DocumentCode :
1739721
Title :
Deterministic time-varying packet fair queueing for integrated services networks
Author :
Stamoulis, Anastasios ; Giannakis, Georgios B.
Author_Institution :
Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN, USA
Volume :
1
fYear :
2000
fDate :
2000
Firstpage :
621
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 algorithms, our time-varying PFQ scheme mitigates the punishment phenomenon, and allows sessions to exploit the extra bandwidth in under-loaded networks
Keywords :
deterministic algorithms; piecewise linear techniques; quality of service; queueing theory; telecommunication networks; time-varying systems; QoS guarantees; delay-bandwidth coupling; deterministic time-varying weight assignments; integrated services networks; low-overhead algorithm; packet fair queueing; piecewise linear service curves; quality of service; Bandwidth; Delay; Global Positioning System; Intserv networks; Piecewise linear techniques; Quality of service; Scheduling algorithm; Switches; Telecommunication traffic; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
0-7803-6451-1
Type :
conf
DOI :
10.1109/GLOCOM.2000.892091
Filename :
892091
Link To Document :
بازگشت