The flip markov chain and a randomising P2P protocol

DOI10.1145/1582716.1582742zbMath1291.68042OpenAlexW1965888336WikidataQ56323835 ScholiaQ56323835MaRDI QIDQ5170311

Colin Cooper, Martin Dyer, Andrew Handley

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

networkmixing timeprotocolasynchronousdistributedpeer-to-peercanonical pathsP2Prandomisation

Mathematics Subject Classification ID

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

Related Items

DEX: self-healing expanders, On the uniformity of peer sampling based on view shuffling, The flip Markov chain for connected regular graphs, Physical Expander in Virtual Tree Overlay