Exponential Bounds with Applications to Call Admission

Abstract : 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.
Type de document :
Rapport
RR-2865, INRIA. 1996
Liste complète des métadonnées

https://hal.inria.fr/inria-00073826
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:50:18
Dernière modification le : samedi 27 janvier 2018 - 01:31:32
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:59:19

Fichiers

Identifiants

  • HAL Id : inria-00073826, version 1

Collections

Citation

Zhen Liu, Philippe Nain, Don Towsley. Exponential Bounds with Applications to Call Admission. RR-2865, INRIA. 1996. 〈inria-00073826〉

Partager

Métriques

Consultations de la notice

101

Téléchargements de fichiers

162