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

TL;DR

This paper introduces a real-time algorithm for finding all shortest or near-shortest node-to-node disjoint paths in symmetric networks, enhancing fault-tolerance and message security.

Contribution

It presents a novel general algorithm capable of constructing all disjoint paths in symmetric networks, including solutions for previously unsolved cases like Cube-Connected-Cycles.

Findings

Successfully constructed all disjoint paths in various network topologies.

Provided solutions for the previously unsolved Cube-Connected-Cycles problem.

Validated the algorithm through simulations on different network types.

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.