Scheduling items using mini-quantum values

Details Scheduling items using mini-quantum values Scheduling items using mini-quantum values

2007-05-01

2007-05-01

Pham, Chi (Department: 2616)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S395400, C370S465000, C370S468000, C370S412000, C709S240000, C709S241000, C709S226000, C709S235000

Reexamination Certificate

active

11395191

ABSTRACT:
Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, and mechanisms, for scheduling items in a system, such as, but not limited to a computer or communications system. For example, in one implementation, each of the items in a set of items has an associated deficit and mini-deficit. A next particular item is selected from the set of items currently having enough deficit to process the particular item. One or more entities associated with the particular item is processed a commensurate amount corresponding to the mini-deficit associated with the particular item. This processing is repeatedly performed until there are no more entities associated with the particular item or until the deficit associated with the particular item does not allow any further processing at the current time.

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.
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. Shreedhar 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.
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, Macmillian Technical Publishing, Apr. 2000, pp. 35-104.
George Coulouris et al., Distributed Systems: Concepts and Design, Third Edition, Addison-Wesley, 2001, pp. 607-633.
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.

Affiliated with

Also associated with

Rating

Scheduling items using mini-quantum values does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scheduling items using mini-quantum values, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling items using mini-quantum values will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3788189