A proof for the queueing formula¶
Little, J. D. C. (1961). A proof for the queueing formula: L = λW. Operations Research, 9(3), 383-387.
Cited by¶
23 citations across 23 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Buffering
- Stability emerges when average inflow equals average outflow, the steady-state relationship Little (1961) formalized as L = λW connecting average inventory, arrival rate, and time-in-system; perturbation is absorbed when spare capacity exists.
This sourceFoundational result of queueing theory: in any stable queueing system the mean number of items in the system equals the arrival rate times the mean residence time (L = λW), giving the steady-state relation among average inventory, arrival rate, and time-in-system.
Supported in partVerified against the publisher's abstract
Little's abstract establishes L = λW under strict stationarity; it says nothing about inflow equalling outflow or spare-capacity absorbing perturbation.
“It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L = λW.”
- Stability emerges when average inflow equals average outflow, the steady-state relationship Little (1961) formalized as L = λW connecting average inventory, arrival rate, and time-in-system; perturbation is absorbed when spare capacity exists.
- Interference and Contention
- The pattern captures a fundamental trade-off: shared resources improve overall utilization (the resource is rarely idle) but introduce contention risk (concurrent demand causes interference and performance loss), the utilization–contention coupling Little (1961) made precise via his foundational queueing-system law.
This sourceFoundational result of queueing theory: in any stable queueing system, the mean number of items in the system equals arrival rate times mean residence time, providing the substrate-independent law that governs throughput-based liquidity in trading, networking, and operations.
Supported in partVerified against the publisher's abstract
Little's abstract states only L = λW for a stationary queueing process; it does not state a utilization–contention coupling, so the law alone supports the attribution only in part.
“In a queuing process, let 1/λ be the mean time between the arrivals of two consecutive units, L be the mean number of units in the system, and W be the mean time spent by a unit in the system. It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L = λW.”
- The pattern captures a fundamental trade-off: shared resources improve overall utilization (the resource is rarely idle) but introduce contention risk (concurrent demand causes interference and performance loss), the utilization–contention coupling Little (1961) made precise via his foundational queueing-system law.
- Liquidity
- The structural analogy is exact at the queueing level: Little (1961) proved that the mean number of items in any stable queueing system equals arrival rate times mean residence time (L = λW), so a system's effective liquidity—throughput per unit residence time—is governed by the same law whether the items are trades, packets, queries, or approval requests.
This sourceFoundational result of queueing theory: in any stable queueing system, the mean number of items in the system equals arrival rate times mean residence time, providing the substrate-independent law that governs throughput-based liquidity in trading, networking, and operations.
Supported in partVerified against the publisher's abstract
Little's abstract states the L = λW identity under stationarity conditions; it says nothing about liquidity, trades, packets, or approval requests.
“It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L = λW.”
- The structural analogy is exact at the queueing level: Little (1961) proved that the mean number of items in any stable queueing system equals arrival rate times mean residence time (L = λW), so a system's effective liquidity—throughput per unit residence time—is governed by the same law whether the items are trades, packets, queries, or approval requests.
- Queueing
- Not identical to scheduling:
This sourceFoundational result: in any stable queueing system the mean number in system equals arrival rate times mean residence time, a relation that holds regardless of queue discipline.
- Not identical to scheduling:
- Reaction Intermediate
- This is a deep and portable identity: it generalizes Little's Law, in which queue depth equals arrival rate times sojourn time, and it connects to the Michaelis-Menten analysis in enzymology, to work-in-process accounting in operations, and to bottleneck detection in dataflow analysis.
This sourceEstablishes Little's Law relating standing population to arrival rate times sojourn time, generalizing the formation/consumption steady-state of an intermediate.
Supported in partVerified against the publisher's abstract
Little (1961) supplies the L = λW identity (mean queue size equals arrival rate times mean sojourn time), but nothing on reaction intermediates, Michaelis-Menten kinetics, work-in-process accounting, or dataflow bottleneck detection.
“let 1/λ be the mean time between the arrivals of two consecutive units, L be the mean number of units in the system, and W be the mean time spent by a unit in the system. It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L = λW.”
- This is a deep and portable identity: it generalizes Little's Law, in which queue depth equals arrival rate times sojourn time, and it connects to the Michaelis-Menten analysis in enzymology, to work-in-process accounting in operations, and to bottleneck detection in dataflow analysis.
- Receptor Saturation
- Following the capacity-utilization framework Little (1961) established in his foundational queueing-theory result L = λW,
This sourceFoundational result of queueing theory: in any stable queueing system, the mean number of items in the system equals arrival rate times mean residence time, providing the substrate-independent law that governs throughput-based liquidity in trading, networking, and operations.
SupportedVerified against the publisher's abstract
Little proves the queueing identity the sentence names, showing that “if the three means are finite and the corresponding stochastic processes strictly stationary”, and if the arrival process is metrically transitive with nonzero mean, “then L = λW”. The relation between mean number in system, arrival rate and mean residence time, and the conditions under which it holds, are the work's own result. The label capacity-utilization framework is the article's framing rather than the work's.
“It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L = λW.”
- Following the capacity-utilization framework Little (1961) established in his foundational queueing-theory result L = λW,
- Unevenness Waste
- The steady-state mean number in system is \(L = \rho / (1 - \rho)\), and by Little's law the mean delay is \(W = 1 / (\mu - \lambda)\) — both containing the \(1/(1-\rho)\) term that explodes as \(\rho \to 1\).
This sourceProves Little's law relating mean number in system, arrival rate, and mean delay, used to convert queue length into waiting time.
Supported in partVerified against the publisher's abstract
Little's paper (abstract) proves only L = λW under stationarity, so it backs the law converting queue length into delay, not the M/M/1 formulas L = ρ/(1−ρ) and W = 1/(μ−λ).
“In a queuing process, let 1/λ be the mean time between the arrivals of two consecutive units, L be the mean number of units in the system, and W be the mean time spent by a unit in the system. It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L = λW.”
- The steady-state mean number in system is \(L = \rho / (1 - \rho)\), and by Little's law the mean delay is \(W = 1 / (\mu - \lambda)\) — both containing the \(1/(1-\rho)\) term that explodes as \(\rho \to 1\).
Mechanisms¶
- Active-Site Capacity Dashboard
- A real anchor makes the point precise: Little's Law relates average queue length, arrival rate, and wait time (L = λW), which is why a capacity board must show queue and cycle time, not just how busy the machines look.
This sourceStates Little's Law as L = λW, relating mean number in a system, arrival rate, and time in the system.
- A real anchor makes the point precise: Little's Law relates average queue length, arrival rate, and wait time (L = λW), which is why a capacity board must show queue and cycle time, not just how busy the machines look.
- Asynchronous Queue or Buffer
- Little's Law is the discipline here: queue length, arrival rate, and wait time are locked together by arithmetic, and no buffer depth beats a service rate below the arrival rate.
This sourceRelates a queue's long-run average population to its arrival rate and average waiting time.
- Little's Law is the discipline here: queue length, arrival rate, and wait time are locked together by arithmetic, and no buffer depth beats a service rate below the arrival rate.
- Attention WIP Limit
- By forcing completion before initiation it directly shortens how long any item spends in progress — the relationship formalized by Little's Law, where lower work-in-progress means faster flow at a fixed throughput.
This sourceEstablishes Little's Law, under stationary conditions, that mean work in a system equals throughput multiplied by mean time in the system; at fixed throughput, lower work in progress implies lower mean flow time.
- By forcing completion before initiation it directly shortens how long any item spends in progress — the relationship formalized by Little's Law, where lower work-in-progress means faster flow at a fixed throughput.
- Autoscaling Worker Pool
- Little's Law
This sourceProves Little’s Law, relating the average number in a stable system to arrival rate and average time in the system.
- Little's Law
- Bandwidth and Latency Budget
- Little's Law ties the three numbers together
This sourceProves Little’s law, L = λW, relating average backlog, arrival rate, and time in the system, so those quantities cannot be budgeted independently.
- Little's Law ties the three numbers together
- Burn-Down or Drain Chart
- A falling count feels like winning; the drain chart, by showing completions net of arrivals, reveals whether the team is actually gaining on the backlog or merely riding a lull — a direct visual expression of the relationship Little's Law formalizes between backlog size, throughput, and wait.
This sourceProves the queueing relation L = λW, linking the mean number in a system, the arrival or throughput rate, and mean time in the system.
- A falling count feels like winning; the drain chart, by showing completions net of arrivals, reveals whether the team is actually gaining on the backlog or merely riding a lull — a direct visual expression of the relationship Little's Law formalizes between backlog size, throughput, and wait.
- Capacity Trigger Revision
- Capacity Trigger Revision re-derives the trigger from the current flow: occupancy relates to arrival rate and length of stay,
This sourceEstablishes the steady-state relation between average occupancy, arrival rate, and average time in a system.
- Capacity Trigger Revision re-derives the trigger from the current flow: occupancy relates to arrival rate and length of stay,
- Concurrency Limit
- By Little's Law the average time a report spends in the system is just its in-flight count divided by throughput, so bounding the concurrency directly bounds the latency users feel.
This sourceProves Little's Law, under which average time in a stable system equals average in-flight work divided by throughput.
- By Little's Law the average time a report spends in the system is just its in-flight count divided by throughput, so bounding the concurrency directly bounds the latency users feel.
- Kanban Pull System
- Tuning the number of cards trades throughput against buffer, a relationship Little's Law makes precise.
This sourceProves the stationary-system relation between average work in process, throughput rate, and average flow time now known as Little's Law.
- Tuning the number of cards trades throughput against buffer, a relationship Little's Law makes precise.
- Paradox Risk Dashboard
- Pairing throughput, work-in-progress, and latency on one view guards against the classic trap of celebrating a local speedup while the system silently backs up.
This sourceRelates average work in process, throughput, and average time in the system through Little’s law.
- Pairing throughput, work-in-progress, and latency on one view guards against the classic trap of celebrating a local speedup while the system silently backs up.
- Pooled Operations Queue
- Little's Law is the reason the fix is flow control, not just hiring — with the arrival rate fixed
This sourceStates the fixed-arrival-rate condition used in Little's mean queueing relation.
- Little's Law is the reason the fix is flow control, not just hiring — with the arrival rate fixed
- Queue-Based Scale Trigger
- By Little's Law, queue length, arrival rate, and average wait are linked,
This sourceProves that average queue population equals arrival rate times average time in the system, allowing a wait-time bound to be translated into a backlog threshold at a given arrival rate.
- By Little's Law, queue length, arrival rate, and average wait are linked,
- Throughput-Based Limit Review
- Because it reasons about cycle time, throughput, and WIP together, it is the natural home for Little's Law: for a stable system, average cycle time rises with WIP at a given throughput, so the review can predict what tightening the cap should buy and check the prediction next cycle.
This sourceDocuments it reasons about cycle time, throughput, and WIP together; it is the natural home for Little's Law; for a stable system, average cycle time rises with WIP at a given throughput.
- Because it reasons about cycle time, throughput, and WIP together, it is the natural home for Little's Law: for a stable system, average cycle time rises with WIP at a given throughput, so the review can predict what tightening the cap should buy and check the prediction next cycle.
- Ticket Backlog Cap
- The relationship it leans on — that average backlog, throughput, and wait time move together — is the everyday form of Little's Law,
This sourceProves L = λW, linking average work in system, throughput, and average time so a target horizon can be converted into a backlog cap.
- The relationship it leans on — that average backlog, throughput, and wait time move together — is the everyday form of Little's Law,
- Work-in-Progress Cap
- Work-in-Progress Limit
- Its strengths are concrete: shorter cycle time
This sourceProves the steady-state identity L = λW, linking average work in process to average cycle time at a given throughput.
- Its strengths are concrete: shorter cycle time
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 6 of 23 citations: 1 supported, 5 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:8e85043c4b1b · see in the full table