See this document in CiteSeerX!

Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks (1997)  (Make Corrections)  (6 citations)
Ehud Aharoni Reuven Cohen Dept. of Computer Science Technion, Haifa 32000...
IEEE\slash ACM Transactions on Networking



  Home/Search   Context   Related

 
View or download:
cs.technion.ac.il/~rcohen...steiner.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.technion.ac.il/~rcoh...journal (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The paper addresses the issue of minimizing the number of nodes involved in the routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a scheme where the tree routing and maintenance burden is laid only upon the source node and the destination nodes associated with the multicast tree. The main concept behind this scheme is to view each multicast tree as a collection of unicast paths, and to locate only the multicast source and destination... (Update)

Context of citations to this paper:   More

.... in a large class of scientific computation problems [10] In case jSj = 1 and D V the CM problem reduces to the multicasting problem [1, 4, 5, 27] and in case D = V to the broadcasting problem, both problems have been well investigated because of their relevance in the context...

...subgraph that covers all terminals. An even more general problem in the context of network multicast is the dynamic MST problem [7], where the tree needs to efficiently adapt to dynamic changes in the multicast group. The basic MST problem is known to be NP Complete,...

Cited by:   More
A Unicast-based Approach for Streaming Multicast - Reuven Cohen And (2001)   (Correct)
Effective Location-Guided Tree Construction Algorithms for.. - Chen, Nahrstedt (2002)   (Correct)
Framework for Multicast in Hierarchical Networks - Cohen, Felstaine, Emek (2000)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Multicast Routing in Point-to-Point Networks Under Constraints - Bauer (1996)   (Correct)
0.1:   ARIES: A Rearrangeable Inexpensive Edge-based On-line Steiner.. - Fred Bauer (1995)   (Correct)
0.1:   Delay-Constrained Routing in Connection-Oriented Networks - Sriram   (Correct)

Similar documents based on text:   More   All
0.1:   Datagram Forwarding via Stateless Internetwork Switching - Finn, Van Meter, Rogers   (Correct)
0.1:   A Scheme for an Internet Encapsulation Protocol: Version 1 - Woodburn, Mills (1991)   (Correct)
0.1:   Effective Search Strategies for Application-Independent.. - Joseph Dixon And (1997)   (Correct)

Related documents from co-citation:   More   All
3:   The PIM Architecture for Wide-Area Multicast Routing - Deering, Estrin et al. - 1996
3:   Routing to multiple destinations in computer networks (context) - Bharath-Kumar - 1983
3:   Routing of multipoint connections (context) - Waxman - 1988

BibTeX entry:   (Update)

E. Aharoni, R. Cohen, "Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks" IEEE INFOCOM, 1997. http://citeseer.ist.psu.edu/aharoni97restricted.html   More

@article{ aharoni98restricted,
    author = "Ehud Aharoni and Reuven Cohen",
    title = "Restricted dynamic {Steiner} trees for scalable multicast in datagram networks",
    journal = "IEEE\slash ACM Transactions on Networking",
    volume = "6",
    number = "3",
    pages = "286--297",
    year = "1998",
    url = "citeseer.ist.psu.edu/aharoni97restricted.html" }
Citations (may not include all citations):
1726   Graph-based algorithms for boolean function manipulation - Bryant - 1986
335   Routing of multipoint connections (context) - Waxman - 1988
316   Freeman and Company (context) - Garey, Johnson et al. - 1979
300   the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1993
234   MBone: The multicast backbone (context) - Eriksson - 1994
168   Core based trees (context) - Ballardie, Francis et al. - 1993
146   Steiner problem in networks: A survey (context) - Winter - 1987
133   An approximate solution for the Steiner problem in graphs (context) - Takahashi, Matsuyama - 1980
130   Multicast routing for multimedia communication - Kompella, Pasquale et al. - 1993
87   Reverse path forwarding of broadcast packets (context) - Dalal, Metcalfe - 1978
68   Steiner minimal tree (context) - Gilbert, Pollak - 1968
62   Multicast routing extensions for OSPF (context) - Moy - 1994
61   How bad is naive multicast routing - Doar, Leslie - 1993
56   Distance vector multicast routing protocol (context) - Deering, Partridge et al. - 1988
46   Protocol independent multicast (context) - Deering, Estrin et al. - 1995
43   Routing to multiple destinations in computer networks (context) - Bharath-Kumar, Ja - 1983
29   ARIES: a rearrangeable inexpensive edge-based on-line steine.. - Bauer, Varma - 1996
27   IP in IP tunneling (context) - Simpson - 1995
25   Comparison of dynamic multicast routing algorithms for wide-.. (context) - Kadirire - 1995
25   Distributed algorithms for multicast path setup in data netw.. - Bauer, Varma - 1995
16   Routing multipoint connections using virtual paths in an ATM.. - Ammar, Cheung et al.
3   Dynamic Steiner tree algorithm (context) - Imase, Waxman - 1991



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.technion.ac.il/~rcohen/journal.html):   More
Service Provisioning in an ATM-over-ADSL Access Network - Cohen (1999)   (Correct)
On the Cost of Virtual Private Networks - Cohen, Kaempfer (2000)   (Correct)
An Efficient Scheme for Accommodating Synchronous Traffic in a.. - Cohen   (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