Multicast routing in self-routing multistage networks

The authors present a study on multicast routing algorithms for the self-routing multistage networks. This work is based on the use of the cube concept which consists of a group of outlets reachable in one pass through the network. A multicast connection is decomposed into associated cubes such that each cube can be self-routed through the network. The context of this work is a recursive scheme for multistage network where the outlets are fed back to the inlets through external links. Three routing algorithms are proposed. The emphasis is on evaluating the performance of those algorithms in terms of two metrics. Extensive results from analysis and simulations are given to derive insights into the performance of the proposed routing algorithms.<<ETX>>