1 research outputs found
The structure connectivity of Data Center Networks
Last decade, numerous giant data center networks are built to provide
increasingly fashionable web applications. For two integers and
, the -dimensional DCell network with -port switches
and -dimensional BCDC network 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
and be two connected graphs. Let be a set whose elements
are subgraphs of , and every member of is isomorphic to
(resp. a connected subgraph of ). Then -structure connectivity (resp. -substructure connectivity ) of is the size
of a smallest set of such that the rest of is disconnected or
the singleton when removing . Then it is meaningful to calculate
the structure connectivity of data center networks on some common structures,
such as star , path , cycle , complete graph and so
on. In this paper, we obtain that for and for by analyzing
the structural properties of . We also compute and
for and by using -extra connectivity of