Weighted Round Robin

• Allows prioritization

• Assign a "weight" to each queue

• Dispatches packets from each queue proportionally to an assigned weight:

- Dispatch up to 4 from Queue 1

- Dispatch up to 2 from Queue 2

- Dispatch 1 from Queue 3

- Go back to Queue 1

Direction of Data Flow

The WRR algorithm was developed to provide prioritization capabilities for round robin.

In WRR, packets are assigned a class (voice, file transfer, and so on) and placed into the queue for that class of service. Packets are accessed round-robin style, but queues can be given priorities called "weights." For example, in a single round, four packets from a high-priority class might be dispatched, followed by two from a middle-priority class, and then one from a low-priority class.

Some implementations of the WRR algorithm will dispatch a configurable number of bytes during each round.

• Allows prioritization

• Assign a "weight" to each queue

• Dispatches packets from each queue proportionally to an assigned weight:

- Dispatch up to 4 from Queue 1

- Dispatch up to 2 from Queue 2

- Dispatch 1 from Queue 3

- Go back to Queue 1

I51 I Q

Queue 1 (Weight 4)

p5

pi

Queue 2 (Weight 2)

p6

p3

Up to four from Queue 1

Direction of Data Flow

Queue 3 (Weight 1)

Up to four from Queue 1

Queue 3 (Weight 1)

Up to 4499 bytes can be forwarded in one round in the worst case

Threshold (byte-count) = 3000

Was this article helpful?

0 0

Post a comment