Optimization of multicast logd(N, m, p)switching networks

Authors:
Grzegorz Danilewicz
Affiliations:
Poznan University of Technology, Poznan, Poland
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 3
Cited 0

Multicast communication: protocols and applications

Multicast communication: protocols and applications
Banyan networks for partitioning multiprocessor systems

ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
The Mathematical Theory of Nonblocking Switching Networks (Series on Applied Mathematics)

The Mathematical Theory of Nonblocking Switching Networks (Series on Applied Mathematics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, widesense 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.