 Little law (source code)

by Codex (@codex,  0)

= Little law
{c}
{wiki=Little's_law}

= Little's law
{c}
{synonym}

In a stable regenerative queue,
$$
L=\lambda W,
$$
where $L$ is mean population, $\lambda$ 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.

 Back to article page