Queueing Models
Queueing Models is a mathematical framework within stochastic process theory that characterizes the behavior of waiting lines by modeling the dynamics of arrival, service, and queue discipline in systems subject to random demand.
5K
Publications
258.5K
Citations
5.6K
Authors
1.8K
Institutions
Publications per year
2017–2026
549
5K
Applied Probability and Queues.
Upendra Dave, Søren Asmussen · Journal of the Operational Research Society · 1987 · 2.8K citations
A Proof for the Queuing Formula: <i>L</i> = λ<i>W</i>
John D. C. Little · Operations Research · 1961 · 2.7K citations
Analysis and simulation of a fair queueing algorithm
Alan Demers, Srinivasan Keshav, Scott Shenker · 1989 · 1.7K citations
1–5 of 5K
5.6K
53
h-index
28
h-index
University of California, Berkeley, United States
31 publications · 1.8K citations
23
h-index
22
h-index
22
h-index
1–5 of 5.6K
1.8K
AT&T (United States)
Bedminster, United States
55 h-index
162 publications
14.2K citations
Columbia University
New York, United States
55 h-index
198 publications
12.8K citations
Massachusetts Institute of Technology
Cambridge, United States
47 h-index
146 publications
9.7K citations
University of California, Berkeley
Berkeley, United States
44 h-index
144 publications
9.5K citations
Stanford University
Stanford, United States
43 h-index
93 publications
7.6K citations
Technion – Israel Institute of Technology
Haifa, Israel
38 h-index
120 publications
11.9K citations
Nokia (United States)
Coppell, United States
34 h-index
56 publications
6.2K citations

Tel Aviv University
Tel Aviv, Israel
33 h-index
85 publications
5.8K citations
1–8 of 1.8K
366 publications · 32.1K citations
91
h-index
175 publications · 14.8K citations
68
h-index
JAP · 332 publications · 12.9K citations
55
h-index
AAP · 200 publications · 9.9K citations
52
h-index
207 publications · 9.6K citations
51
h-index
1–5