Robustness of Join-the-Shortest-Queue Scheduling to Communication Delay
ACC(2018)
摘要
An important issue facing schedulers in queueing networks (e.g. computing/communication) in practice is delayed access to communication information. In this work, we study the robustness of the widely used join-the-shortest-queue scheduling scheme under randomly delayed access to queue backlog information. We consider different information update scenarios and show that as long as the expected information delays are finite, the system is stable and the expected backlogs in the system are also finite. Through simulations, we demonstrate robustness of join-the-shortest queue scheduling and we discuss some interesting observation.
更多查看译文
关键词
join-the-shortest queue scheduling,communication delay,queueing networks,randomly delayed access,backlog information
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络