DocumentCode :
1744515
Title :
Optimal call admission control in generalized processor sharing (GPS) schedulers
Author :
Nandita, D. ; Kuri, Joy ; Jamadagni, H.S.
Author_Institution :
Center for Electron. Design & Technol., Indian Inst. of Sci., Bangalore, India
Volume :
1
fYear :
2001
fDate :
2001
Firstpage :
468
Abstract :
Generalized processor sharing (GPS) is an idealized fluid discipline with a number of desirable properties. Its packetized version PGPS is considered to be a good choice is a packet scheduling discipline to guarantee quality-of-service in IP and ATM networks. The existing connection admission control (CAC) frameworks for GPS result in a conservative resource allocation. We propose an optimal CAC algorithm for a GPS scheduler, for leaky-bucket constrained connections with deterministic delay guarantees. Our numerical results show that the optimal CAC results in a higher network utilization than the existing CACs
Keywords :
asynchronous transfer mode; delays; optimisation; packet switching; quality of service; telecommunication congestion control; telecommunication traffic; transport protocols; ATM networks; GPS schedulers; IP networks; QoS guarantee; connection admission control; conservative resource allocation; deterministic delay guarantees; generalized processor sharing; leaky-bucket constrained connections; network utilization; optimal CAC algorithm; optimal call admission control; packet scheduling; packetized generalized processor sharing; quality-of-service; Bandwidth; Call admission control; Channel allocation; Delay; Global Positioning System; Processor scheduling; Quality of service; Resource management; Scheduling algorithm; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Conference_Location :
Anchorage, AK
ISSN :
0743-166X
Print_ISBN :
0-7803-7016-3
Type :
conf
DOI :
10.1109/INFCOM.2001.916738
Filename :
916738
Link To Document :
بازگشت