Analysis of the performance of dynamic multicast routing algorithms

In this article, three new dynamic, low delay multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree (SOP T), Topology based Optimisation Tree (TOPT) and Minimum Diameter Tree (MDT) . A simulation analysis is presented showing the various performance aspect s of the algorithms, in which a comparison is made with the greedy and Core Based Tree (CBT) techniques. The effects of the tree source location on dy namic membership change are also examined. The simulations demonstrate that the SOFT algorithm achieves a significant improvement in terms of delay an d link usage when compared to the CBT, and the greedy algorithm. (C) 1999 E lsevier Science B.V. All rights reserved.