On gossip and populations

DOI10.1007/978-3-642-11476-2_7MaRDI QIDQ3408161zbMATH OpenOpenAlexFDO

Authors Marin Bertier, Yann Busnel, Anne-Marie Kermarrec

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_7

Mathematics Subject Classification ID

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

Recommendations

• Dynamic gossip
• Intelligent Gossip
• Secure peer sampling
• Gossip in dynamic networks
• Epistemic protocols for dynamic gossip

Cites work

• scientific article; zbMATH DE number 5605125 (Why is no real title available?)
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• On the complexity of asynchronous gossip
• Peer counting and sampling in overlay networks, random walk methods
• Stably computable predicates are semilinear
• T-Man: Gossip-based fast overlay topology construction
• The computational power of population protocols

Cited in

(6)

• The design of novel distributed protocols from differential equations
• Equational reasonings in wireless network gossip protocols
• On the design of distributed protocols from differential equations
• Intelligent Gossip
• Gossip and the efficiency of interactions
• Secure peer sampling

This page was built for publication: On gossip and populations

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