Abstract
The ergodicity criterion for stochastically recursive sequences is given in terms of imbedded subsequences. Several examples are considered.
Similar content being viewed by others
References
A.A. Borovkov, Asymptotic analysis of the communication networks, Sov. Math. Dokl. 36 (1988) 335–338.
R. Loynes, The stability of a queue with non-independent inter-arrival and service times, Proc. Cambr. Phil. Soc. 58 (1962) 497–520.
A.A. Borovkov,Asymptotic Methods in Queueing Theory (Wiley, 1984).
A. Brandt, P. Franken and B. Lisek,Stationary Stochastic Models (Akademie-Verlag, Berlin, 1990).
S.G. Foss and V.V. Kalashnikov, Regeneration and renovation in queues, Queueing Systems 8 (1991) 211–223.
A.A. Borovkov and S.G. Foss, Stochastically recursive sequences and their generalizations, Siberian Adv. Math. 2 (1992), to appear.
S.G. Foss, On the ergodicity conditions for multi-server queues, Siberian Math. J. 34 (1983) 168–175 (in Russian).
S. Asmussen,Applied Probability and Queues (Wiley, 1987).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Foss, S.G. On the ergodicity conditions for stochastically recursive sequences. Queueing Syst 12, 287–295 (1992). https://doi.org/10.1007/BF01158804
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158804