Super edge-connectivity and matching preclusion of data center networks

Publication date 1 August 2019

Full work available at URL https://arxiv.org/abs/1807.05224, https://dmtcs.episciences.org/5652/pdf

matching preclusion restricted edge-connectivity conditional matching preclusion data center network $(n,k)$-star graph

Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)

Abstract: Edge-connectivity is a classic measure for reliability of a network in the presence of edge failures.

k

-restricted edge-connectivity is one of the refined indicators for fault tolerance of large networks. Matching preclusion and conditional matching preclusion are two important measures for the robustness of networks in edge fault scenario. In this paper, we show that the DCell network

D_{k, n}

is super-

l a m b d a

for

k g e q 2

and

n g e q 2

, super-

l a m b d a_{2}

for

k g e q 3

and

n g e q 2

, or

k = 2

and

n = 2

, and super-

l a m b d a_{3}

for

k g e q 4

and

n g e q 3

. Moreover, as an application of

k

-restricted edge-connectivity, we study the matching preclusion number and conditional matching preclusion number, and characterize the corresponding optimal solutions of

D_{k, n}

. In particular, we have shown that

D_{1, n}

is isomorphic to the

(n, k)

-star graph

S_{n + 1, 2}

for

n g e q 2

.

Recommendations

Cited in

(10)

This page was built for publication: Super edge-connectivity and matching preclusion of data center networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226847)