Chord: a scalable peer-to-peer lookup protocol for internet applications
By Ion Stoica, Robert Morris, David Liben-Nowell, David R Karger, M. Frans Kaashoek, Frank Dabek, Hari Balakrishnan. TNET, 2003
3,297 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/88338fd6eb58ba3d559075cbd3e23e24891dd0a7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- John Risson
- Tim Moors
- Ion Stoica
- Michael Walfish
- Srinath T. V. Setty
- Michael J. Freedman
- Hector Garcia-Molina
- Prateek Mittal
Citations in the corpus
- On-the-fly verification of rateless erasure codes for efficient content distribution (2004, background): “, Chord [26], Pastry [24], and Kademlia [13]).”
- The ganglia distributed monitoring system: design, implementation, and experience (2004, background): “One promising direction here might be to leverage distributed hash tables such as CAN [25], Chord [28], Pastry [26], and Tapestry [31].”
- Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks (2011, methodology): “Systems like Chord [17] or Pastry [18] have been implemented, in which 1214 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL.”
- Fast crash recovery in RAMCloud (2011, background): “For example, consistent hashing uses ran domization to distribute objects among a group of servers [24, 9].”
- The socialbot network: when bots socialize for fame and money (2011, neutral): “, Chord [60], Kademlia [43]).”
- ROFL: routing on flat labels (2006, methodology): “[34] I. Stoica, R. Morris, D. Lieben-Nowell, D. Karger, M. Kaashoek, F. Dabek, H. Balakrishnan, “Chord: a scalable peer-to-peer lookup protocol for Internet applications,” IEEE Transactions on Networks, 11(1) 17-32, 2003.”
- Piccolo: Building Fast, Distributed Programs with Partitioned Tables (2010, background): “Examples of these include DDS [23], Memcached [39], the recently proposed RamCloud [38], and many key-value stores based on distributed hash tables [4, 20, 45, 42].”
- Depot: Cloud Storage with Minimal Trust (2010, background): “Many strategies for partitioning keys among nodes are possible [13, 34, 48, 50, 72, 90], and we leave the assignment of keys to volumes to layers above Depot.”
- Versatile, scalable, and accurate simulation of distributed applications and platforms (2014, neutral): “7 shows the simulation time of the Chord protocol [72] vs. the number of simulated peers.”