Structure connectivity of data center networks

Abstract: Last decade, numerous giant data center networks are built to provide increasingly fashionable web applications. For two integers

m g e q 0

and

n g e q 2

, 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

m a t h c a l F

be a set whose elements are subgraphs of

G

, and every member of

m a t h c a l F

is isomorphic to

H

(resp. a connected subgraph of

H

). Then

H

-structure connectivity

k a p p a (G; H)

(resp.

H

-substructure connectivity

k a p p a^{s} (G; H)

) of

G

is the size of a smallest set of

m a t h c a l F

such that the rest of

G

is disconnected or the singleton when removing

m a t h c a l F

. 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

k a p p a (D_{m, n}; K_{1, t}) = k a p p a^{s} (D_{m, n}; K_{1, t}) = l c e i l f r a c n - 1 1 + t c e i l + m

for

1 l e q t l e q m + n - 2

and

k a p p a (D_{m, n}; K_{s}) = l c e i l f r a c n - 1 s c e i l + m

for

3 l e q s l e q n - 1

by analyzing the structural properties of

D_{m, n}

. We also compute

k a p p a (B_{n}; H)

and

k a p p a^{s} (B_{n}; H)

for

H i n K_{1, t}, P_{k}, C_{k} | 1 l e q t l e q 2 n - 3, 6 l e q k l e q 2 n - 1

and

n g e q 5

by using

g

-extra connectivity of

B_{n}

.

Recommendations

Cites work

Cited in

(5)

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)