Hostname: page-component-7dd5485656-zlgnt Total loading time: 0 Render date: 2025-10-31T18:36:49.791Z Has data issue: false hasContentIssue false
  • English
  • Français

Transient phenomena for Markov chains and applications

Part of: Markov processes

Published online by Cambridge University Press:  01 July 2016

A. A. Borovkov ,
G. Fayolle  and
D. A. Korshunov
A. A. Borovkov*
Affiliation:
Institute of Mathematics, Novossibirsk
G. Fayolle*
Affiliation:
INRIA
D. A. Korshunov*
Affiliation:
Institute of Mathematics, Novossibirsk
*
∗ Postal address: Academy of Sciences, Institute of Mathematics, Novossibirsk, 90, 630090 USSR.
∗∗ Postal address: INRIA, Domaine de Voluceau-Rocquencourt, B.P 105, 78153 Le Chesnay, France.
∗ Postal address: Academy of Sciences, Institute of Mathematics, Novossibirsk, 90, 630090 USSR.
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a family of irreducible, ergodic and aperiodic Markov chains X(ε) = {X(ε) n, n ≧0} depending on a parameter ε > 0, so that the local drifts have a critical behaviour (in terms of Pakes' lemma). The purpose is to analyse the steady-state distributions of these chains (in the sense of weak convergence), when ε↓ 0. Under assumptions involving at most the existence of moments of order 2 + γ for the jumps, we show that, whenever X (0) is not ergodic, it is possible to characterize accurately these limit distributions. Connections with the gamma and uniform distributions are revealed. An application to the well-known ALOHA network is given.

Keywords

ERGODICITYRANDOM ACCESSSTABILITYWEAK CONVERGENCE

MSC classification

Primary: 60J27: Continuous-time Markov processes on discrete state spaces

Information

Type
Research Article
Information
Advances in Applied Probability , Volume 24 , Issue 2 , June 1992 , pp. 322 - 342
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

All correspondence should be addressed to this author.

References

[1] Abramson, N. (1970) The ALOHA system-another alternative for computer communications. Proc. Fall Joint Computer Conf., AFIPS Press, 37, 281–285.Google Scholar
[2] Borovkov, A. A. (1964) Some limit theorems in the theory of queueing systems (in Russian). Teoriia Veroiiat. i Primi. 9, 608–625.Google Scholar
[3] Borovkov, A. A. (1976) Stochastic Processes in Queueing Theory. Springer-Verlag, New York.CrossRefGoogle Scholar
[4] Borovkov, A. A. (1988) On ergodicity and stability of the relation. Applications to communication networks (in Russian). Teoriia Veroiiat. i Primi. 33, 641–658.Google Scholar
[5] Fayolle, G. (1975) Etude du comportement d'un canal radio partagé entre plusieurs utilisateurs. Thèse de docteuringénieur, Université Paris VI.Google Scholar
[6] Fayolle, G., Gelenbe, E. and Labetoulle, L. (1977) Stability and optimal control of the packet switching broadcast channel. J. Assoc. Comput. Mach. 24, 375–386.CrossRefGoogle Scholar
[7] Fayolle, G. (1987) Ergodicity and transience of the ALOHA system with a stationary input. Unpublished report.Google Scholar
[8] Fayolle, G. (1989) On random walks arising in queueing systems: ergodicity and transience via quadratic forms as Lyapounov functions-Part I. QUESTA 5, 167–184.Google Scholar
[9] Karlin, S. (1968) A First Course in Stochastic Processes. Academic Press, New York.Google Scholar
[10] Kingman, J. F. C. (1962) On queues in heavy traffic. J. R. Statist. Soc. B 24, 383–392.Google Scholar
[11] Lam, S. S. and Kleinrock, L. (1975) Packet switching in a multiaccess broadcast channel: Dynamic control procedures. IEEE Trans. Commun. 24, 891–904.CrossRefGoogle Scholar
[12] Lamperti, J. (1960) Criteria for the recurrence or transience of stochastic processes, I. J. Math. Anal. Appl. 1, 314–330.CrossRefGoogle Scholar
[13] Loève, ?. (1977) Probability Theory, 4th edn. Springer-Verlag, New York.Google Scholar
[14] Pakes, A. G. (1969) Some conditions for ergodicity and recurrence of Markov chains. Operat. Res. 17, 1058–1061.CrossRefGoogle Scholar
[15] Prokhorov, Yu. V. (1963) Transient phenomena in queueing systems (in Russian). Litovsk. Math. Sb. 3, 199–206.Google Scholar
[16] Tweedie, R. L. (1976) Criteria for classifying general Markov chains. Adv. Appl. Prob. 8, 736–771.CrossRefGoogle Scholar