US6134245A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for the compression and transportation of non frame relay data over a frame relay network
Assignee: Siemens Power Transmission and Distribution Inc
•
Filing: 1998-01-09
•
Granted: 2000-10-17
•
Expires: 2018-01-09
Abstract
Abstract A system and method for the efficient compression and identification of non frame relay data packets allows the transport of non frame relay data packets over a frame relay network. Generic, non frame relay data is segmented into a plurality of data packets and encapsulated for transparent transport over a frame relay communication network.
Inventors
- 👤 John Scarmalis
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 23:39
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/16; H04J3/1605; H04J3/1623; H04J3/1641; H04L; H04L12/00; H04L12/64; H04L12/6418; H04L69/00; H04L69/04; H04L9/00; H04L9/40; H04L2012/6424; H04L2012/647; H04L69/30; H04L69/32; H04L69/322; H04L69/324
Claims Analysis
Total Claims: 44
Claim 1
Independent Claim
155 words
A system for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising: means for segmenting a generic data frame into a plurality of data segments; means for adding a segmentation field to each of said plurality of data segments; means for compressing each of said plurality of data segments to form a plurality of compressed data segments; means for encapsulating each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; means for transporting each of said plurality of compressed frame relay data packets over a frame relay communications network; means for receiving each of said plurality of compressed frame relay data packets; means for decompressing each of said plurality of compressed frame relay data packets to form a plurality of decompressed data segments; and means for reassembling each of said plurality of decompressed data segments into said generic data frame.
Claim 2
Independent Claim
155 words
A system for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising: means for segmenting a generic data frame into a plurality of data segments; means for adding a segmentation field to each of said plurality of data segments; means for compressing each of said plurality of data segments to form a plurality of compressed data segments; means for encapsulating each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; means for transporting each of said plurality of compressed frame relay data packets over a frame relay communications network; means for receiving each of said plurality of compressed frame relay data packets; means for decompressing each of said plurality of compressed frame relay data packets to form a plurality of decompressed data segments; and means for reassembling each of said plurality of decompressed data segments into said generic data frame.
Claim 3
Dependent Claim
17 words
The system of claim 1, wherein each of said plurality of data segments is of length "L".
Claim 4
Dependent Claim
22 words
The system of claim 1, wherein a user check sum is compressed in the last one of said plurality of data segments.
Claim 5
Independent Claim
159 words
A system for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising: logic configured to segment a generic data frame into a plurality of data segments; logic configured to add a segmentation field to each of said plurality of data segments; logic configured to compress each of said plurality of data segments to form a plurality of compressed data segments; logic configured to encapsulate each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; logic configured to transport each of said plurality of compressed frame relay data packets over a frame relay communications network; logic configured to receive each of said plurality of compressed frame relay data packets; logic configured to decompress each of said compressed frame relay data packets to form a plurality of decompressed data segments; and logic configured to reassemble each of said decompressed data segments into said generic data frame.
Claim 6
Independent Claim
159 words
A system for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising: logic configured to segment a generic data frame into a plurality of data segments; logic configured to add a segmentation field to each of said plurality of data segments; logic configured to compress each of said plurality of data segments to form a plurality of compressed data segments; logic configured to encapsulate each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; logic configured to transport each of said plurality of compressed frame relay data packets over a frame relay communications network; logic configured to receive each of said plurality of compressed frame relay data packets; logic configured to decompress each of said compressed frame relay data packets to form a plurality of decompressed data segments; and logic configured to reassemble each of said decompressed data segments into said generic data frame.
Claim 7
Dependent Claim
17 words
The system of claim 4, wherein each of said plurality of data segments is of length "L".
Claim 8
Dependent Claim
22 words
The system of claim 4, wherein a user check sum is compressed in the last one of said plurality of data segments.
Claim 9
Independent Claim
138 words
A method for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising the steps of: segmenting a generic data frame into a plurality of data segments; adding a segmentation field to each of said plurality of data segments; compressing each of said plurality of data segments to form a plurality of compressed data segments; encapsulating each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; transporting each of said plurality of compressed frame relay data packets over a frame relay communications network; receiving each of said plurality of compressed frame relay data packets; decompressing each of said compressed frame relay data packets to form a plurality of decompressed data segments; and reassembling each of said decompressed data segments into said generic data frame.
Claim 10
Independent Claim
138 words
A method for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising the steps of: segmenting a generic data frame into a plurality of data segments; adding a segmentation field to each of said plurality of data segments; compressing each of said plurality of data segments to form a plurality of compressed data segments; encapsulating each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; transporting each of said plurality of compressed frame relay data packets over a frame relay communications network; receiving each of said plurality of compressed frame relay data packets; decompressing each of said compressed frame relay data packets to form a plurality of decompressed data segments; and reassembling each of said decompressed data segments into said generic data frame.
Claim 11
Dependent Claim
17 words
The method of claim 7, wherein each of said plurality of data segments is of length "L".
Claim 12
Dependent Claim
22 words
The method of claim 7, wherein a user check sum is compressed in the last one of said plurality of data segments.
Claim 13
Independent Claim
105 words
A system for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising: means for segmenting a generic data frame into a plurality of data segments; means for adding a segmentation field to each of said plurality of data segments; means for compressing each of said plurality of data segments to form a plurality of compressed data segments; means for encapsulating each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; and means for transporting each of said plurality of compressed frame relay data packets over a frame relay communications network.
Claim 14
Independent Claim
105 words
A system for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising: means for segmenting a generic data frame into a plurality of data segments; means for adding a segmentation field to each of said plurality of data segments; means for compressing each of said plurality of data segments to form a plurality of compressed data segments; means for encapsulating each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; and means for transporting each of said plurality of compressed frame relay data packets over a frame relay communications network.
Claim 15
Dependent Claim
17 words
The system of claim 10, wherein each of said plurality of data segments is of length "L".
Claim 16
Dependent Claim
22 words
The system of claim 10, wherein a user check sum is compressed in the last one of said plurality of data segments.
Claim 17
Independent Claim
75 words
A system for efficiently decompressing a non frame relay communications packet over a frame relay network, comprising: means for receiving a plurality of compressed frame relay data packets, each of said compressed frame relay data packets associated with a segmentation field; means for decompressing each of said compressed frame relay data packets to form a plurality of decompressed data segments; and means for reassembling each of said decompressed data segments into a generic data frame.
Claim 18
Independent Claim
75 words
A system for efficiently decompressing a non frame relay communications packet over a frame relay network, comprising: means for receiving a plurality of compressed frame relay data packets, each of said compressed frame relay data packets associated with a segmentation field; means for decompressing each of said compressed frame relay data packets to form a plurality of decompressed data segments; and means for reassembling each of said decompressed data segments into a generic data frame.
Claim 19
Dependent Claim
21 words
The system of claim 13, further comprising: means for generating a revised frame check sequence based upon said compressed data segment.
Claim 20
Independent Claim
110 words
A system for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising: logic configured to segment a generic data frame into a plurality of data segments; logic configured to add a segmentation field to each of said plurality of data segments; logic configured to compress each of said plurality of data segments to form a plurality of compressed data segments; logic configured to encapsulate each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; and logic configured to transport each of said plurality of compressed frame relay data packets over a frame relay communications network.
Claim 21
Independent Claim
110 words
A system for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising: logic configured to segment a generic data frame into a plurality of data segments; logic configured to add a segmentation field to each of said plurality of data segments; logic configured to compress each of said plurality of data segments to form a plurality of compressed data segments; logic configured to encapsulate each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; and logic configured to transport each of said plurality of compressed frame relay data packets over a frame relay communications network.
Claim 22
Dependent Claim
17 words
The system of claim 15, wherein each of said plurality of data segments is of length "L".
Claim 23
Dependent Claim
22 words
The system of claim 15, wherein a user check sum is compressed in the last one of said plurality of data segments.
Claim 24
Independent Claim
78 words
A system for efficiently decompressing a non frame relay communications packet over a frame relay network, comprising: logic configured to receive a plurality of compressed frame relay data packets, each of said compressed frame relay data packets associated with a segmentation field; logic configured to decompress each of said compressed frame relay data packets to form a plurality of decompressed data segments; and logic configured to reassemble each of said decompressed data segments into a generic data frame.
Claim 25
Independent Claim
78 words
A system for efficiently decompressing a non frame relay communications packet over a frame relay network, comprising: logic configured to receive a plurality of compressed frame relay data packets, each of said compressed frame relay data packets associated with a segmentation field; logic configured to decompress each of said compressed frame relay data packets to form a plurality of decompressed data segments; and logic configured to reassemble each of said decompressed data segments into a generic data frame.
Claim 26
Dependent Claim
22 words
The system of claim 18, further comprising: logic configured to generate a revised frame check sequence based upon said compressed data segment.
Claim 27
Independent Claim
98 words
A method for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising the steps of: segmenting a generic data frame into a plurality of data segments; adding a segmentation field to each of said plurality of data segments; compressing each of said plurality of data segments to form a plurality of compressed data segments; encapsulating each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; and transporting each of said plurality of compressed frame relay data packets over a frame relay communications network.
Claim 28
Independent Claim
98 words
A method for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, comprising the steps of: segmenting a generic data frame into a plurality of data segments; adding a segmentation field to each of said plurality of data segments; compressing each of said plurality of data segments to form a plurality of compressed data segments; encapsulating each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; and transporting each of said plurality of compressed frame relay data packets over a frame relay communications network.
Claim 29
Dependent Claim
17 words
The method of claim 20, wherein each of said plurality of data segments is of length "L".
Claim 30
Dependent Claim
22 words
The method of claim 20, wherein a user check sum is compressed in the last one of said plurality of data segments.
Claim 31
Independent Claim
72 words
A method for efficiently decompressing a non frame relay communications packet over a frame relay network, comprising the steps of: receiving a plurality of compressed frame relay data packets, each of said compressed frame relay data packets associated with a segmentation field; decompressing each of said compressed frame relay data packets to form a plurality of decompressed data segments; and reassembling each of said decompressed data segments into a generic data frame.
Claim 32
Independent Claim
72 words
A method for efficiently decompressing a non frame relay communications packet over a frame relay network, comprising the steps of: receiving a plurality of compressed frame relay data packets, each of said compressed frame relay data packets associated with a segmentation field; decompressing each of said compressed frame relay data packets to form a plurality of decompressed data segments; and reassembling each of said decompressed data segments into a generic data frame.
Claim 33
Dependent Claim
22 words
The method of claim 23, further comprising the step of: generating a revised frame check sequence based upon said compressed data segment.
Claim 34
Dependent Claim
166 words
A computer readable medium having a program for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, the program comprising: logic configured to segment a generic data frame into a plurality of data segments; logic configured to add a segmentation field to each of said plurality of data segments; logic configured to compress each of said plurality of data segments to form a plurality of compressed data segments; logic configured to encapsulate each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; logic configured to transport each of said plurality of compressed frame relay data packets over a frame relay communications network; logic configured to receive each of said plurality of compressed frame relay data packets; logic configured to decompress each of said compressed frame relay data packets to form a plurality of decompressed data segments; and logic configured to reassemble each of said decompressed data segments into said generic data frame.
Claim 35
Dependent Claim
166 words
A computer readable medium having a program for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, the program comprising: logic configured to segment a generic data frame into a plurality of data segments; logic configured to add a segmentation field to each of said plurality of data segments; logic configured to compress each of said plurality of data segments to form a plurality of compressed data segments; logic configured to encapsulate each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; logic configured to transport each of said plurality of compressed frame relay data packets over a frame relay communications network; logic configured to receive each of said plurality of compressed frame relay data packets; logic configured to decompress each of said compressed frame relay data packets to form a plurality of decompressed data segments; and logic configured to reassemble each of said decompressed data segments into said generic data frame.
Claim 36
Dependent Claim
17 words
The program of claim 25, wherein each of said plurality of data segments is of length "L".
Claim 37
Dependent Claim
22 words
The program of claim 25, wherein a user check sum is compressed in the last one of said plurality of data segments.
Claim 38
Dependent Claim
117 words
A computer readable medium having a program for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, the program comprising: logic configured to segment a generic data frame into a plurality of data segments; logic configured to add a segmentation field to each of said plurality of data segments; logic configured to compress each of said plurality of data segments to form a plurality of compressed data segments; logic configured to encapsulate each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; and logic configured to transport each of said plurality of compressed frame relay data packets over a frame relay communications network.
Claim 39
Dependent Claim
117 words
A computer readable medium having a program for efficiently compressing and transporting a non frame relay communications packet over a frame relay network, the program comprising: logic configured to segment a generic data frame into a plurality of data segments; logic configured to add a segmentation field to each of said plurality of data segments; logic configured to compress each of said plurality of data segments to form a plurality of compressed data segments; logic configured to encapsulate each of said plurality of compressed data segments to form a plurality of compressed frame relay data packets; and logic configured to transport each of said plurality of compressed frame relay data packets over a frame relay communications network.
Claim 40
Dependent Claim
17 words
The program of claim 28, wherein each of said plurality of data segments is of length "L".
Claim 41
Dependent Claim
22 words
The program of claim 28, wherein a user check sum is compressed in the last one of said plurality of data segments.
Claim 42
Dependent Claim
85 words
A computer readable medium having a program for efficiently decompressing a non frame relay communications packet over a frame relay network, the program comprising: logic configured to receive a plurality of compressed frame relay data packets, each of said compressed frame relay data packets associated with a segmentation field; logic configured to decompress each of said compressed frame relay data packets to form a plurality of decompressed data segments; and logic configured to reassemble each of said decompressed data segments into a generic data frame.
Claim 43
Dependent Claim
85 words
A computer readable medium having a program for efficiently decompressing a non frame relay communications packet over a frame relay network, the program comprising: logic configured to receive a plurality of compressed frame relay data packets, each of said compressed frame relay data packets associated with a segmentation field; logic configured to decompress each of said compressed frame relay data packets to form a plurality of decompressed data segments; and logic configured to reassemble each of said decompressed data segments into a generic data frame.
Claim 44
Dependent Claim
22 words
The program of claim 31, further comprising: logic configured to generate a revised frame check sequence based upon said compressed data segment.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-10-17 | 2004-04-17 | 2004-10-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-10-17 | 2008-04-17 | 2008-10-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-10-17 | 2012-04-17 | 2012-10-17 | $7700.00 | Window Closed / Lapsed |