ABSTRACT
In parallel and distributed systems, interconnection networks and data center networks are two crucial networks. They are also crucial parts of high-performance computing and cloud computing services. With the rapid growth of high-performance computing and cloud computing, both networks are growing in size. At the same time, vertex faults are unavoidable. In computer/communication networks, unicast refers to one-to-one communication between the source vertex and the destination vertex. Fault-tolerant routing of vertices in networks is an important problem that has been widely discussed. In this paper, for a class of recursive networks with less than -restrict connectivity fault vertices and each fault-free vertex having at least fault-free neighbors, we provide a fault-tolerant unicast path design algorithm in this study. The algorithm’s correctness is then demonstrated and its time complexity is analyzed. In addition, the results obtained can be used for unknown and known networks, including the dragonfly network, DCell, and generalized DCell.
CO EDITOR-IN-CHIEF:
ASSOCIATE EDITOR:
Nomenclature
CGRN | = | complete graph-based recursive network |
DCN | = | data center network |
= | the degree of vertex in | |
= | a subgraph of induced by | |
= | the subgraph of by deleting the vertex of | |
IN | = | interconnection network |
= | graph ’s connectivity | |
= | graph ’s -restricted connectivity | |
MIN | = | multiprocessor interconnection network |
= | the set of neighbors of vertex | |
= | be the set of neighbors of vertex subset | |
= | -ary -cube | |
SIN | = | switch interconnection network |
= | a path of length | |
= | the minimum degree of | |
= | the maximum degree of | |
= | the set of the positive integers |
Disclosure statement
No potential conflict of interest was reported by the author(s).