Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, John D. Kubiatowicz  Home/Search
Context Related
| mit.edu/~strib/doc...tapestry_jsac03.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~strib/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, location-independent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic decentralized object location and routing applications programming interface using a self-repairing, soft-state-based routing layer. This paper presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry... (Update)
Cited by: More
Active and Concurrent Topology Maintenance - Xiaozhou Li Jayadev (Correct)
Concurrent Maintenance of Rings - Xiaozhou Li Jayadev (Correct)
Democratizing content publication with Coral - Michael Freedman Eric (2004) (Correct)
Similar documents (at the sentence level):
64.3%: Tapestry: A Resilient Global-scale Overlay for.. - Zhao, Huang.. (2003) (Correct)
40.2%: Decentralized Object Location and Routing: A New Networking Paradigm - Zhao (2004) (Correct)
Active bibliography (related documents): More All
0.2: PROST: A Programmable Structured Peer-to-peer Overlay.. - Portmann, Ardon.. (2004) (Correct)
0.2: DoS Defense in Structured Peer-to-Peer Networks - Perlegos (2004) (Correct)
0.2: GRIDKIT: Pluggable Overlay Networks for Grid Computing - Grace, Coulson, Blair.. (2004) (Correct)
Similar documents based on text: More All
0.4: Exploiting Routing Redundancy via Structured.. - Zhao, Huang.. (2003) (Correct)
0.4: Rapid Mobility via Type Indirection - Zhao, Huang, Joseph, Kubiatowicz (2004) (Correct)
0.3: Brief Announcement: Stretch Between Nearby Peers - Hildrum, Kubiatowicz, Stribling (2004) (Correct)
Related documents from co-citation: More All
49: Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
48: A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
31: distributed object location and routing for large-scale peer-to-peer systems (context) - Rowstron, Druschel et al. - 2001
BibTeX entry: (Update)
Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, , and John Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 2003. 15 Proof: [Of Property 2.1 For the first inequality, the probability that there exist two nodes whose identifers matching in (3 + ") log n bits is bounded by: http://citeseer.ist.psu.edu/article/zhao04tapestry.html More
@misc{ zhao03tapestry,
author = "B. Zhao and L. Huang and J. Stribling and S. Rhea and A. Joseph and J.
Kubiatowicz",
title = "Tapestry: A resilient global-scale overlay for service deployment",
text = "Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph,
, and John Kubiatowicz. Tapestry: A resilient global-scale overlay for service
deployment. IEEE Journal on Selected Areas in Communications, 2003. 15 Proof:
[Of Property 2.1 For the first inequality, the probability that there exist
two nodes whose identifers matching in (3 + ) log n bits is bounded by:",
year = "2003",
url = "citeseer.ist.psu.edu/article/zhao04tapestry.html" }
Citations (may not include all citations):1225 Chord: A scalable peer-to-peer lookup service for internet a.. - Stoica, Morris et al. - 2001
1023 A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
458 Tapestry: An infrastructure for fault-tolerant wide-area loc.. - Zhao, Kubiatowicz et al. - 2001
411 Freenet: A distributed anonymous information storage and ret.. - Clarke, Sandberg et al. - 2001
342 Wide-area cooperative storage with CFS - Dabek, Kaashoek et al. - 2001
282 Accessing nearby copies of replicated objects in a distribut.. - Plaxton, Rajaraman et al. - 1997
186 Bayeux: An architecture for scalable and fault-tolerant wide.. - Zhuang, Zhao et al. - 2001
181 Space/time trade-offs in hash coding with allowable errors - Bloom - 1970
179 The Sybil attack - Douceur - 2002
144 Application-level multicast using content-addressable networ.. - Ratnasamy, Handley et al. - 2001
144 Internet indirection infrastructure - Stoica, Adkins et al. - 2002
128 Viceroy: A scalable and dynamic emulation of the butterfly - Malkhi, Naor et al. - 2002
123 SCRIBE: The design of a large-scale event notification infra.. - Rowstron, Kermarrec et al. - 2001
120 Kademlia: A peer-to-peer information system based on the XOR.. - Maymounkov, Mazieres - 2002
104 Pastry: Scalable, distributed object location and routing fo.. - Rowstron, Druschel - 2001
100 Skipnet: A scalable overlay network with practical locality .. - Harvey, Jones et al. - 2003
98 SOS: Secure overlay services - Keromytis, Misra et al. - 2002
96 Concurrent online tracking of mobile users - Awerbuch, Peleg - 1991
83 An architecture for IP address allocation with CIDR (context) - Rekhter, Li - 1993
81 Distributed object location in a dynamic network - Hildrum, Kubiatowicz et al. - 2002
57 Bro- cade: Landmark routing on overlay networks - Zhao, Duan et al. - 2002
51 Pond: The OceanStore prototype - Rhea, Eaton et al. - 2003
46 Koorde: A simple degree-optimal hash table (context) - Kaashoek, Karger - 2003
43 Probabilistic location and routing - Rhea, Kubiatowicz - 2002
39 Storage management and caching in PAST, a large-scale, persi.. - Rowstron, Druschel - 2001
38 Security for structured peer-to-peer overlay networks (context) - Castro, Druschel et al. - 2002
34 Experiences deploying a large-scale emergent network (context) - Wilcox-O'Hearn - 2002
30 Mnemosyne: Peer-to-peer steganographic storage - Hand, Roscoe - 2002
30 A simple fault tolerant distributed hash table - Wieder, Naor - 2003
22 Locality-aware mechanisms for large-scale networks - Zhao, Joseph et al. - 2002
17 Approximate object location and spam filtering on peer-to-pe.. - Zhou, Zhuang et al. - 2003
15 SEDA: An architecture for wellconditioned, scalable internet.. - Welsh, Culler et al. - 2001
14 A data tracking scheme for general networks - Rajaraman, Richa et al. - 2001
6 Ex- ploiting routing redundancy via structured peer-to-peer .. - Zhao, Huang et al. - 2003
5 Toward a common API for structured P2P overlays (context) - Dabek, Zhao et al. - 2003
5 MD2, MD4, MD5, SHA and other hash functions (context) - Robshaw - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pdos.lcs.mit.edu/~strib/papers.html): More
Exploiting Routing Redundancy via Structured.. - Zhao, Huang.. (2003) (Correct)
Brief Announcement: Stretch Between Nearby Peers - Hildrum, Kubiatowicz, Stribling (2004) (Correct)
Optimizations for Locality-Aware Structured Peer-to-Peer Overlays - Stribling (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC