M/M/c queue

In queueing theory, a discipline within the mathematical theory of probability, the M/M/c queue (or Erlang–C model^[1]^:495) is a multi-server queueing model.^[2] In Kendall's notation it describes a system where arrivals form a single queue and are governed by a Poisson process, there are c servers and job service times are exponentially distributed.^[3] It is a generalisation of the M/M/1 queue which considers only a single server. The model with infinitely many servers is the M/M/∞ queue.

Model definition

An M/M/c queue is a stochastic process whose state space is the set {0, 1, 2, 3, ...} where the value corresponds to the number of customers in the system, including any currently in service.

Arrivals occur at rate λ according to a Poisson process and move the process from state i to i+1.
Service times have an exponential distribution with parameter μ in the M/M/c queue.
There are c servers, which serve from the front of the queue. If there are less than c jobs, some of the servers will be idle. If there are more than c jobs, the jobs queue in a buffer.
The buffer is of infinite size, so there is no limit on the number of customers it can contain.

The model can be described as a continuous time Markov chain with transition rate matrix

Q={\begin{pmatrix}-\lambda &\lambda \\\mu &-(\mu +\lambda )&\lambda \\&2\mu &-(2\mu +\lambda )&\lambda \\&&3\mu &-(3\mu +\lambda )&\lambda \\&&&&\ddots \\&&&&c\mu &-(c\mu +\lambda )&\lambda \\&&&&&c\mu &-(c\mu +\lambda )&\lambda \\&&&&&&c\mu &-(c\mu +\lambda )&\lambda \\&&&&&&&\ddots \\\end{pmatrix}}

on the state space {0, 1, 2, 3, ...}. The model is a type of birth–death process. We write ρ = λ/(c μ) for the server utilization and require ρ < 1 for the queue to be stable. ρ represents the average proportion of time which each of the servers is occupied (assuming jobs finding more than one vacant server choose their servers randomly).

The state space diagram for this chain is as below.

Stationary analysis

Number of customers in the system

If the traffic intensity is greater than one then the queue will grow without bound but if server utilization $\rho ={\frac {\lambda }{c\mu }}<1$ then the system has a stationary distribution with probability mass function^[4]^[5]

\pi _{0}=\left[(\sum _{k=0}^{c-1}{\frac {(c\rho )^{k}}{k!}})+{\frac {(c\rho )^{c}}{c!}}{\frac {1}{1-\rho }}\right]^{-1}

\pi _{k}={\begin{cases}\pi _{0}{\dfrac {(c\rho )^{k}}{k!}},&{\mbox{if }}0<k<c\\[10pt]\pi _{0}{\dfrac {\rho ^{k}c^{c}}{c!}},&{\mbox{if }}c\leq k\end{cases}}

where π_k is the probability that the system contains k customers.

The probability that an arriving customer is forced to join the queue (all servers are occupied) is given by

{\text{ C}}(c,\lambda /\mu )={\frac {\left({\frac {(c\rho )^{c}}{c!}}\right)\left({\frac {1}{1-\rho }}\right)}{\sum _{k=0}^{c-1}{\frac {(c\rho )^{k}}{k!}}+\left({\frac {(c\rho )^{c}}{c!}}\right)\left({\frac {1}{1-\rho }}\right)}}={\frac {1}{1+\left(1-\rho \right)\left({\frac {c!}{(c\rho )^{c}}}\right)\sum _{k=0}^{c-1}{\frac {(c\rho )^{k}}{k!}}}}

which is referred to as Erlang's C formula and is often denoted C(c, λ/μ) or E_2,c(λ/μ).^[4] The average number of customers in the system (in service and in the queue) is given by^[6]

{\frac {\rho }{1-\rho }}{\text{ C}}(c,\lambda /\mu )+c\rho .

Busy period of server

The busy period of the M/M/c queue can either refer to

full busy period: the time period between an arrival which finds c−1 customers in the system until a departure which leaves the system with c−1 customers
partial busy period: the time period between an arrival which finds the system empty until a departure which leaves the system again empty.^[7]

Write^[8]^[9] T_k = min( t: k jobs in the system at time 0⁺ and k − 1 jobs in the system at time t) and η_k(s) for the Laplace–Stieltjes transform of the distribution of T_k. Then^[8]

For k > c, T_k has the same distribution as T_c.
For k = c,

