Brief announcement: Gossiping with latencies

DOI10.1145/3087801.3087846MaRDI QIDQ5368972zbMATH OpenOpenAlexFDO

Authors Peter Robinson, Suman Sourav, Seth Gilbert

Publication date 11 October 2017

Published in Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

information disseminationguessing gamegossiplatenciescritical latencyweighted conductanceweighted spanner

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Network design and communication in computer systems (68M10)

Recommendations

• Rumor spreading with no dependence on conductance
• Global computation in a poorly connected world
• Almost tight bounds for rumour spreading with conductance
• Rumor spreading and conductance
• Latency, capacity, and distributed minimum spanning trees

This page was built for publication: Brief announcement: Gossiping with latencies

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