Prioritized continuous-deficit round robin scheduling

Details Prioritized continuous-deficit round robin scheduling Prioritized continuous-deficit round robin scheduling

2005-07-05

2005-07-05

Phan, Man U. (Department: 2665)

Multiplex communications

Data flow congestion prevention or control

Control of data admission to the network

C370S252000, C370S395430, C370S429000, C709S232000

Reexamination Certificate

active

06914881

ABSTRACT:
A method and apparatus for queue selection is described below as Prioritized Continuous-Deficit Round Robin (PC-DRR) Scheduling. In PC-DRR scheduling a queue is selected as a source for the shared datapath using a modified round-robin approach, where queues are cyclically, sequentially evaluated to determine whether or not there is data stored in the queue. In PC-DRR scheduling, each queue is assigned a weight, wherein the weight corresponds to a predefined bandwidth that is allocated to the queue. Thus, the weight defines a fixed allotment of transmit opportunities that are to be allowed for the associated queue during its transmit tenure. In a preferred embodiment, a minimum permissible weight that is assigned to a queue is equal to a Maximum Packet Size. As data are drained from the queue, the weight is decreased incrementally by the amount of data sent, providing a balance. Thus the balance represents the instantaneous count of the number of output transmits that are remain for the queue within its transmit tenure. The queue continues to drain until the quantity of data transmitted is greater than the remaining balance, at which point the balance associated with the queue will become negative or zero. Once one queue is drained, or has exceeded its balance, the next sequential queue that has data to transmit is selected, where its associated weight will correspond to the number of fined transmit opportunities that are permitted for the queue.

REFERENCES:
patent: 5905730 (1999-05-01), Yang et al.
patent: 5956340 (1999-09-01), Afek et al.
patent: 5991812 (1999-11-01), Srinivasan
patent: 6101193 (2000-08-01), Ohba
patent: 6470016 (2002-10-01), Kalkunte et al.
patent: 6490248 (2002-12-01), Shimojo
patent: 6526060 (2003-02-01), Hughes et al.
patent: 6567417 (2003-05-01), Kalkunte et al.
patent: 6683884 (2004-01-01), Howard
patent: 6687247 (2004-02-01), Wilford et al.
patent: 6714517 (2004-03-01), Fawaz et al.
U.S. Appl. No. 09/248,155, filed Feb. 9, 1999, Kalkunte et al.
“Efficient Fair Queuing Using Deficit Round Robin”, Shreedhar, et al., Oct. 16, 1995.

Affiliated with

Also associated with

Rating

Prioritized continuous-deficit round robin scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Prioritized continuous-deficit round robin scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prioritized continuous-deficit round robin scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3409147