Abstract—In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN can be used as a candidate for the interconnection of supercomputers of the next generation. The RDN is generated by recursively applying dual-construction on a base network. Given a regular and symmetric graph of size n and node-degree d, the dual-construction generates a regular and symmetric graph of size 2n2