Loading...
Please wait, while we are loading the content...
Similar Documents
Optimal Call Admission Control on a Single Link with a GPS Scheduler (2003)
| Content Provider | CiteSeerX |
|---|---|
| Author | Panagakis, Antonis Nandita, D. Stavrakakis, Ioannis Kuri, Joy |
| Abstract | In this paper 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. |
| File Format | |
| Volume Number | 12 |
| Journal | IEEE/ACM TRANS. NETW |
| Language | English |
| Publisher Date | 2003-01-01 |
| Access Restriction | Open |
| Subject Keyword | Optimal Call Admission Control Single Link Gps Scheduler Effort Traffic Slight Modification Finite Delay Bound Leaky Bucket Cac Algorithm Capable Optimal Solution Numerical Result Call Admission Control Significant Improvement Cac Algorithm Derived Algorithm Generalized Processor Sharing Scheduler Deterministic Service Guarantee Effective Bandwidth-based Cac Scheme Optimization Process Bandwidth Utilization Single Node Cac Problem |
| Content Type | Text |
| Resource Type | Article |
