• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Scalable Application Layer Multicast (2002)

Cached

  • Download as a PDF

Download Links

  • [dslab.csie.ncu.edu.tw]
  • [www.cs.wisc.edu]
  • [www.cs.wisc.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [drum.lib.umd.edu]
  • [drum.lib.umd.edu]
  • [drum.lib.umd.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Suman Banerjee , Bobby Bhattacharjee , Christopher Kommareddy
Citations:731 - 21 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Citations

4465 Chord: A scalable Peer-To-Peer lookup service for internet applications - Stoica, Morris, et al. - 2003 (Show Context)

Citation Context

...se proxies organize themselves into an appropriate data delivery path. TCP is used to provide reliable communicationbetween each pair of peer proxies on the overlay. Some other recent projects (Chord =-=[21]-=-, Content AddressableNetworks (CAN) [16], Tapestry [23] and Pastry [18]) havealso addressed the scalability issue in creating application layer overlays, and are therefore, closely related to our work...

3369 A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001 (Show Context)

Citation Context

...ppropriate data delivery path. TCP is used to provide reliable communicationbetween each pair of peer proxies on the overlay. Some other recent projects (Chord [21], Content AddressableNetworks (CAN) =-=[16]-=-, Tapestry [23] and Pastry [18]) havealso addressed the scalability issue in creating application layer overlays, and are therefore, closely related to our work. CAN definesa virtual d-dimensional Car...

2074 Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems - Rowstron, Druschel - 2001 (Show Context)

Citation Context

...TCP is used to provide reliable communicationbetween each pair of peer proxies on the overlay. Some other recent projects (Chord [21], Content AddressableNetworks (CAN) [16], Tapestry [23] and Pastry =-=[18]-=-) havealso addressed the scalability issue in creating application layer overlays, and are therefore, closely related to our work. CAN definesa virtual d-dimensional Cartesian coordinate space, and ea...

1290 A case for end system multicast - CHU, RAO, et al. - 2000 (Show Context)

Citation Context

...pted by most commercial ISPs, and thus large parts of the Internet are still incapable of native multicast more than a decade after the protocols were developed.sApplication-Layer Multicast protocols =-=[9, 11, 6, 13, 14, 24, 17]-=- do not change the network infrastructure, instead they implement multicast forwarding functionality exclusively at end-hosts. Such application-layer multicast protocols and are increasingly being use...

1249 Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001 (Show Context)

Citation Context

... delivery path. TCP is used to provide reliable communicationbetween each pair of peer proxies on the overlay. Some other recent projects (Chord [21], Content AddressableNetworks (CAN) [16], Tapestry =-=[23]-=- and Pastry [18]) havealso addressed the scalability issue in creating application layer overlays, and are therefore, closely related to our work. CAN definesa virtual d-dimensional Cartesian coordina...

1160 Resilient Overlay Networks - Andersen, Balakrishnan, et al. (Show Context)

Citation Context

...l the scenario of a data stream source multicasting to the group. We chose a single end-host, uniformly at random, to be the data source generating a constant bit rate 5 There are some recent studies =-=[20, 1]-=- to show that this may not always be the case; however, we use the native unicast latency as the reference to compare the performance of the other schemes. data. Each packet in the data sequence, effe...

1073 Multicast Routing in a Datagram Internetwork - Deering - 1991
802 How to model an internetwork. - Zegura, Calvert, et al. - 1996 (Show Context)

Citation Context

...EXPERIMENTS We have implemented a packet-level simulator for the four different protocols. Our network topologies were generated using the Transit-Stub graphmodel, using the GT-ITM topology generator =-=[5]-=-. All topologies in these simulations had 10; 000 routers with an average node degree between 3 and 4. End-hosts were attached to a set of routers, chosen uniformly at random, from among the stubdomai...

658 Scribe: A large-scale and decentralized application-level multicast infrastructure - Castro, Druschel, et al. - 2002 (Show Context)

Citation Context

...mber of hosts in the network. Pastry [19] is a self-organizing overlay network of nodes, where logical peer relationships on the overlay are based on matching prefixes of the node identifiers. Scribe =-=[6]-=- is a large-scale event notification infrastructure that leverages the Pastry system to create groups and build efficient application layer multicast paths to the group members for dissemination of ev...

561 Overcast: Reliable multicasting with an overlay network - JANNOTTI, GIFFORD, et al. - 2000 (Show Context)

Citation Context

...pted by most commercial ISPs, and thus large parts of the Internet are still incapable of native multicast more than a decade after the protocols were developed.sApplication-Layer Multicast protocols =-=[9, 11, 6, 13, 14, 24, 17]-=- do not change the network infrastructure, instead they implement multicast forwarding functionality exclusively at end-hosts. Such application-layer multicast protocols and are increasingly being use...

549 Accessing nearby copies of replicated objects in a distributed environment. - PLAXTON, RAJARAMAN, et al. - 1997 (Show Context)

Citation Context

... Tapestry overlay location and routing system [23]. A level of the hierarchy is defined by a set of hosts that share a common suffix in their host IDs. Such a technique was proposed by Plaxton et.al. =-=[15]-=- for locating and routing to named objects in a network. Therefore, hosts in Bayeux maintain O(b log b N) state and end-to-end overlay paths have O(log b N) application level hops. As discussed in Sec...

465 Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. - Zhuang, Zhao, et al. - 2001 (Show Context)

Citation Context

...pted by most commercial ISPs, and thus large parts of the Internet are still incapable of native multicast more than a decade after the protocols were developed.sApplication-Layer Multicast protocols =-=[9, 11, 6, 13, 14, 24, 17]-=- do not change the network infrastructure, instead they implement multicast forwarding functionality exclusively at end-hosts. Such application-layer multicast protocols and are increasingly being use...

372 Application-Level Multicast Using Content-Addressable Networks, - Ratnasamy, Handley, et al. - 2001 (Show Context)

Citation Context

...pted by most commercial ISPs, and thus large parts of the Internet are still incapable of native multicast more than a decade after the protocols were developed.sApplication-Layer Multicast protocols =-=[9, 11, 6, 13, 14, 24, 17]-=- do not change the network infrastructure, instead they implement multicast forwarding functionality exclusively at end-hosts. Such application-layer multicast protocols and are increasingly being use...

344 SCRIBE: The design of a large-scale event notification infrastructure. - Rowstron, Kermarrec, et al. - 2001 (Show Context)

Citation Context

...umber of hosts in the network. Pastry [18] is a self-organizing overlay network of nodes, where logical peer relationships on the overlay are basedon matching prefixes of the node identifiers. Scribe =-=[19]-=- is a large-scale event notification infrastructure that leverages the Pastry system to create groups and build efficient application layer multicast paths to the group members for dissemination of ev...

335 ALMI: an application level multicast infrastructure,” - Pendarakis, Shi, et al. - 2001 (Show Context)

Citation Context

...pted by most commercial ISPs, and thus large parts of the Internet are still incapable of native multicast more than a decade after the protocols were developed.sApplication-Layer Multicast protocols =-=[9, 11, 6, 13, 14, 24, 17]-=- do not change the network infrastructure, instead they implement multicast forwarding functionality exclusively at end-hosts. Such application-layer multicast protocols and are increasingly being use...

331 Enabling conferencing applications on the Internet using an overlay multicast architecture,” in - Chu, Rao, et al. - 2001 (Show Context)

Citation Context

... Narada application-layer multicast protocol [9]. Narada was first proposed as an efficient applicationlayer multicast protocol for small group sizes. Extensions to it have subsequently been proposed =-=[8]-=- to tailor its applicability to highbandwidth media-streaming applications for these groups, and have been studied using both simulations and implementation. Lastly, we present results from a wide-are...

318 Core Based Trees (CBT): An Architecture for Scalable Inter-Domain Multicast Routing - Ballardie, Francis, et al. - 1993 (Show Context)

Citation Context

...lations and a wide-area implementation. In the simulation environment, we compare the performance of NICE to three other schemes: multi-unicast, native IP-multicast using the Core Based Tree protocol =-=[2]-=-, and the Narada application-layer multicast protocol (as given in [9]). In the Internet experiments, we benchmark the performance metrics against direct unicast paths to the member hosts. Clearly, na...

191 Host Multicast: A Framework for Delivering Multicast to End Users,” In - Zhang, Jamin, et al. - 2002 (Show Context)

Citation Context

...implementing multicast at the application layer. They can be classified into two broad categories: mesh-first (Narada [9], Gossamer [6]) and tree-first protocols (Yoid [11], ALMI [14], Host-Multicast =-=[22]-=-). Yoid and HostMulticast defines a distributed tree building protocol between the end-hosts, while ALMI uses a centralized algorithm to create a minimum spanning tree rooted at a designated single so...

160 Scattercast: An Architecture for Internet Broadcast Distribution as an Infrastructure Service - CHAWATHE - 2000 (Show Context)

Citation Context

...pted by most commercial ISPs, and thus large parts of the Internet are still incapable of native multicast more than a decade after the protocols were developed.sApplication-Layer Multicast protocols =-=[9, 11, 6, 13, 14, 24, 17]-=- do not change the network infrastructure, instead they implement multicast forwarding functionality exclusively at end-hosts. Such application-layer multicast protocols and are increasingly being use...

154 Detour: A case for informed Internet routing and transport. - Savage, Anderson, et al. - 1999 (Show Context)

Citation Context

...l the scenario of a data stream source multicasting to the group. We chose a single end-host, uniformly at random, to be the data source generating a constant bit rate 5 There are some recent studies =-=[20, 1]-=- to show that this may not always be the case; however, we use the native unicast latency as the reference to compare the performance of the other schemes. data. Each packet in the data sequence, effe...

125 E.A.: RMX: Reliable multicast for heterogeneous networks. In: - Chawathe, McCanne, et al. - 2000 (Show Context)

Citation Context

...es) into a distribution tree rooted at a central source for single source multicast. A distributed tree-building protocol is used to create this source specific tree, in a manner similar to Yoid. RMX =-=[7]-=- provides support for reliable multicast data delivery to end-hosts using a set of similar proxies, called Reliable Multicast proXies. Application end-hosts are configured to affiliate themselves with...

75 Yoid : Extending the multicast internet architecture.” White Paper - Francis - 1999 (Show Context)

Citation Context

...pted by most commercial ISPs, and thus large parts of the Internet are still incapable of native multicast more than a decade after the protocols were developed.sApplication-Layer Multicast protocols =-=[9, 11, 6, 13, 14, 24, 17]-=- do not change the network infrastructure, instead they implement multicast forwarding functionality exclusively at end-hosts. Such application-layer multicast protocols and are increasingly being use...

49 Scalable secure group communication over IP multicast - Banerjee, Bhattacharjee - 2002 (Show Context)

Citation Context

...r members in the group. The hierarchical structure is also important for localizing the effect of member failures. The NICE hierarchy describedin this paper is similar to the member hierarchy used in =-=[3]-=- for scalable multicast group re-keying. However, the hierarchy in [3], is layered over a multicast-capable network and is constructed using network multicast services (e.g. scoped expanding ring sear...

33 Steiner points in tree metrics don’t (really) help. - Gupta - 2001
9 Resilient overlay networks - Morris - 1995
4 Accessingnearby copies of replicated objects in a distributed environment - Plaxton, Rajaraman, et al. - 1997
1 RMX: ReliableMulticast for Heterogeneous Networks - Chawathe, McCanne, et al.
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University