Fred Bauer Anujan Varma UCSC-CRL-95-36 July 18, 1995 Computer Engineering...  Home/Search
Context Related
Links: ACM DBLP | ucsc.edu/pub/hsnla...csccrl9536.ps.Z ucsc.edu/pub/tr/ucsccrl9536.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sri.com/people/bauer/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Context of citations to this paper: More
...of dynamic group membership and the corresponding degradation in the quality of the routing tree. An example is the ARIES algorithm [Bauer97] in which a part of the multicast tree is rearranged when it has deteriorated beyond a certain threshold. The deterioration is measured...
Cited by: More
Unknown - (Correct)
Dynamic Proxy Tree-Based Data Dissemination Schemes for.. - Zhang, Cao, Porta (2004) (Correct)
RoamHBA: Maintaining Group Connectivity In Sensor Networks - Qing Fang Jie (2004) (Correct)
Similar documents (at the sentence level):
50.1%: Multicast Routing in Point-to-Point Networks Under Constraints - Bauer (1996) (Correct)
45.9%: ARIES: A Rearrangeable Inexpensive Edge-based On-line Steiner.. - Bauer, Varma (1995) (Correct)
Active bibliography (related documents): More All
0.3: Distributed Degree-Constrained Multicasting in.. - Fred Bauer Anujan (1995) (Correct)
0.3: Distributed Algorithms for Multicast Path Setup in Data Networks - Fred Bauer (1995) (Correct)
0.2: Degree-Constrained Multicasting in Point-to-Point Networks - Bauer, Varma (1995) (Correct)
Similar documents based on text: More All
0.3: A Rearrangeable Algorithm for the Construction of.. - Sriram, Manimaran.. (1999) (Correct)
0.2: Early Simulation Results Aries-1 Satellite Sensor.. - Merton, Huntington (Correct)
0.2: Scalable Internetworking - Garcia-Luna-Aceves, Varma (Correct)
Related documents from co-citation: More All
19: Routing of multipoint connections (context) - Waxman - 1988
16: Multicast routing for multimedia communication - Kompella, Pasquale et al. - 1993
15: Steiner problem in networks: A survey (context) - Winter - 1987
BibTeX entry: (Update)
F. Bauer and A. Varma. "ARIES: A Rearrangeable Inexpensive Edge-based On-line Steiner Algorithm". Technical report, University of California at Santa Cruz, UCSC-CRL-95-36, Jul. 1995. http://citeseer.ist.psu.edu/bauer95aries.html More
@article{ bauer97aries,
author = "Fred Bauer and Anujan Varma",
title = "{ARIES}: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm",
journal = "IEEE Journal of Selected Areas in Communications",
volume = "15",
number = "3",
pages = "382-397",
year = "1997",
url = "citeseer.ist.psu.edu/bauer95aries.html" }
Citations (may not include all citations):335 Routing of multipoint connections (context) - Waxman - 1988 ACM
186 Steiner tree problems (context) - Hwang, Richards - 1992 DBLP
146 Steiner problem in networks: A survey (context) - Winter - 1987 ACM
133 An approximate solution for the Steiner problem in graphs (context) - Takahashi, Matsuyama - 1980
75 Dynamic Steiner tree problem (context) - Imase, Waxman - 1991 DBLP
43 Routing to multiple destinations in computer networks (context) - Bharath-Kumar - 1983
36 Degree-constrained multicasting in point-to-point networks - Bauer, Varma - 1995 ACM DBLP
26 Steiner's problem in graphs: Heuristic methods (context) - Voss - 1992 DBLP
25 Distributed algorithms for multicast path setup in data netw.. - Bauer, Varma - 1995 ACM DBLP
25 Comparison of dynamic multicast routing algorithms for wide-.. (context) - Kadirire - 1995 ACM DBLP
24 An SST-based algorithm for the Steiner problem in graphs (context) - Beasley - 1989
20 How bad is naive multicast routing - Doar, Leslie - 1993
20 Path-distance heuristics for the Steiner problem in undirect.. (context) - Smith, Winter - 1992 DBLP
14 Graph theoretic models for multicast communications (context) - Berry - 1989 DBLP
11 Greedy algorithms for the on-line Steiner tree and generaliz.. (context) - Westbrook, Yan - 1993 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.erg.sri.com/people/bauer/papers.html): More
Distributed Algorithms for Multicast Path Setup in Data Networks - Fred Bauer (1995) (Correct)
ARIES: A Rearrangeable Inexpensive Edge-based On-line Steiner.. - Fred Bauer (1995) (Correct)
Degree-Constrained Multicasting in Point-to-Point Networks - Bauer, Varma (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC