Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net

Recursive dual-net (RDN) is a newly proposed interconnection network for massive parallel computers. The RDN is based on recursive dual-construction of a symmetric 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 RDN is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. Node-to-set disjoint-paths routing is fundamental and has many applications for fault-tolerant and secure communication in a network. In this paper, we propose an efficient algorithm for node-to-set disjoint-paths routing on RDN.