Skip to main content Accessibility help
×
Home
Hostname: page-component-59b7f5684b-j4fss Total loading time: 0.714 Render date: 2022-09-26T17:02:58.868Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": false, "useSa": true } hasContentIssue true

Computable Bounds on the Spectral Gap for Unreliable Jackson Networks

Published online by Cambridge University Press:  22 February 2016

Paweł Lorek*
Affiliation:
University of Wrocław
Ryszard Szekli*
Affiliation:
University of Wrocław
*
Postal address: Mathematical Institute, University of Wroclaw, pl. Grunwaldzki 2/4, 50-384 Wrocław, Poland.
Postal address: Mathematical Institute, University of Wroclaw, pl. Grunwaldzki 2/4, 50-384 Wrocław, Poland.
Rights & Permissions[Opens in a new window]

Abstract

HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The goal of this paper is to identify exponential convergence rates and to find computable bounds for them for Markov processes representing unreliable Jackson networks. First, we use the bounds of Lawler and Sokal (1988) in order to show that, for unreliable Jackson networks, the spectral gap is strictly positive if and only if the spectral gaps for the corresponding coordinate birth and death processes are positive. Next, utilizing some results on birth and death processes, we find bounds on the spectral gap for network processes in terms of the hazard and equilibrium functions of the one-dimensional marginal distributions of the stationary distribution of the network. These distributions must be in this case strongly light-tailed, in the sense that their discrete hazard functions have to be separated from 0. We relate these hazard functions with the corresponding networks' service rate functions using the equilibrium rates of the stationary one-dimensional marginal distributions. We compare the obtained bounds on the spectral gap with some other known bounds.

Type
Research Article
Copyright
© Applied Probability Trust 

Footnotes

The work of both authors was supported by NCN Research Grant DEC-2011/01/B/ST1/01305.

References

