Multicasting for multimedia applications
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Steiner's problem in graphs: heuristic methods
Discrete Applied Mathematics - Special issue: combinatorial methods in VLSI
Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Degree-constrained multicasting in point-to-point networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
ARIES: A REARRANGEABLE INEXPENSIVE EDGE-BASED ON-LINE STEINER ALGORITHM
ARIES: A REARRANGEABLE INEXPENSIVE EDGE-BASED ON-LINE STEINER ALGORITHM
Restricted dynamic Steiner trees for scalable multicast in datagram networks
IEEE/ACM Transactions on Networking (TON)
New Distributed Multicast Routing and Its Performance Evaluation
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
| Hi-index | 0.00 |
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accumulated damage to the multicast tree within local regions of the tree as nodes are added and deleted, and triggering a rearrangement when the number of changes within a connected subtree crosses a set threshold. We derive an analytical upper-bound on the competitiveness of the algorithm. We also present simulation results to compare the averagecase perforinance of the algorithm with two other known algorithms for the dynamic multicast problem, GREEDY and EBA (Edge-Bounded Algorithm). Our results show that ARIES provides the best balance among competitiveness, computational effort, and changes in the multicast tree after each update.