On the runtime and robustness of randomized broadcasting

DOI10.1016/j.tcs.2008.04.017zbMath1206.68362OpenAlexW1970542229MaRDI QIDQ838155

Thomas Sauerwald, Robert Elsässer

Publication date: 21 August 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.017

zbMATH Keywords

randomized algorithmdistributed computing

Mathematics Subject Classification ID

Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12)

Related Items (15)

Diameter and broadcast time of random geometric graphs in arbitrary dimensions ⋮ On the Push&Pull Protocol for Rumor Spreading ⋮ Unnamed Item ⋮ Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication ⋮ Simplified Chernoff bounds with powers-of-two probabilities ⋮ Randomized Rumour Spreading: The Effect of the Network Topology ⋮ Nonlinear vibration analysis of micro-plates based on strain gradient elasticity theory ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ The worst case behavior of randomized gossip protocols ⋮ Propagation time for probabilistic zero forcing ⋮ Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits ⋮ Unnamed Item ⋮ An application of a size-dependent model on microplate with elastic medium based on strain gradient elasticity theory ⋮ Velocity dispersion in an elastic plate with microstructure: effects of characteristic length in a couple stress model ⋮ Robustness of randomized rumour spreading

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive broadcasting with faulty nodes
• Agent-based randomized broadcasting in large networks
• A guided tour of Chernoff bounds
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• The Mathematics of Infectious Diseases
• Randomized broadcast in networks
• Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
• On Spreading a Rumor
• Handbook of Graph Theory
• Probability and Computing
• Optimal Assignments of Numbers to Vertices
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: On the runtime and robustness of randomized broadcasting