Get started
Keyword

chords

Description: Chord is a distributed peer-to-peer protocol that organizes nodes using a distributed hash table to support scalable lookup and data location.
Wikidata ID: wiki/Q1076368
OpenAlex ID: keywords/chords
Chord
2001 · Ion Stoica, Robert Morris, et al. · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · 9,623
Chord: a scalable peer-to-peer lookup protocol for internet applications
2003 · I. Stoica, R. Morris, et al. · IEEE/ACM Transactions on Networking · 3,134
Chord
2001 · Ion Stoica, Robert Morris, et al. · ACM SIGCOMM Computer Communication Review · 1,923
Wide-area cooperative storage with CFS
2001 · Frank Dabek, M. Frans Kaashoek, et al. · 1,443
Tonal Pitch Space
2001 · Fred Lerdahl · Medical Entomology and Zoology · 575
Koorde: A Simple Degree-Optimal Distributed Hash Table
2003 · M. Frans Kaashoek, David R. Karger · Lecture notes in computer science · 568
Wide-area cooperative storage with CFS
2001 · Frank Dabek, M. Frans Kaashoek, et al. · 449
OverSim: A Flexible Overlay Network Simulation Framework
2007 · Ingmar Baumgart, Bernhard Heep, et al. · 433
Analysis of the evolution of peer-to-peer systems
2002 · David Liben-Nowell, Hari Balakrishnan, et al. · 411
Simple efficient load balancing algorithms for peer-to-peer systems
2004 · David R. Karger, Matthias Ruhl · 326
An evaluation of scalable application-level multicast built using peer-to-peer overlays
2003 · M. Castro, M.B. Jones, et al. · 251
Building peer-to-peer systems with chord, a distributed lookup service
2005 · F. Dabek, E. Brunskill, et al. · Workshop on Hot Topics in Operating Systems · 230
Graph-theoretic analysis of structured peer-to-peer systems
2003 · Dmitri Loguinov, Anuj Kumar, et al. · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · 229
Serving DNS Using a Peer-to-Peer Lookup Service
2002 · Russ Cox, Athicha Muthitacharoen, et al. · Lecture notes in computer science · 217
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
2005 · Jinyano Li, J. Stribling, et al. · 216
Hierarchical Peer-to-peer Systems
2003 · L. GARCÉS-ERICE, E. W. BIERSACK, et al. · Parallel Processing Letters · 216
Know thy neighbor's neighbor
2004 · Gurmeet Singh Manku, Moni Naor, et al. · ACM Symposium on Theory of Computing (STOC) · 205
T-Man: Gossip-based fast overlay topology construction
2009 · Márk Jelasity, Alberto Montresor, et al. · Computer Networks · 204
PDF
Canon in G major: designing DHTs with hierarchical structure
2004 · Prasanna Ganesan, Krishna Gummadi, et al. · International Conference on Distributed Computing Systems · 202
A peer-to-peer approach to content-based publish/subscribe
2003 · Wesley W. Terpstra, Stefan Behnel, et al. · 187
Exploiting network proximity in peer-to-peer overlay networks
2002 · Miguel Castro, Peter Druschel, et al. · 177
Associative search in peer to peer networks: harnessing latent semantics
2003 · E. Cohen, A. Fiat, et al. · 174
The Processing of Pitch Combinations
1999 · Diana Deutsch · Elsevier eBooks · 169
Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks
2003 · Miguel Castro, Peter Druschel, et al. · Lecture notes in computer science · 164
Using graphic turing tests to counter automated DDoS attacks against web servers
2003 · William G. Morein, Angelos Stavrou, et al. · Proceedings of the ACM Conference on Computer and Communications Security · 155
Works count: 3,451
Citation count: 32,700
Year
Topic
Type