US5648970A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for ordering out-of-sequence packets
Assignee: Google Technology Holdings LLC
•
Filing: 1996-03-04
•
Granted: 1997-07-15
•
Expires: 2016-03-04
Abstract
Abstract In a packet switched network, a method and system order packets arriving out-of-sequence from a lower service. An ordering service temporarily buffers packets (101-115) while delayed packets arrive and forwards in-sequence packets to an upper service. Delay introduced by buffering does not accumulate as a propagation toleration timer (304) is activated for a predetermined time period (120) while awaiting the arrival of delayed packets or until the delayed packet arrives. Out-of-sequence packets are grouped between a lower-bound and an upper-bound of sequence identifiers to avoid accumulated delay due to repetitive lost packets.
Inventors
- 👤 Vijay Kapoor
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 12:08
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/34; H04L47/28; H04L47/43; Y; Y10; Y10S; Y10S370/00; Y10S370/901; Y10S370/902
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
224 words
In a packet switched network, a method for ordering a plurality of packets arriving out-of-sequence from a lower service and forwarding said plurality of packets to an upper service without accumulating delay introduced by late or dropped packets, said method comprising the steps of: when a propagation toleration timer having an expiration exceeding a maximum propagation duration of any of said plurality of packets in said packet switched network continues unexpired, collating a new packet received from said lower service in a packet buffer according to a sequence identifier contained in said new packet, said packet buffer having a lower-bound defining a position of one of said plurality of packets yet to be forwarded and having an earliest sequence identifier of said plurality of packets in said packet buffer; while said earliest sequence identifier corresponds with an expected sequence identifier, forwarding one of said plurality of packets at said lower-bound of said packet buffer to said upper service; when said earliest sequence identifier does not correspond with said expected sequence identifier, designating a position of said new packet in said packet buffer as an upper-bound of said packet buffer, and activating said propagation toleration timer; and when said propagation toleration timer expires, forwarding inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer to said upper service.
Claim 2
Dependent Claim
224 words
In a packet switched network, a method for ordering a plurality of packets arriving out-of-sequence from a lower service and forwarding said plurality of packets to an upper service without accumulating delay introduced by late or dropped packets, said method comprising the steps of: when a propagation toleration timer having an expiration exceeding a maximum propagation duration of any of said plurality of packets in said packet switched network continues unexpired, collating a new packet received from said lower service in a packet buffer according to a sequence identifier contained in said new packet, said packet buffer having a lower-bound defining a position of one of said plurality of packets yet to be forwarded and having an earliest sequence identifier of said plurality of packets in said packet buffer; while said earliest sequence identifier corresponds with an expected sequence identifier, forwarding one of said plurality of packets at said lower-bound of said packet buffer to said upper service; when said earliest sequence identifier does not correspond with said expected sequence identifier, designating a position of said new packet in said packet buffer as an upper-bound of said packet buffer, and activating said propagation toleration timer; and when said propagation toleration timer expires, forwarding inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer to said upper service.
Claim 3
Dependent Claim
28 words
A method as recited in claim 1, wherein said collating step further comprises the step of: monitoring for an arrival of said new packet from said lower service.
Claim 4
Dependent Claim
58 words
A method as recited in claim 1, wherein said forwarding said one of said plurality of packets at said lower-bound comprises the steps of: removing said one of said plurality of packets designated by said lower-bound from said packet buffer; delivering said one of said plurality of packets to said upper service; and incrementing said expected sequence identifier.
Claim 5
Dependent Claim
25 words
A method as recited in claim 3 further comprises the step of: when said packet buffer is empty, deactivating said propagation toleration timer if activated.
Claim 6
Dependent Claim
71 words
A method as recited in claim 1, wherein said forwarding inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer comprises the steps of: removing inclusively each of said plurality of packets designated by said lower-bound to said upper-bound from said packet buffer; delivering said each of said plurality of packets to said upper service; and incrementing said expected sequence identifier past said upper-bound.
Claim 7
Dependent Claim
250 words
In a packet switched network, a method for communicating information from a source to a destination across a plurality of varying propagation paths wherein said information may be received out-of-sequence, said method ordering said information arriving out-of-sequence without accumulating delay introduced by late or dropped information comprising the steps of: packetizing said information into a plurality of packets; transmitting said plurality of packets; receiving a new packet, said new packet being one of said plurality of packets; collating said new packet received in a packet buffer according to a sequence identifier contained in said new packet, said packet buffer having a lower-bound defining a position of one of said plurality of packets yet to be forwarded and having an earliest sequence identifier of said plurality of packets in said packet buffer when a propagation toleration timer having an expiration exceeding a maximum propagation duration of any of said plurality of packets in said packet switched network continues unexpired; forwarding in order said one of said plurality of packets at said lower-bound of said packet buffer while said earliest sequence identifier corresponds with an expected sequence identifier; designating a position of said new packet in said packet buffer as an upper-bound of said packet buffer, and activating said propagation toleration timer when said earliest sequence identifier does not correspond with said expected sequence identifier; and forwarding in order inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer when said propagation toleration timer expires.
Claim 8
Dependent Claim
250 words
In a packet switched network, a method for communicating information from a source to a destination across a plurality of varying propagation paths wherein said information may be received out-of-sequence, said method ordering said information arriving out-of-sequence without accumulating delay introduced by late or dropped information comprising the steps of: packetizing said information into a plurality of packets; transmitting said plurality of packets; receiving a new packet, said new packet being one of said plurality of packets; collating said new packet received in a packet buffer according to a sequence identifier contained in said new packet, said packet buffer having a lower-bound defining a position of one of said plurality of packets yet to be forwarded and having an earliest sequence identifier of said plurality of packets in said packet buffer when a propagation toleration timer having an expiration exceeding a maximum propagation duration of any of said plurality of packets in said packet switched network continues unexpired; forwarding in order said one of said plurality of packets at said lower-bound of said packet buffer while said earliest sequence identifier corresponds with an expected sequence identifier; designating a position of said new packet in said packet buffer as an upper-bound of said packet buffer, and activating said propagation toleration timer when said earliest sequence identifier does not correspond with said expected sequence identifier; and forwarding in order inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer when said propagation toleration timer expires.
Claim 9
Dependent Claim
20 words
A method as recited in claim 6, further comprising the step of: monitoring for an arrival of said new packet.
Claim 10
Dependent Claim
56 words
A method as recited in claim 6, wherein said forwarding in order said one of said plurality of packets at said lower-bound comprises the steps of: removing said one of said plurality of packets designated by said lower-bound from said packet buffer; delivering said one of said plurality of packets; and incrementing said expected sequence identifier.
Claim 11
Dependent Claim
67 words
A method as recited in claim 6, wherein said forwarding inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer comprises the steps of: removing inclusively each of said plurality of packets designated by said lower-bound to said upper-bound from said packet buffer; delivering said each of said plurality of packets; and incrementing said expected sequence identifier past said upper-bound.
Claim 12
Dependent Claim
252 words
In a packet switched network for delivering a plurality of packets from an lower service to an upper service, a service for ordering said plurality of packets arriving out-of-sequence from said lower service and forwarding said plurality of packets to said upper service without accumulating delay introduced by late or dropped packets, comprising: a packet buffer having a lower-bound defining a position of one of said plurality of packets yet to be forwarded and having an earliest sequence identifier of said plurality of packets, and having an upper-bound defining a position of a new packet, said new packet being one of said plurality of packets when said earliest sequence identifier does not correspond with an expected sequence identifier; a propagation toleration timer for expiring upon a maximum propagation duration of any of said plurality of packets in said packet switched network; and a processor for collating said new packet received from said lower service according to a sequence identifier contained in said new packet and for forwarding one of said plurality of packets at said lower-bound of said packet buffer to said upper service, for designating the position of said new packet in said packet buffer as said upper-bound of said packet buffer when said earliest sequence identifier does not correspond with said expected sequence identifier, for activating said propagation toleration timer, and for forwarding inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer to said upper service when said propagation toleration timer expires.
Claim 13
Dependent Claim
252 words
In a packet switched network for delivering a plurality of packets from an lower service to an upper service, a service for ordering said plurality of packets arriving out-of-sequence from said lower service and forwarding said plurality of packets to said upper service without accumulating delay introduced by late or dropped packets, comprising: a packet buffer having a lower-bound defining a position of one of said plurality of packets yet to be forwarded and having an earliest sequence identifier of said plurality of packets, and having an upper-bound defining a position of a new packet, said new packet being one of said plurality of packets when said earliest sequence identifier does not correspond with an expected sequence identifier; a propagation toleration timer for expiring upon a maximum propagation duration of any of said plurality of packets in said packet switched network; and a processor for collating said new packet received from said lower service according to a sequence identifier contained in said new packet and for forwarding one of said plurality of packets at said lower-bound of said packet buffer to said upper service, for designating the position of said new packet in said packet buffer as said upper-bound of said packet buffer when said earliest sequence identifier does not correspond with said expected sequence identifier, for activating said propagation toleration timer, and for forwarding inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer to said upper service when said propagation toleration timer expires.
Claim 14
Dependent Claim
24 words
A service as recited in claim 10, further comprising: a receiver for monitoring for an arrival of said new packet from said lower service.
Claim 15
Dependent Claim
49 words
A service as recited in claim 10, further comprising: a means for removing said one of said plurality of packets designated by said lower-bound from said packet buffer; a transmitter for delivering said plurality of packets to said upper service; and a means for incrementing said expected sequence identifier.
Claim 16
Dependent Claim
58 words
A service as recited in claim 10, further comprising: a means for removing inclusively each of said plurality of packets designated by said lower-bound to said upper-bound from said packet buffer; a means for delivering said each of said plurality of packets to said upper service; and a means for incrementing said expected sequence identifier past said upper-bound.
Claim 17
Dependent Claim
234 words
In a packet switched network, a system for communicating information from a source to a destination across a plurality of varying propagation paths wherein said information may be received out-of-sequence, said system for ordering a plurality of packets arriving out-of-sequence without accumulating delay introduced by late or dropped information, comprising: a packet buffer having a lower-bound defining a position of one of said plurality of packets yet to be forwarded and having an earliest sequence identifier of said plurality of packets, and having an upper-bound defining a position of a new packet, said new packet being one of said plurality of packets when said earliest sequence identifier does not correspond with an expected sequence identifier; a propagation toleration timer for expiring upon a maximum propagation duration of any of said plurality of packets in said packet switched network; and a processor for collating said new packet according to a sequence identifier contained in said new packet and for forwarding said plurality of packets at said lower-bound of said packet buffer, for designating the position of said new packet in said packet buffer as said upper-bound of said packet buffer when said earliest sequence identifier does not correspond with said expected sequence identifier, for activating said propagation toleration timer, and for forwarding inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer when said propagation toleration timer expires.
Claim 18
Dependent Claim
234 words
In a packet switched network, a system for communicating information from a source to a destination across a plurality of varying propagation paths wherein said information may be received out-of-sequence, said system for ordering a plurality of packets arriving out-of-sequence without accumulating delay introduced by late or dropped information, comprising: a packet buffer having a lower-bound defining a position of one of said plurality of packets yet to be forwarded and having an earliest sequence identifier of said plurality of packets, and having an upper-bound defining a position of a new packet, said new packet being one of said plurality of packets when said earliest sequence identifier does not correspond with an expected sequence identifier; a propagation toleration timer for expiring upon a maximum propagation duration of any of said plurality of packets in said packet switched network; and a processor for collating said new packet according to a sequence identifier contained in said new packet and for forwarding said plurality of packets at said lower-bound of said packet buffer, for designating the position of said new packet in said packet buffer as said upper-bound of said packet buffer when said earliest sequence identifier does not correspond with said expected sequence identifier, for activating said propagation toleration timer, and for forwarding inclusively each of said plurality of packets from said lower-bound to said upper-bound of said packet buffer when said propagation toleration timer expires.
Claim 19
Dependent Claim
20 words
A system as recited in claim 14, further comprising: a receiver for monitoring for an arrival of said new packet.
Claim 20
Dependent Claim
42 words
A system as recited in claim 14, further comprising: a means for removing said plurality of packets designated by said lower-bound from said packet buffer; a transmitter for delivering said plurality of packets; and a means for incrementing said expected sequence identifier.
Claim 21
Dependent Claim
54 words
A system as recited in claim 14, further comprising: a means for removing inclusively each of said plurality of packets designated by said lower-bound to said upper-bound from said packet buffer; a means for delivering said each of said plurality of packets; and a means for incrementing said expected sequence identifier past said upper-bound.
References Cited (Backward Citations)
US5400324A
Cited
US5278828A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-07-14 | 2001-01-13 | 2001-07-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-07-14 | 2005-01-13 | 2005-07-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-07-14 | 2009-01-13 | 2009-07-15 | $7700.00 | Window Closed / Lapsed |