Publication | Closed Access
A Simple Proof of: <i>L</i> = λ<i>W</i>
71
Citations
2
References
1967
Year
Renewal TheoryEngineeringAutomated ReasoningStochastic ProcessesPerformance ModelingProbability TheoryQueuing TheoryHigher-order LogicSimple ProofLambda CalculusPoisson BoundaryEvent SystemQueueing SystemsQueueing Theory
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1