HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073826
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:50:18 PM
Last modification on : Friday, February 4, 2022 - 3:15:27 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:59:19 PM

Identifiers

  • 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⟩

Share

Metrics

Record views

30

Files downloads

146