Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks

Hesham AlMansouri; Zaid Hussain

Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks

Distributed, Parallel, and Cluster Computing 2021-10-07 v2

Authors: Hesham AlMansouri , Zaid Hussain

Abstract

Disjoint paths are defined as paths between the source and destination nodes where the intermediate nodes in any two paths are disjoint. They are helpful in fault-tolerance routing and securing message distribution in the network. Several research papers were proposed to solve the problem of finding disjoint paths for variety of interconnection networks such as Hypercube, Generalized Hypercube, Mesh, Torus, Gaussian, Eisenstein-Jacobi, and many other topologies. In this research, we have developed a general real-time fault-tolerance algorithm that constructs all node-to-node disjoint paths for symmetric networks where all paths are shortest or close to shortest. In addition, we have simulated the proposed algorithm on different networks. The solution of unsolved problem in Cube-Connected-Cycles is given in the simulation results.

Keywords

shortest path problem distributed optimization fault tolerance

Cite

@article{arxiv.2103.09801,
  title  = {Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks},
  author = {Hesham AlMansouri and Zaid Hussain},
  journal= {arXiv preprint arXiv:2103.09801},
  year   = {2021}
}

Comments

There will be no replacement since maximum flow solves the problem in better way, also the paper contains typos and errors

Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks

Abstract

Keywords

Cite

Comments

Related papers