A new multiple-multicast algorithm in a class of self-routable switching network

In this paper, we propose a new algorithm for multiple-multicast in a class of self-routable multistage interconnection networks (MINs) (Omega, baseline and so on). The new algorithm is based on some admissible permutations, which can be realized in the class of MINs. Any multiple-multicast can be transmitted through the network in two passes; the number of passes is optimal. For sufficiently long messages, the algorithm is very efficient.