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
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Concrete Math
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Broadcast Ring Sandwich Networks
IEEE Transactions on Computers
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Nonblocking WDM Multicast Switching Networks
IEEE Transactions on Parallel and Distributed Systems
Nonblocking k-Fold Multicast Networks
IEEE Transactions on Parallel and Distributed Systems
Nonblocking k-Fold Multicast Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Nonblocking WDM Multicast Switching Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Policy-hiding access control in open environment
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
IEEE/ACM Transactions on Networking (TON)
Performance of CLOS multicast networks
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
| Hi-index | 14.98 |
Efficient interconnection networks are critical in providing low latency, high bandwidth communication in parallel and distributed computing systems with hundreds or thousands of processors. The well-known Clos network or $v(m,n,r)$ network can be extended to provide full one-to-many or multicast capability. In this paper, we consider several typical routing control strategies for Clos-type nonblocking multicast networks and derive the necessary conditions under which this type of network is nonblocking for arbitrary multicast assignments in the strict sense as well as under these control strategies. The necessary conditions obtained are represented as the number of middle stage switches $m \geq \Theta\left(n {\frac{\log r}{\log \log r}} \right )$. These results match the sufficient nonblocking condition for the currently best available explicitly constructed, constant stage nonblocking multicast network [8], [9], and provide a basis for the optimal design of this type of multicast network.