Computer Science · Computer Networks
A topic within Computer Networks, itself one of 11 topics in that field and part of Computer Science.
Assumes you know the vocabulary.
Incentives Build Robustness in BitTorrent
Bram Cohen · 2003
Argues a tit-for-tat exchange of pieces between peers, rather than altruism, is what keeps a swarm functioning even when every peer acts purely in…
Primary sources and full treatments.
Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron & Peter Druschel · 2001
Routes lookups through a ring of node identifiers using prefix matching, achieving the same logarithmic hop count as Chord with a different topology…
+2 more at this level
4 works
Bram Cohen
Argues a tit-for-tat exchange of pieces between peers, rather than altruism, is what keeps a swarm functioning even when every peer acts purely in its own interest.
link checked 17 Sept 2026Antony Rowstron & Peter Druschel
Routes lookups through a ring of node identifiers using prefix matching, achieving the same logarithmic hop count as Chord with a different topology and stronger locality properties.
link checked 17 Sept 2026Petar Maymounkov & David Mazières
Defines node distance by XOR so that every lookup step is guaranteed to roughly halve the remaining distance, simplifying the routing-table maintenance earlier distributed hash tables needed.
link checked 17 Sept 2026Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frans Dabek & Hari Balakrishnan
Gives a distributed hash table in which any node can locate the owner of a key in a number of hops logarithmic in network size, with no central directory.
link checked 17 Sept 2026