Jump to content

Weighted round robin

From Wikipedia, the free encyclopedia
(Redirected from Weighted Round Robin)

Weighted round robin (WRR) is a network scheduler for data flows, but also used to schedule processes.

Weighted round robin[1] is a generalisation of round-robin scheduling. It serves a set of queues or tasks. Whereas round-robin cycles over the queues or tasks and gives one service opportunity per cycle, weighted round robin offers to each a fixed number of opportunities, as specified by the configured weight which serves to influence the portion of capacity received by each queue or task. In computer networks, a service opportunity is the emission of one packet, if the selected queue is non-empty.

If all packets have the same size, WRR is the simplest approximation of generalized processor sharing (GPS). Several variations of WRR exist.[2] The main ones are the classical WRR, and the interleaved WRR.



WRR is presented in the following as a network scheduler. It can also be used to schedule tasks in a similar way.

A weighted round-robin network scheduler has input queues, . To each queue is associated , a positive integer, called the weight. The WRR scheduler has a cyclic behavior. In each cycle, each queue has emissions opportunities.

The different WRR algorithms differ on the distributions of these opportunities in the cycle.

Classical WRR[edit]

In classical WRR[2][3][4] the scheduler cycles over the queues. When a queue is selected, the scheduler will send packets, up to the emission of packet or the end of queue.

Constant and variables: 
    const N             // Nb of queues 
    const weight[1..N]  // weight of each queue
    queues[1..N]        // queues
    i                   // queue index
    c                   // packet counter
while true do 
    for i in 1 .. N do
        c := 0
        while (not queue[i].empty) and (c<weight[i]) do
            c:= c+1

Interleaved WRR[edit]

Let , be the maximum weight. In IWRR,[1][5] each cycle is split into rounds. A queue with weight can emit one packet at round only if .

Constant and variables: 
    const N             // Nb of queues 
    const weight[1..N]  // weight of each queue
    const w_max
    queues[1..N]        // queues
    i                   // queue index
    r                   // round counter
while true do
    for r in 1 .. w_max do 
        for i in 1 .. N do
            if (not queue[i].empty) and (weight[i] >= r) then


Example of scheduling for CWRR and IWRR

Consider a system with three queues and respective weights . Consider a situation where they are 7 packets in the first queue, A,B,C,D,E,F,G, 3 in the second queue, U,V,W and 2 in the third queue X,Y. Assume that there is no more packet arrival.

With classical WRR, in the first cycle, the scheduler first selects and transmits the five packets at head of queue,A,B,C,D,E (since ), then it selects the second queue, , and transmits the two packets at head of queue, U,V (since ), and last it selects the third queue, which has a weight equals to 3 but only two packets, so it transmits X,Y. Immediately after the end of transmission of Y, the second cycle starts, and F,G from are transmitted, followed by W from .

With interleaved WRR, the first cycle is split into 5 rounds (since ). In the first one (r=1), one packet from each queue is sent (A,U,X), in the second round (r=2), another packet from each queue is also sent (B,V,Y), in the third round (r=3), only queues are allowed to send a packet (, and ), but since is empty, only C from is sent, and in the fourth and fifth rounds, only D,E from are sent. Then starts the second cycle, where F,W,G are sent.

Task scheduling[edit]

Task or process scheduling can be done in WRR in a way similar to packet scheduling: when considering a set of active tasks, they are scheduled in a cyclic way, each task gets quantum or slice of processor time .[6][7]


Like round-robin, weighted round robin scheduling is simple, easy to implement, work conserving and starvation-free.

When scheduling packets, if all packets have the same size, then WRR and IWRR are an approximation of Generalized processor sharing:[8] a queue will receive a long term part of the bandwidth equals to (if all queues are active) while GPS serves infinitesimal amounts of data from each nonempty queue and offer this part on any interval.

If the queues have packets of variable length, the part of the bandwidth received by each queue depends not only on the weights but also of the packets sizes.

If a mean packets size is known for every queue , each queue will receive a long term part of the bandwidth equals to . If the objective is to give to each queue a portion of link capacity (with ), one may set .

Since IWRR has smaller per class bursts than WRR, it implies smaller worst-case delays.[9]

Limitations and improvements[edit]

WRR for network packet scheduling was first proposed by Katevenis, Sidiropoulos and Courcoubetis in 1991,[1] specifically for scheduling in ATM networks using fixed-size packets (cells). The primary limitation of weighted round-robin queuing is that it provides the correct percentage of bandwidth to each service class only if all the packets in all the queues are the same size or when the mean packet size is known in advance. In the more general case of IP networks with variable size packets, to approximate GPS the weight factors must be adjusted based on the packet size. That requires estimation of the average packet size, which makes a good GPS approximation hard to achieve in practice with WRR.[1]

Deficit round robin is a later variation of WRR that achieves better GPS approximation without knowing the mean packet size of each connection in advance. More effective scheduling disciplines were also introduced which handle the limitations mentioned above (e.g. weighted fair queuing).

See also[edit]


  1. ^ a b c d Katevenis, M.; Sidgiropoulos, S.; Courcoubetis, C. (1991). "Weighted round-robin cell multiplexing in a general-purpose ATM switch chip". IEEE Journal on Selected Areas in Communications. 9 (8): 1265–1279. doi:10.1109/49.105173. ISSN 0733-8716.
  2. ^ a b Chaskar, H.M.; Madhow, U. (2003). "Fair scheduling with tunable latency: A round-robin approach". IEEE/ACM Transactions on Networking. 11 (4): 592–601. doi:10.1109/TNET.2003.815290. ISSN 1063-6692. S2CID 8010108.
  3. ^ Brahimi, B.; Aubrun, C.; Rondeau, E. (2006). "Modelling and Simulation of Scheduling Policies Implemented in Ethernet Switch by Using Coloured Petri Nets". 2006 IEEE Conference on Emerging Technologies and Factory Automation. pp. 667–674. doi:10.1109/ETFA.2006.355373. ISBN 0-7803-9758-4. S2CID 6089006.
  4. ^ F. Baker; R.Pan (May 2016). "2.2.2. Round-Robin Models". On Queuing, Marking, and Dropping (Technical report). IETF. RFC 7806.
  5. ^ Semeria, Chuck (2001). Supporting Differentiated Service Classes: Queue Scheduling Disciplines (PDF) (Report). pp. 15–18. Retrieved May 4, 2020.
  6. ^ Beaulieu, Alain (Winter 2017). "Real Time Operating Systems – Scheduling & Schedulers" (PDF). Retrieved May 4, 2020.[permanent dead link]
  7. ^ United States 20190266019, Philip D. Hirsch, "Task Scheduling Using Improved Weighted Round Robin Techniques", published August 29, 2019 
  8. ^ Fall, Kevin (April 29, 1999). "EECS 122, "Introduction to Communication Networks", Lecture 27, "Scheduling Best-Effort and Guaranteed Connections"". Retrieved May 4, 2020.
  9. ^ Tabatabaee, Seyed Mohammadhossein; Le Boudec, Jean-Yves; Boyer, Marc (September 22–24, 2020). "Interleaved Weighted Round-Robin: A Network Calculus Analysis". Proc. of the 32nd Int. Teletraffic Congress (ITC 32). arXiv:2003.08372. doi:10.1109/ITC3249928.2020.00016.