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 protocol for internet applications
Abstract
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired 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 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 and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale 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
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
Self-citationPastry: 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
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
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
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-citation
Cited by
Cassandra: a decentralized structured storage system
Lakshman, A., & Malik, P. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1773912.1773922 · Cited by 2,664
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
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
Web-Based Database for Facial Expression Analysis
Pantic, M., Valstar, M., Rademaker, R., & Maat, L. (2005) · 2005 IEEE International Conference on Multimedia and Expo · doi:10.1109/icme.2005.1521424 · Cited by 1,039
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
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
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
Peer-to-peer support for massively multiplayer games
Knutsson, B., Lu, H., Xu, W., & Hopkins, B. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354485 · Cited by 501
The socialbot network: when bots socialize for fame and money
Boshmaf, Y., Muslukhov, I., Beznosov, K., & Ripeanu, M. (2011) · Proceedings of the 27th Annual Computer Security Applications Conference · doi:10.1145/2076732.2076746 · Cited by 436
Taxonomy of trust: Categorizing P2P reputation systems
Marti, S., & Garcia-Molina, H. (2006) · Computer Networks · doi:10.1016/j.comnet.2005.07.011 · Cited by 433
Versatile, scalable, and accurate simulation of distributed applications and platforms
Casanova, H., Giersch, A., Legrand, A., Quinson, M., & Suter, F. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.06.008 · Cited by 415
Trusted P2P Transactions with Fuzzy Reputation Aggregation
Song, S., Hwang, K., Zhou, R., & Kwok, Y.-K. (2005) · IEEE Internet Computing · doi:10.1109/mic.2005.136 · Cited by 408
PRIVE: anonymous location-based queries in distributed mobile systems
Ghinita, G., Kalnis, P., & Skiadopoulos, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242623 · Cited by 402
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
A taxonomy of Data Grids for distributed data sharing, management, and processing
Venugopal, S., Buyya, R., & Ramamohanarao, K. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132955 · Cited by 351
Distributed and cloud computing: from parallel processing to the Internet of things
(2012) · Choice Reviews Online · doi:10.5860/choice.49-5712 · Cited by 314
Falkon: a Fast and Light-weight tasK executiON framework
Raicu, I., Zhao, Y., Dumitrescu, C., Foster, I., & Wilde, M. (2007) · Proceedings of the 2007 ACM/IEEE conference on Supercomputing · doi:10.1145/1362622.1362680 · Cited by 299
Implementing declarative overlays
Loo, B. T., Condie, T., Hellerstein, J. M., Maniatis, P., Roscoe, T., & Stoica, I. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095818 · Cited by 292
Self-citationVON: a scalable peer-to-peer network for virtual environments
Hu, S.-Y., Chen, J.-F., & Chen, T.-H. (2006) · IEEE Network · doi:10.1109/mnet.2006.1668400 · Cited by 272
Ousterhout, J., Gopalan, A., Gupta, A., Kejriwal, A., Lee, C., Montazeri, B., Ongaro, D., Park, S. J., Qin, H., Rosenblum, M., et al. (2015) · ACM Transactions on Computer Systems · doi:10.1145/2806887 · Cited by 268
MobilityFirst: a robust and trustworthy mobility-centric architecture for the future internet
Raychaudhuri, D., Nagaraja, K., & Venkataramani, A. (2012) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/2412096.2412098 · Cited by 263
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.”
BackgroundA Routing Table Poisoning Model for Peer-to-Peer (P2P) Botnets
Tetarave, S. K., Tripathy, S., Kalaimannan, E., John, C., & Srivastava, A. (2019) · IEEE Access · doi:10.1109/access.2019.2906875 · Cited by 7
Metadata
- Authors
- Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2003-02
- Volume
- 11
- Issue
- 1
- Pages
- 17-32
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2118428193
- Cited by
- 3,133
- References
- 17
- FWCI
- 261.00
- 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.