Optimal Round-Robin Routing to Parallel Servers in Heavy Traffic
ACM SIGMETRICS Performance Evaluation Review(2022)
摘要
We study a system with heterogeneous parallel servers. Upon arrival, a job is routed to the queue of one of the servers. We establish the diffusion limit for the round-robin (RR) policy, and show that with properly chosen parameters, it achieves the optimal performance asymptotically over all blind routing policies. Analysis of the diffusion limit yields a number of insights into the performance of the optimal RR policies.
更多查看译文
关键词
parallel servers,round-robin
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要