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

	Закон Литтла (L = λW)	Система массового обслуживания M/M/1: Одноканальная модель
Область	Исследование операций	Исследование операций
Семейство	Regression model	Regression model
Год появления	1961	1953
Автор метода	John D. C. Little	A. K. Erlang; David Kendall (notation)
Тип	Exact queueing identity	Stochastic queueing model
Основополагающий источник	Little, J. D. C. (1961). A proof for the queuing formula: L = λW. Operations Research, 9(3), 383–387.	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.
Другие названия	L = λW Theorem, Little's Theorem, Little's Result, Little Yasası	Single-Server Markovian Queue, Birth-Death Queue, Poisson Queue, M/M/1 Kuyruk Modeli
Связанные	3	3
Сводка	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.	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.