TY - GEN
T1 - Deterministic time-varying Packet Fair Queueing for Integrated Services Networks
AU - Stamoulis, Anastasios
AU - Giannakis, Georgios B
PY - 2000/12/1
Y1 - 2000/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0034478307&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034478307&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0034478307
VL - 1
SP - 621
EP - 625
BT - Conference Record / IEEE Global Telecommunications Conference
PB - IEEE
ER -