Structure connectivity of data center networks

DOI10.1016/J.AMC.2023.128022arXiv2212.13003OpenAlexW4365506120MaRDI QIDQ6160617FDOQ6160617

Heping Zhang, Li'Na Ba

Publication date: 26 June 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: Last decade, numerous giant data center networks are built to provide increasingly fashionable web applications. For two integers $mgeq0$ and $ngeq2$, the $m$-dimensional DCell network with $n$-port switches $D_{m,n}$ and $n$-dimensional BCDC network $B_n$ 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 $G$ and $H$ be two connected graphs. Let $mathcalF$ be a set whose elements are subgraphs of $G$, and every member of $mathcalF$ is isomorphic to $H$ (resp. a connected subgraph of $H$). Then $H$-structure connectivity $kappa(G;H)$ (resp. $H$-substructure connectivity $kapp{a}^s(G;H)$) of $G$ is the size of a smallest set of $mathcalF$ such that the rest of $G$ is disconnected or the singleton when removing $mathcalF$. Then it is meaningful to calculate the structure connectivity of data center networks on some common structures, such as star $K_{1,t}$, path $P_k$, cycle $C_k$, complete graph $K_s$ and so on. In this paper, we obtain that $kappa(D_{m,n};K_{1,t})=kapp{a}^s(D_{m,n};K_{1,t})=lceilfracn-11+tceil+m$ for $1leqtleqm+n-2$ and $kappa(D_{m,n};K_s)=lceilfracn-1sceil+m$ for $3leqsleqn-1$ by analyzing the structural properties of $D_{m,n}$. We also compute $kappa(B_n;H)$ and $kapp{a}^s(B_n;H)$ for $Hin{K}_{1,t},P_k,C_k|1leqtleq2n-3,6leqkleq2n-1$ and $ngeq5$ by using $g$-extra connectivity of $B_n$.

Full work available at URL: https://arxiv.org/abs/2212.13003

zbMATH Keywords

fault-tolerancestructure connectivityDCellBCDC

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Graph theory (05Cxx) Computer system organization (68Mxx)

Cites Work

• The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
• On the extraconnectivity of graphs
• The restricted \(h\)-connectivity of the data center network DCell
• Conditional connectivity
• The Generalized Connectivity of Data Center Networks
• On computing a conditional edge-connectivity of a graph
• Structure connectivity and substructure connectivity of hypercubes
• Connectivity of the crossed cube
• Structure connectivity and substructure connectivity of bubble-sort star graph networks
• Structure connectivity and substructure connectivity of star graphs
• Structure fault tolerance of hypercubes and folded hypercubes
• Structure connectivity and substructure connectivity of wheel networks
• Structure and substructure connectivity of alternating group graphs
• Structure and Substructure Connectivity of Hypercube-Like Networks

Cited In (5)

• Connection and power in centralized exchange networks
• The restricted \(h\)-connectivity of the data center network DCell
• Two-disjoint-cycle-cover pancyclicity of data center networks
• A CLASS OF DATA-CENTER NETWORK MODELS OFFERING SYMMETRY, SCALABILITY, AND RELIABILITY
• How to Allocate Network Centers

This page was built for publication: Structure connectivity of data center networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160617)