Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
M/M/c queue
open-in-new
<p>In <a href="/facts/Queueing_theory/8NDl56EM">queueing theory</a>, a discipline within the <a href="/facts/Maths/pxTouaz4">mathematical</a> <a href="/facts/Probability_theory/mFBn51rE">theory of probability</a>, the M/M/c queue (or Erlang–C model: 495 ) is a multi-server <a href="/facts/Queueing_model/8NDl56EM">queueing model</a>. In <a href="/facts/Kendall%2527s_notation/zz5PJ7vs">Kendall's notation</a> it describes a system where arrivals form a single queue and are governed by a <a href="/facts/Poisson_process/8uphjAUc">Poisson process</a>, there are c servers, and job service times are exponentially distributed. It is a generalisation of the <a href="/facts/M%2fM%2f1_queue/eTkKX6Ro">M/M/1 queue</a> which considers only a single server. The model with infinitely many servers is the <a href="/facts/M%2fM%2f%25E2%2588%259E_queue/H2DUETwd">M/M/∞ queue</a>. </p>