Anantharam, V. (1989). Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases. Queueing Systems Theory Appl. 5, 7798.CrossRefGoogle Scholar
Baxendale, P. H. (2005). Renewal theory and computable convergence rates for geometrically ergodic Markov chains. Ann. Appl. Prob. 15, 700738.CrossRefGoogle Scholar
Berenhaut, K. S. and Lund, R. (2001). Geometric renewal convergence rates from hazard rates. J. Appl. Prob. 38, 180194.CrossRefGoogle Scholar
Berenhaut, K. S. and Lund, R (2002). Renewal convergence rates for DHR and NWU lifetimes. Prob. Eng. Inf. Sci. 16, 6784.CrossRefGoogle Scholar
Blanc, J. P. C. (1985). The relaxation time of two queueing systems in series. Commun. Statist. Stoch. Models 1, 116.CrossRefGoogle Scholar
Callaert, H. and Keilson, J. (1973). On exponential ergodicity and spectral structure for birth–death processes. I. Stoch. Process. Appl. 1, 187216.CrossRefGoogle Scholar
Chafai, D. and Joulin, A. (2013). Intertwining and commutation relations for birth–death processes. Bernoulli 19, 18551879.CrossRefGoogle Scholar
Chen, M.-F. (1991). Exponential L 2-convergence and L 2-spectral gap for Markov processes. Acta Math. Sinica (N.S.) 7, 1937.Google Scholar
Chen, M.-F. (1996). Estimation of spectral gap for Markov chains. Acta Math. Sinica (N.S.) 12, 337360.Google Scholar
Chen, M.-F. (2005). Eigenvalues, Inequalities, and Ergodic Theory. Springer, London.Google Scholar
Chen, M.-F. (2010). Speed of stability for birth–death processes. Front. Math. China 5, 379515.CrossRefGoogle Scholar
Daduna, H. and Szekli, R. (1995). Dependencies in Markovian networks. Adv. Appl. Prob. 27, 226254.CrossRefGoogle Scholar
Daduna, H. and Szekli, R. (1996). A queueing theoretical proof of increasing property of Pólya frequency functions. Statist. Prob. Lett. 26, 233242.CrossRefGoogle Scholar
Daduna, H. and Szekli, R. (2008). Impact of routeing on correlation strength in stationary queueing network processes. J. Appl. Prob. 45, 846878.CrossRefGoogle Scholar
Daduna, H., Kulik, R., Sauer, C. and Szekli, R. (2006). Dependence ordering for queueing networks with breakdown and repair. Prob. Eng. Inf. Sci. 20, 575594.CrossRefGoogle Scholar
Diaconis, P. and Fill, J. A. (1990). Examples for the theory of strong stationary duality with countable state spaces. Prob. Eng. Inf. Sci. 4, 157180.CrossRefGoogle Scholar
Diaconis, P. and Fill, J. A. (1990). Strong stationary times via a new form of duality. Ann. Prob. 18, 14831522.CrossRefGoogle Scholar
Diaconis, P. and Miclo, L. (2009). On times to quasi-stationarity for birth and death processes. J. Theoret. Prob. 22, 558586.CrossRefGoogle Scholar
Diaconis, P. and Stroock, D. (1991). Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob. 1, 3661.CrossRefGoogle Scholar
Dieker, A. B. and Warren, J. (2010). Series Jackson networks and noncrossing probabilities. Math. Operat. Res. 35, 257266.CrossRefGoogle Scholar
Fayolle, G., Malyshev, V. A., Meńshikov, M. V. and Sidorenko, A. F. (1993). Lyapounov functions for Jackson networks. Math. Operat. Res. 18, 916927.CrossRefGoogle Scholar
Fill, J. A. (1991). Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Prob. 1, 6287.CrossRefGoogle Scholar
Fill, J. A. (1991). Time to stationarity for a continuous-time Markov chain. Prob. Eng. Inf. Sci. 5, 6176.CrossRefGoogle Scholar
Fill, J. A. (1992). Strong stationary duality for continuous-time Markov chains. I. Theory. J. Theoret. Prob. 5, 4570.CrossRefGoogle Scholar
Fill, J. A. (2009). On hitting times and fastest strong stationary times for skip-free and more general chains. J. Theoret. Prob. 22, 587600.CrossRefGoogle Scholar
Hart, A. G., Martı´nez, S. and San Martin, J. (2003). The λ-classification of continuous-time birth-and-death processes. Adv. Appl. Prob. 35, 11111130.CrossRefGoogle Scholar
Hordijk, A. and Spieksma, F. (1992). On ergodicity and recurrence properties of a Markov chain with an application to an open Jackson network. Adv. Appl. Prob. 24, 343376.Google Scholar
Ignatiouk-Robert, I. (2006). On the spectrum of Markov semigroups via sample path large deviations. Prob. Theory Relat. Fields 134, 4480.CrossRefGoogle Scholar
Ignatiouk-Robert, I. and Tibi, D. (2012). Explicit Lyapunov functions and estimates of the essential spectral radius for Jackson networks. Preprint. Available at http://arxiv.org/abs/1206.3066v1.Google Scholar
Iscoe, I. and McDonald, D. (1994). Asymptotics of exit times for Markov Jump processes. II. Applications to Jackson networks. Ann. Prob. 22, 21682182.CrossRefGoogle Scholar
Kartashov, N. V. (2000). Determination of the spectral index of ergodicity of a birth-and-death process. Ukrainian Math. J. 52, 10181028.CrossRefGoogle Scholar
Kijima, M. (1992). Evaluation of the decay parameter for some specialized birth–death processes. J. Appl. Prob. 29, 781791.CrossRefGoogle Scholar
Kroese, D. P., Scheinhardt, W. R. W. and Taylor, P. G. (2004). Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process. Ann. Appl. Prob. 14, 20572089.CrossRefGoogle Scholar
Lawler, G. F. and Sokal, A. D. (1988). Bounds on the L 2 spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality. Trans. Amer. Math. Soc. 309, 557580.Google Scholar
Liggett, T. M. (1989). Exponential L 2 convergence of attractive reversible nearest particle systems. Ann. Prob. 17, 403432.CrossRefGoogle Scholar
Liu, W. and Ma, Y. (2009). Spectral gap and convex concentration inequalities for birth–death processes. Ann. Inst. H. Poincaré Prob. Statist. 45, 5869.CrossRefGoogle Scholar
Lorek, P. and Szekli, R. (2012). Strong stationary duality for Möbius monotone Markov chains. Queueing Systems 71, 7995.CrossRefGoogle Scholar
Lund, R. B., Meyn, S. P. and Tweedie, R. L. (1996). Computable exponential convergence rates for stochastically ordered Markov processes. Ann. Appl. Prob. 6, 218237.Google Scholar
Malyshev, V. A. and Spieksma, F. M. (1995). Intrinsic convergence rate of countable Markov chains. Markov Processes Relat. Fields 1, 203266.Google Scholar
Meyn, S. P. and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer, London.CrossRefGoogle Scholar
Roberts, G. O. and Tweedie, R. L. (2000). Rates of convergence of stochastically monotone and continuous time Markov models. J. Appl. Prob. 37, 359373.CrossRefGoogle Scholar
Rolski, T., Schmidli, H., Schmidt, V. and Teugels, J. (1999). Stochastic Processes for Insurance and Finance. John Wiley, Chichester.CrossRefGoogle Scholar
Sauer, C. (2006). Stochastic product form networks with unreliable nodes: analysis of performance and availability. , Hamburg University.Google Scholar
Sauer, C. and Daduna, H. (2003). Availability formulas and performance measures for separable degradable networks. Econom. Quality Control 18, 165194.Google Scholar
Sirl, D., Zhang, H. and Pollett, P. (2007). Computable bounds for the decay parameter of a birth–death process. J. Appl. Prob. 44, 476491.CrossRefGoogle Scholar
Van Doorn, E. A. (1981). Stochastic Monotonicity and Queueing Applications of Birth–Death Processes (Lecture Notes Statis. 4). Springer, New York.CrossRefGoogle Scholar
Van Doorn, E. A. (1985). Conditions for exponential ergodicity and bounds for the decay parameter of a birth–death process. Adv. Appl. Prob. 17, 514530.CrossRefGoogle Scholar
Van Doorn, E. A. (2002). Representations for the rate of convergence of birth–death processes. Theory Prob. Math. Statist. 65, 3743.Google Scholar
Van Doorn, E. A., Zeifman, A. I. and Panfilova, T. L. (2010). Bounds and asymptotics for the rate of convergence of birth–death processes. Theory Prob. Appl. 54, 97113.CrossRefGoogle Scholar
Vere-Jones, D. (1963). On the spectra of some linear operators associated with queueing systems. Z. Wahrscheinlichkeitsth. 2, 1221.CrossRefGoogle Scholar
Wu, L. (2004). Essential spectral radius for Markov semigroups. I. Discrete time case. Prob. Theory Relat. Fields 128, 255321.CrossRefGoogle Scholar
You have Access
1
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Computable Bounds on the Spectral Gap for Unreliable Jackson Networks
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Computable Bounds on the Spectral Gap for Unreliable Jackson Networks
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Computable Bounds on the Spectral Gap for Unreliable Jackson Networks
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *