Open AccessDelay-Join the Shortest Queue Routing for a Parallel Queueing System with Removable Servers
Author(s) -
Pamela Badian-Pessot,
Douglas G. Down,
Michael M. Lewis
Publication year - 2022
Publication title -
stochastic systems
Language(s) - English
Resource type - Journals
ISSN - 1946-5238
DOI - 10.1287/stsy.2021.0090
Subject(s) - server , computer science , queue , routing (electronic design automation) , computer network , queueing theory , join (topology) , distributed computing , mathematics , combinatorics
We introduce a new class of policies called “delay-join the shortest queue (delay-JSQ)” for use in parallel processing networks with removable servers. When jobs arrive to the system while all servers are on, jobs should be routed to the shortest queue. However, when servers are off, they take a random time to turn back on, which we allow to occur only when the number of jobs in each of the nonempty queues exceeds a fixed threshold. This new class of policies balances the load among all servers that are currently on and balances the capacity by keeping servers off until they are needed. A detailed numerical study shows that at moderate loads (where server farms and increasingly manufacturing facilities operate), delay-JSQ outperforms JSQ by up to 80%. In addition, it does so without precise knowledge of the input parameters and even when the input process is nonstationary.