\eta _{c}(s)={\frac {c\mu }{k\mu +s+\lambda -\lambda \eta _{{c}}(s)}}.

For k < c,

\eta _{k}(s)={\frac {k\mu }{k\mu +s+\lambda -\lambda \eta _{{k+1}}(s)}}.

Response time

The response time is the total amount of time a customer spends in both the queue and in service. The average response time is the same for all work conserving service disciplines and is^[6]

{\frac {{\text{ C}}(c,\lambda /\mu )}{c\mu -\lambda }}+{\frac {1}{\mu }}.

Customers in first-come, first-served discipline

The customer either experiences an immediate exponential service, or must wait for k customers to be served before their own service, thus experiencing an Erlang distribution with shape parameter k + 1.^[10]

Customers in processor sharing discipline

In a processor sharing queue the service capacity of the queue is split equally between the jobs in the queue. In the M/M/c queue this means that when there are c or fewer jobs in the system, each job is serviced at rate μ. However, when there are more than c jobs in the system the service rate of each job decreases and is ${\frac {c\mu }{n}}$ where n is the number of jobs in the system. This means that arrivals after a job of interest can impact the service time of the job of interest. The Laplace–Stieltjes transform of the response time distribution has been shown to be a solution to a Volterra integral equation from which moments can be computed.^[11] An approximation has been offered for the response time distribution.^[12]^[13]

Finite capacity

In an M/M/c/K queue (sometimes known as the Erlang–A model^[1]^:495) only K customers can queue at any one time (including those in service^[4]). Any further arrivals to the queue are considered "lost". We assume that K ≥ c. The model has transition rate matrix

Q={\begin{pmatrix}-\lambda &\lambda \\\mu &-(\mu +\lambda )&\lambda \\&2\mu &-(2\mu +\lambda )&\lambda \\&&3\mu &-(3\mu +\lambda )&\lambda \\&&&&\ddots \\&&&&c\mu &-(c\mu +\lambda )&\lambda \\&&&&&c\mu &-(c\mu +\lambda )&\lambda \\&&&&&&&\ddots \\&&&&&&&c\mu &-(c\mu )\\\end{pmatrix}}

on the state space {0, 1, 2, ..., c, ..., K}. In the case where c = K, the M/M/c/c queue is also known as the Erlang–B model.^[1]^:495

Transient analysis

See Takács for a transient solution^[14] and Stadje for busy period results.^[15]

Stationary analysis

Stationary probabilities are given by^[16]

\pi _{0}=\left[\sum _{k=0}^{c}{\frac {\lambda ^{k}}{\mu ^{k}k!}}+{\frac {\lambda ^{c}}{\mu ^{c}c!}}\sum _{k=c+1}^{K}{\frac {\lambda ^{k-c}}{\mu ^{k-c}c^{k-c}}}\right]^{-1}

\pi _{k}={\begin{cases}{\frac {(\lambda /\mu )^{k}}{k!}}\pi _{0}&{\text{for }}k=1,2,\ldots ,c\\{\frac {(\lambda /\mu )^{k}}{c^{{k-c}}c!}}\pi _{0}&{\text{for }}k=c+1,\ldots ,K.\end{cases}}

The average number of customers in the system is^[16]

{\frac {\lambda }{\mu }}+\pi _{0}{\frac {\rho (c\rho )^{c}}{(1-\rho )^{2}c!}}

and number of average response time for a customer^[16]

{\frac {1}{\mu }}+\pi _{0}{\frac {\rho (c\rho )^{c}}{\lambda (1-\rho )^{2}c!}}.

Heavy traffic limits

Writing X(t) for the number of customers in the system at time t, it can be shown that under three different conditions the process

{\hat X}_{n}(t)={\frac {X(nt)-{\mathbb E}(X(nt))}{{\sqrt {n}}}}

converges to a diffusion process.^[1]^:490

Fix μ and c, increase λ and scale by n = 1/(1 − ρ)².
Fix μ and ρ, increase λ and c, and scale by n = c.
Fix as a constant β where

\beta =(1-\rho ){\sqrt {s}}

and increase λ and c using the scale n = c or n = 1/(1 − ρ)². This case is called the Halfin–Whitt regime.^[17]

References

