Fred Bauer and Anujan Varma Computer Engineering Department University of...  Home/Search
Context Related
| ucsc.edu/pub/hsnla...dglobecom95.ps.Z sri.com/pub/ITAD/b...dglobecom95.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) From: sri.com/people/bauer/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, can be modeled as the NP-complete Steiner problem in networks. In this paper, we introduce and evaluate two distributed algorithms for finding multicast trees in point-to-point data networks. These algorithms are based on two centralized Steiner heuristics, the shortest path heuristic (SPH) and the Kruskal-based shortest path heuristic (K-SPH), and have the advantage that only the... (Update)
Context of citations to this paper: More
...some dealing with pure tree cost minimization and others dealing with both cost minimization and QoS constraints, have been proposed. In [2] distributed SPH (shortest path heuristic) and K SPH (Kruskal type SPH) heuristics have been described that deal only with the...
.... and [16] Consequently, a number of good, inexpensive heuristics for the Steiner problem have been proposed and reviewed extensively [3], 16] 7] There have also been attempts to create multicast trees without resorting to the Steiner tree based model. Some important...
Cited by: More
Modelling Data-Centric Routing in Wireless Sensor Networks - Krishnamachari, Estrin.. (Correct)
A Case for Scalable Multicast Tree Migration - Chakrabarti, Manimaran (2001) (Correct)
A Rearrangeable Algorithm for the Construction of.. - Sriram, Manimaran.. (1999) (Correct)
Similar documents (at the sentence level):
53.7%: Distributed Algorithms for Multicast Path Setup in Data Networks - Fred Bauer (1995) (Correct)
45.3%: Distributed Degree-Constrained Multicasting in Point-to-Point.. - Bauer, Varma (1995) (Correct)
37.5%: Multicast Routing in Point-to-Point Networks Under Constraints - Bauer (1996) (Correct)
Active bibliography (related documents): More All
0.3: A Survey of Combinatorial Optimization Problems in Multicast .. - Oliveira, Pardalos (2003) (Correct)
0.1: ARIES: A Rearrangeable Inexpensive Edge-based On-line Steiner.. - Fred Bauer (1995) (Correct)
0.1: Benefit of Multicasting in All-Optical Networks - Malli, Zhang, Qiao (1998) (Correct)
Similar documents based on text: More All
0.1: Degree-Constrained Multicasting in Point-to-Point Networks - Bauer, Varma (1995) (Correct)
0.1: Strategic Planning For Research Competitiveness - Hauger (Correct)
0.1: Hardware Implementation of Fair-Queueing Algorithms in ATM.. - Stiliadis, Varma (1997) (Correct)
Related documents from co-citation: More All
17: Multicast routing for multimedia communication - Kompella, Pasquale et al. - 1993
17: Steiner problem in networks: A survey (context) - Winter - 1987
16: An approximate solution for the Steiner problem in graphs (context) - Takahashi, Matsuyama - 1980
BibTeX entry: (Update)
F. Bauer and A. Varma. "Distributed Algorithms for Multicast Path Setup in Data Networks." Technical report, University of California at Santa Cruz, UCSC-CRL-95-10, Aug. 1995. http://citeseer.ist.psu.edu/article/bauer95distributed.html More
@article{ bauer96distributed,
author = "Bauer and Varma",
title = "Distributed Algorithms for Multicast Path Setup in Data Networks",
journal = "IEEETNWKG: IEEE/ACM Transactions on NetworkingIEEE Communications Society, IEEE Computer Society and the ACM with its Special Interest Group on Data Communication (SIGCOMM), ACM Press",
volume = "4",
year = "1996",
url = "citeseer.ist.psu.edu/article/bauer95distributed.html" }
Citations (may not include all citations):186 Steiner tree problems (context) - Hwang, Richards - 1992
146 Steiner problem in networks: A survey (context) - Winter - 1987
134 A distributed algorithm for minimum-weight spanning trees (context) - Gallager, Humblet et al. - 1983
133 An approximate solution for the Steiner problem in graphs (context) - Takahashi, Matsuyama - 1980
43 Routing to multiple destinations in computer networks (context) - Bharath-Kumar - 1983
36 Degree-constrained multicasting in pointto -point networks - Bauer, Varma - 1995
31 Two distributed algorithms for the constrained Steiner tree .. (context) - Kompella, Pasquale et al. - 1993
28 Another adaptive distributed shortest path algorithm - Humblet - 1991
26 Steiner's problem in graphs: Heuristic methods (context) - Voss - 1992
25 Distributed Algorithms for Multicast Path Setup in Data Netw.. - Bauer, Varma - 1995
20 Path-distance heuristics for the Steiner problem in undirect.. (context) - Smith, Winter - 1992
6 The Steiner problem in distributed computing systems (context) - Chen, Houle et al. - 1993
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
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)
Multicast Routing in Point-to-Point Networks Under Constraints - Bauer (1996) (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