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)
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68M10: Network design and communication in computer systems
Related Items
Theory and Practice of Discrete Interacting Agents Models, A linear algorithm for finding the k‐broadcast center of a tree, On Mixing and Edge Expansion Properties in Randomized Broadcasting, Broadcasting in weighted trees under the postal model, Binary linear programming models for robust broadcasting in communication networks, All-to-all broadcast problem of some classes of graphs under the half duplex all-port model, Gossiping and routing in second-kind Frobenius graphs, Upper bounds on the broadcast function using minimum dominating sets, Odd gossiping, Efficient broadcast trees for weighted vertices, Rumor spreading in social networks, Messy broadcasting - decentralized broadcast schemes with limited knowledge, Meeting the deadline: on the complexity of fault-tolerant continuous gossip, Rooted level-disjoint partitions of Cartesian products, A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks, Rotational circulant graphs, On the runtime and robustness of randomized broadcasting, Robust gossiping with an application to consensus, On the complexity of the shortest-path broadcast problem, On the complexity of bandwidth allocation in radio networks, Broadcasting from multiple originators, Gossiping by processors prone to omission failures, Minimum broadcast tree decompositions, Spreading messages, Optimal gathering protocols on paths under interference constraints, Broadcasting multiple messages in the 1-in port model in optimal time, Optimal odd gossiping, The shortest path problem in the Knödel graph, Modelling simultaneous broadcasting by level-disjoint partitions, Optimal gossiping in square 2D meshes, Minimum bisection is NP-hard on unit disk graphs, Dynamic gossip, Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model, Nonadaptive broadcasting in trees
