EXPONENTIAL BOUNDS WITH APPLICATIONS TO CALL ADMISSION

In this paper, we develop a framework for computing upper and lower bo unds of an exponential form for a large class of single resource syste ms with Markov additive inputs. Specifically, the bounds are on quanti ties such as backlog, queue length, and response time. Explicit or com putable expressions for our bounds are given in the context of queuing theory and numerical comparisons with other bounds and exact results are presented. The paper concludes with two applications to admission control in multimedia systems.