ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm

Abstract

In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large pointto-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 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.

Efficient Heuristic for Minimum Cost Trees Construction in Multi-Groups Multicast

“…This is not desirable especially for applications which require the trees to be ready within a short time period. Also, effective algorithms for dynamic membership multicast [3] proposed in [4], [5] will not work well and may incur race condition if the rearranged tree is not ready before the arrival of next member's addition or removal event.…”

Steiner Tree Based Distributed Multicast Routing in Networks

“…Imase and Waxman have shown that no such finite bound exists if delete requests are also honoured [13]. This was the motivation for developing heuristic ARIES (A Rearrangable Inexpensive Edge-based Steiner algorithm) [4].…”

“…In addition to the Greedy Algorithm (GA) that was originally proposed as a centralized algorithm [33], two distributed algorithms are described: the Predetermined Path Search Algorithm (PPS) [1] and the ARIES (A Rearrangeable Inexpensive Edge-based On-line Steiner Algorithm) [4]. Several other algorithms exist, like Edge-Bounded Algorithm (EBA) [13] and Geographic-Spread Dynamic Multicast Algorithm (GSDM) [16], but only centralized versions of these algorithms are known to us.…”

“…Much work has been done on re-routing unicast connections, but only a few algorithms re-route multicast connections. ARIES [4] makes improvements to the multicast tree while responding to join and leave requests, while our MRR (Multicast Re-Routing algorithm) [23] cannot be classified as either static or dynamic MR algorithm. In addition to MRR, we present here a delay-bounded version of the re-routing algorithm.…”

Online Multicasting in WDM Networks with Shared Light Splitter Bank

“…For each pair of nodes u and v, a random number r u,v is generated, 0 ≤ r u,v < 1. Whether or not u and v are connected is determined by r u,v and the edge probability [19,20] …”