Dcell

Author:

Guo Chuanxiong1,Wu Haitao1,Tan Kun1,Shi Lei2,Zhang Yongguang1,Lu Songwu3

Affiliation:

1. Microsoft Research Asia, Beijing, China

2. Tsinghua University, Beijing, China

3. UCLA, Los Angeles, CA, USA

Abstract

A fundamental challenge in data center networking is how to efficiently interconnect an exponentially increasing number of servers. This paper presents DCell, a novel network structure that has many desirable features for data center networking. DCell is a recursively defined structure, in which a high-level DCell is constructed from many low-level DCells and DCells at the same level are fully connected with one another. DCell scales doubly exponentially as the node degree increases. DCell is fault tolerant since it does not have single point of failure and its distributed fault-tolerant routing protocol performs near shortest-path routing even in the presence of severe link or node failures. DCell also provides higher network capacity than the traditional tree-based structure for various types of services. Furthermore, DCell can be incrementally expanded and a partial DCell provides the same appealing features. Results from theoretical analysis, simulations, and experiments show that DCell is a viable interconnection structure for data centers.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Software

Reference23 articles.

1. A group-theoretic model for symmetric interconnection networks

2. S. Arnold. Google Version 2.0: The Calculating Predator 2007. Infonortics Ltd. S. Arnold. Google Version 2.0: The Calculating Predator 2007. Infonortics Ltd.

3. Web search for a planet: the google cluster architecture

4. A. Carter. Do It Green: Media Interview with Michael Manos 2007. http://edge.technet.com/Media/Doing-IT-Green/. A. Carter. Do It Green: Media Interview with Michael Manos 2007. http://edge.technet.com/Media/Doing-IT-Green/.

Cited by 586 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An expandable and cost-effective data center network;Journal of Network and Computer Applications;2024-12

2. The number of spanning trees for Sierpiński graphs and data center networks;Information and Computation;2024-10

3. Two-disjoint-cycle-cover pancyclicity of data center networks;Applied Mathematics and Computation;2024-08

4. Investigating Data Center Network Protocols;Proceedings of the Applied Networking Research Workshop on zzz;2024-07-20

5. SARS: Towards minimizing average Coflow Completion Time in MapReduce systems;Computer Networks;2024-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3