Chord: A scalable peer-to-peer lookup service for internet applications
Explore this paper's citation graph
Summary
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.
- Type
- article
- Published
- 2001-10-01
- Cited by
- 11,935
- References
- 44
- OpenAlex
- https://openalex.org/W2158049821
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:207787803
Keywords
Chord (peer-to-peer), Computer science, Scalability, Pastry, Key (lock)
References
- Consistent hashing and random trees : algorithms for caching in distributed networks
- Building peer-to-peer systems with chord, a distributed lookup service
- Freenet: A Distributed Anonymous Information Storage and Retrieval System
- XDR: External Data Representation Standard
- Service Location Protocol
- Host Mobility Using an Internet Indirection Infrastructure
- A prototype implementation of archival Intermemory
- The impact of DHT routing geometry on resilience and proximity
- Separating key management from file system security
- OceanStore: an architecture for global-scale persistent storage
- Internet indirection infrastructure
- Development of the domain name system
- Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
- The design and implementation of an intentional naming system
- Algorithmic Design of the Globe Wide-Area Location Service
- The synchronization of periodic routing messages
- Resilient overlay networks
- Wide-area cooperative storage with CFS
- A scalable content-addressable network
- A scalable location service for geographic ad hoc routing
Cited by
- An adaptive randomised structured search network for locating objects in a distributed computing system
- Peer-to-peer overlays: structured, unstructured, or both?
- Peer Rewiring in Semantic Overlay Networks under Churn - (Short Paper)
- Piggyback Meta-Data Propagation in Distributed Hash Tables
- A comparison of distributed test generation techniques
- Chord und Varianten
- FeedTree: Scalable and prompt delivery for Web feeds
- Constructing Efficient and Fault-Tolerant Unstructured Peer-To-Peer Networks
- Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases
- Accessing XML Documents Using Semantic Meta Data in a P2P Environment
- Knowing Where to Search: Personalized Search Strategies for Peers in P2P Networks
- Espaces vectoriels sémantiques : enrichissement et interprétation de requêtes dans un système d'information distribué et hétérogène. (Semantic Vector Spaces: Query Enrichment and Interpretation in a Distributed and Heterogeneous Information System)
- Dealing with Network Partitions and Mergers in Structured Overlay Networks
- LinuxNOW: A Peer-to-Peer Metacomputer for the Linux Operating System
- A totally distributed iterative scheme for web services addressing and discovery
- Detecting and Excluding Misbehaving Nodes in a P2P Network
- Revisiting Internet topology : application-centric approach
- Energy efficient resource sharing for networked homes
- FISH: A Novel Peer-to-Peer Overlay Network Based on Hyper-deBruijn
- Better than 1 Hop Lookup Performance with Proactive Caching
Related papers
- A Range Query Model Based on DHT in P2P System
- A critical comparative evaluation on DHT-based peer-to-peer search algorithms
- Improvement of Chord Algorithm by Optimizing Finger Tables for Peer Nodes
- E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
- An Evaluation of Chord and Pastry Models in OverSim
- TP2P: 효율적인 자원탐색을 위한 토폴로지 기반의 P2P 시스템
- Re-Chord: A Self-stabilizing Chord Overlay Network