A proof of the queueing formula: L=λW

By Shang Zhi. 2001

611 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Asymptotic approximations for stationary distributions of many-server queues with abandonment (2010, unknown): “[17]), we know that E[〈1, η (N) ∗ 〉] = λ (N) θ, where θ, defined in Assumption 1, is the mean of G.”
Capacity, delay and mobility in wireless ad-hoc networks (2003, methodology): “In particular, applying Little’s Law [10] to Theorem 2 we get the expected amount of data in the buffers is bounded by 2d v W log3 n .”
Spreadsheet simulation (2004, unknown): “In factory physics, Little’s Law (Little 1961) is stated as Equation (4):”