Shortest-queue Asymptotics

Shortest-Queue Asymptotics is a theoretical framework in heavy-traffic approximation that characterizes the limiting behavior of queueing systems under the policy of assigning arrivals to the shortest queue, distinguished by its focus on system performance and stability in asymptotic regimes where traffic intensity approaches criticality.

12

Publications

664

Citations

15

Authors

15

Institutions

Publications per year

2017–2026

2

Authors

15

  1. SH
    Shlomo Halfin

    Core Competence, United States

    2 publications · 97 citations

    2

    h-index

  2. TK
    Thomas K. Philips

    IBM Research - Thomas J. Watson Research Center, United States

    1 publications · 65 citations

    1

    h-index

  3. DG
    David Gamarnik

    Massachusetts Institute of Technology, United States

    1 publications · 110 citations

    1

    h-index

  4. NW
    Neil Walton

    University of Amsterdam, Netherlands

    1 publications · 45 citations

    1

    h-index

  5. RD
    Robert D. Foley

    Georgia Institute of Technology, United States

    1 publications · 149 citations

    1

    h-index

1–5 of 15

Venues

  1. Journal of Applied Probability

    JAP · 2 publications · 97 citations

    2

    h-index

  2. The Annals of Applied Probability

    2 publications · 180 citations

    2

    h-index

  3. Operations Research Letters

    1 publications · 13 citations

    1

    h-index

  4. Probability Theory and Related Fields

    1 publications · 45 citations

    1

    h-index

  5. Performance Evaluation

    1 publications · 65 citations

    1

    h-index

1–5