inria-00073826, version 1
Exponential Bounds with Applications to Call Admission
Zhen Liu 1Philippe Nain
Don Towsley
N° RR-2865 (1996)
Résumé : In this paper we develop a framework for computing upper and lower bounds of an exponential form for a large class of single resource systems with Markov additive inputs. Specifically, the bounds are on quantities such as backlog, queue length, and response time. Explicit or computable expressions for our bounds are given in the context of queueing theory and numerical comparisons with other bounds are presented. The paper concludes with two applications to admission control in multimedia systems.
- 1 : MISTRAL (INRIA Sophia Antipolis)
- INRIA
- Domaine : Informatique/Autre
- Mots-clés : TAIL DISTRIBUTION / EXPONENTIAL BOUND / MARKOV CHAIN / MATRIX ANALYSIS / QUEUES / MARKOV MODULATED PROCESS / QUALITY OF SERVICE / EFFECTIVE BANDWIDTH / CALL ADMISSION CONTROL
- Référence interne : RR-2865
- inria-00073826, version 1
- http://hal.inria.fr/inria-00073826
- oai:hal.inria.fr:inria-00073826
- Contributeur : Rapport De Recherche Inria
- Soumis le : Mercredi 24 Mai 2006, 13:50:18
- Dernière modification le : Mercredi 31 Mai 2006, 14:24:28
Documents associés
Exporter