An Efficient Construction of Node Disjoint Paths in OTIS Networks

Abstract

Abstract.We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint paths in any OTIS network with a connected basis network is presented, which is independent of any construction of node disjoint paths in its basis network. This general construction is effective and efficient, which can obtain desirable node disjoint paths of length at most D+4 in O(Δ 2 +Δf(N 1/2 )) time if the basis network of size n has a shortest routing algorithm of time complexity O(f(n)), where D, Δ and N are, respectively, the diameter, the degree and the size of the OTIS network. Further, for OTIS networks with maximally fault tolerant basis networks, we give an improved version of a conventional construction of node disjoint paths by incorporating the above general construction. Finally, we show the effectiveness and efficiency of these constructions applied to OTIS-Hypercubes.

Constructing Node-Disjoint Paths in Biswapped Networks (BSNs)

“…From this algorithm, we know that the number of node-disjoint paths between two arbitrary distinct nodes in a BSN attains the maximum, namely, the minimum degree of these two nodes in the BSN. This denotes that the BSN has better fault tolerance than the corresponding OTIS network [3], and verifies the importance of node symmetry properties of the networks for both algorithmic efficiency and good fault-tolerance emphasized by many researchers [1,7]. On the other hand, the proposed construction algorithm, and the obtained conclusion about the maximal connectivity are applicable to a wide array of interconnection networks in the form of BSNs built of specific connected basis networks.…”