Choosing a random peer in Chord

DOI10.1007/s00453-007-9029-2zbMath1131.68022OpenAlexW2155530897MaRDI QIDQ2461543

Scott J. Lewis, Maxwell Young, Valerie King, Jared Saia

Publication date: 28 November 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9029-2

zbMATH Keywords

Randomized algorithmsChordDistributed algorithmsData collectionPeer-to-peerAttack-resistanceDistributed Hash table

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Randomized algorithms (68W20) Distributed algorithms (68W15)

Uses Software

• Chord
• Pastry

Cites Work

• Simple efficient load-balancing algorithms for peer-to-peer systems
• Routing networks for distributed hash tables
• Finding nearest neighbors in growth-restricted metrics
• A stochastic process on the hypercube with applications to peer-to-peer networks
• Viceroy
• Algorithms – ESA 2005
• Choosing a random peer
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Choosing a random peer in Chord