Messy broadcasting - Decentralized broadcast schemes with limited knowledge

Authors:
Hovhannes A. Harutyunyan;Pavol Hell;Arthur L. Liestman
Affiliations:
Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada;School of Computing Science, Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada;School of Computing Science, Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 13
Cited 1

On spreading a rumor

SIAM Journal on Applied Mathematics
A trade-off between information and communication in broadcast protocols

Journal of the ACM (JACM)
Methods and problems of communication in usual networks

Proceedings of the international workshop on Broadcasting and gossiping 1990
Exact solutions to diameter and routing problems in PEC networks

Journal of Parallel and Distributed Computing
On the Optimality of General Lower Bounds for Broadcasting and Gossiping

SIAM Journal on Discrete Mathematics
Deterministic broadcasting time with partial knowledge of the network

Theoretical Computer Science
Randomized rumor spreading

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)

Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem

SIAM Journal on Computing
Oracle size: a new measure of difficulty for communication tasks

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Quasirandom rumor spreading

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Neighborhood Broadcasting in Hypercubes

SIAM Journal on Discrete Mathematics
On randomized broadcasting in Star graphs

Discrete Applied Mathematics

The worst case behavior of randomized gossip

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider versions of broadcasting that proceed in the absence of information about the network. In particular, the vertices of the network do not know the structure of the network or the starting time, originator, or state of the broadcast. Furthermore, the protocols are not coordinated. This synchronous anonymous communication model has been called messy broadcasting. We perform a worst case analysis of three variants of messy broadcasting. These results also provide upper bounds on broadcasting where every vertex simply calls each of its neighbors once in random order. We prove exact bounds on the time required for broadcasting under two variants and give a conjectured value for the third.