Codex Wiki
OurBigBook.com
Site
Source code
Little law
Home
Mathematics
Area of mathematics
Probability and statistics
Probability theory
Queueing theory
OurBigBook.com
Words: 40
In a stable regenerative queue,
L
=
λW
,
(8)
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)
Queueing theory
Probability theory
Probability and statistics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution