Analysis of Performance of Dynamic Multicast Routing Algorithms
<|reference_start|>Analysis of Performance of Dynamic Multicast Routing Algorithms: In this paper, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various performance aspects of the algorithms, in which a comparison is made with the greedy and core based tree techniques. The effects of the tree source location on dynamic membership change are also examined. The simulations demonstrate that the Source Optimised Tree algorithm achieves a significant improvement in terms of delay and link usage when compared to the Core Based Tree, and greedy algorithm.<|reference_end|>
@article{cho1998analysis,
    title={Analysis of Performance of Dynamic Multicast Routing Algorithms},
    author={Jaihyung Cho, James Breen},
    journal={ICCCN`98;IEEE 7th International Conference onComputer
  Communications and Networks, lafayett Louisiana, U.S.A, Oct. 1998},
    year={1998},
    doi={10.1016/S0140-3664(99)00009-2},
    archivePrefix={arXiv},
    eprint={cs/9809102},
    primaryClass={cs.NI}
}