Issue No. 12 - December (1999 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.819951
<p><b>Abstract</b>—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 <tmath>$O(n\log^2 n)$</tmath> logic gates, and has <tmath>$O(\log^2 n)$</tmath> depth and <tmath>$O(\log^2 n)$</tmath> 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 <tmath>$O(n\log n)$</tmath>.</p>
Multicast network, self-routing, binary radix sorting network, reverse banyan network, compact routing, recursive construction.
Y. Yang and J. Wang, "A New Self-Routing Multicast Network," in IEEE Transactions on Parallel & Distributed Systems, vol. 10, no. , pp. 1299-1316, 1999.