Bounds for a class of stochastic recursive equations | Mathematical Methods of Operations Research Skip to main content
Log in

Bounds for a class of stochastic recursive equations

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Manuscript received: March 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Z., Nain, P. & Towsley, D. Bounds for a class of stochastic recursive equations. Mathematical Methods of OR 49, 325–333 (1999). https://doi.org/10.1007/PL00020920

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00020920

Navigation