Poisson queues with Markov modulated service rates
Summary: In this paper we investigate an \(M/MM/1\) queueing system that makes transitions between two service rates `S (slow) and F (fast)' only at service completion epochs. Switching between these `S and F' states occurs according to an embedded Markov chain rule. Both inter arrival times and service times follow exponential distributions. We also discuss an extension for an \(M/MM/1/(0, N] \cup (N, \infty )\) system. Under steady state conditions, the stationary probability distribution for the system size is obtained by spectral expansion method. To exemplify the tractability of the dynamics of the switching probabilities on the offered work load and the mean waiting time, we provide numerical illustrations.
- \(\mathrm{M}/\mathrm{M}/1\) queue in two alternating environments and its heavy traffic approximation
- Single-server queues with Markov-modulated arrivals and service speed
- Markov processes with constant transition rates of size one \& two
- On queues with Markov modulated service rates
- On the Tail of the Waiting Time in a Markov-Modulated M/G/1 Queue
- Transient analysis of multi-server queues with Markov-modulated Poisson arrivals and overload control
- scientific article; zbMATH DE number 665416 (Why is no real title available?)
- Dynamic service rate control for a single-server queue with Markov-modulated arrivals
- Poisson functionals of Markov processes and queueing networks
- Markovian queueing system with self regulatory servers
- Markovian queues with Poisson control
- Martingale relations for the M/GI/1 queue with Markov modulated Poisson input
This page was built for publication: Poisson queues with Markov modulated service rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664709)