1 2 3 4 Gautam, Natarajan (2012). Analysis of Queues: Methods and Applications. CRC Press. ISBN 9781439806586.
↑ Harrison, Peter; Patel, Naresh M. (1992). Performance Modelling of Communication Networks and Computer Architectures. Addison–Wesley. p. 173.
↑ Kendall, D. G. (1953). "Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain". The Annals of Mathematical Statistics. 24 (3): 338. doi:10.1214/aoms/1177728975. JSTOR 2236285.
1 2 3 Kleinrock, Leonard (1975). Queueing Systems Volume 1: Theory. pp. 101–103, 404. ISBN 0471491101.
↑ Bolch, G.; Greiner, S.; de Meer, H.; Trivedi, K. S. (1998). "Single Station Queueing Systems". Queueing Networks and Markov Chains. pp. 209–262. doi:10.1002/0471200581.ch6. ISBN 0471193666.
1 2 Barbeau, Michel; Kranakis, Evangelos (2007). Principles of Ad-hoc Networking. John Wiley & Sons. p. 42. ISBN 0470032901.
↑ Artalejo, J. R.; Lopez-Herrero, M. J. (2001). "Analysis of the Busy Period for the M/M/c Queue: An Algorithmic Approach". Journal of Applied Probability. 38 (1): 209–222. JSTOR 3215752.
1 2 Omahen, K.; Marathe, V. (1978). "Analysis and Applications of the Delay Cycle for the M/M/c Queueing System". Journal of the ACM. 25 (2): 283. doi:10.1145/322063.322072.
↑ Daley, D. J.; Servi, L. D. (1998). "Idle and busy periods in stable M / M / k queues". Journal of Applied Probability. 35 (4): 950. doi:10.1239/jap/1032438390.
↑ Iversen, Villy B. (June 20, 2001). "ITU/ITC Teletraffic Engineering Handbook" (PDF). Retrieved August 7, 2012.
↑ Braband, J. (1994). "Waiting time distributions for M/M/N processor sharing queues". Communications in Statistics. Stochastic Models. 10 (3): 533–548. doi:10.1080/15326349408807309.
↑ Braband, J. (1995). "Waiting time distributions for closed M/M/N processor sharing queues". Queueing Systems. 19 (3): 331–344. doi:10.1007/BF01150417.
↑ Braband, Jens; Schassberger, Rolf (21–23 September 1993). B. Walke and O. Spaniol, ed. "Random Quantum Allocation: A New Approach to Waiting Time Distributions for M/M/N Processor Sharing Queues". Aachen: Springer: 130–142. ISBN 3540572015.
↑ Takács, L. (1962). Introduction to the Theory of Queues. London: Oxford University Press. pp. 12–21.
↑ Stadje, W. (1995). "The busy periods of some queueing systems". Stochastic Processes and their Applications. 55: 159–167. doi:10.1016/0304-4149(94)00032-O.
1 2 3 Allen, Arnold O. (1990). Probability, Statistics, and Queueing Theory: With Computer Science Applications. Gulf Professional Publishing. pp. 679–680. ISBN 0120510510.
↑ Halfin, Shlomo; Whitt, Ward (1981). "Heavy-Traffic Limits for Queues with Many Exponential Servers" (PDF). Operations Research. 29 (3): 567–588. doi:10.1287/opre.29.3.567. JSTOR 170115.

Queueing theory

Single queueing nodes	D/M/1 queue M/D/1 queue M/D/c queue M/M/1 queue Burke's theorem M/M/c queue M/M/∞ queue M/G/1 queue Pollaczek–Khinchine formula Matrix analytic method M/G/k queue G/M/1 queue G/G/1 queue Kingman's formula Lindley equation Fork–join queue Bulk queue

Arrival processes	Poisson process Markovian arrival process Rational arrival process

Queueing networks	Jackson network Traffic equations Gordon–Newell theorem Mean value analysis Buzen's algorithm Kelly network G-network BCMP network

Service policies	FIFO LIFO Processor sharing Round-robin Shortest job first Shortest remaining time

Key concepts	Continuous-time Markov chain Kendall's notation Little's law Product-form solution Balance equation Quasireversibility Flow-equivalent server method Arrival theorem Decomposition method Beneš method

Limit theorems	Fluid limit Mean field theory Heavy traffic approximation Reflected Brownian motion

Extensions	Fluid queue Layered queueing network Polling system Adversarial queueing network Loss network Retrial queue

