Optimal call admission control on a single link with a GPS scheduler

Authors:
Antonis Panagakis;Nandita Dukkipati;Ioannis Stavrakakis;Joy Kuri
Affiliations:
Department of Informatics, University of Athens, Athens 157-84, Greece;Centre for Electronics Design and Technology, Indian Institute of Science, Bangalore 560012, India;Department of Informatics, University of Athens, Athens 157-84, Greece;Centre for Electronics Design and Technology, Indian Institute of Science, Bangalore 560012, India
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2004

Citing 7
Cited 5

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Statistical analysis of generalized processor sharing scheduling discipline

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Efficient network QoS provisioning based on per node traffic shaping

IEEE/ACM Transactions on Networking (TON)
Bandwidth allocation for multiple qualities of service using generalized processor sharing

IEEE Transactions on Information Theory
Application of network calculus to guaranteed service networks

IEEE Transactions on Information Theory
Nonintrusive TCP connection admission control for bandwidth management of an Internet access link

IEEE Communications Magazine

GPS scheduling: selection of optimal weights and comparison with strict priorities

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Beyond processor sharing

ACM SIGMETRICS Performance Evaluation Review
QoS mechanisms for the MAC protocol of IEEE 802.11 WLANs

Wireless Networks
Generalized processor sharing: Characterization of the admissible region and selection of optimal weights

Computers and Operations Research
Pricing the quality of differentiated services for media-oriented real-time applications: A multi-attribute negotiation approach

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.