Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2008-03-25
2008-03-25
Shah, Chirag G. (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S412000, C370S468000, C370S235000
Reexamination Certificate
active
10601517
ABSTRACT:
A packet scheduling method and apparatus is described for enqueuing incoming data packets in sessions, and for storing the sessions in sequential order in service-groups. Each service-group is assigned a nominal service-interval in which time a data packet is to be transmitted, the nominal service-interval of one service-group being faster than the nominal service-interval of another service-group. Within one service-group, one session is serviced until the nominal service-interval of any of the service-groups where there is at least one data packet to be sent is exceeded.
REFERENCES:
patent: 6747976 (2004-06-01), Bensaou et al.
patent: 7061918 (2006-06-01), Duckering et al.
patent: 7065762 (2006-06-01), Duda et al.
patent: 2003/0050954 (2003-03-01), Tayyar et al.
patent: 2003/0179774 (2003-09-01), Saidi et al.
patent: 2004/0085964 (2004-05-01), Vaananen
patent: 2004/0114602 (2004-06-01), Ko et al.
patent: 2004/0151197 (2004-08-01), Hui
patent: 2004/0160961 (2004-08-01), Duckering et al.
patent: 2007/0050773 (2007-03-01), Tayyar et al.
“Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks”, by Pawan Goyal, Harrick M. Vin, and Haichen Cheng. vol. 5, No. 5, Oct. 1997, IEEE.
“A Self-Clocked Fair Queueing Scheme for Broadband Applications”, by S. Jamaloddin Golestani, Belicore, 1994 IEEE.
“Analysis and Simulation of a Fair Queueing Algorithm” by Alan Demers, Srinivasan Keshav, Scott Shenker, Computer Communications Review vol. 19, No. 4, Austin TX Sep. 1989, pp. 1-12.
“Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks” by Lixia Zhang, 1990 ACM.
“WF Q: Worst-case Fair Weighted Fair Queueing” by Jon C.R. Bennett, FORE Systems, and Hui Zhang, School of Computer Science, Carnegie Mellon University.
“Implementing Scheduling Algorithms in High-Speed Networks”, Donpaul C. Stephens, Jon C.R. Bennett, Hui Zhang ; sponsored by DARPA.
“Hardware-Efficient Fair Queueing Architectures for High-Speed Networks” by Jennifer L. Rexford, Albert G. Greenberg and Flavio G. Bonomi.
“Efficient Fair Queuing using Deficit Round Robin” by M. Shreedhar and George Varghese, SIGCOMM 1995, Cambridge, MA , ACM.
“Fair scheduling with tunable latency: A round robin approach”, Hemant M. Chaskar and U. Madhow. Supported by the U.S. Army Research Office under grant DAAH04-95-1-0246.
Gordon & Jacobson, PC
Shah Chirag G.
TranSwitch Corporation
LandOfFree
Method and apparatus for fair queueing of data 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 and apparatus for fair queueing of data packets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for fair queueing of data packets will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3948133