Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On collaborative content distribution using multi-message gossip

From MaRDI portal
Publication:436627
Jump to:navigation, search

DOI10.1016/J.JPDC.2007.05.004zbMath1243.68027OpenAlexW2584710039MaRDI QIDQ436627

Dahlia Malkhi, Yaacov Fernandess

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)


Related Items (4)

Large-scale access scheduling in wireless mesh networks using social centrality ⋮ Performance tradeoffs in structured peer to peer streaming ⋮ Order optimal information spreading using algebraic gossip ⋮ Unnamed Item







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:436627&oldid=12312456"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 04:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki