Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks

This paper compares three dynamic multipoint routing algorithms for wide-area packet switched networks like asynchronous transfer mode (ATM) networks. The three algorithms compared are the greedy algorithm, the source rooted shortest path (SP) algorithm and the geographic spread dynamic multicast (GSDM) routing algorithm. We present simulation results over random graphs that demonstrate the performance of these algorithms. The algorithms are evaluated via a series of multiple simulations in terms of the number of packet copies per node and their (in)efficiency. A near optimal Steiner tree heuristic algorithm called the KMB algorithm is used as a measure of the (in)efficiency of the algorithms