Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

Journal Article

A Proof for the Queuing Formula: L= λ W

John D. C. Little
Operations Research
Vol. 9, No. 3 (May - Jun., 1961), pp. 383-387
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/167570
Page Count: 5

You can always find the topics here!

Topics: Stochastic processes, Ergodic theory
Were these topics helpful?
See something inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • Download ($30.00)
  • Add to My Lists
  • Cite this Item
A Proof for the Queuing Formula: L= λ W
Preview not available

Abstract

In a queuing process, let 1/λ be the mean time between the arrivals of two consecutive units, L be the mean number of units in the system, and W be the mean time spent by a unit in the system. It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L=λ W.

Page Thumbnails

  • Thumbnail: Page 
383
    383
  • Thumbnail: Page 
384
    384
  • Thumbnail: Page 
385
    385
  • Thumbnail: Page 
386
    386
  • Thumbnail: Page 
387
    387