Little's law
en.wikipedia.org · 1,777 words · saved by 2 readers
Couldn't find lead section for Little's_law
From Wikipedia, the free encyclopedia In mathematical queueing theory, Little's law (also result, theorem, lemma, or formula[1][2]) is a theorem by John Little which states that the long-term average number of customers (L) in a stationary system is equal to the long-term average effective arrival rate (λ) multiplied by the average time that a customer spends in the system (W). Expressed algebraically the law is The relationship is not influenced by the arrival process distribution, the service distribution, the service order, or practically anything else. In most queuing systems, service…
saved by
related reading
- Amdahl's law - Wikipediaen.wikipedia.org
- Law of large numbers - Wikipediaen.wikipedia.org
- Metcalfe's law - Wikipediaen.wikipedia.org
- GitHub - joelparkerhenderson/queueing-theory: Queueing theory: an introduction for software developmentgithub.com
- Scaling Laws, Carefully | Lil'Loglilianweng.github.io
- Zipf's law - Wikipediaen.wikipedia.org
- Poisson distribution - Wikipediaen.wikipedia.org
- Benford's law - Wikipediaen.wikipedia.org
- Central limit theorem - Wikipediaen.wikipedia.org
- Zipf's law - Wikipediaen.wikipedia.org
- Power law - Wikipediaen.wikipedia.org
- Poisson limit theorem - Wikipediaen.wikipedia.org