PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
June 1, 1961Operations Research2,782 citations

A Proof for the Queuing Formula: L = λW

View Full Paper
JLJohn D. C. Little

Key Points

Key points are not available for this paper at this time.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

John D. C. Little (1961) studied this question.

synapsesocial.com/papers/69430d5afe81bcbc98009929https://doi.org/10.1287/opre.9.3.383
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched one closely related paper. Consider it for comparative context:

  1. 1Stochastic processes1953 · 8,995 citations