IEEE Transactions on Network Science and Engineering · 2022 · 27 citations · 36 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureComputer NetworksInterconnection NetworksHypercube NetworksNetwork TopologyCrossed CubeData Center NetworkData Center Network ArchitectureData Center Network DesignData Center Network TopologyDatacenter InterconnectsInterconnection Network Topology DesignRecursive Structure
With the increasing demand of data center interconnection in the network cloud era, data center networks (DCNs) play key roles in computing and communication, becoming the center of a great deal of resources and business. Therefore, how to design a DCN with good performance has been a significant issue in networks. The hypercube is a popular interconnection network topology with low diameter, symmetry and recursive structure, and scalability. As a variant of the hypercube, the crossed cube not only retains the excellent properties of the hypercube, but also performs better in terms of Hamiltonian-connectivity, embeddability, diameter, etc. In this paper, we first propose a novel and server-centric DCN, called CSDC, which is based on the crossed cube network. The performance of CSDC can be characterized by the properties of its logical structure, so we then give its logical structure <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$C_{n}$</tex-math></inline-formula> , and determine the connectivity and edge-connectivity of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$C_{n}$</tex-math></inline-formula> . Furthermore, we explore the fault-tolerant paths and disjoint paths between any two distinct nodes in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$C_{n}$</tex-math></inline-formula> , and obtain the diameter of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$C_{n}$</tex-math></inline-formula> . Moreover, we propose a method to construct two completely independent spanning trees (CISTs) in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$C_{n}$</tex-math></inline-formula> . Extensive evaluations demonstrate that CSDC is a magnetic DCN for building large-scale data centers.
36
Sanjay Ghemawat · Communications of the ACM · 2008 · 18.5K citations · Full text
Fay W. Chang, Sanjay Ghemawat, Wilson C. Hsieh et al. · ACM Transactions on Computer Systems · 2008 · 3.4K citations
Michael Isard, Mihai Budiu, Yuan Yu et al. · 2007 · 2.5K citations
A scalable, commodity data center network architecture
Mohammad Al-Fares, Alexander Loukissas, Amin Vahdat · 2008 · 1.7K citations · Full text
Sanjay Ghemawat, Howard Gobioff, Shun-Tak A. Leung · 2003 · 1.4K citations