Packet Fair Queueing (PFQ) algorithms have been extensively studied for provision of Quality of Service (QoS) guarantees in Integrated Services Networks. Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitations on the range of QoS that can be supported. We develop PFQ with deterministic time-varying weight assignments, and we propose a low-overhead algorithm capable of supporting arbitrary piecewise linear service curves which achieve delay-bandwidth decoupling. Unlike existing service-curve based algorithm, our time-varying PFQ scheme mitigates the punishment phenomenon, and allows sessions to exploit the extra bandwidth in under-loaded networks.
|Original language||English (US)|
|Title of host publication||Conference Record / IEEE Global Telecommunications Conference|
|Number of pages||5|
|State||Published - Dec 1 2000|