Multicast routing algorithms for 3-stage Clos ATM switching networks

The author investigates the general problem of multicast routing in the three-stage Clos switching network, with point-to-point routing as a special case. An optimal and a heuristic algorithm have been designed and tested. The results show that the heuristic algorithm can find multicast routes that are close to optimal within a response time that is significantly lower than that of the optimal algorithm. Further analysis of the experimental data suggests a hybrid implementation in which the optimal and heuristic algorithms are run in parallel with a set time limit. The algorithms and the discussion provided also apply to other networks, including wide-area communication networks, with a two-hop structure