The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Chord: A scalable peer-to-peer lookup service for internet applications
Abstract
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data item pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Freenet: 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
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., & Lewin, D. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258660 · Cited by 1,981
Self-citationAndersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502048 · Cited by 1,868
Self-citationWide-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
Self-citationOceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379239 · Cited by 869
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
The design and implementation of an intentional naming system
Adjie-Winoto, W., Schwartz, E., Balakrishnan, H., & Lilley, J. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319164 · Cited by 673
Self-citation
Cited by
Items 101–111 of 111
SybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1159913.1159945 · Cited by 260
Cooperative peer groups in NICE
Lee, S., Sherwood, R., & Bhattacharjee, B. (2003) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208963 · Cited by 257
A Taxonomy of Botnet Structures
Dagon, D., Gu, G., Lee, C. P., & Lee, W. (2007) · Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007) · doi:10.1109/acsac.2007.44 · Cited by 255
Piccolo: building fast, distributed programs with partitioned tables
Power, R., & Li, J. (2010) · doi:10.5555/1924943.1924964 · Cited by 252
A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Passarella, A. (2012) · Computer Communications · doi:10.1016/j.comcom.2011.10.005 · Cited by 226
“Chord [168,169] organises the virtual address space in a logical ring.”
BackgroundFDC: A Secure Federated Deep Learning Mechanism for Data Collaborations in the Internet of Things
Yin, B., Yin, H., Wu, Y., & Jiang, Z. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2966778 · Cited by 149
(2012) · doi:10.1109/icde.2012.147 · Cited by 75
A secure self-destructing scheme for electronic data
Wang, G., Yue, F., & Liu, Q. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2012.05.008 · Cited by 44
Hazelcast jet: low-latency stream processing at the 99.99 th percentile
Gencer, C., Topolnik, M., Ďurina, V., Demirci, E., Kahveci, E. B., Gürbüz, A., Lukáš, O., Bartók, J., Gierlach, G., Hartman, F., et al. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3476311.3476387 · Cited by 38
A survey of structured P2P systems for RDF data storage and retrieval
Filali, I., Bongiovanni, F., Huet, F., & Baude, F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23074-5_2 · Cited by 19
Want to scale in centralized systems? Think P2P
Kermarrec, A.-M., & Taïani, F. (2015) · Journal of Internet Services and Applications · doi:10.1186/s13174-015-0029-1 · Cited by 18
“Interestingly enough, the origin of many of today’s key-value stores can be traced back to the work on distributed hash tables originally developed for P2P systems a decade ago, such as Chord [3], CAN [13], Pastry [2], and Tapestry [14].”
BackgroundMethodResultInfluential
Metadata
- Authors
- Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H.
- Venue
- Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2001-08-27
- Pages
- 149-160
- OpenAlex
- W2158049821
- Cited by
- 9,623
- References
- 17
- FWCI
- 229.75
- Type
- conference paper
- 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.