Sciweavers

Share
INFOCOM
1996
IEEE

ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm

11 years 5 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
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 average-case performance 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 e ort, and changes in the multicast tree after each update.
Fred Bauer, Anujan Varma
Added 07 Aug 2010
Updated 07 Aug 2010
Type Conference
Year 1996
Where INFOCOM
Authors Fred Bauer, Anujan Varma
Comments (0)
books