See this document in CiteSeerX!

How Bad is Naive Multicast Routing? (1993)  (Make Corrections)  (20 citations)
Matthew Doar, Ian Leslie
INFOCOM (1)



  Home/Search   Context   Related

 
View or download:
cl.cam.ac.uk/ftp/p...castrouting.ps.gz
mit.edu/~djw/libra...castrouting.ps.gz
ftp.cl.cam.ac.uk/f...castrouting.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cl.cam.ac.uk/ftp/papers/ (more)
From:  mit.edu/~djw/library/
(Enter author homepages)

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

Abstract: When the problem of routing multicast connections in networks has been previously considered, the aim has been to minimise overall costs, possibly subject to a delay constraint. The emphasis has been on examining the problem with a source transmitting to a fixed set of destinations (the multicast group) which are known when communication is established. There are clearly some applications for which the set of destinations will be dynamic, with destinations joining and leaving the multicast... (Update)

Context of citations to this paper:   More

.... aspect of our simulation experiments because the performance of multicast protocols is often sensitive to the underlying topology [52, 53, 54]. By topology we mean both link topology, i.e. the way links are connected together, as well as receiver topology, i.e. the way...

...should be theoretically bounded as small as possible. Many dynamic multicast routing algorithms have been proposed [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14]. However, none of there algorithms can satisfy all of the above requirements. The greedy algorithm [8, 9] selects the...

Cited by:   More
Alternate Path Routing for Multicast - Zappala (2000)   (Correct)
Optimal Allocation of Clients to Replicated Multicast Servers - Fei, Ammar, Zegura (1999)   (Correct)
Distributed Degree-Constrained Multicasting in.. - Fred Bauer Anujan (1995)   (Correct)

Similar documents (at the sentence level):
58.7%:   Multicast in the Asynchronous Transfer Mode Environment - Doar (1993)   (Correct)

Active bibliography (related documents):   More   All
0.3:   New Algorithms for Multicast Routing in Real Time Networks - Mokbel (1999)   (Correct)
0.3:   Reliability in Multicast Services and Protocols ; A Survey. - Diot (1994)   (Correct)
0.2:   Unknown -   (Correct)

Similar documents based on text:   More   All
0.2:   Observing Web Browser Behaviour Using the Nprobe Passive.. - Hall, Pratt, Leslie (2001)   (Correct)
0.1:   A Better Model for Generating Test Networks - Doar (1996)   (Correct)
0.1:   A Slotted Ring Copy Fabric for a Multicast Fast Packet Switch - Newman, Doar (1990)   (Correct)

Related documents from co-citation:   More   All
11:   Routing to multiple destinations in computer networks (context) - Bharath-Kumar - 1983
11:   An approximate solution for the Steiner problem in graphs (context) - Takahashi, Matsuyama - 1980
11:   Routing of multipoint connections (context) - Waxman - 1988

BibTeX entry:   (Update)

M. Doar and I. Leslie. "How bad is naive multicast routing?", in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1993, pp. 82--89. http://citeseer.ist.psu.edu/doar93how.html   More

@inproceedings{ doar93how,
    author = "Matthew Doar and Ian M. Leslie",
    title = "How Bad is Naive Multicast Routing?",
    booktitle = "{INFOCOM} (1)",
    pages = "82-89",
    year = "1993",
    url = "citeseer.ist.psu.edu/doar93how.html" }
Citations (may not include all citations):
773   Reducibility among combinatorial problems (context) - Karp - 1972
452   Data Structures and Algorithms (context) - Hopcroft - 1983
335   Routing of Multipoint Connections (context) - Waxman - 1988
163   A Fast Algorithm for Steiner Trees (context) - Kou, Markowsky et al. - 1981
68   Steiner Minimal Trees (context) - Gilbert, Pollak - 1968
26   On finding Steiner Vertices (context) - Rayward-Smith, Clare - 1986
24   On Multicast Path Finding Algorithms (context) - Chow - 1991
5   Routing and Congestion Control in Datagram Networks (context) - Wang - 1992
4   Steiner Problem in Networks (context) - Winter - 1987
3   Multicast Routing Algorithm for Nodal Load Balancing (context) - Tode, Sakai et al. - 1992
2   Selected Broadcast in Packet-Switched Networks (context) - Wall - 1990
2   Multipoint Digital Video Communications (context) - Jiang - 1991
1   ISDN ATM Aspects (context) - Draft, B- - 1990



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


Documents on the same site (http://www.cl.cam.ac.uk/ftp/papers/):   More
Liminf convergence in \Omega\Gamma33432/-630 - Kim Ritter   (Correct)
A Strategic Metagame Player for General Chess-Like Games - Pell (1994)   (Correct)
TEA, a Tiny Encryption Algorithm. - Wheeler, Needham (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