Little's Law (L = λW)
Also known as: L = λW Theorem, Little's Theorem, Little's Result, Little Yasası
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.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Little's Law applies to any stable queuing system in steady state — manufacturing lines, call centers, web servers, hospital wards, or software pipelines. It is appropriate when the system reaches a long-run equilibrium so that time-average quantities exist and are well-defined. Key assumptions are stability (λ < μ for single-server queues), that items neither enter nor leave through side channels not counted in λ, and that the averages have converged. It does not apply to transient or non-stationary systems. When stability is uncertain, discrete-event simulation is a stronger alternative.
Strengths & limitations
- Exact identity requiring no distributional assumptions — holds for any stable stochastic system.
- Allows any one of L, λ, or W to be inferred from the other two, enabling indirect measurement.
- Applicable across diverse domains including manufacturing, healthcare, computing, and service operations.
- Simple to communicate to non-technical stakeholders due to its intuitive, arithmetic form.
- Requires system stability (steady state); results are meaningless for non-stationary or overloaded systems.
- Provides only long-run averages and gives no information about variance, tail behavior, or transient dynamics.
- All three quantities must be measured consistently over the same system boundary; inconsistent scoping leads to incorrect conclusions.
- Does not prescribe how to improve a system — it diagnoses relationships but does not optimize them.
Frequently asked
Does Little's Law require Poisson arrivals or exponential service times?
No. One of the most important aspects of the law is that it holds for any stable queuing system regardless of the arrival distribution, service time distribution, or queue discipline. The proof requires only that the system reaches a steady state and that the relevant long-run averages exist and are finite.
Can Little's Law be applied to subsystems rather than the whole system?
Yes, provided the system boundary is applied consistently to all three quantities. L, λ, and W must all refer to the same defined region — for example, only the waiting area or only the service stage. Mixing boundaries from different subsystems invalidates the equality.
What happens if the system is not in steady state?
If the system has not reached a long-run equilibrium — for example, during a transient startup phase or when the arrival rate exceeds service capacity — the time-average limits may not converge and L = λW does not hold in general. In such cases discrete-event simulation or time-series analysis of transient behavior is more appropriate.
Sources
- Little, J. D. C. (1961). A proof for the queuing formula: L = λW. Operations Research, 9(3), 383–387. DOI: 10.1287/opre.9.3.383 ↗
How to cite this page
ScholarGate. (2026, June 2). Little's Law (L = λW). ScholarGate. https://scholargate.app/en/operations-research/littles-law
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Discrete-Event SimulationSimulation↔ compare
- M/M/1 QueueOperations Research↔ compare
- M/M/c QueueOperations Research↔ compare