Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net

The recursive dual-net is a newly proposed interconnection network for of massive parallel computers. The recursive dual-net is based on a recursive dual-construction of a base network. A $\bm{k}$-level dual-construction for $\bm{k>0}$ creates a network containing $\bm{(2n_0)^{2^k}/2}$ nodes with node-degree $\bm{d_0+k}$, where $\bm{n_0}$ and $\bm{d_0}$ are the number of nodes and the node-degree of the base network, respectively. The recursive dual-net is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. Disjoint-paths routing and fault-tolerant routing are fundamental and critical issues for the performance of an interconnection network. In this paper, we propose efficient algorithms for disjoint-paths and fault-tolerant routings on the recursive dual-net.