Steady-state Queueing Analysis
Steady-State Queueing Analysis is a mathematical framework within queueing theory that characterizes the long-term probabilistic behavior of queueing systems under equilibrium conditions, distinguishing itself by focusing on performance metrics such as average waiting time, queue length, and server utilization as time approaches infinity.
1.1K
Publications
53.2K
Citations
1.4K
Authors
596
Institutions
Publications per year
2017–2026
106
Parents
1.1K
An Equilibrium Queuing Model of Bribery
Francis T. Lui · Journal of Political Economy · 1985 · 1.3K citations
James R. Jackson · Operations Research · 1957 · 1.3K citations
1–5 of 1.1K
1.4K
14
h-index
14
h-index
14
h-index
13
h-index
12
h-index
1–5 of 1.4K
596
Columbia University
New York, United States
19 h-index
34 publications
1.4K citations
AT&T (United States)
Bedminster, United States
19 h-index
37 publications
6.4K citations

Tel Aviv University
Tel Aviv, Israel
17 h-index
27 publications
1.3K citations
Eindhoven University of Technology
Eindhoven, The Netherlands
17 h-index
44 publications
1.5K citations
Universidad Complutense de Madrid
Madrid, Spain
16 h-index
27 publications
1.3K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
16 h-index
37 publications
961 citations
Technion – Israel Institute of Technology
Haifa, Israel
15 h-index
27 publications
1.5K citations
Georgia Institute of Technology
Atlanta, United States
14 h-index
22 publications
1.2K citations
1–8 of 596
71 publications · 6.5K citations
37
h-index
86 publications · 3.5K citations
32
h-index
JAP · 78 publications · 2.8K citations
30
h-index
50 publications · 1.9K citations
27
h-index
45 publications · 2.5K citations
26
h-index
1–5