The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
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. The paper presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry deployment on PlanetLab, a global testbed of approximately 100 machines. Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers. Several widely distributed applications have been implemented on Tapestry, illustrating its utility as a deployment infrastructure.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Maymounkov, P., & Mazières, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_5 · Cited by 3,004
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · Cited by 2,146
Self-citationFreenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · ACM SIGCOMM Computer Communication Review · doi:10.1145/964723.383071 · Cited by 1,923
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · ACM SIGCOMM Computer Communication Review · doi:10.1145/964723.383072 · Cited by 1,799
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
SEDA: an architecture for well-conditioned, scalable internet services
Welsh, M., Culler, D., & Brewer, E. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502057 · Cited by 834
Accessing nearby copies of replicated objects in a distributed environment
Plaxton, C. G., Rajaraman, R., & Richa, A. W. (1997) · Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97 · doi:10.1145/258492.258523 · Cited by 760
Zhuang, S. Q., Zhao, B. Y., Joseph, A. D., Katz, R. H., & Kubiatowicz, J. D. (2001) · International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV) · doi:10.1145/378344.378347 · Cited by 722
Self-citationSkipNet: A Scalable Overlay Network with Practical Locality Properties
Harvey, N. J. A., Dunagan, J., Jones, M. B., Saroiu, S., Theimer, M. M., & Wolman, A. (2003) · Cited by 614
Application-Level Multicast Using Content-Addressable Networks
Ratnasamy, S., Handley, M. J., Karp, R. M., & Shenker, S. J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45546-9_2 · Cited by 608
Koorde: A Simple Degree-Optimal Distributed Hash Table
Kaashoek, M. F., & Karger, D. R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45172-3_9 · Cited by 567
Pond: the oceanstore prototype
Rhea, S. C., Eaton, P. R., Geels, D., Weatherspoon, H., Zhao, B. Y., & Kubiatowicz, J. D. (2003) · Cited by 453
Self-citationSecure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · Proceedings of the 5th symposium on Operating systems design and implementation - OSDI '02 · doi:10.1145/1060289.1060317 · Cited by 328
Distributed object location in a dynamic network
Hildrum, K. W., Kubiatowicz, J. D., Rao, S. B., & Zhao, B. Y. (2002) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/564870.564877 · Cited by 274
Self-citationConcurrent online tracking of mobile users
Awerbuch, B., & Peleg, D. (1991) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/115992.116013 · Cited by 188
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A. I. T., & Druschel, P. (2001) · ACM SIGOPS Operating Systems Review · doi:10.1145/502059.502053 · Cited by 154
Approximate object location and spam filtering on peer-to-peer systems
Zhou, F. C., Li, Z., Zhao, B. Y., et al. (2003) · doi:10.5555/1515915.1515917 · Cited by 105
Self-citationInternet indirection infrastructure
Stoica, I. G., Adkins, D., Zhuang, S. Q., Shenker, S. J., & Surana, S. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/964725.633033 · Cited by 66
Exploiting routing redundancy via structured peer-to-peer overlays
Zhao, B., Huang, L., Stribling, J., Joseph, A. D., & Kubiatowicz, J. D. (2004) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2003.1249775 · Cited by 51
Self-citationApproximate Object Location and Spam Filtering on Peer-to-Peer Systems
Zhou, F. C., Li, Z., Zhao, B. Y., et al. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44892-6_1 · Cited by 48
Self-citation
Cited by
A survey on security issues in service delivery models of cloud computing
Subashini, S., & Kavitha, V. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2010.07.006 · Cited by 2,625
A survey and comparison of peer-to-peer overlay network schemes
Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1610546 · Cited by 1,496
Restful web services vs. "big"' web services: making the right architectural decision
Pautasso, C., Zimmermann, O., & Leymann, F. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367606 · Cited by 879
Toward Secure and Dependable Storage Services in Cloud Computing
Wang, C., Wang, Q., Ren, K., Cao, N., & Lou, W. (2012) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.24 · Cited by 643
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
Metadata
- Authors
- Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., & Kubiatowicz, J. D.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2004-01
- Volume
- 22
- Issue
- 1
- Pages
- 41-53
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2123482462
- Cited by
- 1,730
- References
- 27
- FWCI
- 222.68
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.