The k-restricted edge-connectivity of the data center network DCell

Xuemei Liu and Jixiang Meng

Applied Mathematics and Computation, 2021, vol. 396, issue C

Abstract: For any integers m≥0 and n≥2, we use Dm,n to denote the m-dimensional DCell with n-port switches. For a simple graph G=(V,E), an edge subset S⊂E(G) is said to be a λk-cut of G, if G−S is disconnected and each component of G−S has at least k vertices. The k-restricted edge-connectivity of G, denoted by λk(G), is the minimum cardinality of all λk-cuts of G. We prove that λk(Dm,n)=k(m+n−k) for m≥n≥2 and 2≤k≤n,λk(Dm,n)=mn for n>m≥2 and m≤k≤n and λk(Dm,n)=k(m+n−k) for n>m≥2 and 2≤kKeywords: Data center networks; DCell; λk-cut; k-restricted edge-connectivity (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320308948
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:396:y:2021:i:c:s0096300320308948

DOI: 10.1016/j.amc.2020.125941

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 ().