Opening your learning space
Starting the app …
Opening your learning space
Starting the app …
Little’s law relates mean number in a stationary system, throughput and mean time in the system.
Free to browse · flashcards or a multiple-choice quiz · import from Essential
Formula
L in items; lambda in items/s; W in s
| Symbol | Meaning | Unit |
|---|---|---|
| Mean number of jobs in the system | jobs | |
| Long-run mean throughput | jobs/s | |
| Mean time a job spends in the system | s |
L=\lambda WThe relation applies under stability and long-run stationary operation and does not require a particular arrival or service-time distribution. System boundary and measurement window must be consistent: if only waiting jobs are counted, use waiting time rather than total sojourn time. The law does not specify distributions of L, lambda or W and does not replace a queueing model under overload.
The relation applies under stability and long-run stationary operation and does not require a particular arrival or service-time distribution. System boundary and measurement window must be consistent: if only waiting jobs are counted, use waiting time rather than total sojourn time. The law does not specify distributions of L, lambda or W and does not replace a queueing model under overload.
Little’s law relates mean number in a stationary system, throughput and mean time in the system.
Defining relation
The equation states the defining relation within its stated domain.
Use the example for Little’s law for queues to explain which inputs determine the requested output.
The example connects concrete inputs to its result.
Little’s law relates mean number in a stationary system, throughput and mean time in the system.
The relation applies only under its stated assumptions.
Applying the relation to a different case without checking its stated assumptions.
Check the validity range before substituting values: The relation applies under stability and long-run stationary operation and does not require a particular arrival or service-time distribution. System boundary and measurement window must be consistent: if only waiting.
Formula cluster
Little’s law relates mean number in a stationary system, throughput and mean time in the system.
A stable service with throughput 20 jobs/s and mean sojourn time 0.15 s has L=20·0.15=3 jobs on average.
Capacity planning and performance analysis for servers, production lines, networks and support queues.
Here is how to work through a typical Little’s law for queues (L = λ·W) task step by step:
Task
Use the example for Little’s law for queues to explain which inputs determine the requested output.
Solution path
The example connects concrete inputs to its result.
Little’s law relates mean number in a stationary system, throughput and mean time in the system.
The relation applies only under its stated assumptions.
The relation L=\lambda W summarizes Little’s law relates mean number in a stationary system, throughput and mean time in the system. Read it as a model for defined quantities, not as an automatic claim about every real situation. In the example A stable service with throughput 20 jobs/s and mean sojourn time 0.15 s has L=20·0.15=3 jobs on average., symbols are connected to concrete values and the result is interpreted in context. Validity limit: The relation applies under stability and long-run stationary operation and does not require a particular arrival or service-time distribution. System boundary and measurement window must be consistent: if only waiting Source: MIT OpenCourseWare 1.203J, Lecture 5: Queueing Systems and Little’s Law.
First write down the requested quantity and all given values with their symbols. Substitute them into the defining relation and check unit consistency. The example A stable service with throughput 20 jobs/s and mean sojourn time 0.15 s has L=20·0.15=3 jobs on average. provides a worked check: formula and result must have compatible scale and meaning; round only at the end. Validity limit: The relation applies under stability and long-run stationary operation and does not require a particular arrival or service-time distribution. System boundary and measurement window must be consistent: if only waiting Source: MIT OpenCourseWare 1.203J, Lecture 5: Queueing Systems and Little’s Law.
The formula applies only when quantities are defined as in the source and background. Check boundary cases, measurement conditions and whether an approximation rather than equality is intended. Substitution can be algebraically correct yet technically wrong when assumptions fail or the population or system boundary changes. Validity limit: The relation applies under stability and long-run stationary operation and does not require a particular arrival or service-time distribution. System boundary and measurement window must be consistent: if only waiting Source: MIT OpenCourseWare 1.203J, Lecture 5: Queueing Systems and Little’s Law.
The stated units are: L in items; lambda in items/s; W in s. Convert values to a consistent unit system before substitution; counts, percentages and dimensionless ratios are not interchangeable. The variable list states the role of each symbol. Dimensional analysis catches many errors but does not replace checking the formula's assumptions. Validity limit: The relation applies under stability and long-run stationary operation and does not require a particular arrival or service-time distribution. System boundary and measurement window must be consistent: if only waiting Source: MIT OpenCourseWare 1.203J, Lecture 5: Queueing Systems and Little’s Law.
Comparison helps when both quantities address the same question but emphasize different properties. Report the definition, input data, threshold or averaging with the value. The source MIT OpenCourseWare 1.203J, Lecture 5: Queueing Systems and Little’s Law. supports the definition used here; other conventions can differ. Choose the measure to match the learning or analysis goal. Validity limit: The relation applies under stability and long-run stationary operation and does not require a particular arrival or service-time distribution. System boundary and measurement window must be consistent: if only waiting Source: MIT OpenCourseWare 1.203J, Lecture 5: Queueing Systems and Little’s Law.
Quanta exam set
Curated exam set for "Little’s law for queues":
Question (front)
Which formula describes Little’s law for queues?
Answer in your set
Question (front)
How do you rearrange Little’s law for queues for Defining relation?
Answer in your set
Question (front)
Which common mistake happens with Little’s law for queues?
Answer in your set
+ 7 more cards: units, variables, derivation, example, exam task
The formula set contains 10 cards. After importing, review them and start practicing; your ratings determine later review intervals.
This list names subject references and further reading. A page or section number appears when it is part of the reference; these are not verbatim quotations.
Create a curated FSRS exam set for L = λ·W: formula recall, variables, derivation, rearrangement, worked example, common mistakes and exam context.
Curated formula set · LaTeX · FSRS spaced repetition · import from Essential