 Structure connectivity of data center networksLina Ba and Heping Zhang Applied Mathematics and Computation, 2023, vol. 451, issue C Abstract: Last decade, numerous giant data center networks are built to provide increasingly fashionable web applications. For two integers m≥0 and n≥2, the m-dimensional DCell network with n-port switches Dm,n and n-dimensional BCDC network Bn have been proposed. As a generalization of connectivity, structure (substructure) connectivity was recently proposed. Let G and H be two connected graphs. Let F be a set whose elements are subgraphs of G, and every member of F is isomorphic to H (resp. a connected subgraph of H). Then H-structure connectivity κ(G;H) (resp. H-substructure connectivity κs(G;H)) of G is the size of a smallest set of F such that G−F is disconnected or the singleton. Then it is meaningful to calculate the structure connectivity of data center networks on some common structures, such as star K1,t, path Pk, cycle Ck, complete graph Ks and so on. In this paper, we obtain that κ(Dm,n;K1,t)=κs(Dm,n;K1,t)=⌈n−11+t⌉+m for 1≤t≤m+n−2 and κ(Dm,n;Ks)=⌈n−1s⌉+m for 3≤s≤n−1 by analyzing the structural properties of Dm,n. We also compute κ(Bn;H) and κs(Bn;H) for H∈{K1,t,Pk,Ck|1≤t≤2n−3,6≤k≤2n−1} and n≥5 by using g-extra connectivity of Bn. Keywords: Fault-tolerance; Structure connectivity; DCell; BCDC (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:451:y:2023:i:c:s0096300323001911 DOI: 10.1016/j.amc.2023.128022 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.