  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.
