Component connectivity of the data center network DCell

Xuemei Liu, Jixiang Meng and Eminjan Sabir

Applied Mathematics and Computation, 2023, vol. 444, issue C

Abstract: In a simple non-complete graph G, an h-component cut is a vertex subset S of V(G) such that G−S has at least h components for any positive integer h. The h-component connectivity of G, denoted by κhc(G), is the minimum cardinality of all h-component cuts of G. The m-dimensional DCell network with n-port switches is represented by Dm,n for integers m≥0 and n≥2. In this paper, we determine the h-component connectivity of Dm,n for 2≤h≤5.

Keywords: Data center network DCell; h-component cut; h-component connectivity (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322008906
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:444:y:2023:i:c:s0096300322008906

DOI: 10.1016/j.amc.2022.127822

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().