Generalized Processor Sharing (GPS)
Algorithm (Parekh, 1993):
- Serve queues in a round-robin fashion.
- Serve an infinitesimal amount of data from each non-empty queue.
- In any finite time interval, visits every queue at least once.
Advantages:
- Ideal fairness and complete isolation of flows.
Disadvantages:
- Not implementable. Various emulations of the algorithm (CQ, WFQ) exists.