An efficient method for proportional differentiated admission control implementation

Authors:
Vladimir V. Shakhov
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics of SB RAS, Novosibirsk, Russia
Venue:
MACOM'10 Proceedings of the Third international conference on Multiple access communications
Year:
2010

Citing 3
Cited 1

Sharp bounds and simple approximations for the Erlang delay and loss formulas

Management Science
Proportional differentiated services: delay differentiation and packet scheduling

IEEE/ACM Transactions on Networking (TON)
Utilizing call admission control for pricing optimization of multiple service classes in wireless cellular networks

Computer Communications

Optimization problems in proportional differentiated admission control

Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the admission control mechanism inspired in the framework of proportional differentiated services has been investigated. The mechanism provides a predictable and controllable network service for real-time traffic in terms of blocking probability. Implementation of proportional differentiated admission control is a complicated computational problem. Previously, asymptotic assumptions have been used to simplify the problem, but it is unpractical for real world applications. We improve previous solutions of the problem and offer an efficient non-asymptotic method for implementation of proportional differentiated admission control.