Information systems	Data buffer Erlang (unit) Erlang distribution Flow control (data) Message queue Network congestion Network scheduler Pipeline (software) Quality of service Scheduling (computing) Teletraffic engineering

Category

Stochastic processes

Discrete time	Bernoulli process Branching process Chinese restaurant process Galton–Watson process Independent and identically distributed random variables Markov chain Moran process Random walk Loop-erased Self-avoiding

Continuous time	Bessel process Birth–death process Brownian motion Bridge Excursion Fractional Geometric Meander Cauchy process Contact process Continuous-time random walk Cox process Diffusion process Empirical process Feller process Fleming–Viot process Gamma process Hunt process Interacting particle systems Itô diffusion Itô process Jump diffusion Jump process Lévy process Local time Markov additive process McKean–Vlasov process Ornstein–Uhlenbeck process Poisson process Compound Non-homogeneous Point process Schramm–Loewner evolution Semimartingale Sigma-martingale Stable process Superprocess Telegraph process Variance gamma process Wiener process Wiener sausage

Both	Branching process Galves–Löcherbach model Gaussian process Hidden Markov model (HMM) Markov process Martingale Differences Local Sub- Super- Random dynamical system Regenerative process Renewal process Stochastic chains with memory of variable length White noise

Fields and other	Dirichlet process Gaussian random field Gibbs measure Hopfield model Ising model Potts model Boolean network Markov random field Percolation Pitman–Yor process Point process Cox Poisson Random field Random graph

Time series models	Autoregressive conditional heteroskedasticity (ARCH) model Autoregressive integrated moving average (ARIMA) model Autoregressive (AR) model Autoregressive–moving-average (ARMA) model Generalized autoregressive conditional heteroskedasticity (GARCH) model Moving-average (MA) model

Financial models	Black–Derman–Toy Black–Karasinski Black–Scholes Chen Constant elasticity of variance (CEV) Cox–Ingersoll–Ross (CIR) Garman–Kohlhagen Heath–Jarrow–Morton (HJM) Heston Ho–Lee Hull–White LIBOR market Rendleman–Bartter SABR volatility Vašíček Wilkie

Actuarial models	Bühlmann Cramér–Lundberg Risk process Sparre–Anderson

Queueing models	Bulk Fluid Generalized queueing network M/G/1 M/M/1 M/M/c

Properties	Càdlàg paths Continuous Continuous paths Ergodic Exchangeable Feller-continuous Gauss–Markov Markov Mixing Piecewise deterministic Predictable Progressively measurable Self-similar Stationary Time-reversible

Limit theorems	Central limit theorem Donsker's theorem Doob's martingale convergence theorems Ergodic theorem Fisher–Tippett–Gnedenko theorem Large deviation principle Law of large numbers (weak/strong) Law of the iterated logarithm Maximal ergodic theorem Sanov's theorem

Inequalities	Burkholder–Davis–Gundy Doob's martingale Kunita–Watanabe

Tools	Cameron–Martin formula Convergence of random variables Doléans-Dade exponential Doob decomposition theorem Doob–Meyer decomposition theorem Doob's optional stopping theorem Dynkin's formula Feynman–Kac formula Filtration Girsanov theorem Infinitesimal generator Itô integral Itô's lemma Kolmogorov continuity theorem Kolmogorov extension theorem Lévy–Prokhorov metric Malliavin calculus Martingale representation theorem Optional stopping theorem Prokhorov's theorem Quadratic variation Reflection principle Skorokhod integral Skorokhod's representation theorem Skorokhod space Snell envelope Stochastic differential equation Tanaka Stopping time Stratonovich integral Uniform integrability Usual hypotheses Wiener space Classical Abstract

Disciplines	Actuarial mathematics Econometrics Ergodic theory Extreme value theory (EVT) Large deviations theory Mathematical finance Mathematical statistics Probability theory Queueing theory Renewal theory Ruin theory Statistics Stochastic analysis Time series analysis Machine learning

List of topics Category

This article is issued from Wikipedia - version of the 11/5/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.

M/M/c queue

Model definition

Stationary analysis

Number of customers in the system

Busy period of server

Response time

Customers in first-come, first-served discipline

Customers in processor sharing discipline

Finite capacity

Transient analysis

Stationary analysis

Heavy traffic limits

See also

References