Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows

Published:2024-06-17 Issue: Volume:10 Page:358-368
ISSN:
Container-title:Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Ferreira Miguel Alves¹²³^ORCID,Atre Nirav¹^ORCID,Sherry Justine⁴^ORCID,Sobrinho João Luís²³^ORCID

Affiliation:

1. Carnegie Mellon University, Pittsburgh, United States of America

2. Instituto de Telecomunicações, Lisboa, Portugal

3. Instituto Superior Técnico, Universidade de Lisboa, Lisboa, Portugal

4. Carnegie Mellon University, Pittsburgh, Pennsylvania, United States of America

Funder

Portuguese Fundação para a Ciência e Tecnologia

Publisher

ACM

Reference32 articles.

1. Sincronia

2. A scalable, commodity data center network architecture

3. Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan, Nelson Huang, and Amin Vahdat. 2010. Hedera: Dynamic Flow Scheduling for Data Center Networks. In Proceedings of the USENIX Conference on Networked Systems Design and Implementation, Vol. 10. 89--92.

4. CONGA

5. pFabric

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP