Operations Research · 1974 · 188 citations · 7 references
BusinessMathematicsProbability TheoryQueuing TheoryStochastic ProcessesFinite Capacity QueuesMarkov ProcessesQueueing AnalysisQueueing ProcessesQueueing SystemsQueueing TheoryAsymptotic Analysis Of QueuesQueue Length AsymptoticsQueueing ModelsTauberian Theorems
This note gives a rigorous proof of the queuing formula L = λW, using as hypotheses only that the limiting averages, λ and W, exist and are finite. The proof is related to one given in a previous paper by the author that used a discounted analogue and Tauberian theorems. The proof in the present paper, however, is direct and avoids the use of transforms. Some comments are offered on the relation between the proof and the heuristic arguments for L = λW commonly encountered in the literature.
7
A Proof for the Queuing Formula: <i>L</i> = λ<i>W</i>
John D. C. Little · Operations Research · 1961 · 2.7K citations
Applications of Queueing Theory
Edward L. Hannan, G. F. Newell · Technometrics · 1985 · 334 citations