D/M/1 queue

In queueing theory, a discipline within the mathematical theory of probability, a D/M/1 queue represents the queue length in a system having a single server, where arrivals occur at fixed regular intervals and job service requirements are…

Uses your system voice; voice and rate in settings.

≈ 2 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

  • EnglishD/M/1 queue
  • EnglishD/M/1 queue
  • EnglishD/M/1 queue
  • cacua D/M/1

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, a D/M/1 queue represents the queue length in a system having a single server, where arrivals occur at fixed regular intervals and job service requirements are random with an exponential distribution. The model name is written in Kendall's notation.

Agner Krarup Erlang first published a solution to the stationary distribution of a D/M/1 and D/M/k queue, the model with k servers, in 19171 and 1920.

Model definition

A D/M/1 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 deterministically at fixed times β apart. Service times are exponentially distributed (with rate parameter μ).

A single server serves customers one at a time 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.

Stationary distribution

When μβ > 1, the queue has stationary distribution \pi_i=\begin{cases} 0 & \text{ when } i=0\\ (1-\delta)\delta^{i-1} &\text{ when } i>0 \end{cases} where δ is the root of the equation δ = e -μβ(1 – δ) with smallest absolute value.

Idle times

The mean stationary idle time of the queue (period with 0 customers) is β – 1/μ, with variance (1 + δ − 2μβδ)/μ 2 (1 – δ).

Waiting times

The mean stationary waiting time of arriving jobs is (1/μ) δ/(1 – δ).

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

Words in each sectionModel definitionModel definitionModel definition: 112 words112Stationary distributionStationary distributionStationary distribution: 44 words44Waiting timesWaiting timesWaiting times: 32 words32Idle timesIdle timesIdle times: 20 words20
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

References

  1. ↩Wikipedia “D/M/1 queue” revision 1190905610 · retrieved 2026-10-20 publication date (×1) · confidence 0.95 revision URL

Provenance

snapshot enwiki-001190905610 · captured 2023-12-20 · ledger · version history

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