This paper deals with non-blocking properties of multicast three-stage interconnection networks. The necessary and suflcient condition for a strictly non blocking three-stage network is found and demonstrated. This condition represents a real innovative result with respect to those already available in literature that only refer to sufjicient bounds. Moreover, it is also demonstrated that, in the worst case of unrestricted fan-out and with a simple assumption on the path selection algorithm, the complexity of a NxN multicast network can be limited to O(p '). Such complexity is lower than that relevant to a crossbar network of the same size.
Non-blocking multicast three-stage interconnection networks / Listanti, Marco; L., Veltri. - Unico:(1999), pp. 1401-1405. (Intervento presentato al convegno Globecom 1999 tenutosi a Rio de Janeiro (Br) nel December 1999) [10.1109/GLOCOM.1999.830006].