Method for reordering sequenced packets

Details Method for reordering sequenced packets Method for reordering sequenced packets

2006-12-13

2010-02-23

Ahmed, Salman (Department: 2476)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S428000, C370S517000

Reexamination Certificate

active

07668187

ABSTRACT:
There are disclosed a method and apparatus for reordering sequenced data packets. An expiration time is calculated for each received data packet. The expiration time and a packet sequence number are stored in a table. The table is read to determine the next data packet to be transmitted in sequence number order. The next data packet is output if available. If the next data packet is not available, a true expiration time is determined for the unavailable next data packet. If the unavailable next data packet fails to arrive before a current time is greater than the expiration time of the unavailable data packet, the unavailable next data packet is considered lost.

REFERENCES:
patent: 4330824 (1982-05-01), Girard
patent: 4394725 (1983-07-01), Bienvenu
patent: 4740954 (1988-04-01), Cotton
patent: 4754451 (1988-06-01), Eng et al.
patent: 5022025 (1991-06-01), Urushidani et al.
patent: 5127000 (1992-06-01), Henrion
patent: 5412646 (1995-05-01), Cyr et al.
patent: 5550823 (1996-08-01), Irie
patent: 5555543 (1996-09-01), Grohoski
patent: 5606370 (1997-02-01), Moon
patent: 5845145 (1998-12-01), James
patent: 5859835 (1999-01-01), Varma et al.
patent: 5860085 (1999-01-01), Stormon
patent: 5898689 (1999-04-01), Kumar
patent: 5905911 (1999-05-01), Shimizu
patent: 5909440 (1999-06-01), Ferguson
patent: 5923893 (1999-07-01), Moyer
patent: 5982749 (1999-11-01), Daniel
patent: 6026092 (2000-02-01), Abu-Amara
patent: 6067408 (2000-05-01), Runaldue
patent: 6088721 (2000-07-01), Lin et al.
patent: 6138185 (2000-10-01), Nelson
patent: 6172927 (2001-01-01), Taylor
patent: 6192465 (2001-02-01), Roberts
patent: 6389489 (2002-05-01), Stone
patent: 6442674 (2002-08-01), Lee
patent: 6460120 (2002-10-01), Bass et al.
patent: 6493347 (2002-12-01), Sindhu
patent: 6570876 (2003-05-01), Aimoto
patent: 6574194 (2003-06-01), Sun
patent: 6629147 (2003-09-01), Grow
patent: 6687768 (2004-02-01), Horikomi
patent: 6754741 (2004-06-01), Alexander
patent: 6781992 (2004-08-01), Rana et al.
patent: 6795870 (2004-09-01), Bass
patent: 6842443 (2005-01-01), Allen, Jr. et al.
patent: 6907041 (2005-06-01), Turner et al.
patent: 6934760 (2005-08-01), Westbrook et al.
patent: 6967951 (2005-11-01), Alfano
patent: 6977941 (2005-12-01), Takahashi
patent: 6987760 (2006-01-01), Calvignac et al.
patent: 6996624 (2006-02-01), LeCroy et al.
patent: 7035214 (2006-04-01), Seddigh et al.
patent: 7271765 (2007-09-01), Stilp et al.
patent: 7349393 (2008-03-01), Pierson
patent: 7363572 (2008-04-01), Sidenblad et al.
patent: 7403525 (2008-07-01), Sano et al.
patent: 7471870 (2008-12-01), Bradstreet et al.
patent: 7472304 (2008-12-01), Malekkhosravi et al.
patent: 7480308 (2009-01-01), Cohen et al.
patent: 7529245 (2009-05-01), Muller et al.
patent: 7535913 (2009-05-01), Minami et al.
patent: 7577145 (2009-08-01), Maruyama et al.
patent: 2001/0037435 (2001-11-01), Van Doren
patent: 2002/0165947 (2002-11-01), Ackerman
patent: 2003/0035427 (2003-02-01), Alasti et al.
patent: 2009/0046593 (2009-02-01), Ptasinski et al.
Distributed deadlock detection and resolution based on hardware clocks; Mayo, J.; Kearns, P.; Distributed Computing Systems, 1999. Proceedings. 19th IEEE International Conference on May 31-Jun. 4, 1999 pp. 208-215.
Predictable timestamp under synchronized clocks in a network; Geng-Sheng Kuo; Jing-Pei Lin; Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on Jun. 27-Jul. 1, 1994 p. 68.
Dynamic priority protocols for packet voice; TM Chen, J Walrand, DG Messerschmitt—IEEE journal on selected areas in communications, 1989.
PetaSwitch Solutions, Inc., The Pisces Chipset, Product Brief, 2001, http://www.peta-switch.com/products/product—brief.htm.
PetaSwitch Solutions, Inc., PetaSwitch Solutions Announces Raising $4 Million in First Round Financing, Press Release, 2001, http://peta-switch.com
ewsroom/press—releases.htm.
PetaSwitch Solutions, Inc., Company Overview, 2001, http://peta-switch.com/markets/overview.htm.
Gupta, Scheduling in Input Queued Switches: A Survey, Jun. 1996, Department of Computer Science, Stanford University, California.
Schoenen, et al., Distributed Cell Scheduling Algorithms for Virtual-Output-Queued Switches, Dec. 1999, pp. 1211-1215, vol. 1, GLOBECOM, IEEE Global Telecommunications Conference.
Fahmy, A Survey of ATM Switching Techniques, Aug. 14, 2001, Department of Computer and Information Science, The Ohio State University.
Stiliadis, et al., Rate-Proportional Servers: A Design Methodology for Fair Queueing Algorithms, Dec. 1995, Computer Engineering & Information Sciences, University of California. Santa Cruz.
Stoica, et al., Earliest Eligible Virtual Deadline First: A Flexible and Accurate Mechanism for Proportional Share Resource Allocation, Department of Computer Science, Old Dominion University, Norfolk, VA.

Affiliated with

Also associated with

Rating

Method for reordering sequenced packets does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for reordering sequenced packets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for reordering sequenced packets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4173706