Abstract
We study bounds on the rate of convergence to the stationary distribution in monotone separable networks which are represented in terms of stochastic recursive sequences. Monotonicity properties of this subclass of Markov chains allow us to formulate conditions in terms of marginal network characteristics. Two particular examples, generalized Jackson networks and multiserver queues, are considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen and J. Teugels, Convergence rates for M/G/1 queues and ruin problems with heavy tails, J. Appl. Probab. 33 (1996) 1181–1190.
K. B. Athreya and P. Ney, A new approach to the limit theory of recurrent Markov chains, Trans. of AMS 245 (1978) 493–501.
F. Baccelli and S. Foss, Ergodicity of Jackson-type queueing networks, Queueing Systems 17 (1994) 5–72.
F. Baccelli and S. Foss, On the saturation rule for the stability of queues, J. Appl. Probab. 32 (1995) 494–507.
F. Baccelli and S. Foss, Moments and tails in monotone separable stochastic networks, Ann. Appl. Probab. 14 (2004) 612–650.
P. Billingsley, Convergence of Probability Measures (Wiley, New York, 1999).
A. A. Borovkov, Some estimates for the rate of convergence in stability theorems, Teor. Verojatnost. i Primenen. 22 (1977) 689–699.
A. A. Borovkov, Asymptotic Methods in Queueing Theory (Wiley, New York, 1984).
A. A. Borovkov, Limit theorems for queueing networks. I, Theory Probab. Appl. 31 (1986) 413–427.
A. A. Borovkov and S. Foss, Stochastically recursive sequences and their generalizations, Siberian Adv. Math. 2 (1992) 16–81.
A. Brandt, P. Franken and B. Lisek, Stationary Stochastic Models (Wiley, New York, 1990).
J. G. Dai and S. P. Meyn, Stability and convergence of moments for multiclass queueing networks via fluid limit models, IEEE Trans.Automat.Control 40 (1995) 1889–1904.
R. Douc, G. Fort, E. Moulines and Ph. Soulier, Practical drift conditions for subgeometric rates of convergence, Ann. Appl. Probab. 14 (2004) 1353–1377.
D. Down, S. P. Meyn and R. L. Tweedie, Exponential and uniform ergodicity of Markov processes, Ann.Probab. 23 (1995) 1671–1691.
G. Fayolle, V. A. Malyshev, M. V. Men'shikov and A. F. Sidorenko, Lyapunov functions for Jackson networks, Math. Oper. Res. 18 (1993) 916–927.
S. Foss, On the certain properties of open queueing networks, Problems of Inform. Transmit. 25 (1989) 90–97.
S. Foss, Ergodicity of queueing networks, Siberian Math. J. 32 (1991) 690–705.
S. Foss and A. Sapozhnikov, On the existence of moments for the busy period in a single-server queue, to appear in Math. Oper. Res. (2004).
S. F. Jarner and G. O. Roberts, Polynomial convergence rates of Markov chains, Ann. Appl. Probab. 12 (2002) 224–247.
Yu. Kifer, Ergodic Theory of Random Transformations (Boston, Birkhauser, 1986).
S. A. Klokov and A. Yu. Veretennikov, Sub-exponential mixing rate for a class of Markov chains, Math. Commun. 9 (2004) 9–26.
T. Lindvall, Lectures on The Coupling Method (Wiley, New York, 1992).
T. Lindvall, Stochastic monotonicities in Jackson queueing networks, Probab. Engrg. Inform. Sci. 11 (1997) 1–9.
B. Lisek, Stability theorems for queueing systems without delay, Elektron. Informationsverarb. Kybernet. 17 (1981) 259–278.
R. M. Loynes, The stability of a queue with non-independent inter-arrival and service times, Proc. Cambr. Phil.Soc. 58 (1962) 497–520.
R. B. Lund, S. P. Meyn and R. L. Tweedie, Computable exponential convergence rates for stochastically ordered Markov processes, Ann. Appl. Prob. 6 (1996) 218–237.
S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability (Springer, London, 1993).
J. G. Shanthikumar and D. D, Yao, Stochastic monotonicity in general queueing networks, J. Appl. Probab. 26 (1989) 413–417.
D. Stoyan, Comparison Methods for Queues and Other Stochastic Models (Wiley, New York, 1983).
H. Thorisson, The queue GI/G/1: finite moments of the cycle variables and uniform rates of convergence, Stochastic Process. Appl. 19 (1985) 85–99.
H. Thorisson, The queue GI/GI/k: finite moments of the cycle variables and uniform rates of convergence, Comm. Statist. Stochastic Models 1 (1985) 221–238.
P. Touminen and R. L. Tweedie, Subgeometric rates of convergence of f-ergodic Markov chains, Adv. Appl. Probab. 26 (1994) 775–798.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Foss, S., Sapozhnikov, A. Convergence rates in monotone separable stochastic networks. Queueing Syst 52, 125–137 (2006). https://doi.org/10.1007/s11134-006-4261-z
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11134-006-4261-z