A probabilistic characterization of a fault-tolerant gossiping algorithm

DOI10.1007/S11424-009-9149-7MaRDI QIDQ1044771zbMATH OpenOpenAlexFDO

Authors Xiaohu Li, Shouhuai Xu, Paul A. Parker

Publication date 15 December 2009

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-009-9149-7

zbMATH Keywords

fault-tolerancegossipprobabilistic broadcastreliable multicast

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Epidemiology (92D30) Stochastic systems in control theory (general) (93E03)

Recommendations

• Correctness of a gossip based membership protocol
• How efficient can gossip be? (On the cost of resilient information exchange)
• Fast gossiping with short unreliable messages
• An online distributed gossiping protocol for mobile networks
• scientific article; zbMATH DE number 1696679

Cites work

• Correctness of a gossip based membership protocol
• Fault-tolerant broadcasting and gossiping in communication networks
• Feasibility and complexity of broadcasting with random transmission failures
• scientific article; zbMATH DE number 1696679 (Why is no real title available?)
• scientific article; zbMATH DE number 3523369 (Why is no real title available?)
• scientific article; zbMATH DE number 843258 (Why is no real title available?)
• Spatial gossip and resource location protocols

Cited in

(5)

• Competing between two groups of individuals following frailty models
• Correctness of a gossip based membership protocol
• Stochastic and deterministic fault detection for randomized gossip algorithms
• Fault-tolerant broadcasting and gossiping in communication networks
• An analytical model of information dissemination for a gossip-based protocol

This page was built for publication: A probabilistic characterization of a fault-tolerant gossiping algorithm

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