On the uniformity of peer sampling based on view shuffling

DOI10.1016/J.JPDC.2011.01.009zbMath1219.68038OpenAlexW2087851658MaRDI QIDQ635396

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

stochastic processnumerical evaluationtheoretical analysisgossip-based protocolpeer sampling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An analytical model of information dissemination for a gossip-based protocol
• T-Man: Gossip-based fast overlay topology construction
• Brahms
• The flip markov chain and a randomising P2P protocol
• Correctness of gossip-based membership under message loss
• Peer counting and sampling in overlay networks
• Choosing a random peer

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