Patent GB404591A successfully refreshed from Google Patents.
Patent US6098188A successfully refreshed from Google Patents.
US6098188A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Packet framer
Assignee: Nokia of America Corp
•
Filing: 1995-06-30
•
Granted: 2000-08-01
•
Expires: 2015-06-30
Abstract
Abstract A packet of information is encapsulated into a frame and the frame is segmented into one or more cells for transmission over a communications network. One of the cells contains a sequence-identifier. When a cell is received with a non-consecutive sequence-identifier, it is determined whether or not the entire packet is contained within one cell. If the packet is not contained within one cell, the receiver discards the frame associated with the received cells. If the packet is contained within one cell, the receiver attempts to recover the packet notwithstanding the non-consecutive sequence-identifier.
Inventors
- 👤 Charles Robert Kalmanek, Jr.
- 👤 William Todd Marshall
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 02:11
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0061; H04L1/0078
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
161 words
An apparatus for recovering a nonconsecutive packet, said apparatus comprising: means for forming (217) a candidate frame from at least one cell, such that one of said cells comprises a sequence-identifier, a user-data-length indicator and a first CRC checksum based on said sequence-identifier and said user-data-length indicator; means for parsing (619, 721) said candidate frame, said candidate frame comprising: (1) at least a portion of said packet, (2) a second CRC checksum based on said packet, (3) said sequence identifier, (4) said user-data-length indicator, and (5) said first CRC checksum; means for determining (801) if said sequence-identifier is not consecutive; means for determining (805) if all of said packet is contained within one cell; means for disregarding said candidate frame if said sequence-identifier is not consecutive and if all of said packet is not contained within one cell; and means for recovering said packet if said sequence-identifier is not consecutive and if all of said packet is contained within one cell.
Claim 2
Independent Claim
161 words
An apparatus for recovering a nonconsecutive packet, said apparatus comprising: means for forming (217) a candidate frame from at least one cell, such that one of said cells comprises a sequence-identifier, a user-data-length indicator and a first CRC checksum based on said sequence-identifier and said user-data-length indicator; means for parsing (619, 721) said candidate frame, said candidate frame comprising: (1) at least a portion of said packet, (2) a second CRC checksum based on said packet, (3) said sequence identifier, (4) said user-data-length indicator, and (5) said first CRC checksum; means for determining (801) if said sequence-identifier is not consecutive; means for determining (805) if all of said packet is contained within one cell; means for disregarding said candidate frame if said sequence-identifier is not consecutive and if all of said packet is not contained within one cell; and means for recovering said packet if said sequence-identifier is not consecutive and if all of said packet is contained within one cell.
Claim 3
Dependent Claim
16 words
The apparatus of claim 1 further comprising means for checking said packet with a cyclic-redundancy code.
Claim 4
Dependent Claim
27 words
The apparatus of claim 2 wherein said means for checking is defined by a generator polynomial equal to g(x)=x 32 +x 31 +x 4 +x 3 +x+1.
Claim 5
Independent Claim
148 words
An method for recovering a non-consecutive packet, said method comprising the steps of: forming a candidate frame from at least one cell, such that one of said cells comprises a sequence-identifier, a user-data-length indicator and a first CRC checksum based on said sequence identifier and said user-data-length indicator; parsing said candidate frame, said candidate frame comprising: (1) at least a portion of said packet, (2) a second CRC checksum based on said packet, (3) said sequence identifier, (4) said user-data-length indicator, and (5) said first CRC checksum; determining if said sequence-identifier is not consecutive; determining if all of said packet is contained within one cell; disregarding said candidate frame if said sequence-identifier is not consecutive and if all of said packet is not contained within one cell; and recovering said packet if said sequence-identifier is not consecutive and if all of said packet is contained within one cell.
Claim 6
Independent Claim
148 words
An method for recovering a non-consecutive packet, said method comprising the steps of: forming a candidate frame from at least one cell, such that one of said cells comprises a sequence-identifier, a user-data-length indicator and a first CRC checksum based on said sequence identifier and said user-data-length indicator; parsing said candidate frame, said candidate frame comprising: (1) at least a portion of said packet, (2) a second CRC checksum based on said packet, (3) said sequence identifier, (4) said user-data-length indicator, and (5) said first CRC checksum; determining if said sequence-identifier is not consecutive; determining if all of said packet is contained within one cell; disregarding said candidate frame if said sequence-identifier is not consecutive and if all of said packet is not contained within one cell; and recovering said packet if said sequence-identifier is not consecutive and if all of said packet is contained within one cell.
Claim 7
Dependent Claim
17 words
The method of claim 4 further comprising the step of checking said packet with a cyclic-redundancy code.
Claim 8
Dependent Claim
27 words
The method of claim 5 wherein said step of checking is defined by a generator polynomial equal to g(x)=x 32 +x 31 +x 4 +x 3 +x+1.
References Cited (Backward Citations)
US4430699A
Cited
JPS58206254A
Cited
US4750109A
Cited
US4852127A
Cited
JPS6273826A
Cited
JPS6273827A
Cited
US4763319A
Cited
JPS6316744A
Cited
JPS6348030A
Cited
US4975907A
Cited
US5072449A
Cited
US5128945A
Cited
US5163054A
Cited
US5251215A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-08-01 | 2004-01-31 | 2004-08-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-08-01 | 2008-01-31 | 2008-08-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-08-01 | 2012-01-31 | 2012-08-01 | $7700.00 | Window Closed / Lapsed |