Sammenlign metoder

	Little's lov (L = λW)	Diskrete hendelsesbaserte simuleringer (DES)	M/M/1-kø: Den en-serverte kømodellen
Fagfelt	Operasjonsanalyse	Simulering	Operasjonsanalyse
Familie	Regression model	Process / pipeline	Regression model
Opprinnelsesår	1961	1960s (formalized); modern computational form from 1970s onward	1953
Opphavsperson	John D. C. Little	Banks, Carson, Nelson & Nicol (textbook lineage); foundational work by Tocher & Conway (1960s)	A. K. Erlang; David Kendall (notation)
Type	Exact queueing identity	Stochastic process simulation	Stochastic queueing model
Opprinnelig kilde	Little, J. D. C. (1961). A proof for the queuing formula: L = λW. Operations Research, 9(3), 383–387.	Banks, J., Carson, J.S., Nelson, B.L. & Nicol, D.M. (2010). Discrete-Event System Simulation (5th ed.). Pearson. ISBN: 978-0136062127	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.
Alias	L = λW Theorem, Little's Theorem, Little's Result, Little Yasası	DES, event-driven simulation, Ayrık Olay Simülasyonu (DES)	Single-Server Markovian Queue, Birth-Death Queue, Poisson Queue, M/M/1 Kuyruk Modeli
Relaterte	3	4	3
Sammendrag	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.	Discrete-Event Simulation (DES) is a computational modeling paradigm in which the state of a system changes only at a countable sequence of points in time — the events. Between events nothing changes, so the simulation clock jumps directly from one event to the next. Formalized through the foundational textbooks of Banks, Carson, Nelson and Nicol and of Law in the 1960s–2000s, DES has become the standard tool for analyzing queuing systems, healthcare patient flows, manufacturing lines, and logistics networks where entities move through resources over time.	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.