|
Abstract : |
We design a class of Fair Airport (FA) algorithms that combines Start-time Fair Queuing with a non-work conserving algorithm in the Rate Controlled Service Discipline (RCSD) class. We derive the fairness and deadline guarantees for FA servers. We demonstrate that by appropriately choosing an algorithm from the RCSD class, algorithms that either allocate only rate or achieve separation of rate and delay allocation and are fair over Fluctuation Constrained variable rate servers can be designed. This method leads to the design of the first fair algorithm that achieves separation of rate and delay allocation. We also show that the FA class contains algorithms with different implementation complexity and performance guarantees and thus enables tradeoffs between the two. Furthermore, since FA contains algorithms that are fair over variable rate servers, they can be employed for achieving hierarchical link sharing. Finally, we demonstrate that the FA algorithms can be generalized to achieve objectives such as hierarchical and/or prioritized fair allocation of residual bandwidth. 1, |
