Chuanxiong Guo
Haitao Wu
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.
- S. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE trans. Computers, 1989. Google Scholar
Digital Library
- S. Arnold. Google Version 2.0: The Calculating Predator, 2007. Infonortics Ltd.Google Scholar
- L. Barroso, J. Dean, and U. Hölzle. Web Search for a Planet: The Google Cluster Architecture. IEEE Micro, March-April 2003. Google ScholarDigital Library
- A. Carter. Do It Green: Media Interview with Michael Manos, 2007. http://edge.technet.com/Media/Doing-IT-Green/.Google Scholar
- J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI'04, 2004. Google ScholarDigital Library
- J. Duato, S. Yalamanchili, and L. Ni. Interconnection networks: an engineering approach. Morgan Kaufmann, 2003. Google ScholarDigital Library
- F. Chang et. al. Bigtable: A Distributed Storage System for Structured Data. In OSDI'06, 2006. Google ScholarDigital Library
- S. Ghemawat, H. Gobioff, and S. Leung. The Google File System. In ACM SOSP'03, 2003. Google ScholarDigital Library
- T. Hoff. Google Architecture, July 2007. http://highscalability.com/google-architecture.Google Scholar
- Intel. High-Performance 1000BASE-SX and 1000BASE-LX Gigabit Fiber Connections for Servers. http://www.intel.com/network/connectivity/resources/doc_library/data_sheets/pro1000mf_mf-lx.pdf.Google Scholar
- M. Isard, M. Budiu, and Y. Yu. Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks. In ACM EuroSys, 2007. Google ScholarDigital Library
- F. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes. Morgan Kaufmann, 1992. Google ScholarDigital Library
- K. Liszka, J. Antonio, and H. Siegel. Is an Alligator Better Than an Armadillo? IEEE Concurrency, Oct-Dec 1997.Google Scholar
- D. Loguinov, A. Kumar, V. Rai, and S. Ganesh. Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In ACM SIGCOMM, 2003. Google ScholarDigital Library
- J. Moy. OSPF Version 2, April 1998. RFC 2328.Google Scholar
- L. Ni and P. McKinley. A Survey of Wormhole Routing Techniques in Direct Networks. IEEE Computer, Feb 1993. Google ScholarDigital Library
- B. Parhami. Introduction to Parallel Processing: Algorithms and Architectures. Kluwer Academic, 2002. Google ScholarDigital Library
- Jon Postel. Internet Protocol. RFC 791.Google Scholar
- L. Rabbe. Powering the Yahoo! network, 2006. http://yodel.yahoo.com/2006/11/27/powering-the-yahoo-network/.Google Scholar
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In ACM SIGCOMM'01, 2001. Google ScholarDigital Library
- H. Jay Seigel, W. Nation, C. Kruskal, and L. Napolitando. Using the Multistage Cube Network Topology in Parallel Supercomputers. Proceedings of the IEEE, Dec 1989.Google Scholar
- J. Snyder. Microsoft: Datacenter Growth Defies Moore's Law, 2007. http://www.pcworld.com/article/id,130921/article.html.Google Scholar
- I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM'01, 2001. Google ScholarDigital Library
Index Terms
- Dcell: a scalable and fault-tolerant network structure for data centers
Recommendations
Dcell: a scalable and fault-tolerant network structure for data centers
SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communicationA 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 ...
The restricted h -connectivity of the data center network DCell
Traditional data center networks (DCNs) are faced with many challenges with the development of cloud computing. This fact makes design of new DCNs represented by DCell networks become a hot research topic. For any integers k 0 and n 2 , the k -...
Switch-Centric Data Center Network Structures Based on Hypergraphs and Combinatorial Block Designs
Fat trees are considered suitable structures for data center interconnection networking. Such structures are rigid, and hard to scale up and scale out. A good data center network structure should have high scalability, efficient switch utilization, and ...
Comments