A Simple Proof of: L = λW
- 1 December 1967
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 15 (6) , 1109-1116
- https://doi.org/10.1287/opre.15.6.1109
Abstract
A simple proof of the fundamental queuing formula L = λW is given that is based on renewal theory. The basic assumptions that are needed are: (1) the event system is empty is recurrent, and (2) the arrival and waiting-time mechanisms are reset by the next arrival after this event occurs.Keywords
This publication has 0 references indexed in Scilit: