Optimization of Multicast logd(N, m, p) Switching Networks
Grzegorz Danilewicz · 2009
The general case of multiplane wide-sense nonblocking multicast switching networks which are based on the baseline network are considered in this paper. Up to now, wide-sense nonblocking (WSNB) log2(N, 0, p), log2(N, m, p) and logd(N, 0, p) switching networks have been considered for multicast connections. A control algorithm under which these networks are WSNB is called the variable-size blocking window algorithm. In this paper, the path-searching algorithm is adopted for logd(N, m, p) networks with m extra stages and for general case d ¿ 2. The WSNB multicast conditions for logd(N, m, p) networks are presented (without proofs) and the optimal multicast switching networks are investigated.