Pastry: Scalable, distributed object location and routing for large-scale peer-to-

By Antony Ian Taylor Rowstron, Peter Druschel. 2001

3,096 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/29f0a4ba7176e870ce4ab54b6b627ee7c761d890

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

Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks (2011, methodology): “Systems like Chord [17] or Pastry [18] have been implemented, in which 1214 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL.”
Cooperative Security for Network Coding File Distribution (2006, background): “In this paper we do not consider such types of attacks, which often require a more distributed peer-discovery protocol [34], [45].”
A survey of attack and defense techniques for reputation systems (2009, background): “The distribution of responsibility may be symmetrical (e.g., distributed hash tables (DHTs) [Ratnasamy et al. 2000; Stoica et al. 2001; Zhao et al. 2001; Rowstron and Druschel 2001]) or asymmetrical (e.g., power-law peer-topeer networks [Dimitriou et al. 2007; Matei et al. 2002]).”
SplitStream: high-bandwidth multicast in cooperative environments (2003, background): “Unfortunately, conventional tree-based multicast is inherently not well matched to a cooperative environment.”
T-Man: Gossip-Based Overlay Topology Management (2005, background): “Examples from the vast literature include DHTs [7] [11] [13], unstructured overlays [9] [3], and superpeer topologies [16].”
Mercury: supporting scalable multi-attribute range queries (2004, background): “A large number of distributed hash table designs [11,22,23, 25] have been proposed over the past few years.”
Topologically-aware overlay construction and server selection (2002, background): “Several ongoing projects make use of application-level or overlay networks [1], [2], [3], [4], [5], [6], [7], [8], [9].”
Secure Untrusted Data Repository (SUNDR) (2004, methodology): “Several new distributed hash tables such as Chord [26] and Pastry [24] show the potential to scale to millions of separately administered volunteer nodes, with CFS [5] layering a read-only ﬁle system on top of such a highly distributed architecture.”
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility (2001, methodology): “This local heuristic obviously cannot achieve globally shortest routes, but simulations have shown that the average distance traveled by a message, in terms of the proximity metric, is only 50% higher than the corresponding “distance” of the source and destination in the underlying network [27].”
Wide-area cooperative storage with CFS (2001, background): “PAST handles the load of serving popular files by caching them along the lookup path.”
VoroNet: A scalable object network based on Voronoi tessellations (unknown): “Among the numerous peer to peer networks that have been proposed in the past 5 years, structured peer to peer networks, such as Pastry [9] or Chord [11], have generated a lot of interest.”
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].”
P2Cast: peer-to-peer patching scheme for VoD service (2003, background): “SplitStream [21] is a high-bandwidth content streaming/distribution system that is built upon Pastry [22], a generic substrate for peer-to-peer applications.”
Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead (2003, methodology): “Our system, called Kelips, uses peer-to-peer gossip to partially replicate file index information.”
Eclipse Attacks on Overlay Networks: Threats and Defenses (2006, background): “Moreover, a large number of research projects explore the use of overlays to provide decentralized network services [25], [31], [33], [38], [43].”
Tapestry: a resilient global-scale overlay for service deployment (2004, unknown): “Several systems have application level multicast: CAN-MC [21] (CAN), Scribe [22] (Pastry), and Bayeux [5] (Tapestry).”
Efficient search in peer to peer networks (2004, methodology): “Keywords: Peer-to-peer, distributed data, search, performance modeling, evaluation Technical Area(s): Databases, performance modeling and evaluation”