The rate of convergence to stationarity for M/G/1 models with admission controls via coupling
From MaRDI portal
Publication:2803406
Abstract: We study the workload processes of two restricted M/G/1 queueing systems: in Model 1 any service requirement that would exceed a certain capacity threshold is truncated; in Model 2 new arrivals do not enter the system if they have to wait more than a fixed threshold time in line. For Model 1 we obtain several results concerning the rate of convergence to equilibrium. In particular we derive uniform bounds for geometric ergodicity with respect to certain subclasses. However, we prove that for the class of all Model 1 workload processes there is no uniform bound. For Model 2 we prove that geometric ergodicity follows from the finiteness of the moment-generating function of the service time distribution and derive bounds for the convergence rates in special cases. The proofs use the coupling method.
Recommendations
- Several types of convergence rates of the \(M/G/1\) queueing system
- Convergence rates in matrix analytic models
- Explicit convergence rates of the embedded \(\mathrm{M}/\mathrm{G}/1\) queue
- Rate of convergence to ergodic distribution for queue length in systems of the type M θ/G/1/N
- Convergence Rate Estimates for Some Models of Queuing Theory, and Their Applications
Cites work
- scientific article; zbMATH DE number 52512 (Why is no real title available?)
- A duality approach to queues with service restrictions and storage systems with state-dependent rates
- Computable exponential convergence rates for stochastically ordered Markov processes
- Conditions for exponential ergodicity and bounds for the decay parameter of a birth-death process
- Exponential and strong ergodicity for Markov processes with an application to queues
- ExponentialL 2-convergence andL 2-spectral gap for Markov processes
- General Irreducible Markov Chains and Non-Negative Operators
- Geometric Convergence Rates for Stochastically Ordered Markov Chains
- Level crossing methods in stochastic models
- Many server queueing processes with Poisson input and exponential service times
- Markov chains and stochastic stability
- Note—A Single Server Queue with Constant Service Time and Restricted Accessibility
- On the convergence to stationarity of the many-server Poisson queue
- On the rate of convergence to stationarity of the M/M/\(n\) queue in the Halfin-Whitt regime
- On the speed of convergence to stationarity of the Erlang loss system
- On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn times
- Rates of convergence of stochastically monotone and continuous time Markov models
- Single server queues with restricted accessibility
- Single-server queueing systems with uniformly limited queueing time
- Strong ergodicity for Markov processes by coupling methods
- Subgeometric rates of convergence for a class of continuous-time Markov process
- The Markovian Queue with Bounded Waiting time
- The coupling of regenerative processes
- The queue GI/G/1: Finite moments of the cycle variables and uniform rates of convergence
- TheM/G/1 Queue with Quasi-Restricted Accessibility
This page was built for publication: The rate of convergence to stationarity for \(\mathrm{M}/\mathrm{G}/1\) models with admission controls via coupling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803406)