Wide-sense nonblocking networks
SIAM Journal on Discrete Mathematics
Nonblocking Broadcast Switching Networks
IEEE Transactions on Computers
Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
A Class of Interconnection Networks for Multicasting
IEEE Transactions on Computers
Efficient Broadcast and Multicast on Multistage Interconnection Networks Using Multiport Encoding
IEEE Transactions on Parallel and Distributed Systems
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
The Necessary Conditions for Clos-Type Nonblocking Multicast Networks
IEEE Transactions on Computers
Asynchronous Tree-Based Multicasting in Wormhole-Switched MINs
IEEE Transactions on Parallel and Distributed Systems
A New Self-Routing Multicast Network
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Optimal Software Multicast in Wormhole-Routed Multistage Networks
IEEE Transactions on Parallel and Distributed Systems
A Hardware Multicast Routing Algorithm for Two-Dimensional Meshes
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
| Hi-index | 0.00 |
Multicast communication involves transmitting information from a single source to multiple destinations, and is a requirement in high-performance networks. Current trends in networking applications indicate an increasing demand in future networks for multicast capability. Many multicast applications require not only multicast capability but also predictable communication performance, such as guaranteed multicast latency and bandwidth. In this paper, we present a design for a nonblocking k-fold multicast network, in which any destination node can be involved in up to k simultaneous multicast connections in a nonblocking manner. We also develop an efficient routing algorithm for the network. As can be seen, a k-fold multicast network has significantly lower network cost than that of k copies of 1-fold multicast networks and is a costeffective choice for supporting arbitrary multicast communication.