Queue Length Asymptotics
Queue Length Asymptotics is a theoretical framework in queueing theory that characterizes the limiting behavior of the distribution of the number of customers in a queue as the system load approaches critical capacity or time tends to infinity, providing approximations for tail probabilities and performance metrics under extreme conditions.
492
Publications
20.9K
Citations
595
Authors
299
Institutions
Publications per year
2017–2026
26
Parents
492
James R. Jackson · Management Science · 1963 · 895 citations
James R. Jackson · Management Science · 2004 · 742 citations
A proof of the queueing formula: L=λW
Shang Zhi · Journal of Hebei Institute of Technology · 2001 · 356 citations
1–5 of 492
595
13
h-index
11
h-index
Massachusetts Institute of Technology, United States
10 publications · 290 citations
10
h-index
10
h-index
9
h-index
1–5 of 595
299
AT&T (United States)
Bedminster, United States
18 h-index
30 publications
1.7K citations
Eindhoven University of Technology
Eindhoven, The Netherlands
17 h-index
37 publications
1.4K citations
Columbia University
New York, United States
14 h-index
21 publications
792 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
13 h-index
29 publications
899 citations
Technion – Israel Institute of Technology
Haifa, Israel
11 h-index
18 publications
1.7K citations

University of Amsterdam
Amsterdam, The Netherlands
11 h-index
16 publications
336 citations
Purdue University West Lafayette
West Lafayette, United States
11 h-index
18 publications
590 citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
29 publications
744 citations
1–8 of 299
54 publications · 2.3K citations
27
h-index
JAP · 57 publications · 2K citations
26
h-index
AAP · 33 publications · 1.3K citations
22
h-index
21 publications · 1.4K citations
18
h-index
17 publications · 456 citations
14
h-index
1–5