Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
M/M/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/M/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 have an <a href="/facts/Exponential_distribution/yY3EdV0u">exponential distribution</a>. The model name is written in <a href="/facts/Kendall%27s_notation/zz5PJ7vs">Kendall's notation</a>. The model is the most elementary of queueing models and an attractive object of study as <a href="/facts/Closed-form_expression/y0xCXlSk">closed-form expressions</a> can be obtained for many metrics of interest in this model. An extension of this model with more than one server is the <a href="/facts/M/M/c_queue/MXB6lmQ1">M/M/c queue</a>. </p>