Nandita, D and Kuri, Joy and Jamadagni, HS (2001) Optimal Call Admission Control in Generalized Processor Sharing (GPS) Schedulers. In: IEEE INFOCOM 2001 Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, 22-26 April, Alaska,USA, Vol.1, 468 -477.
optimal.pdf - Published Version
Restricted to Registered users only
Download (172Kb) | Request a copy
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 as 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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||Generalized Processor Sharing;Call Admission Control;Optimal Bandwidth Allocation;Non-Rate Proportional Resource Allocation|
|Department/Centre:||Division of Electrical Sciences > Electronic Systems Engineering (Formerly, (CEDT) Centre for Electronic Design & Technology)|
|Date Deposited:||14 Feb 2006|
|Last Modified:||01 Jul 2011 07:12|
Actions (login required)