What is it about?
Application of the power-series algorithm to a discrete-time multi-server system with a join-the-shortest-queue discipline. It concerns the joint queue-length, the waiting time and the sojourn time distributions and the probability of bad luck.
Featured Image
Read the Original
This page is a summary of: Join the Shortest Queue in Discrete Time, January 2025, Elsevier,
DOI: 10.2139/ssrn.5274334.
You can read the full text:
Contributors
The following have contributed to this page
