Convergence rates in monotone separable stochastic networks
From MaRDI portal
Publication:2494541
DOI10.1007/s11134-006-4261-zzbMath1142.60400OpenAlexW2080424506MaRDI QIDQ2494541
Sergeĭ Georgievich Foss, Artëm Sapozhnikov
Publication date: 28 June 2006
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-006-4261-z
MomentsMultiserver queueCouplingConvergence ratesGeneralized Jackson networkHarris ergodic Markov chainMonotone separable networkRenovating events
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- The queue GI/G/1: Finite moments of the cycle variables and uniform rates of convergence
- Ergodicity of Jackson-type queueing networks
- Polynomial convergence rates of Markov chains
- Moments and tails in monotone-separable stochastic networks.
- Practical drift conditions for subgeometric rates of convergence.
- Exponential and uniform ergodicity of Markov processes
- Computable exponential convergence rates for stochastically ordered Markov processes
- Convergence rates for M/G/1 queues and ruin problems with heavy tails
- The queue GI/GI/k: finite moments of the cycle variables and uniform rates of convergence
- A New Approach to the Limit Theory of Recurrent Markov Chains
- Some Estimates of the Rate of Convergence in Stability Theorems
- Stochastic monotonicity in general queueing networks
- Lyapounov Functions for Jackson Networks
- Subgeometric Rates of Convergence of f-Ergodic Markov Chains
- Limit Theorems for Queueing Networks. I
- On the saturation rule for the stability of queues
- Stability and convergence of moments for multiclass queueing networks via fluid limit models
- Stochastic Monotonicities in Jackson Queueing Networks
- On the Existence of Moments for the Busy Period in a Single-Server Queue