Analysis of Performance of Dynamic Multicast Routing Algorithms

Details Analysis of Performance of Dynamic Multicast Routing Algorithms Analysis of Performance of Dynamic Multicast Routing Algorithms

1998-09-24

arxiv.org/abs/cs/9809102v1

ICCCN`98;IEEE 7th International Conference onComputer Communications and Networks, lafayett Louisiana, U.S.A, Oct. 1998

Computer Science

Networking and Internet Architecture

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Analysis of Performance of Dynamic Multicast Routing Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Analysis of Performance of Dynamic Multicast Routing Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of Performance of Dynamic Multicast Routing Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708965