Chord: A scalable peer-to-peer lookup service for internet applications. 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.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 202 articles )

Showing results 1 to 20 of 202.
Sorted by year (citations)

1 2 3 ... 9 10 11 next

  1. Marinković, Bojan; Glavan, Paola; Ognjanović, Zoran: Proving properties of the chord protocol using the ASM formalism (2019)
  2. Pass, Rafael; Seeman, Lior; Shelat, Abhi: Analysis of the blockchain protocol in asynchronous networks (2017)
  3. Baldoni, Roberto; Bonomi, Silvia; Raynal, Michel: Implementing set objects in dynamic distributed systems (2016)
  4. Bollig, Beate; Bury, Marc: On the OBDD representation of some graph classes (2016)
  5. Rocha, Vladimir; Kon, Fabio; Cobe, Raphael; Wassermann, Renata: A hybrid cloud-P2P architecture for multimedia information retrieval on VoD services (2016) ioport
  6. Brodal, Gerth Stølting; Sioutas, Spyros; Tsichlas, Kostas; Zaroliagis, Christos: (D^2)-tree: a new overlay with deterministic bounds (2015)
  7. Kapelko, Rafał; Marchwicki, Karol: Uniformity of direct unions of Chord (2015)
  8. Kniesburges, Sebastian; Koutsopoulos, Andreas; Scheideler, Christian: A deterministic worst-case message complexity optimal solution for resource discovery (2015)
  9. Komu, Miika; Sethi, Mohit; Beijar, Nicklas: A survey of identifier-locator split addressing architectures (2015) ioport
  10. Shahrivari, Saeed; Jalili, Saeed: Distributed discovery of frequent subgraphs of a network using MapReduce (2015)
  11. Sioutas, Spyros; Sourla, Efrosini; Tsichlas, Kostas; Zaroliagis, Christos: (D^3)-tree: a dynamic deterministic decentralized structure (2015)
  12. Zave, P.: A practical comparison of Alloy and Spin (2015) ioport
  13. Gall, Dominik; Jacob, Riko; Richa, Andrea; Scheideler, Christian; Schmid, Stefan; Täubig, Hanjo: A note on the parallel runtime of self-stabilizing graph linearization (2014)
  14. Jacob, Riko; Richa, Andrea; Scheideler, Christian; Schmid, Stefan; Täubig, Hanjo: (\mathrmSKIP^+), a self-stabilizing skip graph (2014)
  15. Joung, Yuh-Jzer; Yang, Li-Wei: On character-based index schemes for complex wildcard search in peer-to-peer networks (2014)
  16. Kniesburges, Sebastian; Koutsopoulos, Andreas; Scheideler, Christian: Re-Chord: a self-stabilizing chord overlay network (2014)
  17. Lee, Jaehwan; Keleher, Pete; Sussman, Alan: Exploiting multi-core nodes in peer-to-peer grids (2014) ioport
  18. Li, Juan; Li, Qingrui; Liu, Chao; Ullah Khan, Samee; Ghani, Nasir: Community-based collaborative information system for emergency management (2014) ioport
  19. Martalò, M.; Amoretti, M.; Picone, M.; Ferrari, G.: Sporadic decentralized resource maintenance for P2P distributed storage networks (2014) ioport
  20. Ma, Xingkong; Wang, Yijie; Sun, Weidong: Feverfew: a scalable coverage-based hybrid overlay for Internet-scale pub/sub networks (2014) ioport

1 2 3 ... 9 10 11 next