Analysis of Performance of Dynamic Multicast Routing Algorithms

TL;DR

This paper introduces three new dynamic multicast routing algorithms based on greedy trees, compares their performance with existing techniques through simulations, and examines the impact of source location on dynamic membership changes.

Contribution

It proposes three novel algorithms for dynamic multicast routing and provides a comprehensive simulation-based performance comparison with existing methods.

Findings

Source Optimised Tree reduces delay and link usage

Performance improvements over greedy and core based trees

Source location affects dynamic membership performance

Abstract

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.