Choosing a random peer

DOI10.1145/1011767.1011786MaRDI QIDQ5501491zbMATH OpenOpenAlexFDO

Authors Valerie King, Jared Saia

Publication date 3 August 2015

Published in Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1011767.1011786

zbMATH Keywords

distributed hash tablepeer-to-peerrandom sampling

Mathematics Subject Classification ID

Network protocols (68M12) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Choosing a random peer in Chord
• On Sampling in Higher-Dimensional Peer-to-Peer Systems
• Routing networks for distributed hash tables
• Random Subsets of the Interval and P2P Protocols
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems

Cited in

(11)

• Robust random number generation for peer-to-peer systems
• Randomized leader election
• The expansion and mixing time of skip graphs with applications
• Choosing a random peer in Chord
• On Sampling in Higher-Dimensional Peer-to-Peer Systems
• Random Subsets of the Interval and P2P Protocols
• scientific article; zbMATH DE number 2091895 (Why is no real title available?)
• Peer counting and sampling in overlay networks, random walk methods
• On the uniformity of peer sampling based on view shuffling
• Echo: a peer-to-peer clustering framework for improving communication in DHTs
• Maintaining the Ranch topology

This page was built for publication: Choosing a random peer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501491)