INRIA, B.P. 93, F-06902, Sophia Antipolis Cedex, France (e-mail: liu@sophia.inria.fr; nain@sophia.inria.fr), FR Department of Computer Science, University of Massachusetts, Amherst, MA 01003, USA (e-mail: towsley@cs.umass.edu), US
Abstract:
In this note we develop a framework for computing upper and lower bounds of an exponential form for a class of stochastic recursive equations with uniformly recurrent Markov modulated inputs. These bounds generalize Kingman's bounds for queues with renewal inputs.