Optimal Call Admission Control under Generalized Processor Sharing Scheduling

Authors:
Antonis Panagakis;Ioannis Stavrakakis
Affiliations:
-;-
Venue:
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Year:
2001

Citing 5
Cited 2

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)
Application of network calculus to guaranteed service networks

IEEE Transactions on Information Theory

Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Computer Networks: The International Journal of Computer and Telecommunications Networking
Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the problem of Call Admission Control 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 applicable, under slight modification, in a system where the best effort traffic is absent and capable of guaranteeing that a solution to the CAC problem does not exist, if not found. The provided numerical results indicate that the presented algorithm can achieve, under certain conditions, a significant improvement on bandwidth utilization compared to a (deterministic) effective bandwidth based CAC scheme.