Exponential Bounds with Applications to Call Admission - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1996

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.
Fichier principal
Vignette du fichier
RR-2865.pdf (380.32 Ko) Télécharger le fichier

Dates and versions

inria-00073826 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073826 , version 1

Cite

Zhen Liu, Philippe Nain, Don Towsley. Exponential Bounds with Applications to Call Admission. RR-2865, INRIA. 1996. ⟨inria-00073826⟩
28 View
161 Download

Share

Gmail Facebook Twitter LinkedIn More