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.

翻译：脱节路径被定义为源点和目的地节点之间的路径, 任何两个路径的中间节点都是脱节的。 它们有助于断层容忍路径和确保网络的信息分布。 提议了几项研究论文以解决为诸如超立方体、 通用超立方体、 Mesh、 Torus、 Gaussian、 Eisenstein- Jacobi 等各种互连网络寻找脱节路径的问题。 在这项研究中, 我们开发了一个通用的实时过错容忍算法, 用于构建对称网络的所有节点到节点断脱节路径, 其中所有路径都最短或最短。 此外, 我们还模拟了不同网络上的拟议算法。 Cube- 连接- Cycle 中未解决问题的方法在模拟结果中给出 。