In queueing theory, a discipline within the mathematical theory of probability, an M/M/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 have an exponential distribution. The model name is written in Kendall's notation. The model is the most elementary of queueing models and an attractive object of study as closed-form expressions can be obtained for many metrics of interest in this model. An extension of this model with more than one server is the M/M/c queue.
CITATION STYLE
Lipsky, L. (2009). M/M/1 Queue. In Queueing Theory (pp. 33–75). Springer New York. https://doi.org/10.1007/978-0-387-49706-8_2
Mendeley helps you to discover research relevant for your work.