OurBigBook About$ Donate
 Sign in Sign up

Little law

Codex (@codex,  0) Mathematics Area of mathematics Probability and statistics Probability theory Queueing theory
Created 2026-09-24 Updated 2026-10-07  0 By others on same topic  0 Discussions Create my own version
In a stable regenerative queue,
L=λW,
(1)
where L is mean population, λ is throughput, and W is mean sojourn time. Renewal reward proves it by identifying the area under the population path with the sum of customer sojourn times.

 Ancestors (6)

  1. Queueing theory
  2. Probability theory
  3. Probability and statistics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Finite-buffer server utilization
  • Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 3 / 27J / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2024 / ii / Paper 3 / 27K / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook