Analysis of the performance of dynamic multicast routing algorithms

Authors:
J Cho;J Breen
Affiliations:
School of Computer Science and Software Engineering, Monash University, Melbourne, Australia;School of Computer Science and Software Engineering, Monash University, Melbourne, Australia
Venue:
Computer Communications
Year:
1999

Citing 8
Cited 3

Multicast routing in datagram internetworks and extended LANs

ACM Transactions on Computer Systems (TOCS)
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Efficient solutions to multicast routing in communication networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
Center selection and migration for wide-area multicast routing

Journal of High Speed Networks
Mechanisms for broadcast and selective broadcast

Mechanisms for broadcast and selective broadcast
Multicast routing with end-to-end delay and delay variation constraints

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

RAD: Recipient-anonymous data delivery based on public routing proxies

Computer Networks: The International Journal of Computer and Telecommunications Networking
Exploiting the temporal dimension in QoS-aware multicast routing

Computer Communications
A routing algorithm for dynamic multicast trees with end-to-end path length control

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this article, three new dynamic, low delay multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree (SOPT), Topology based Optimisation Tree (TOPT) and Minimum Diameter Tree (MDT). A simulation analysis is presented showing the various performance aspects 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 dynamic membership change are also examined. The simulations demonstrate that the SOPT algorithm achieves a significant improvement in terms of delay and link usage when compared to the CBT, and the greedy algorithm.