Hostname: page-component-89b8bd64d-j4x9h Total loading time: 0 Render date: 2026-05-07T02:59:20.421Z Has data issue: false hasContentIssue false
  • English
  • Français

Geometric Ergodicity of the ALOHA-system and a Coupled Processors Model

Published online by Cambridge University Press:  27 July 2009

F. M. Spieksma
F. M. Spieksma
Affiliation:
Department of Mathematics and Computer Science Niels Bohrweg 1 University of Leiden, 2333CA Leiden, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

μ-Geometric ergodicity of two-dimensional versions of the ALOHA and coupled processors models is verified by checking μ-geometric recurrence. Ergodicity and convergence of the Laplace-Stieltjes transforms in a neighborhood of 0 are necessary and sufficient conditions for the first model. The second model is exponential, for which ergodicity suffices to establish the required results.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 5 , Issue 1 , January 1991 , pp. 15 - 42
Copyright
Copyright © Cambridge University Press 1991

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

References

Cheong, C. K. & Heathcote, C. R. (1965). On the rate of convergence of waiting times. Journal of the Australian Mathematical Society 5: 365–373.CrossRefGoogle Scholar
Chung, K. L. (1967). Markov chains with stationary transition probabilities. Berlin: Springer- Verlag.Google Scholar
Dekker, R. & Hordijk, A. (1988). Average, sensitive and Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards. Mathematics of Operations Research 13: 395–421.CrossRefGoogle Scholar
Dekker, R. & Hordijk, A. (1989). Recurrence conditions for average and Blackwell optimality in denumerable state Markov decision chains. Technical report, Department of Mathematics and Computer Science, University of Leiden. To appear in Mathematics of Operations Research.Google Scholar
Fayolle, G. & Iasnogorodski, R. (1979). Two coupled processors: the reduction to a RiemannHubert problem. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 47: 325–351.CrossRefGoogle Scholar
Hajek, B. (1982). Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability 14: 502–525.CrossRefGoogle Scholar
Hordijk, A. (1974). Dynamic programming and Markov potential theory. Mathematical Centre Tract 51, Amsterdam.Google Scholar
Hordijk, A. & Spieksma, F. M. (1989). On ergodicity and recurrence properties of a Markov chain with an application to an open Jackson network. Technical report, Department of Mathematics and Computer Science, University of Leiden, submitted for publication.Google Scholar
Kendall, D. G. (1959). Unitary dilations of Markov transition operators, and the corresponding integral representations for transition-probability matrices. In Grenander, U. (ed.), Probability and statistics. Stockholm: Almqvist and Wiksell (Wiley, New York), pp. 139–161.Google Scholar
Kendall, D. G. (1960). Geometric ergodicity and the theory of queues. In Arrow, K. J., Karlin, S. & Suppes, P. (eds.), Mathematical methods in the social sciences. Stanford, CA: Stanford University Press, pp. 176–195.Google Scholar
Makowski, A. M. & Shwartz, A. (1989). Recurrence properties of a discrete-time single-server network with random routing, EE PUB No. 718, Technion Institute of Technology.Google Scholar
Malyshev, V. A. (1972). Classification of two-dimensional positive random walks and almost linear semimartingales. Soviet Mathematics Doklady 13: 136–139.Google Scholar
Malyshev, V. A. & Mensikov, M. V. (1981). Ergodicity, continuity and analyticity of countable Markov chains. Transactions of the Moscow Mathematical Society 1: 1–48.Google Scholar
Miller, H. D. (1966). Geometric ergodicity in a class of denumerable Markov chains. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 4: 354–373.CrossRefGoogle Scholar
Neuts, M. F. & Teugels, J. L. (1969). Exponential ergodicity of the M'G'l-queue. SIAM Journal of Applied Mathematics 17: 921–929.CrossRefGoogle Scholar
Neveu, J. (1965). Mathematical foundations of the calculus of probability. San Francisco:Holden-Day.Google Scholar
Nummelin, E. & Tweedie, R. L. (1978). Geometric ergodicity and R-positivity for general Markov chains. Annals of Probability 6: 404–420.CrossRefGoogle Scholar
Popov, N. N. (1977). Conditions for geometric ergodicity of countable Markov chains. Soviet Mathematics Doklady 18:676–679.Google Scholar
Ridder, A. N. (1987). Stochastic inequalities for queues. Unpublished doctoral dissertation, University of Leiden. (Available on request from Hordijk, A., Department of Mathematics and Computer Science, P.O. Box 9512, 2300RA Leiden, Netherlands.)Google Scholar
Rosberg, Z. (1980). A positive recurrence criterion associated with multi-dimensional queueing processes. Journal of Applied Probability 17: 790–801.CrossRefGoogle Scholar
Ross, S. M. (1983). Stochastic processes. New York: Wiley.Google Scholar
Schäl, M. (1971). The analysis of queues with state-dependent parameters by Markov renewal processes. Advances in Applied Probability 3: 155–175.CrossRefGoogle Scholar
Spieksma, F. M. (1989). The existence of sensitive optimal policies in two multi-dimensional queueing models. Technical report, Department of Mathematics and Computer Sciences, University of Leiden, to appear in Annals of Operations Research, a special volume on Markov Decision Processes (guest eds. Hernández-Lerma, O., Lasserre, J.B.).Google Scholar
Spieksma, F. M. (1990). A note on μ-exponentia1 ergodicity in uniformizable Markov processes with or without control. Technical report, Department of Mathematics and Computer Science, University of Leiden.Google Scholar
Spieksma, F. M. (1990). Geometrically ergodic Markov chains and the optimal control of queues. Unpublished doctoral dissertation, University of Leiden. (Available on request from Spieksma, F., Department of Mathematics and Computer Science, P.O. Box 9512, 2300RA Leiden, Netherlands.)Google Scholar
Szpankowski, W. (1988). Stability conditions for multi-dimensional queueing systems with computer applications. Operations Research 36: 944–957.CrossRefGoogle Scholar
Tuominen, P. & Tweedie, R. L. (1979). Exponential ergodicity in Markovian queueing and dam models. Journal of Applied Probability 16: 867–880.CrossRefGoogle Scholar
Tweedie, R. L. (1975). Sufficient conditions for regularity, recurrence and ergodicity of Markov processes. Mathematical Proceedings of the Cambridge Philosophical Society 78: 125–136.CrossRefGoogle Scholar
Tweedie, R. L. (1981). Criteria for ergodicity, exponential ergodicity and strong ergodicity of Markov processes. Journal of Applied Probability 18: 122–130.CrossRefGoogle Scholar
Vere-Jones, D. (1962). Geometric ergodicity in denumerable Markov chains. The Quarterly Journal of Mathematics, Oxford 13: 7–28.CrossRefGoogle Scholar