Admission control for real-time packet sessions
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 553-559 vol.2
- https://doi.org/10.1109/infcom.1991.147553
Abstract
Admission control is a tool in the management of the grade of service provided by the network to ongoing connections and new sessions. When the admission decision is based on the clipping loss, the authors model the node load by a Markov modulated point process and show that, if the two conjectures introduced hold, the optimum admission control that guarantees quality for all sessions in the node is of a threshold type. If the conjectures fail to hold, then the result holds for Poisson arrivals. The authors characterize the threshold and show that for the admission decision, the admission controller needs to compare the arrival rate matrices to the threshold. This threshold is based on the partial order on the lattice of arrival rate matrices.Keywords
This publication has 6 references indexed in Scilit:
- Palm Probabilities and Stationary QueuesLecture Notes in Statistics, 1987
- The preservation of likelihood ratio ordering under convolutionStochastic Processes and their Applications, 1986
- A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer PerformanceIEEE Journal on Selected Areas in Communications, 1986
- Uniform stochastic ordering and related inequalitiesThe Canadian Journal of Statistics / La Revue Canadienne de Statistique, 1982
- A versatile Markovian point processJournal of Applied Probability, 1979
- Markov Chain Models — Rarity and ExponentialityPublished by Springer Nature ,1979