Resumen
Connectivity in large-scale data center networks is a critical indicator to evaluate network state. A feasible and performance-guaranteed algorithm enables us to find disjoint paths between network vertices to ensure effective data transfer and to maintain the normal operation of network in case of faulty nodes. As an important data center network, BCube Connected Crossbars (BCCC) has many excellent properties that have been widely studied. In this paper, we first propose a vertex disjoint path algorithm with the time complexity of ??(????)
O
(
n
k
)
in BCCC, where n denotes a switch connected to n servers and k denotes dimension. Then, we prove that the restricted connectivity of ????????(??,??)
B
C
C
C
(
n
,
k
)
. Finally, we present an ??(??????1(??))
O
(
k
n
?
1
(
G
)
)
fault-free algorithm in BCCC, where ??1(??)
?
1
(
G
)
is the restricted connectivity. This algorithm can obtain a fault-free path between any two distinct fault-free vertices under the condition that each vertex has at least one fault-free neighbor in the BCCC and a set of faulty vertices F with |??|