CS-534: Packet Switch Architecture
Spring 2003
Department of Computer Science
© University of Crete, Greece

7.4   Weighted Round Robin (WFQ) Scheduling

[Up: Table of Contents]
[Prev: 7.3 Round Robin Scheduling]

[Next: 8. Other Topics]

Weighted Round Robin Service Schedules

Priority Queue: (quite) smooth WRR scheduling

Real or Virtual Time?

Where to Reinsert a Flow that becomes Eligible?

Beware: multiple low-rate flows may create large jitter for high-rate flows

  • Read the pages on Weighted Round-Robin Schedulers of the Computer Architecture and VLSI Systems Lab of ICS-FORTH.

  • For Calendar Queues, the primary reference is: R. Brown: "Calendar Queues: a Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem", Communications of the ACM, vol. 31, no. 10, Oct. 1988, pp. 1220-1227.

    Leaky Bucket implemented using Priority Queue
    [Correction: the "max" should be "min" in the equation at the middle of this transparency]


    [Up: Table of Contents]
    [Prev: 7.3 Round Robin Scheduling]

    [Next: 8. Other Topics]

    Up to the Home Page of CS-534
     
    © copyright University of Crete, Greece.
    Last updated: 6 June 2003, by M. Katevenis.