Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.

zbMATH Open1067.68016MaRDI QIDQ1773296FDOQ1773296

Authors: Juraj Hromkovič, Ralf Klasing, Andrzej Pelc, Peter Ružička, Walter Unger 

Publication date: 27 April 2005

Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 857072
• Time-efficient broadcast in radio networks
• Design and Analysis of Distributed Algorithms
• Fault-tolerant broadcasting and gossiping in communication networks
• A survey of gossiping and broadcasting in communication networks

zbMATH Keywords

distributed computing

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10)

Cited In (48)

• A linear algorithm for finding the k‐broadcast center of a tree
• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• Binary linear programming models for robust broadcasting in communication networks
• Dynamic gossip
• Robust gossiping with an application to consensus
• Leader nodes in communities for information spreading
• The shortest path problem in the Knödel graph
• Information Dispersal and Parallel Computation
• Upper bounds on the broadcast function using minimum dominating sets
• A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks
• Rumor spreading in social networks
• Optimal gathering protocols on paths under interference constraints
• Nonadaptive broadcasting in trees
• Propositional gossip protocols
• Gossiping by processors prone to omission failures
• Broadcasting from multiple originators
• Spreading messages
• Theory and practice of discrete interacting agents models
• Gossiping and routing in second-kind Frobenius graphs
• The logic of gossiping
• Gossiping by energy-constrained mobile agents in tree networks
• Title not available (Why is that?)
• Time-optimal broadcasting of multiple messages in 1-in port model
• Common knowledge in a logic of gossips
• Modelling simultaneous broadcasting by level-disjoint partitions
• On the runtime and robustness of randomized broadcasting
• Rotational circulant graphs
• Minimum bisection is NP-hard on unit disk graphs
• On the complexity of the shortest-path broadcast problem
• Optimal odd gossiping
• On Mixing and Edge Expansion Properties in Randomized Broadcasting
• Source-oblivious broadcast
• Messy broadcasting - decentralized broadcast schemes with limited knowledge
• On broadcast schemes of Knödel graphs
• Parameterized Complexity of Broadcasting in Graphs
• Broadcasting multiple messages in the 1-in port model in optimal time
• Approximation algorithms in graphs with known broadcast time of the base graph
• Minimal number of calls in propositional protocols
• On the complexity of bandwidth allocation in radio networks
• Broadcasting in weighted trees under the postal model
• Rooted level-disjoint partitions of Cartesian products
• Efficient broadcast trees for weighted vertices
• Odd gossiping
• Confidential gossip
• Optimal gossiping in square 2D meshes
• Title not available (Why is that?)
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Minimum broadcast tree decompositions

This page was built for publication: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.

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