Constructing Node-Disjoint Paths in Biswapped Networks (BSNs)

The recent biswapped networks (BSNs) offer a systematic scheme for building large, scalable, modular, and robust parallel architectures of arbitrary basis networks. BSNs are related to well-known swapped or OTIS networks, and are promising because of their attractive performance attributes including structural symmetry and algorithmic efficiency. In this paper we present an efficient general algorithm for constructing a maximal number of node-disjoint paths between two distinct nodes in a BSN built of an arbitrary basis network and analyze its performance. From this algorithm, we prove that a BSN is maximally fault tolerant if its basis network is connected. As an example application, we show that this algorithm finds the desirable node disjoint paths of length at most 1.5D+3 in 0(log³N) time when applied to an N-node BSN of diameter D built of a cube, and also estimate the average performance concerning the maximum path length by computer simulation.