On collaborative content distribution using multi-message gossip

DOI10.1016/J.JPDC.2007.05.004MaRDI QIDQ436627zbMATH OpenOpenAlexFDO

Authors Yaacov Fernandess, Dahlia Malkhi

Publication date 25 July 2012

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.2007.05.004

zbMATH Keywords

randomized algorithmscollaborative content distributionepidemic algorithmsgossipmessage dissemination

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Gossiping With Multiple Messages
• How efficient can gossip be? (On the cost of resilient information exchange)
• Confidential gossip
• Gossip algorithms
• Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination

Cited in

(5)

• Performance tradeoffs in structured peer to peer streaming
• Stochastic coalescence in logarithmic time
• Large-scale access scheduling in wireless mesh networks using social centrality
• Two phase gossip: Managing distributed event histories
• Order optimal information spreading using algebraic gossip

This page was built for publication: On collaborative content distribution using multi-message gossip

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