Sub-linear universal spatial gossip protocols

DOI10.1007/978-3-642-11476-2_5MaRDI QIDQ3408159zbMATH OpenOpenAlexFDO

Authors Hervé Baumann, Pierre Fraigniaud

Publication date 24 February 2010

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11476-2_5

zbMATH Keywords

epidemic algorithminformation spreadingresource location

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Spatial gossip and resource location protocols
• Spatial gossip and resource location protocols
• Simple, fast and deterministic gossip and rumor spreading
• Dynamic gossip
• Simple, fast and deterministic gossip and rumor spreading

Cites work

• Accessing nearby copies of replicated objects in a distributed environment
• On Spreading a Rumor
• Randomized broadcast in networks
• Spatial gossip and resource location protocols
• The shortest-path problem for graphs with random arc-lengths
• Universal augmentation schemes for network navigability

Cited in

(5)

• Equational reasonings in wireless network gossip protocols
• Spatial gossip and resource location protocols
• Geographic gossip on geometric random graphs via affine combinations
• Spatial gossip and resource location protocols
• An online distributed gossiping protocol for mobile networks

This page was built for publication: Sub-linear universal spatial gossip protocols

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