Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination

DMCA

Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Shelley Q. Zhuang , Ben Y. Zhao , Anthony D. Joseph , Randy H. Katz , John D. Kubiatowicz

Citations:

465 - 12 self

Citations

4465	Chord: A scalable Peer-To-Peer lookup service for internet applications - Stoica, Morris, et al. - 2003 (Show Context) Citation Context ...by the Tapestry overlay network described herein forms an interesting topic for future research. Finally, there are several recent projects focusing on similar goals as Tapestry. Among them are Chord =-=[28]-=- from MIT/Berkeley, ContentAddressable Networks (CAN) [21] from AT&T/ACIRI and Pastry [5] from Rice and Microsoft Research. These research projects have also produced decentralized wide-area location ...
3369	A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001 (Show Context) Citation Context ...interesting topic for future research. Finally, there are several recent projects focusing on similar goals as Tapestry. Among them are Chord [28] from MIT/Berkeley, ContentAddressable Networks (CAN) =-=[21]-=- from AT&T/ACIRI and Pastry [5] from Rice and Microsoft Research. These research projects have also produced decentralized wide-area location services with fault-tolerant properties, but have not focu...
2074	Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems - Rowstron, Druschel - 2001 (Show Context) Citation Context ...earch. Finally, there are several recent projects focusing on similar goals as Tapestry. Among them are Chord [28] from MIT/Berkeley, ContentAddressable Networks (CAN) [21] from AT&T/ACIRI and Pastry =-=[5]-=- from Rice and Microsoft Research. These research projects have also produced decentralized wide-area location services with fault-tolerant properties, but have not focused on the area of routing. Spe...
1290	A case for end system multicast - CHU, RAO, et al. - 2000 (Show Context) Citation Context ... MAN, and WAN routers. In our experiments, unicast distances are measured as the shortest path distance between any two multicast members. 4.2 Performance Metrics We adopt the two metrics proposed in =-=[4] t-=-o evaluate the effectiveness of our application-level multicast technique: Relative Delay Penalty, a measure of the increase in delay � that applications incur while using overlay routing. For Bayeu...
1249	Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001 (Show Context) Citation Context ...load balancing with locality for efficient use of network bandwidth. Bayeux utilizes a prefix-based routing scheme that it inherits from an existing application-level routing protocol called Tapestry =-=[32]-=-, a wide-area location and routing architecture used in the OceanStore [15] globally distributed storage system. On top of Tapestry, Bayeux provides a simple protocol that organizes the multicast rece...
1147	OceanStore: An architecture for global-scale persistent storage - Kubiatowicz, Bindel, et al. - 2000 (Show Context) Citation Context ... utilizes a prefix-based routing scheme that it inherits from an existing application-level routing protocol called Tapestry [32], a wide-area location and routing architecture used in the OceanStore =-=[15]-=- globally distributed storage system. On top of Tapestry, Bayeux provides a simple protocol that organizes the multicast receivers into a distribution tree rooted at the source. Simulation results ind...
561	Overcast: Reliable multicasting with an overlay network - JANNOTTI, GIFFORD, et al. - 2000 (Show Context) Citation Context ...drops and reduces the number of measured data points. 7. RELATED WORK There are several projects that share the goal of providing the benefits of IP multicast without requiring direct router support (=-=[3, 4, 9, 13, 18]-=-). End System Multicast [4] is one such example targeted towards small-sized groups such as audio and video conferencing applications, where every member in the group is a potential source of data. Ho...
549	Accessing nearby copies of replicated objects in a distributed environment. - PLAXTON, RAJARAMAN, et al. - 1997 (Show Context) Citation Context ...bution tree is built on top of this overlay structure. The Tapestry location and routing infrastructure uses similar mechanisms to the hashed-suffix mesh introduced by Plaxton, Rajaraman and Richa in =-=[20].-=- It is novel in allowing messages to locate objects and route to them across an arbitrarily-sized network,swhile using a routing map with size logarithmic to the network ¢ namespace at each hop. Tape...
335	ALMI: an application level multicast infrastructure,” - Pendarakis, Shi, et al. - 2001 (Show Context) Citation Context ...drops and reduces the number of measured data points. 7. RELATED WORK There are several projects that share the goal of providing the benefits of IP multicast without requiring direct router support (=-=[3, 4, 9, 13, 18]-=-). End System Multicast [4] is one such example targeted towards small-sized groups such as audio and video conferencing applications, where every member in the group is a potential source of data. Ho...
259	Yoid: Extending the internet multicast architecture,” - Francis - 2000 (Show Context) Citation Context ...drops and reduces the number of measured data points. 7. RELATED WORK There are several projects that share the goal of providing the benefits of IP multicast without requiring direct router support (=-=[3, 4, 9, 13, 18]-=-). End System Multicast [4] is one such example targeted towards small-sized groups such as audio and video conferencing applications, where every member in the group is a potential source of data. Ho...
221	SPAND: Share Passive Network Performance Discovery. - Seshan, Stemm, et al. - 1997 (Show Context) Citation Context ...e rendezvous points per multicast tree [14]. However, there is a lack of a globally deployed IP-anycast service. There are several proposals for providing an anycast service at the application layer (=-=[2, 8, 10, 16, 25]-=-), which attempt to build directory systems that return the nearest server when queried with a service name and a client address. Although our anycast service is provided at the application layer, ser...
201	IP Multicast Channels: EXPRESS Support for Large-Scale Single-Source Applications - Holbrook, Cheriton - 1999 (Show Context) Citation Context ...m. 3. BAYEUX BASE ARCHITECTURE Bayeux provides a source-specific, explicit-join multicast service. The source-specific model has numerous practical advantages and is advocated by a number of projects =-=[12, 27, 29, 31]. A -=-Bayeux multicast session is identified by the tuple � session name, UID� . A session name is a semantic name describing the content of the multicast, and the UID is a distinquishing ID that unique...
163	Protocol independent multicast sparse-mode (pim-sm): Protocol specification," Internet Engineering Task Force (IETF), RFC 2362 - Estrin, Farinacci, et al. - 1998 (Show Context) Citation Context ...receivers when roots are placed near listeners. Bayeux’s technique of root replication is similar in principle to root replication used by many existing IP multicast protocols such as CBT [1] and PI=-=M [6, 7]-=-. Unlike other root replication mechanisms, however, we do not send periodic advertisements via the set of root nodes, and members can transparently find the closest root given the root node identifie...
150	An Architecture for IP Address Allocation with CIDR.” - Rekhter, Li - 1993 (Show Context) Citation Context ... destination ID digit by digit (e.g., *8 £¥¤ 98 £¦¤ 598 £¥¤ 4598 where ’s represent wildcards). This approach is similar to longest prefix routing in the CIDR IP address allocation ar=-=chitecture [22].-=- A node § has a neighbor map with multiple levels, where each level represents a matching suffix up to a digit position in the ID. A given level of the neighbor map contains a number of entries equal...
130	Core Based Trees (CBT) Multicast Routing Architecture, - Ballardie - 1997 (Show Context) Citation Context ... latency to receivers when roots are placed near listeners. Bayeux’s technique of root replication is similar in principle to root replication used by many existing IP multicast protocols such as CB=-=T [1]-=- and PIM [6, 7]. Unlike other root replication mechanisms, however, we do not send periodic advertisements via the set of root nodes, and members can transparently find the closest root given the root...
110	REUNITE: A recursive unicast approach to multicast - STOICA, NG, et al. - 2000 (Show Context) Citation Context ...m. 3. BAYEUX BASE ARCHITECTURE Bayeux provides a source-specific, explicit-join multicast service. The source-specific model has numerous practical advantages and is advocated by a number of projects =-=[12, 27, 29, 31]. A -=-Bayeux multicast session is identified by the tuple � session name, UID� . A session name is a semantic name describing the content of the multicast, and the UID is a distinquishing ID that unique...
82	An Architecture for Internet Content Distribution as an Infrastructure Service - Chawathe, McCanne, et al. - 2000 (Show Context) Citation Context ...drops and reduces the number of measured data points. 7. RELATED WORK There are several projects that share the goal of providing the benefits of IP multicast without requiring direct router support (=-=[3, 4, 9, 13, 18]-=-). End System Multicast [4] is one such example targeted towards small-sized groups such as audio and video conferencing applications, where every member in the group is a potential source of data. Ho...
63	Performance characteristics of mirror servers on the internet - MYERS, DINDA, et al. (Show Context) Citation Context ...e rendezvous points per multicast tree [14]. However, there is a lack of a globally deployed IP-anycast service. There are several proposals for providing an anycast service at the application layer (=-=[2, 8, 10, 16, 25]-=-), which attempt to build directory systems that return the nearest server when queried with a service name and a client address. Although our anycast service is provided at the application layer, ser...
29	Application Layer Anycasting," - Bhattacharjee, Ammar, et al. - 1997 (Show Context) Citation Context ...e rendezvous points per multicast tree [14]. However, there is a lack of a globally deployed IP-anycast service. There are several proposals for providing an anycast service at the application layer (=-=[2, 8, 10, 16, 25]-=-), which attempt to build directory systems that return the nearest server when queried with a service name and a client address. Although our anycast service is provided at the application layer, ser...
22	Md2, md4, md5, sha and other hash functions,”. - Robshaw - 1995 (Show Context) Citation Context ... 160 bits). The system assumes entries are roughly evenly distributed in both node and object namespaces, which can be achieved by using the output of secure one-way hashing algorithms, such as SHA-1 =-=[23]. 2.1 Rou-=-ting Layer Tapestry uses local routing maps at each node, called neighbor maps, to incrementally route overlay messages to the destination ID digit by digit (e.g., *8 £¥¤ 98 £¦¤ *598 £¥¤ ...
18	Protocol independent multicast - dense mode (pim-dm): Protocol specification - Estrin, Farinacci, et al. (Show Context) Citation Context ...receivers when roots are placed near listeners. Bayeux’s technique of root replication is similar in principle to root replication used by many existing IP multicast protocols such as CBT [1] and PI=-=M [6, 7]-=-. Unlike other root replication mechanisms, however, we do not send periodic advertisements via the set of root nodes, and members can transparently find the closest root given the root node identifie...
17	The breadcrumb forwarding service: A synthesis of PGM and EXPRESS to improve and simplify global IP multicast - YANO, MCCANNE - 2000 (Show Context) Citation Context ...m. 3. BAYEUX BASE ARCHITECTURE Bayeux provides a source-specific, explicit-join multicast service. The source-specific model has numerous practical advantages and is advocated by a number of projects =-=[12, 27, 29, 31]. A -=-Bayeux multicast session is identified by the tuple � session name, UID� . A session name is a semantic name describing the content of the multicast, and the UID is a distinquishing ID that unique...
14	tech internet topology model. http://www.cc.gatech.edu/fac/Ellen.Zegura/graphs.html - Georgia (Show Context) Citation Context ...outing tables. The MBone graph presents the topology of the MBone as collected by the SCAN project at USC/ISI [24] on February 1999. To measure our metrics on larger networks, we turned to the GT-ITM =-=[11]-=- package, which produces transit-stub style topologies, and the TIERS [30] package, which constructs topologies by categorizing routers into LAN, MAN, and WAN routers. In our experiments, unicast dist...
9	An Architecture for a Global Host Distance Estimation Service," - Francis, Jamin, et al. - 1998 (Show Context) Citation Context ...e rendezvous points per multicast tree [14]. However, there is a lack of a globally deployed IP-anycast service. There are several proposals for providing an anycast service at the application layer (=-=[2, 8, 10, 16, 25]-=-), which attempt to build directory systems that return the nearest server when queried with a service name and a client address. Although our anycast service is provided at the application layer, ser...
8	A Novel Server Technique for Improving the Response Time of a Replicated Service," - Fei, Bhattacharjee, et al. - 1998 (Show Context) Citation Context ...e rendezvous points per multicast tree [14]. However, there is a lack of a globally deployed IP-anycast service. There are several proposals for providing an anycast service at the application layer (=-=[2, 8, 10, 16, 25]-=-), which attempt to build directory systems that return the nearest server when queried with a service name and a client address. Although our anycast service is provided at the application layer, ser...
4	Network adaptive continuous-media applications through self-organised transcoding - PERKINS, HUDSON, et al. - 1998 (Show Context) Citation Context ...tocol trades off additional bandwidth usage for circumventing single logical hop failures. 2. Application-specific Duplicates: Similar to previous work leveraging application-specific data distilling =-=[19]-=-, this protocol is an enhancement to Proactive Duplication, where an application-specific lossy duplicate is sent to the alternateslink. In streaming multimedia, the duplicate would be a reduction in ...