M/D/1 queue
In queueing theory, a discipline within the mathematical theory of probability, an M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times are…
≈ 13 min read
M/D/1 queue. encyclopegia.org, snapshot enwiki-001359423469. /a/m-d-1-queue
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/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation.[1] Agner Krarup Erlang first published on this model in 1909, starting the subject of queueing theory.[2][3] An extension of this model with more than one server is the M/D/c queue.
Model definition
edit edit sourceAn M/D/1 queue is a stochastic process whose state space is the set {0,1,2,3,...} where the value corresponds to the number of entities 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).
- A single server serves entities one at a time from the front of the queue, according to a first-come, first-served discipline. When the service is complete the entity leaves the queue and the number of entities in the system reduces by one.
- The buffer is of infinite size, so there is no limit on the number of entities it can contain.
Transition Matrix
edit edit sourceThe transition probability matrix for an M/D/1 queue with arrival rate λ and service time 1, such that λ <1 (for stability of the queue) is given by P as below:[4]
P=(a0a1a2a3...a0a1a2a3...0a0a1a2...00a0a1..................) , an=λnn!e−λ, n = 0,1,....
Classic performance metrics
edit edit sourceThe following expressions present the classic performance metrics of a single server queuing system such as M/D/1, with:
- arrival rate =λ,
- service rate =μ, and
- utilization =ρ=λμ
The average number of entities in the system, L is given by:
L=ρ+12(ρ21−ρ);
The average number of entities in the queue (line), LQ is given by:
LQ=12(ρ21−ρ);
The average waiting time in the system, W is given by:
W=1μ+ρ2μ(1−ρ);
The average waiting time in the queue (line), WQ is given by:
WQ=ρ2μ(1−ρ)
Example
edit edit sourceConsidering a system that has only one server, with an arrival rate of 20 entities per hour and the service rate is at a constant of 30 per hour.
So the utilization of the server is: ρ=20/30=2/3. Using the metrics shown above, the results are as following: 1) Average number in line LQ= 0.6667; 2) Average number in system L =1.333; 3) Average time in line ωQ = 0.033 hour; 4) Average time in system ω = 0.067 hour.
Relations for Mean Waiting Time in M/M/1 and M/D/1 queues
edit edit sourceFor an equilibrium M/G/1 queue, the expected value of the time W spent by a customer in the queue are given by Pollaczek-Khintchine formula as below:[5]
E(W)=ρτ2(1−ρ)(1+σ2τ2)
where τ is the mean service time; σ2 is the variance of service time; and ρ=λτ < 1, λ being the arrival rate of the customers.
For M/M/1 queue, the service times are exponentially distributed, then σ2 = τ2 and the mean waiting time in the queue denoted by WM is given by the following equation:[5]
WM=ρτ1−ρ
Using this, the corresponding equation for M/D/1 queue can be derived, assuming constant service times. Then the variance of service time becomes zero, i.e. σ2 = 0. The mean waiting time in the M/D/1 queue denoted as WD is given by the following equation:[5]
WD=ρτ2(1−ρ)
From the two equations above, we can infer that Mean queue length in M/M/1 queue is twice that in M/D/1 queue.
Stationary distribution
edit edit sourceThe number of jobs in the queue can be written as M/G/1 type Markov chain and the stationary distribution found for state i (written πi) in the case D = 1 to be[4]
- π0=1−λπ1=(1−λ)(eλ−1)πn=(1−λ)(enλ+∑k=1n−1ekλ(−1)n−k[(kλ)n−k(n−k)!+(kλ)n−k−1(n−k−1)!])(n≥2).
Delay
edit edit sourceDefine ρ = λ/μ as the utilization; then the mean delay in the system in M/D/1 queue is[6]
- 12μ⋅2−ρ1−ρ
and in the queue:
- 12μ⋅ρ1−ρ.
The distribution function of the waiting time WQ is defined as P{WQ≤t} for t≥0. A numerically stable algorithm is described in[7]. First, denote the Poisson distribution with parameter ρ as
P(k,ρ)=ρkk!e−ρ.
We can write
t=(K+τ)D
where K is the largest integer such that KD≤t and 0<τ<1 is the remaining fraction of a service time.
In the case where τ=0, i.e., where t is an integer number of service times, we have
P{WQ≤t}=∑k=0Kπk.
If τ>0, we have
P{WQ≤t}=e2ρτ∑k=0K{πk∑j=0K−j(−1)jP(j,ρτ)}.
Busy period
edit edit sourceThe busy period is the time period measured from the instant a first customer arrives at an empty queue to the time when the queue is again empty. This time period is equal to D times the number of customers served. If ρ < 1, then the number of customers served during a busy period of the queue has a Borel distribution with parameter ρ.[8][9]
Finite capacity
edit edit sourceStationary distribution
edit edit sourceA stationary distribution for the number of customers in the queue and mean queue length can be computed using probability generating functions.[10]
Transient solution
edit edit sourceThe transient solution of an M/D/1 queue of finite capacity N, often written M/D/1/N, was published by Garcia et al. in 2002.[11]
Application
edit edit sourceIncludes applications in wide area network design,[12] where a single central processor to read the headers of the packets arriving in exponential fashion, then computes the next adapter to which each packet should go and dispatch the packets accordingly. Here the service time is the processing of the packet header and cyclic redundancy check, which are independent of the length of each arriving packets. Hence, it can be modeled as a M/D/1 queue.[13]
References
edit edit source- ^ 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. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Kingman, J. F. C. (2009). "The first Erlang century—and the next". Queueing Systems. 63: 3–4. doi:10.1007/s11134-009-9147-4. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Erlang, A. K. (1909). "The theory of probabilities and telephone conversations" (PDF). Nyt Tidsskrift for Matematik B. 20: 33–39. Archived from the original (PDF) on October 1, 2011. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ a b Nakagawa, Kenji (2005). "On the Series Expansion for the Stationary Probabilities of an M/D/1 queue" (PDF). Journal of the Operations Research Society of Japan. 48 (2): 111–122. doi:10.15807/jorsj.48.111. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ a b c Cooper, Robert B. (1981). Introduction to Queuing Theory. Elsevier Science Publishing Co. p. 189. ISBN 0-444-00379-7. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Cahn, Robert S. (1998). Wide Area Network Design:Concepts and Tools for Optimization. Morgan Kaufmann. p. 319. ISBN 1558604588. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Iversen, V.B.; Staalhagen, L. (1999-12-09). "Waiting time distribution in M/D/1 queueing systems". Electronics Letters. 35 (25): 2184–2185. doi:10.1049/el:19991500. ISSN 0013-5194. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Tanner, J. C. (1961). "A derivation of the Borel distribution". Biometrika. 48: 222–224. doi:10.1093/biomet/48.1-2.222. JSTOR 2333154. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Haight, F. A.; Breuer, M. A. (1960). "The Borel-Tanner distribution". Biometrika. 47: 143. doi:10.1093/biomet/47.1-2.143. JSTOR 2332966. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Brun, Olivier; Garcia, Jean-Marie (2000). "Analytical Solution of Finite Capacity M/D/1 Queues". Journal of Applied Probability. 37 (4). Applied Probability Trust: 1092–1098. doi:10.1239/jap/1014843086. JSTOR 3215497. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Garcia, Jean-Marie; Brun, Olivier; Gauchard, David (2002). "Transient Analytical Solution of M/D/1/N Queues". Journal of Applied Probability. 39 (4). Applied Probability Trust: 853–864. doi:10.1239/jap/1037816024. JSTOR 3216008. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Kotobi, Khashayar; Bilén, Sven G. (2017). "Spectrum sharing via hybrid cognitive players evaluated by an M/D/1 queuing model". EURASIP Journal on Wireless Communications and Networking. 2017: 85. doi:10.1186/s13638-017-0871-x. Retrieved 2017-05-05. Wikipedia revision 1359423469, retrieved 2026-11-22
- ^ Chan, Robert S. (1998). Wide Area Network Design: Concepts and Tools for optimization. Morgan Kaufmann Publishers Inc. p. 319. ISBN 1-55860-458-8. Wikipedia revision 1359423469, retrieved 2026-11-22
- Additive process
- Airy process
- Bessel process
- Birth–death process
- Brownian motion
- Cauchy process
- Contact process
- Continuous-time random walk
- Cox process
- Diffusion process
- Empirical process
- Feller process
- Fleming–Viot process
- Gamma process
- Geometric process
- Hawkes 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
- Quasimartingale
- Schramm–Loewner evolution
- Semimartingale
- Sigma-martingale
- Stable process
- Superprocess
- Telegraph process
- Variance gamma process
- Wiener process
- Wiener sausage
- Binomial options pricing model
- Black–Derman–Toy
- Black–Karasinski
- Black–Scholes
- Chan–Karolyi–Longstaff–Sanders (CKLS)
- Chen
- Constant elasticity of variance (CEV)
- Cox–Ingersoll–Ross (CIR)
- Garman–Kohlhagen
- Heath–Jarrow–Morton (HJM)
- Heston
- Ho–Lee
- Hull–White
- Korn-Kreer-Lenssen
- LIBOR market
- Rendleman–Bartter
- SABR volatility
- Vašíček
- Wilkie
- 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
- Zero–one laws (Blumenthal, Borel–Cantelli, Engelbert–Schmidt, Hewitt–Savage, Kolmogorov, Lévy)
- Cameron–Martin theorem
- 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
- Kosambi–Karhunen–Loève 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
- Stopping time/Hitting time
- Stratonovich integral
- Uniform integrability
- Usual hypotheses
- Wiener space
- Actuarial mathematics
- Control theory
- Econometrics
- Ergodic theory
- Extreme value theory (EVT)
- Large deviations theory
- Mathematical finance
- Mathematical statistics
- Probability theory
- Queueing theory
- Renewal theory
- Ruin theory
- Signal processing
- Statistics
- Stochastic analysis
- Time series analysis
- Machine learning
Text derived from https://en.wikipedia.org/w/index.php?oldid=1359423469 under CC BY-SA 4.0; modifications have been made.
References
- ↩Wikipedia “M/D/1 queue” publication date (×1) · confidence 0.95 revision URL