BCCC Disjoint Path Construction Algorithm and Fault-Tolerant Routing Algorithm under Restricted Connectivity
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...
Main Authors: | Jialiang Lu, Xiaoyu Du, Huiping Li, Zhijie Han |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-12-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/15/12/481 |
Similar Items
-
The t/k-Diagnosability and a t/k Diagnosis Algorithm of the Data Center Network BCCC under the MM* Model
by: Jialiang Lu, et al.
Published: (2022-12-01) -
Many-to-Many Disjoint Paths in Augmented Cubes With Exponential Fault Edges
by: Mingzu Zhang, et al.
Published: (2021-01-01) -
On the Path Cover Number of Connected Quasi-Claw-Free Graphs
by: Huiqing Liu, et al.
Published: (2021-01-01) -
Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements
by: Jung-Heum Park
Published: (2022-01-01) -
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
by: Meng Wei
Published: (2021-02-01)