Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
M/D/1 queue
open-in-new
<p>In <a href="/facts/Queueing_theory/8NDl56EM">queueing theory</a>, a discipline within the mathematical <a href="/facts/Probability_theory/mFBn51rE">theory of probability</a>, an M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined by a <a href="/facts/Poisson_process/8uphjAUc">Poisson process</a> and job service times are fixed (deterministic). The model name is written in <a href="/facts/Kendall%27s_notation/zz5PJ7vs">Kendall's notation</a>. <a href="/facts/Agner_Krarup_Erlang/WswurAKU">Agner Krarup Erlang</a> first published on this model in 1909, starting the subject of <a href="/facts/Queueing_theory/8NDl56EM">queueing theory</a>. An extension of this model with more than one server is the <a href="/facts/M/D/c_queue/Wh4eYyhV">M/D/c queue</a>. </p>