What question did this study set out to answer?

To establish finite-time convergence to stationarity bounds of queuing systems, especially Join-the-Shortest-Queue policy.

Mixing time of Queuing Systems: From Erlang-C to Join-the-Shortest-Queue

View Full Paper

Ask AI

Bookmark

Authors

Analysis reveals stationary distribution behavior in queuing systems, suggesting implications for performance in heavy traffic scenarios.

To establish finite-time convergence to stationarity bounds of queuing systems, especially Join-the-Shortest-Queue policy.
Analyzed the rate of convergence to steady-state behavior in various queuing systems.
Examined stationary distribution and its approximation in high-traffic scenarios.
Considered discrepancies in queue length and waiting time behavior over finite time.
Identified key metrics for performance analysis in service systems.
Established that stationary distribution is a better predictor in certain traffic conditions.
Revealed that approximation errors increase when systems are further from asymptotic regimes.

Hoang Huy Nguyen (2026) studied this question.

View Full Paper

Ask AI

Bookmark