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
Parents
12
1–5 of 12
15
2
h-index
IBM Research - Thomas J. Watson Research Center, United States
1 publications · 65 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
15
Tokyo University of Information Sciences
Chiba, Japan
2 h-index
2 publications
60 citations
Core Competence
Santa Fe, United States
2 h-index
2 publications
97 citations
Tokyo University of Science
Tokyo, Japan
2 h-index
2 publications
60 citations
University of Southern California
Los Angeles, United States
1 h-index
1 publications
19 citations
École Polytechnique
Palaiseau, France
1 h-index
1 publications
45 citations
University of Chicago
Chicago, United States
1 h-index
2 publications
90 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
45 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
1 publications
65 citations
1–8 of 15
JAP · 2 publications · 97 citations
2
h-index
2 publications · 180 citations
2
h-index
1 publications · 13 citations
1
h-index
1 publications · 45 citations
1
h-index
1 publications · 65 citations
1
h-index
1–5