The DOI matches its Crossref record; 8 of the 8 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
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-citation(2014) · African Studies Companion Online · doi:10.1163/1872-9037_afco_dum_r0022a · Cited by 1,664
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
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
National Technical Information Service
(2008) · Reference Reviews · doi:10.1108/09504120810872238 · Cited by 611
Development of the domain name system
Mockapetris, P., & Dunlap, K. J. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52338 · Cited by 161
Cited by
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
Xiong, L., & Liu, L. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1318566 · Cited by 1,788
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., & Kubiatowicz, J. D. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.818784 · Cited by 1,730
Scribe: a large-scale and decentralized application-level multicast infrastructure
Castro, M., Druschel, P., Kermarrec, A.-M., & Rowstron, A. I. T. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803069 · Cited by 1,461
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
Zhou, R., & Hwang, K. (2007) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2007.1021 · Cited by 728
Reclaiming space from duplicate files in a serverless distributed file system
Douceur, J. R., Adya, A., Bolosky, W. J., Simon, P., & Theimer, M. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022312 · Cited by 645
Analyzing Peer-To-Peer Traffic Across Large Networks
Sen, S., & Wang, J. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.826277 · Cited by 586
Trustworthiness Management in the Social Internet of Things
Nitti, M., Girau, R., & Atzori, L. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.105 · Cited by 508
LSB: A Lightweight Scalable Blockchain for IoT security and anonymity
Dorri, A., Kanhere, S. S., Jurdak, R., & Gauravaram, P. (2019) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2019.08.005 · Cited by 480
OmniPHR: a distributed architecture model to integrate personal health records
Roehrs, A., da Costa, C. A., & da Rosa Righi, R. (2017) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2017.05.012 · Cited by 428
SybilGuard: Defending Against Sybil Attacks via Social Networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. D. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.923723 · Cited by 394
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
Block-DEF: A secure digital evidence framework using blockchain
Tian, Z., Li, M., Qiu, M., Sun, Y., & Su, S. (2019) · Information Sciences · doi:10.1016/j.ins.2019.04.011 · Cited by 355
Static analysis of android apps: A systematic literature review
Li, L., Bissyandé, T. F., Papadakis, M., Rasthofer, S., Bartel, A., Octeau, D., Klein, J., & Traon, L. (2017) · Information and Software Technology · doi:10.1016/j.infsof.2017.04.001 · Cited by 350
QRON: QoS-Aware Routing in Overlay Networks
Li, Z., & Mohapatra, P. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.818782 · Cited by 286
A Survey on Virtual Machine Migration: Challenges, Techniques, and Open Issues
Zhang, F., Liu, G., Fu, X., & Yahyapour, R. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2794881 · Cited by 266
FDC: 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
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
Map API - scalable decentralized map building for robots
Cieslewski, T., Lynen, S., Dymczyk, M., Magnenat, S., & Siegwart, R. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7140075 · Cited by 36
Metadata
- Authors
- Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2001-08-27
- Volume
- 31
- Issue
- 4
- Pages
- 149-160
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W4250390143
- Cited by
- 1,923
- References
- 8
- FWCI
- 56.65
- 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.