Сравнение на методи

	M/M/1 опашка: Основният модел на опашка с един обслужващ канал	Модел на Ерланг C	Закон на Литъл (L = λW)
Област	Изследване на операциите	Изследване на операциите	Изследване на операциите
Семейство	Regression model	Regression model	Regression model
Година на възникване	1953	1981	1961
Създател	A. K. Erlang; David Kendall (notation)	Agner Krarup Erlang; Cooper	John D. C. Little
Тип	Stochastic queueing model	Steady-state queueing model	Exact queueing identity
Основополагащ източник	Kendall, D. G. (1953). Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. The Annals of Mathematical Statistics, 24(3), 338–354.	Cooper, R. B. (1981). Introduction to Queueing Theory (2nd ed.). North-Holland. ISBN: 978-0-444-00379-7	Little, J. D. C. (1961). A proof for the queuing formula: L = λW. Operations Research, 9(3), 383–387.
Други названия	Single-Server Markovian Queue, Birth-Death Queue, Poisson Queue, M/M/1 Kuyruk Modeli	M/M/c Queue, Multi-Server Queueing Model, Erlang Delay Formula, Erlang-C Bekleme Modeli	L = λW Theorem, Little's Theorem, Little's Result, Little Yasası
Свързани	3	3	3
Резюме	The M/M/1 queue is the foundational single-server queueing model in which customers arrive according to a Poisson process with rate λ, are served one at a time by a single server with exponentially distributed service times at rate μ, and wait in an infinite-capacity first-come-first-served queue. Formalized within the Kendall notation framework by David Kendall in 1953, building on A. K. Erlang's early twentieth-century telephone traffic work, it yields closed-form steady-state performance measures when the traffic intensity ρ = λ/μ is less than one.	The Erlang C model is a steady-state queueing formula that determines the probability a customer must wait before being served in a system with c parallel servers, Poisson arrivals at rate lambda, and exponentially distributed service times. Originally developed by Danish engineer Agner Krarup Erlang in the early twentieth century for telephone exchange design, and formalized in the queueing theory literature by Cooper (1981), it remains the canonical staffing model for call centers and service operations worldwide.	Little's Law is a fundamental theorem in queueing theory that relates the long-run average number of items in a stable system (L) to the long-run average arrival rate (λ) and the long-run average time an item spends in the system (W), expressed as L = λW. Introduced and rigorously proved by John D. C. Little in 1961, the law holds for virtually any stable stochastic system, requiring no assumptions about arrival distributions, service distributions, or queue disciplines.