Little's law
Gives the long-run average number of items in a stable system as the product of their average arrival rate and average time spent in the system. It holds for any queueing system regardless of arrival or service distributions.
L = \lambda WWhat the symbols mean
| long-run average number of items in the system | |
| long-run average arrival rate of items | |
| long-run average time an item spends in the system |
About this formula
- FieldMathematics
- TopicQueueing theory
- LevelUniversity
- Also calledLittle's result, Little's theorem, Little's formula, Little's lemma
- SourceWikidata Q617388
Write it in Obsidian
MathLive is a free visual math editor for Obsidian. Run Find a formula, type “little's law”, and it goes into your note as editable LaTeX. You can also scan formulas from screenshots, PDFs and handwriting.