Windowed Priority Queuing

• Packets sent to “n” queues, like Priority Queuing

• Limited number of packets processed per queue per servicing round

  • p(n) packets for each of the “n” queues

• Achievements:

  • Offers that some low priority traffic can be serviced even if high priority traffic is waiting

• Concerns:

  • Increases delay for higher priority queues
  • Still not fair
  • Large p(n) == Priority Queuing; Small p(n) == Round-Robin

Previous slide

Next slide

Back to first slide

View graphic version