This Article 
 Bibliographic References 
 Add to: 
A New Self-Routing Multicast Network
December 1999 (vol. 10 no. 12)
pp. 1299-1316

Abstract—In this paper, we propose a design for a new self-routing multicast network which can realize arbitrary multicast assignments between its inputs and outputs without any blocking. The network design uses a recursive decomposition approach and is based on the binary radix sorting concept. All functional components of the network are reverse banyan networks. Specifically, the new multicast network is recursively constructed by cascading a binary splitting network and two half-size multicast networks. The binary splitting network, in turn, consists of two recursively constructed reverse banyan networks. The first reverse banyan network serves as a scatter network and the second reverse banyan network serves as a quasisorting network. The advantage of this approach is to provide a way to self-route multicast assignments through the network and a possibility to reuse part of network to reduce the network cost. The new multicast network we design is compared favorably with the previously proposed multicast networks. It uses $O(n\log^2 n)$ logic gates, and has $O(\log^2 n)$ depth and $O(\log^2 n)$ routing time where the unit of time is a gate delay. By reusing part of the network, the feedback implementation of the network can further reduce the network cost to $O(n\log n)$.

[1] D.K. Panda, “Issues in Designing Efficient and Practical Algorithms for Collective Communication on Wormhole-Routed Systems,” ICPP'95 Workshop Challenges for Parallel Processing, pp. 8-15, 1995.
[2] L.M. Ni, “Should Scalable Parallel Computers Support Efficient Hardware Multicast?” ICPP'95 Workshop Challenges for Parallel Processing, pp. 2-7, 1995.
[3] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Los Alamitos, Calif.: IEEE CS Press, 1997.
[4] D. Nassimi and S. Sahni, “Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network,” J. ACM, vol. 29, no. 3, pp. 642-667, July 1982.
[5] J. Turner, “Design of a Broadcast Packet Switching Network,” IEEE Trans. Comm., vol. 36, no. 6, pp. 734-743, 1988.
[6] T.T. Lee, “Nonblocking Copy Networks for Multicast Packet Switching,” IEEE J. Selected Areas in Comm., vol. 6, no. 9, pp. 1,455-1,467, 1988.
[7] C.-T. Lea, “A New Broadcast Switching Network,” IEEE Trans. Comm., vol. 36, no. 10, pp. 1,128-1,137, 1988.
[8] Y. Yang, G.M. Masson, “Nonblocking Broadcast Switching Networks,” IEEE Trans. Computers, vol. 40, pp. 1,005-1,015, 1991.
[9] C. Lee and A.Y. Oruç, “Design of Efficient and Easily Routable Generalized Connectors,” IEEE Trans. Comm., vol. 43, nos. 2,3, 4, pp. 646-650, 1995.
[10] Y. Yang and G.M. Masson, “Broadcast Ring Sandwich Networks,” IEEE Trans. Computers, vol. 44, no. 10, pp. 1,169-1,180, Oct. 1995.
[11] D.M. Koppelman and A.Y. Oruç, “A Self-Routing Permutation Network,” J. Parallel and Distributed Computing, vol. 10, no. 10, pp. 140-151, Oct. 1990.
[12] C.Y. Jan and A.Y. Oruç, “Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network,” IEEE Trans. Computers, vol. 42, no. 12, pp. 1,469-1,479, Dec. 1993.
[13] S. Lee and M. Lu, “New Self-Routing Permutation Networks,” IEEE Trans. Computers, Vol. 43, no. 11, pp. 1,319-1,323, Nov. 1994.
[14] W.-J. Cheng and W.-T. Chen, “A New Self-Routing Permutation Network,” IEEE Trans. Computers, vol. 45, no. 5, pp. 630-636, May 1996.
[15] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.

Index Terms:
Multicast network, self-routing, binary radix sorting network, reverse banyan network, compact routing, recursive construction.
Yuanyuan Yang, Jianchao Wang, "A New Self-Routing Multicast Network," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 12, pp. 1299-1316, Dec. 1999, doi:10.1109/71.819951
Usage of this product signifies your acceptance of the Terms of Use.