Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 222,876,896 papers from all fields of science
Search
Sign In
Create Free Account
Little's law
Known as:
Little's lemma
, Queueing formula
, Little's Formula
Expand
In queueing theory, a discipline within the mathematical theory of probability, Little's result, theorem, lemma, law or formula is a theorem by John…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Erlang (unit)
Pollaczek–Khinchine formula
Preemption (computing)
Queuing delay
Expand
Broader (2)
Operations research
Queueing theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Global Geography of ‘Little Italy’: Italian Neighbourhoods in Comparative Perspective
D. Gabaccia
Modern Italy
2006
Corpus ID: 56372320
Between 1870 and 1970 the migration of 26 million people from Italy produced an uneven geography of Little Italies worldwide…
Expand
2006
2006
진료예약콜센터의 인력 배치 최적화 연구
김성문
,
나정은
2006
Corpus ID: 75112815
Call center staffing problems have often relied upon queueing models, which are traditionally used to compute average call…
Expand
2005
2005
Reexamination of processing time uncertainty
Q. Cao
,
J. Wayne Patterson
,
Xue Bai
European Journal of Operational Research
2005
Corpus ID: 27663085
2005
2005
The waiting time distribution for a TDMA model with a finite buffer and state-dependent service
M. Neuts
,
Jun Guo
,
M. Zukerman
,
H. Vu
IEEE Transactions on Communications
2005
Corpus ID: 10065672
We obtain detailed analytic formulas for the density and probability distribution of the waiting time in a time-division multiple…
Expand
2003
2003
The waiting time distribution for a TDMA model with a finite buffer
M. Neuts
,
Junhao Guo
,
M. Zukerman
,
H. Vu
IEEE INFOCOM . Twenty-second Annual Joint…
2003
Corpus ID: 43856313
Detailed analytic formulas for the density and probability distribution of the waiting time in a TDMA model with a finite buffer…
Expand
1997
1997
The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability
C. Humes
,
J. Ou
,
P. Kumar
Mathematics of Operations Research
1997
Corpus ID: 15444568
For open Markovian queueing networks, we study the functional dependence of the mean number in the system and thus also the mean…
Expand
1988
1988
An LIL Version of L = λW
P. Glynn
,
W. Whitt
Mathematics of Operations Research
1988
Corpus ID: 45955000
This paper establishes a law-of-the-iterated-logarithm LIL version of the fundamental queueing formula L = λW: Under regularity…
Expand
1986
1986
A central-limit-theorem version ofL=λw
P. Glynn
,
W. Whitt
Queueing Syst. Theory Appl.
1986
Corpus ID: 6991442
Underlying the fundamental queueing formulaL=λW is a relation between cumulative processes in continuous time (the integral of…
Expand
1983
1983
Too Much Order With Too Little Law
F. Brennan
1983
Corpus ID: 107436816
Read more and get great! That's what the book enPDFd too much order with too little law will give for every reader to read this…
Expand
Highly Cited
1980
Highly Cited
1980
The Relation between Customer and Time Averages in Queues
D. Heyman
,
S. Stidham
Operational Research
1980
Corpus ID: 39943064
Brumelle has generalized the queueing formula L = λW to H = λG, where λ is the arrival rate and H and G are respectively time and…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE