Filling token buckets of schedule entries

Details Filling token buckets of schedule entries Filling token buckets of schedule entries

2005-06-01

2010-11-30

Pham, Chi H (Department: 2471)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S450000

Reexamination Certificate

active

07843940

ABSTRACT:
Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, and mechanisms, for filling token buckets of schedule entries, such as those used in, but not limited to, a scheduling system used in a computer or communications system (e.g., for sending packets, allocating processing resources, etc.). A scheduling system includes multiple schedule entries with a number of tokens and a last filled slot value. A period of time allocated for periodically updating the number of tokens for all of the schedule entries is divided into the slots, and each schedule entry is associated with a particular fill slot. Each particular schedule entry is repeatedly sequence through and updated during is corresponding slot; while in parallel, a next schedule entry to service is repeatedly identified and updated, while in parallel, ineligible entries schedule to be woken up for the current time slot are made eligible.

REFERENCES:
patent: 6011798 (2000-01-01), McAlpine
patent: 6247061 (2001-06-01), Douceur et al.
patent: 6381214 (2002-04-01), Prasad
patent: 6567379 (2003-05-01), Walker et al.
patent: 6950395 (2005-09-01), Bashandy et al.
patent: 7065091 (2006-06-01), Shoham et al.
patent: 7110411 (2006-09-01), Saidi et al.
patent: 7212535 (2007-05-01), Shoham et
patent: 7385987 (2008-06-01), Charny et al.
patent: 2003/0103514 (2003-06-01), Nam et al.
patent: 2003/0169743 (2003-09-01), Chiussi
patent: 2006/0029080 (2006-02-01), Kappler et al.
Craig Partridge, Gigabit Networking, Addison Wesley Longman, Inc., 1994, pp. 253-263.
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.
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.

Affiliated with

Also associated with

Rating

Filling token buckets of schedule entries does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Filling token buckets of schedule entries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Filling token buckets of schedule entries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4248020