Fred Bauer, Anujan Varma  Home/Search
Context Related
| ucsc.edu/pub/tr/ucsccrl9508.ps.Z ucsc.edu/pub/hsnla...csccrl9508.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: ucsc.edu (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, is often modeled as the NP-complete Steiner problem in networks. In this paper, we study algorithms for finding efficient multicast trees in the presence of constraints on the copying ability of the individual switch nodes in the network. We refer to this problem as the degree-constrained multicast tree problem and model it as the degree-constrained Steiner problem in networks. Steiner... (Update)
Cited by: More
Unknown - (Correct)
Design of a Multi-sender 3D Videoconferencing Application.. - Hosseini, Georganas (2003) (Correct)
A Proactive Approach to Reconstructing Overlay - Multicast Trees Mengkun (2004) (Correct)
Similar documents (at the sentence level):
57.8%: Degree-Constrained Multicasting in Point-to-Point Networks - Bauer, Varma (1995) (Correct)
45.1%: Multicast Routing in Point-to-Point Networks Under Constraints - Bauer (1996) (Correct)
10.3%: Distributed Degree-Constrained Multicasting in Point-to-Point.. - Bauer, Varma (1995) (Correct)
Active bibliography (related documents): More All
0.5: Solving Steiner Tree Problems in Graphs to Optimality - Koch, Martin (1996) (Correct)
0.4: Worst-Case Relative Performances Of Heuristics For The Steiner.. - Plesník (1991) (Correct)
0.3: Benefit of Multicasting in All-Optical Networks - Malli, Zhang, Qiao (1998) (Correct)
Similar documents based on text: More All
0.2: Scalable Internetworking - Garcia-Luna-Aceves, Varma (Correct)
0.2: Light Edges in Degree-Constrained Graphs - Bose, Smid, Wood (2002) (Correct)
0.2: ARIES: A Rearrangeable Inexpensive Edge-based On-line Steiner.. - Fred Bauer (1995) (Correct)
Related documents from co-citation: More All
21: Steiner problem in networks: A survey (context) - Winter - 1987
20: The Steiner Tree Problem (context) - Hwang, Richards et al. - 1992
19: An approximate solution for the Steiner problem in graphs (context) - Takahashi, Matsuyama - 1980
BibTeX entry: (Update)
F. Bauer and A. Varma. "Degree-constrained multicasting in pointto -point networks," in Proc. IEEE INFOCOM, Boston, Apr. 1995, pp. 369--376. http://citeseer.ist.psu.edu/128689.html More
@techreport{ bauer95degreeconstrained,
author = "Fred Bauer and Anujan Varma",
title = "{DEGREE}-{CONSTRAINED} {MULTICASTING} {IN} {POINT}-{TO}-{POINT} {NETWORKS}",
number = "UCSC-CRL-95-08",
year = "1995",
url = "citeseer.ist.psu.edu/128689.html" }
Citations (may not include all citations):186 Steiner tree problems (context) - Hwang, Richards - 1992
174 Multicast routing in internetworks and extended LANs (context) - Deering - 1988
146 Steiner problem in networks: A survey (context) - Winter - 1987
144 The NP-completeness column: an ongoing guide (context) - Johnson - 1985
133 An approximate solution for the Steiner problem in graphs (context) - Takahashi, Matsuyama - 1980
130 Multicast routing for multimedia communications - Kompella, Pasquale et al. - 1993
109 the shortest spanning subtree of a graph and the traveling s.. (context) - Kruskal - 1956
49 An optimal nonblocking multicast virtual circuit switch - Turner - 1994
43 Routing to multiple destinations in computer networks (context) - Bharath-Kumar - 1983
26 Steiner's problem in graphs: Heuristic methods (context) - Voss - 1992
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 A dual ascent approach for Steiner tree problems on a direct.. (context) - Wong - 1984
20 Path-distance heuristics for the Steiner problem in undirect.. (context) - Smith, Winter - 1992
19 Reduction tests for the Steiner problem in graphs (context) - Duin, Volgenant - 1989
16 Routing multipoint connections using virtual paths in an ATM.. - Ammar, Cheung et al. - 1993
14 Graph theoretic models for multicast communications (context) - Berry - 1989
11 An integer linear programming approach to the Steiner proble.. (context) - Aneja - 1980
10 Steiner-Probleme in Graphen (context) - Voss - 1990
8 A copy network with shared buffers for large-scale multicast.. (context) - De Zhong, Onozato et al. - 1993
7 Path finding algorithms for broadband multicast (context) - Jiang - 1991
6 NP-completeness and degree restricted spanning trees (context) - Douglas - 1992
6 New York: NorthHolland (context) - Hwang, Richards et al. - 1992
6 Problems with generalized Steiner problems (context) - Voss - 1992
5 A survey of some generalizations of Steiner's problem (context) - Voss - 1988
4 New algorithms for Steiner tree on graphs (context) - Chen - 1983
3 An edge elimination test for the Steiner problem in graphs (context) - Duin, Volgenant - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cse.ucsc.edu.html): More
Modeling Replica Divergence in a Weak-Consistency Protocol for .. - Golding, Long (1993) (Correct)
Exact Arithmetic in Q with Applications in Celestial Mechanics - Conrad (1994) (Correct)
Census: Collecting Host Information on a Wide Area Network - Ganatra (1992) (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