Component connectivity of the data center network DCell

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.