Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
From MaRDI portal
Publication:1773296
zbMath1067.68016MaRDI QIDQ1773296
Walter Unger, Peter Ružička, Ralf Klasing, Andrzej Pelc, Juraj Hromkovič
Publication date: 27 April 2005
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10)
Related Items
Binary linear programming models for robust broadcasting in communication networks ⋮ Broadcasting multiple messages in the 1-in port model in optimal time ⋮ On the runtime and robustness of randomized broadcasting ⋮ Propositional gossip protocols ⋮ Optimal gossiping in square 2D meshes ⋮ Robust gossiping with an application to consensus ⋮ Optimal odd gossiping ⋮ On temporal graph exploration ⋮ Minimum bisection is NP-hard on unit disk graphs ⋮ Dynamic gossip ⋮ All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ Approximation algorithms in graphs with known broadcast time of the base graph ⋮ On the complexity of the shortest-path broadcast problem ⋮ Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model ⋮ Messy broadcasting - decentralized broadcast schemes with limited knowledge ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ Minimal number of calls in propositional protocols ⋮ Confidential gossip ⋮ Unnamed Item ⋮ The logic of gossiping ⋮ Unnamed Item ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ On Mixing and Edge Expansion Properties in Randomized Broadcasting ⋮ Meeting the deadline: on the complexity of fault-tolerant continuous gossip ⋮ Rooted level-disjoint partitions of Cartesian products ⋮ On the complexity of bandwidth allocation in radio networks ⋮ Odd gossiping ⋮ Efficient broadcast trees for weighted vertices ⋮ Gossiping by energy-constrained mobile agents in tree networks ⋮ A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks ⋮ Broadcasting from multiple originators ⋮ Rumor spreading in social networks ⋮ Gossiping by processors prone to omission failures ⋮ The shortest path problem in the Knödel graph ⋮ A linear algorithm for finding the k‐broadcast center of a tree ⋮ Modelling simultaneous broadcasting by level-disjoint partitions ⋮ Theory and Practice of Discrete Interacting Agents Models ⋮ Broadcasting in weighted trees under the postal model ⋮ Rumor spreading with bounded in-degree ⋮ Rotational circulant graphs ⋮ Nonadaptive broadcasting in trees ⋮ Minimum broadcast tree decompositions ⋮ Spreading messages ⋮ Optimal gathering protocols on paths under interference constraints
