If you need an accessible version of this item please contact JSTOR User Support

A Simple Proof of: L=λ W

William S. Jewell
Operations Research
Vol. 15, No. 6 (Nov. - Dec., 1967), pp. 1109-1116
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/168616
Page Count: 8
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
A Simple Proof of: L=λ W
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
1109
    1109
  • Thumbnail: Page 
1110
    1110
  • Thumbnail: Page 
1111
    1111
  • Thumbnail: Page 
1112
    1112
  • Thumbnail: Page 
1113
    1113
  • Thumbnail: Page 
1114
    1114
  • Thumbnail: Page 
1115
    1115
  • Thumbnail: Page 
1116
    1116