A Simple Proof of:L= λW

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.