Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-09-19
2006-09-19
Sam, Phirin (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S412000
Reexamination Certificate
active
07110411
ABSTRACT:
A method and apparatus is provided for scheduling access to a common resource for a plurality of objects queued in a plurality of connection queues. Tokens associated with the connection queues are stored in scheduling queues. Each scheduling queue has a scheduling weight assigned thereto. Each connection queue has a connection weight value assigned thereto. A serving value is used to determine which scheduling queue to select. When a scheduling queue is selected, an object stored in a connection queue having an associated token stored in the selected scheduling queue is provided to the common resource. Tokens are moved among the scheduling queues as a function of the connection weight values, scheduling weights, and serving value. The objects queued in the connection queues may be fixed length cells or variable length packets. When the objects are variable length packets, a residual weight value is also maintained for each connection queue, the residual weight values being useful to prevent the connection queues from receiving an undue amount of service relative to their connection weights during each serving cycle.
REFERENCES:
patent: 5526352 (1996-06-01), Min et al.
patent: 6014367 (2000-01-01), Joffe
patent: 6041059 (2000-03-01), Joffe et al.
patent: 6049059 (2000-04-01), Kim
patent: 6101193 (2000-08-01), Ohba
patent: 6130878 (2000-10-01), Charny
patent: 6611522 (2003-08-01), Zheng et al.
patent: 6876659 (2005-04-01), Aznar et al.
patent: 6909720 (2005-06-01), Willis
patent: 2002/0136230 (2002-09-01), Dell et al.
patent: 2003/0076848 (2003-04-01), Bremler-Barr et al.
patent: 2003/0081624 (2003-05-01), Aggarwal et al.
patent: 2003/0200339 (2003-10-01), Greenblat et al.
patent: 0 843 499 (1998-05-01), None
Goyal, Pawan; Vin, Harrick M.; and Cheng, Haichen;Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks; IEEE/ACM Transactions on Networking, vol. 5, No. 5, Oct. 1997, pp. 690-704.
Golestani, S. Jamaloddin;A Self-Clocked Fair Queueing Scheme for Broadband Applications; Proceedings of IEEE INFOCOM 1994, pp. 636-646.
Katevenis, Manolis; Sidiropoulos, Stafanos; and Courcoubetis, Costas;Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip; IEEE Journal on Selected Areas in Communications, vol. 9, No. 8, Oct. 1991, pp. 1265-1279.
Keshav, S.;Congestion Control on Computer Networks; PhD Thesis published as U.C. Berkley TR-654, Sep. 1991, pp. 19-25.
Ohba, Yoshihiro;QLWFQ: A Queue Length Based Weighted Fair Queueing Algorithm in ATM Networks; Proceedings of INFOCOM'97, 16thAnnual Joint Conference of IEEE Computer and Communications Societies.
Parekh, Abhay K. and Gallager, Robert G.;A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case; IEEE/ACM Transactions on Networking, vol. 1, No. 3, Jun. 1993, pp. 344-357.
Suri, Subhash; Varghese, George; and Chandranmenon, Girish;Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness; IEEE INFOCOM'97.
Zhang, Hui and Keshav, Srinivasan;Comparison of Rate-Based Service Disciplines; Proceedings of ACM SIGCOMM'91; pp. 113-121.
Bennett and Zhang; “WF2Q: Worst-case Fair Weighted Fair Queueing”;Proceedings of IEEE INFOCOM; 1996; pp. 120-128.
Vishnu and Mark; “HOL-EDD: A Flexible Service Scheduling Scheme for ATM Networks”;Proceedings of IEEE INFOCOM; 1996; pp. 647-654.
Zhang; “VirtualClock: A New Traffic Control Algorithm for Packet Switching Networks”;Proceedings of ACM SIGCOMM; 1990; pp. 19-29.
Patent Cooperation Treaty; International Search Report; Sep. 19, 2003.
Hu Chunhua
Min Paul Seungkyu
Saidi Hossein
Yan Peter Yifey
Erlang Technology, Inc.
Sam Phirin
Thompson & Coburn LLP
LandOfFree
Method and apparatus for WFQ scheduling using a plurality of... 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 WFQ scheduling using a plurality of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for WFQ scheduling using a plurality of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3546596