Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
Author:
Affiliation:
1. Massachusetts Institute of Technology Operations Research Center, Cambridge, Massachusetts, 02139
2. Massachusetts Institute of Technology Sloan School of Management and Operations Research Center, Cambridge, Massachusetts 02139
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Management Science and Operations Research,Computer Science Applications,General Mathematics
Reference23 articles.
1. Small Random perturbation of dynamical systems with reflecting boundary
2. State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems
3. Randomized longest-queue-first scheduling for large-scale buffered systems
4. Wiley Series in Probability and Statistics;Ethier SN,2005
Cited by 78 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The non-preemptive ‘Join the Shortest Queue–Serve the Longest Queue’ service system with or without switch-over times;Mathematical Methods of Operations Research;2024-02-26
2. Cost-aware defense for parallel server systems against reliability and security failures;Automatica;2024-02
3. Large-System Insensitivity of Zero-Waiting Load Balancing Algorithms;Stochastic Systems;2024-01-22
4. SOLT: A Software-Defined Load Balancing Algorithm for Time Sensitive Networks;GLOBECOM 2023 - 2023 IEEE Global Communications Conference;2023-12-04
5. Optimal Routing to Parallel Servers in Heavy Traffic;Operations Research;2023-08-16
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3