Priority Queuing

• Packets sent to “n” queues, assigned a priority 0..(n-1)

• Packets in higher priority queues get serviced first

• Packets in queue “m” only serviced if queues 0..(m-1) are empty

• Achievements:

  • Higher priority queues yield high throughput, lowest delay and highest bandwidth

• Concerns:

  • Lower priority queues are at the mercy of the higher priority queues,
  • Low priority queues completely starved if higher priority queues saturate the output

Previous slide

Next slide

Back to first slide

View graphic version