M/D/c queue: Difference between revisions

Revision as of 13:04, 14 June 2013

Revision as of 13:51, 14 June 2013

Line 1:

In [[queueing theory]], a discipline within the mathematical [[probability theory|theory of probability]], an '''M/D/c queue''' represents the queue length in a system having ''c'' servers, where arrivals are determined by a [[Poisson process]] and job service times are fixed (deterministic). The model name is written in [[Kendall's notation]].<ref>{{cite doi|10.1214/aoms/1177728975}}</ref> [[Agner Krarup Erlang]] first published on this model in 1909, starting the subject of [[queueing theory]].<ref>{{cite doi|10.1007/s11134-009-9147-4}}</ref><ref>{{cite journal | title = The theory of probabilities and telephone conversations | journal = Nyt Tidsskrift for Matematik B | volume = 20 | pages = 33–39 | urlarchiveurl = http://web.archive.org/web/20120207184053/http://oldwww.com.dtu.dk/teletraffic/erlangbook/pps131-137.pdf | year = 1909}}</ref> The model is an extension of the [[M/D/1 queue]] which has only a single server.

==Model definition==