On exponential ergodicity of multiclass queueing networks
From MaRDI portal
(Redirected from Publication:975794)
Abstract: One of the key performance measures in queueing systems is the exponential decay rate of the steady-state tail probabilities of the queue lengths. It is known that if a corresponding fluid model is stable and the stochastic primitives have finite moments, then the queue lengths also have finite moments, so that the tail probability pr(cdot >s) decays faster than s^{-n} for any n. It is natural to conjecture that the decay rate is in fact exponential. In this paper an example is constructed to demonstrate that this conjecture is false. For a specific stationary policy applied to a network with exponentially distributed interarrival and service times it is shown that the corresponding fluid limit model is stable, but the tail probability for the buffer length decays slower than s^{-log s}.
Recommendations
- Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Stability and convergence of moments for multiclass queueing networks via fluid limit models
- Stability of acyclic multiclass queueing networks
- Several types of convergence rates of the \(GI/G/1\) queueing system
Cites work
- scientific article; zbMATH DE number 1190409 (Why is no real title available?)
- scientific article; zbMATH DE number 54039 (Why is no real title available?)
- scientific article; zbMATH DE number 847278 (Why is no real title available?)
- Big queues.
- Control Techniques for Complex Networks
- Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies
- Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems
- Ergodicity of stochastic processes describing the operation of open queueing networks
- Exponential and uniform ergodicity of Markov processes
- Large deviations and overflow probabilities for the general single-server queue, with applications
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Markov chains and stochastic stability
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Practical drift conditions for subgeometric rates of convergence.
- Sequencing and routing in multiclass queueing networks. I: Feedback regulation
- Stability and convergence of moments for multiclass queueing networks via fluid limit models
- Subgeometric Rates of Convergence of f-Ergodic Markov Chains
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
- Workload models for stochastic networks: value functions and performance evaluation
Cited in
(8)- Exponential upper bounds via martingales for multiplexers with Markovian arrivals
- The ODE method for stability of skip-free Markov chains with applications to MCMC
- \(V\)-uniform ergodicity for state-dependent single class queueing networks
- Short run dynamics of multi-class queues
- Queueing systems fed by many exponential on-off sources: an infinite-intersection approach
- Stability and busy periods in a multiclass queue with state-dependent arrival rates
- Some Equivalence Results for Load-Independent Exponential Queueing Networks
- CONJECTURES ON DECAY RATES OF TAIL PROBABILITIES IN GENERALIZED JACKSON AND BATCH MOVEMENT NETWORKS
This page was built for publication: On exponential ergodicity of multiclass queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975794)
