Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-06-20
2006-06-20
Chin, Wellington (Department: 2664)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S395400, C370S465000, C370S468000, C370S412000, C709S240000, C709S241000, C709S226000, C709S235000
Reexamination Certificate
active
07065091
ABSTRACT:
Methods and apparatus are disclosed for scheduling items (e.g., packets, processes, etc.) in a system, such as, but not limited to a computer or communications system (e.g., router, switch, etc.) In one implementation, multiple sets of items requiring processing to be performed are maintained. A current set of the multiple sets of items is identified. Each of the items in the current set is processed. In one implementation, this processing includes identifying a particular item in the current set, adding a quantum to a deficit of the particular item, processing an entity corresponding to the particular item, decreasing the deficit of the particular item by a value, determining if the deficit allows the particular item to be further processed, and moving the particular item from the current set to another of the multiple sets of items after said determining if deficit allows the particular item to be further processed.
REFERENCES:
patent: 6247061 (2001-06-01), Douceur et al.
patent: 2003/0103514 (2003-06-01), Nam et al.
patent: 2003/0169743 (2003-09-01), Chiussi et al.
S. Keshav, An Engineering Approach to Computer Networking: ATM Networks, The Internet, and the Telephone Network, Addison Wesley Longman, Inc. 1997, Chapter 9, pp. 209-263.
C. Partridge, “A Proposed Flow Specification,” RFC 1363, Sep. 1992, 20 pages.
Craig Partridge, Gigabit Networking, Addison Wesley Longman, Inc. 1994, pp. 253-263.
M. Shreedhar and George Varghese, “Efficient Fair Queuing Using Deficit Round-Robin,” Proc. SIGCOMM′ '95 Cambridge, MA, ACM, 1995, pp. 231-242.
M. Shreedhar and George Varghese, “Efficient Fair Queuing Using Deficit Round-Robin,” IEEE/ACM Transactions on Networking, vol. 4, No. 3, Jun. 1996, pp. 375-385.
Sugih Jamin et al., “A Measurement-Based Admission Control Algorithm for Integrated Service Packet Networks,” IEEE/ACM Transactions on Networking, vol. 5, No. 1, Feb. 1997, pp. 56-70.
Grenville Armitage, Quality of Service in IP Networks: Foundations for a Multi-Service Internet, Macmillan Technical Publishing, Apr. 2000, pp. 35-104.
George Coulouris et al., Distributed Systems: Concepts and Design, Third Edition, Addison-Wesley, 2001, pp. 607-633.
Giroux N et al., “Queuing and Scheduling, Scheduling Mechanisms”, Quality of Service in ATM Networks: State-of-the-Art Traffic Management, 1999, pp. 96-109.
M. Schreedhar and George Varghese, “Efficient Fair Queuing Using Deficit Round-Robin,” IEEE/ACM Transactions on Networking, IEEE Inc., New York, USA, vol. 4, No. 3, Jun. 1996, pp. 375-385.
Appanna Chandrashekhar
Michaeli Amir
Shoham Doron
Tsiang David J.
Chin Wellington
Cisco Technology Inc.
Jain Raj
The Law Office of Kirk D. Williams
LandOfFree
Method and apparatus for scheduling and interleaving items... 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 scheduling and interleaving items..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for scheduling and interleaving items... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3707377