Skip to main content
Log in

Properties of the Reflected Ornstein–Uhlenbeck Process

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Consider an Ornstein–Uhlenbeck process with reflection at the origin. Such a process arises as an approximating process both for queueing systems with reneging or state-dependent balking and for multi-server loss models. Consequently, it becomes important to understand its basic properties. In this paper, we show that both the steady-state and transient behavior of the reflected Ornstein–Uhlenbeck process is reasonably tractable. Specifically, we (1) provide an approximation for its transient moments, (2) compute a perturbation expansion for its transition density, (3) give an approximation for the distribution of level crossing times, and (4) establish the growth rate of the maximum process.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Abate and W. Whitt, Transient behavior of regulated Brownian motion, I: Starting at the origin, Adv. in Appl. Probab. 19 (1987) 560–598.

    Google Scholar 

  2. J. Abate and W. Whitt, Transient behavior of regulated Brownian motion, II: Non-zero initial conditions, Adv. in Appl. Probab. 19 (1987) 599–631.

    Google Scholar 

  3. S. Asmussen, Extreme value theory for queues via cycle maxima, Extremes 1(2) (1998) 137–168.

    Google Scholar 

  4. A. Berger and W. Whitt, Maximum values in queueing processes, Probab. Engrg. Inform. Sci. 9 (1995) 375–409.

    Google Scholar 

  5. A. Borovkov, Asymptotic Methods in Queueing Theory (Wiley, New York, 1984).

    Google Scholar 

  6. S. Browne and W. Whitt, Piecewise-linear diffusion processes, in: Advances in Queueing: Theory, Methods, and Open Problems, ed. J. Dshalalow (CRC Press, Boca Raton, FL, 1995) pp. 463–480.

    Google Scholar 

  7. E. Coffman, A. Puhalskii, M. Reiman and P. Wright, Processor-shared buffers with reneging, Performance Evaluation 19 (1994) 25–46.

    Google Scholar 

  8. P.W. Glynn and D. Iglehart, Trading securities using trailing stops, Managm. Sci. 41 (1995) 1096– 1106.

    Google Scholar 

  9. J.M. Harrison, Brownian Motion and Stochastic Flow Systems (Wiley, New York, 1985).

    Google Scholar 

  10. I. Karatzas and S.E. Shreve, Brownian Motion and Stochastic Calculus (Springer, New York, 1991).

    Google Scholar 

  11. S. Karlin and H. Taylor, A Second Course in Stochastic Processes (Academic Press, New York, 1976).

    Google Scholar 

  12. J. Keilson, A limit theorem for passage times in ergodic regenerative processes, Ann. Math. Statist. 37 (1966) 866–870.

    Google Scholar 

  13. T. Lindvall, On coupling of diffusion processes, J. Appl. Probab. 20 (1983) 82–93.

    Google Scholar 

  14. T. Lindvall, Lectures on the coupling method, in: Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics (Wiley, New York, 1992).

    Google Scholar 

  15. P. Lions and A. Sznitman, Stochastic differential equations with reflecting boundary conditions, Comm. Pure Appl. Math. 37 (1984) 511–537.

    Google Scholar 

  16. H. Rootzen, Maxima and exceedances of stationary Markov chains, Adv. in Appl. Probab. 20 (1989) 371–390.

    Google Scholar 

  17. S. Ross, Stochastic Processes (Wiley, New York, 1996).

    Google Scholar 

  18. R. Serfozo, Extreme values of birth and death processes and queues, Stochastic Process. Appl. 27 (1988) 291–306.

    Google Scholar 

  19. R. Srikant and W. Whitt, Simulation run lengths to estimate blocking probabilities, ACMTrans.Modeling Comput. Simulation 6 (1996) 7–52.

    Google Scholar 

  20. A. Ward and P. Glynn, A diffusion approximation for a GI/G/1 queue with reneging, Working paper (2002).

  21. A. Ward and P. Glynn, A diffusion approximation for a Markovian queue with reneging, under review (2002).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ward, A.R., Glynn, P.W. Properties of the Reflected Ornstein–Uhlenbeck Process. Queueing Systems 44, 109–123 (2003). https://doi.org/10.1023/A:1024403704190

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024403704190

Navigation