The structure connectivity of Data Center Networks
Lina Ba, Heping Zhang

TL;DR
This paper calculates the structure connectivity of data center networks, specifically DCell and BCDC networks, with respect to common subgraph structures, providing formulas for fault-tolerance analysis.
Contribution
It introduces exact formulas for the structure and substructure connectivity of DCell and BCDC networks concerning various subgraphs, advancing fault-tolerance understanding.
Findings
Derived formulas for D_{m,n} with star and complete subgraphs.
Computed structure connectivity for B_n with specific subgraphs.
Enhanced understanding of fault-tolerance in data center network topologies.
Abstract
Last decade, numerous giant data center networks are built to provide increasingly fashionable web applications. For two integers and , the -dimensional DCell network with -port switches and -dimensional BCDC network have been proposed. Connectivity is a basic parameter to measure fault-tolerance of networks. As generalizations of connectivity, structure (substructure) connectivity was recently proposed. Let and be two connected graphs. Let be a set whose elements are subgraphs of , and every member of is isomorphic to (resp. a connected subgraph of ). Then -structure connectivity (resp. -substructure connectivity ) of is the size of a smallest set of such that the rest of is disconnected or the singleton when removing .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Software-Defined Networks and 5G · Carbon and Quantum Dots Applications
