Computable bounds on the spectral gap for unreliable Jackson networks
From MaRDI portal
Publication:5262447
Abstract: 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 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 zero. 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1190399 (Why is no real title available?)
- scientific article; zbMATH DE number 1249326 (Why is no real title available?)
- A queueing theoretical proof of increasing property of Polya frequency functions
- Asymptotics of exit times for Markov jump processes. II: Applications to Jackson networks
- Availability Formulas and Performance Measures for Separable Degradable Networks
- Bounds and Asymptotics for the Rate of Convergence of Birth-Death Processes
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Computable Bounds for the Decay Parameter of a Birth–Death Process
- Computable exponential convergence rates for stochastically ordered Markov processes
- Conditions for exponential ergodicity and bounds for the decay parameter of a birth-death process
- DEPENDENCE ORDERING FOR QUEUING NETWORKS WITH BREAKDOWN AND REPAIR
- Dependencies in Markovian networks
- Determination of the spectral index of ergodicity of a birth-and-death process
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Eigenvalues, Inequalities, and Ergodic Theory
- Essential spectral radius for Markov semigroups. I: Discrete time case
- Estimation of spectral gap for Markov chains
- Evaluation of the decay parameter for some specialized birth-death processes
- Examples for the Theory of Strong Stationary Duality with Countable State Spaces
- Exponential \(L_ 2\) convergence of attractive reversible nearest particle systems
- ExponentialL 2-convergence andL 2-spectral gap for Markov processes
- Geometric bounds for eigenvalues of Markov chains
- Geometric renewal convergence rates from hazard rates
- Impact of Routeing on Correlation Strength in Stationary Queueing Network Processes
- Intertwining and commutation relations for birth-death processes
- Lyapounov Functions for Jackson Networks
- Markov chains and stochastic stability
- On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network
- On exponential ergodicity and spectral structure for birth-death processes. I
- On hitting times and fastest strong stationary times for skip-free and more general chains
- On the spectra of some linear operators associated with queueing systems
- On the spectrum of Markov semigroups via sample path large deviations
- On times to quasi-stationarity for birth and death processes
- Rates of convergence of stochastically monotone and continuous time Markov models
- Renewal convergence rates for DHR and NWU lifetimes
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Series Jackson networks and noncrossing probabilities
- Spectral gap and convex concentration inequalities for birth-death processes
- Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process
- Speed of stability for birth-death processes
- Stochastic monotonicity and queueing applications of birth-death processes
- Stochastic product form networks with unreliable nodes: analysis of performance and availability.
- Strong stationary duality for Möbius monotone Markov chains
- Strong stationary duality for continuous-time Markov chains. I: Theory
- Strong stationary times via a new form of duality
- The relaxation time of two queueing systems in series
- The λ-classification of continuous-time birth-and-death processes
- Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases
- Time to Stationarity for a Continuous-Time Markov Chain
Cited in
(6)- On exponential convergence of dynamic queueing network and its applications
- Spectral gap for open Jackson networks
- Rate of convergence to stationary distribution for unreliable Jackson-type queueing network with dynamic routing
- Analysis of unreliable open queueing network with dynamic routing
- Dynamics of finite inhomogeneous particle systems with exclusion interaction
- Correlation formulas for Markovian network processes in a random environment
This page was built for publication: Computable bounds on the spectral gap for unreliable Jackson networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262447)
