PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
Introduction to distributed algorithms
Introduction to distributed algorithms
Broadcasting in unlabeled hypercubes with a linear number of messages
Information Processing Letters
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Perfect broadcasting in unlabeled networks
Discrete Applied Mathematics
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Randomized Broadcast in Networks
SIGAL '90 Proceedings of the International Symposium on Algorithms
Lower Bounds for Synchronous Networks and the Advantage of Local Information
Proceedings of the 2nd International Workshop on Distributed Algorithms
| Hi-index | 0.00 |
We consider the problem of disseminating messages in networks. We are interested in information dissemination algorithms in which machines operate independently without any knowledge of the network topology or size. Three communication tasks of increasing difficulty are studied. In blind broadcasting (BB) the goal is to communicate the source message to all nodes. In acknowledged blind broadcasting (ABB) the goal is to achieve BB and inform the source about it. Finally, in full synchronization (FS) all nodes must simultaneously enter the state terminated after receiving the source message. The algorithms should be efficient both in terms of the time required and the communication overhead they put on the network. We limit the latter by allowing every node to send a message to at most one neighbor in each round. We show that BB is achieved in time at most 2n in any n-node network and show networks in which time 2n-o(n) is needed. For ABB we show algorithms working in time (2+Ɛ)n, for any fixed positive constant Ɛ and sufficiently large n. Thus for both BB and ABB our algorithms are close to optimal. Finally, we show a simple algorithm for FS working in time 3n.The optimal time of full synchronization remains an open problem.