Metraipolis › archive › dc_8a2173390b71

Chord (peer-to-peer) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Chord_(peer-to-peer)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-05T23:57:18.553Z
SHA-256 of the archived text
0be2bff8deaf545535c6d957715cb0aec363c0115307a1b50b01652d21b41d18
Stable URL of this page
https://metraipolis.com/documento/dc_8a2173390b71

How to cite

Chord (peer-to-peer) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Chord_(peer-to-peer) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_8a2173390b71 (Metraipolis archive dc_8a2173390b71, sha256 0be2bff8deaf545535c6d957715cb0aec363c0115307a1b50b01652d21b41d18)
BibTeX
@misc{dc8a2173390b71,
  title = {Chord (peer-to-peer) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Chord_(peer-to-peer)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_8a2173390b71; sha256 0be2bff8deaf545535c6d957715cb0aec363c0115307a1b50b01652d21b41d18},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Chord_(peer-to-peer). Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computing, Chord is a protocol and algorithm for a peer-to-peer distributed hash table. A distributed hash table stores key-value pairs by assigning keys to different computers (known as "nodes"); a node will store the values for all the keys for which it is responsible. Chord specifies how keys are assigned to nodes, and how a node can discover the value for a given key by first locating the node responsible for that key. Chord is one of the four original distributed hash table protocols, along with CAN, Tapestry, and Pastry. It was introduced in 2001 by Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan, and was developed at MIT. The 2001 Chord paper won an ACM SIGCOMM Test of Time award in 2011. Subsequent research by Pamela Zave has shown that the original Chord protocol (as specified in the 2001 SIGCOMM paper, the 2001 Technical report, the 2002 PODC paper, and the 2003 TON paper ) can mis-order the ring, produce several rings, and break the ring. A corrected version of the protocol prevents these errors, without imposing additional overhead.

Tema degli esploratori: ricerca e scienza aperta (deposito sistematico; ricerca «open peer review»).
Fonte: Wikipedia in inglese, voce «Chord (peer-to-peer)» — https://en.wikipedia.org/wiki/Chord_(peer-to-peer)
Wikidata Q1076368 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1076368
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Chord_(peer-to-peer)?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1371957200, consultata il 2026-10-05T23:24:34.431Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 6b17d066556c563c3fa87320b6da3a13eb15385558bd94786a3d0064656509d6