Operations Research · 1967 · 72 citations · 2 references
EngineeringMathematicsProbability TheoryQueuing TheoryStochastic ProcessesMarkov ProcessesQueueing ProcessesQueueing SystemsQueueing TheoryRenewal ProcessesRenewal TheoryDelayed Renewal ProcessesRenewal Arrival ProcessesRenewal EquationRenewal FunctionRenewal Process ModelsRenewal Queueing TheoryRenewal Theory Limit TheoremsStochastic Arrival Processes
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.
2
A Proof for the Queuing Formula: <i>L</i> = λ<i>W</i>
John D. C. Little · Operations Research · 1961 · 2.7K citations