Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

By Antony Ian Taylor Rowstron, Peter Druschel. International Middleware Conference, 2001

8,055 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/cf025469b2d7e4b37c7f2d2bf0d46c6776f48fd4

How researchers see this paper

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

In Computer Networks and Communications

Citations in the corpus

MAAN: A Multi-Attribute Addressable Network for Grid Information Services (2003, background): “Current proposed DHT systems include Tapestry [18], Pastry [14], Chord [16], CAN [11] and Koorde [6].”
An Infrastructure for Fault-tolerant Wide-area Location and Routing (2001, background): “The PAST routing and location layer, called Pastry [10], is a location protocol sharing many similarities with Tapestry.”
PROMISE: peer-to-peer media streaming using CollectCast (2003, methodology): “Therefore, PROMISE can be deployed on top of P2P substrates such as Pastry [27], Chord [31], and CAN [24].”
Squirrel: a decentralized peer-to-peer web cache (2002, background): “Squirrel can be seen as a combination of cooperative web caching, where caches share Internet objects among themselves [3, 6, 9, 20, 23, 24], and peer-to-peer request routing, characterized as decentralized, self-organizing, and faultresilient [13, 15, 19, 25].”
Glacier: highly durable, decentralized storage despite massive correlated failures (2005, methodology): “Structured overlay networks with a distributed hash table (DHT) layer like DHash/Chord [16, 40] or PAST/Pastry [20, 37] provide such a service, though other implementations are possible.”
Scribe: a large-scale and decentralized application-level multicast infrastructure (2002, methodology): “The protocol is described and evaluated in [12] and [16].”
SplitStream: high-bandwidth multicast in cooperative environments (2003, methodology): “A full description of Pastry can be found in [33, 11, 12].”
Efficient content location using interest-based locality in peer-to-peer systems (2003, methodology): “Another class of protocols based on the Distributed Hash Table (DHT) abstraction [3] [4] [5] [6] and motivated by Plaxton et al.”
Peer-to-peer systems (2010, neutral): “Many implementations of key-based routing exist [18, 26, 32].”
Trustworthiness Management in the Social Internet of Things (2014, background): “Several DHT systems are available for this purpose, such as CAN [50], Chord [51], Pastry [52].”
On the Feasibility of Peer-to-Peer Web Indexing and Search (2003, background): “DHTs are well-suited for exact match lookups using unique identifiers, but do not directly support text search.”
PocketLens: Toward a personal recommender system (2004, background): “There are also a number of research prototype networks such as Chord, CAN, CFS, and Pastry [Stoica et al. 2001; Ratnasamy et al. 2001; Rowstron and Druschel 2001a, 2001b; Dabek et al. 2001].”
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].”