An Inherently Stabilizing Distributed Algorithm for All Node-Disjoint Paths in Exchanged Hypercube

ways to deal with lost, damaged or altered messages during delivery. For instance, sending copies of messages over several disjoint paths increases the reliability of communication in systems prone to message omission. Moreover, data can be split into several shares and sent over disjoint paths to increase network throughput. Many topologies such as hypercube, star networks, and their variants have been proposed providing multiple disjoint paths between a pair of endpoints. Exchanged hypercube is a new topology
that is obtained by systematically removing edges from a binary hypercube. Exchanged hypercube topology aims to increase scalability while reducing the number of edges, i.e., reducing relative network cost. This paper presents an inherently stabilizing distributed algorithm to find all node-disjoint paths in an exchanged hypercube network. Due to being inherently stabilizing, the system is immune to transient faults by construction