Many-server Queue Asymptotics

Many-Server Queue Asymptotics is a mathematical framework in queueing theory that characterizes the limiting behavior of queueing systems with a large number of servers under heavy-traffic conditions, distinguishing itself by scaling the number of servers and arrival rates jointly to study performance metrics in asymptotic regimes.

54

Publications

2.7K

Citations

78

Authors

55

Institutions

Publications per year

2017–2026

5

Authors

78

  1. AM
    Avishai Mandelbaum

    Technion – Israel Institute of Technology, Israel

    5 publications · 516 citations

    5

    h-index

  2. JG
    J. G. Dai

    Georgia Institute of Technology, United States

    3 publications · 206 citations

    3

    h-index

  3. RA
    Rami Atar

    Technion – Israel Institute of Technology, Israel

    3 publications · 221 citations

    3

    h-index

  4. XL
    Xin Liu

    Arizona State University, United States

    3 publications · 69 citations

    3

    h-index

  5. CK
    Charles Knessl

    University of Illinois Chicago, United States

    3 publications · 34 citations

    3

    h-index

1–5 of 78

Venues

  1. Mathematics of Operations Research

    9 publications · 505 citations

    9

    h-index

  2. Journal of Applied Probability

    JAP · 8 publications · 423 citations

    8

    h-index

  3. Queueing Systems

    7 publications · 467 citations

    7

    h-index

  4. The Annals of Applied Probability

    5 publications · 288 citations

    5

    h-index

  5. Operations Research

    4 publications · 387 citations

    4

    h-index

1–5