Optimal Broadcast with Partial Knowledge

Authors:
Baruch Awerbuch;Israel Cidon;Shay Kutten;Yishay Mansour;David Peleg
Affiliations:
-;-;-;-;-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 3

Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Optimal maintenance of a spanning tree

Journal of the ACM (JACM)
Time-efficient broadcasting in radio networks: a review

ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work is concerned with the problem of broadcasting a large message efficiently when each processor has partial prior knowledge about the contents of the broadcast message. The partial information held by the processors might be out of date or otherwise erroneous, and consequently, different processors may hold conflicting information. Tight bounds are established for broadcast under such conditions, and applications of the broadcast protocol to other distributed computing problems are discussed.