On the uniformity of peer sampling based on view shuffling

DOI10.1016/J.JPDC.2011.01.009MaRDI QIDQ635396zbMATH OpenOpenAlexFDO

Authors Yann Busnel, Roberto Beraldi, Roberto Baldoni

Publication date 19 August 2011

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2011.01.009

zbMATH Keywords

numerical evaluationstochastic processtheoretical analysisgossip-based protocolpeer sampling

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Recommendations

• On Sampling in Higher-Dimensional Peer-to-Peer Systems
• Choosing a random peer
• Compact samples for data dissemination
• Choosing a random peer in Chord
• Peer counting and sampling in overlay networks, random walk methods

Cites work

• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• An analytical model of information dissemination for a gossip-based protocol
• Brahms
• Choosing a random peer
• Correctness of gossip-based membership under message loss
• Peer counting and sampling in overlay networks, random walk methods
• Random graphs.
• T-Man: Gossip-based fast overlay topology construction
• The flip Markov chain and a randomising P2P protocol

Cited in

(1)

• Compact samples for data dissemination

This page was built for publication: On the uniformity of peer sampling based on view shuffling

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