Deterministic time-varying Packet Fair Queueing for Integrated Services Networks

Anastasios Stamoulis, Georgios B Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

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 languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
PublisherIEEE
Pages621-625
Number of pages5
Volume1
StatePublished - Dec 1 2000

Fingerprint Dive into the research topics of 'Deterministic time-varying Packet Fair Queueing for Integrated Services Networks'. Together they form a unique fingerprint.

Cite this