Round-Robin
Packets are classified and sent to “n” queues
- Queues are serviced in order 0..n-1
Problems
- Can’t offer bandwidth or delay guarantees
- Packets can “park” in a queue, while empty queues are checked for servicing
- Insensitive to packet size (inherently unfair)