M/D/c queue

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In queueing theory, a discipline within the mathematical theory of probability, an M/D/c queue represents the queue length in a system having c servers, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation. Agner Krarup Erlang first published on this model in 19091, starting the subject of queueing theory. The model is an extension of the M/D/1 queue which has only a single server.

In queueing theory, a discipline within the mathematical theory of probability, an M/D/c queue represents the queue length in a system having c servers, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation. Agner Krarup Erlang first published on this model in 1909, starting the subject of queueing theory. The model is an extension of the M/D/1 queue which has only a single server.

Model definition

An M/D/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 are deterministic time D (serving at rate μ = 1/D). c servers serve customers from the front of the queue, according to a first-come, first-served discipline. When the service is complete the customer leaves the queue and the number of customers in the system reduces by one. The buffer is of infinite size, so there is no limit on the number of customers it can contain.

Waiting time distribution

Erlang showed that when ρ = (λ D)/c  F(y) = \int_0^\infty F(x+y-D)\frac{\lambda^c x^{c-1}}{(c-1)!} e^{-\lambda x} \text{d} x, \quad y \geq 0 \quad c \in \mathbb N. Crommelin showed that, writing P n for the stationary probability of a system with n or fewer customers, \mathbb P(W \leq x) = \sum_{n=0}^{c-1} P_n \sum_{k=1}^m \frac{(-\lambda(x-kD))^{(k+1)c-1-n}}{((K+1)c-1-n)!}e^{\lambda(x-kD)}, \quad mD \leq x

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1336628432 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia publication date (×1) · confidence 0.95 https://en.wikipedia.org/w/index.php?oldid=1336628432

Provenance

snapshot enwiki-001336628432 · captured 1770236566.0 · version history

Cite this page as: encyclopegia.org, “M/D/c queue”, snapshot enwiki-001336628432. https://encyclopegia.org/a/m-d-c-queue

Sources cited in this revision

Extracted from the cited revision's reference blocks; absent citations are not invented.