Skip to main content
Log in

On random walks arising in queueing systems: ergodicity and transience via quadratic forms as lyapounov functions — Part I

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

A simple and quite general approach is proposed to derive criteria for transience and ergodicity of a certain class of irreducibleN-dimensional Markov chains in ℤ N+ assuming a boundedness condition on the second moment of the jumps. The method consists in constructing convenient smooth supermartingales outside some compact set. The Lyapounov functions introduced belong to the set of quadratic forms in ℤ N+ and do not always have a definite sign. Existence and construction of these forms is shown to be basically equivalent to finding vectors satisfying a system of linear inequalities.

Part I is restricted toN=2, in which case a complete characterization is obtained for the type of random walks analyzed by Malyshev and Mensikov, thus relaxing their condition of boundedness of the jumps. The motivation for this work is partly from a large class of queueing systems that give rise to random walks in ℤ N+

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.

Similar content being viewed by others

References

  1. J.L. Doob,Stochastic processes (John Wiley, 1953).

  2. G. Fayolle and M.A. Brun, On a system with impatience and repeated calls,Queueing Theory and its Applications. Liber Amicorum for J.W. Cohen (North-Holland, Amsterdam, 1988), 283–305.

    Google Scholar 

  3. G. Fayolle, P.J.B. King and I. Mitrani, The solution of certain two-dimensional Markov models, Adv. in Appl. Prob. 14 (1982) 295–308.

    Google Scholar 

  4. F.G. Foster, On the stochastic matrices associated with certain queueing processes, Ann. Math. Statis. 14 (1953) 355–360.

    Google Scholar 

  5. J. Lamperti, Criteria for the recurrence or transience of stochastic process, I.J. Math. Anal. Appl. 1 (1960) 314–330.

    Google Scholar 

  6. V.A. Malyshev, Classification of two-dimensional positive random walks and almost linear semi-martingales, Soviet. Math. Dokl. 13 (1972) 136–139.

    Google Scholar 

  7. V.A. Malyshev and M.V. Mensikov, Ergodicity, continuity and analyticity, of countable Markov chains, Trudi Moscow Matem. Obsch. Tom 39 (1979) and also in Trans. Moscow. Math. Soc. Issue 7 (1981) 1–8.

    Google Scholar 

  8. M.V. Mensikov, Ergodicity and transience conditions for random walks in the positive octant of space, Soviet. Math. Dokl. Vol. 15 No. 4 (1979).

  9. S. Orey,Lecture Notes on Limit Theorems for Markov Chains on a General State Space (Van Nostrand, London, 1971).

    Google Scholar 

  10. W. Rosenkrantz, Ergodicity conditions for two-dimensional Markov chains with oblique reflection, Report Univ. of Massachusetts, to appear in Prob. Theory and Related Fields (1988).

  11. R.L. Tweedie, Criteria for classifying general Markov chains, Adv. Appl. Prob. 8 (1976) 737–771.

    Google Scholar 

  12. S.R.S. Varadhan and R. Williams, Brownian motion in a wedge with oblique reflection, Comm. Pure and Appl. Math. 38 (1985) 405–443.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fayolle, G. On random walks arising in queueing systems: ergodicity and transience via quadratic forms as lyapounov functions — Part I. Queueing Syst 5, 167–183 (1989). https://doi.org/10.1007/BF01149191

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation