Panagakis, Antonis and Dukkipati, Nandita and Stavrakakis, Ioannis and Kuri, Joy (2004) Optimal Call Admission Control on a Single Link With a GPS Scheduler. In: IEEE-ACM Transactions on Networking, 12 (5). pp. 865-878.
The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process, a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is also applicable, under a slight modification, in a system where the best effort traffic is absent and is capable of guaranteeing that if it does not find a solution to the CAC problem, then a solution does not exist. The numerical results indicate that the CAC algorithm can achieve a significant improvement on bandwidth utilization as compared to a (deterministic) effective bandwidth-based CAC scheme.
|Item Type:||Journal Article|
|Additional Information:||©2004 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:||Call admission control;generalized processor sharing;optimal bandwidth allocation|
|Department/Centre:||Division of Biological Sciences|
|Date Deposited:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:17|
Actions (login required)