An Infrastructure for Fault-tolerant Wide-area Location and Routing

By Ben Y. Zhao, John D. Kubiatowicz, Anthony D. Joseph. 2001

2,478 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/329fcd3852118a62ea613dad2c4ada9fea23a8ec

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Analysis of the evolution of peer-to-peer systems (2002, background): “[14] ZHAO, B., KUBIATOWICZ, J., AND JOSEPH, A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing.”
Modeling peer-peer file sharing systems (2003, methodology): “We will denote such systems as DIHA (Distributed Indexing with Hashing Architecture) which are typified by Chord [2], CAN [3], Pastry [6] and Tapestry [ 7 ].”
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure (2001, methodology): “Bayeux is built on top of a scalable peer-to-peer object location system called Tapestry [ 13 ] (which is similar to Pastry).”
Hermes: a distributed event-based middleware architecture (2002, methodology): “The node id of a replica rendezvous node is obtained by concatenating a salt value to the event type name before calculating the hash function [26].”
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining (2003, methodology): “Tapestry: An infrastructure for fault-tolerant wide-area location and routing.”
Efficient Peer-to-Peer Keyword Searching (2003, methodology): “To build a peer-to-peer distributed search infrastructure, we assume the a system model based on recent work on peer-to-peer lookup services [18, 14, 15, 21].”
Towards a Common API for Structured Peer-to-Peer Overlays (2003, methodology): “Some protocols ([11], [7]) only support a max rank value of one.”
Improving search in peer-to-peer networks (2002, background): “With deliberately formed connections and intelligent routing, these systems can locate an object by its identifier within a bounded number of hops.”
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility (2001, background): “In principle, it should be possible to layer PAST on top of one of the other peer-to-peer routing schemes described in the literature, such as Tapestry [ 31 ], Chord [30] or CAN [25].”
Distributing streaming media content using cooperative networking (2002, background): “The short lifetime of the individual nodes poses a challenge to distributed search schemes such as CAN [17], Chord [20], Pastry [18], and Tapestry [ 22 ].”
Simple Load Balancing for Distributed Hash Tables (2003, background): “Distributed hash tables have been proposed as a fundamental building block for peer-to-peer systems [6, 9, 8, 10, 12].”
Application-Level Multicast Using Content-Addressable Networks (2001, methodology): “The majority of these proposed solutions (for example [ 1 , 4]) typically involve having the members of a multicast group self-organize into an essentially random application-level mesh topology over which a traditional multicast routing algorithm such as DVMRP [2] is used to construct distribution ”