This work concerns 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 conflict ing information. Tight bounds are “Dept. of Mathematics and Lab. for Computer Science, M. I. T., Cambridge, MA 02139. Supported by Air Force Contract TNDGAFOSR-860078, ARO contract DAAL03-86-K-0171, NSF contract CCR861 1442, and a special grant from IBM. tIBM T*J. Watson Research center, p-o. Box 704, Yorktown Heights, NY 10598, and Faculty of Electrical Engineering, The Technion, Haifa 32000, Israel. fIBM T.J. Watson Research center p,o. Box 704, Yorktown Heights, NY 10598. ~Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138. Partially supported by ONR NOO014-85-K-0445. WDepartment of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel. Supported in part by an Allen Fellowship, by a Walter and Elise Haaa Career Development Award and by a Bantrell Fellowship. Permission to copy without fee all or part of this material k granted provided that the copiesare not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. 01991 ACM 0-89791-439-2/91/0007/0153 $1.50 established for broadcast under such conditions, and applications of the broadcast protocol to other distributed computing problems are discussed.
[1]
Baruch Awerbuch,et al.
Distributed control for PARIS
,
1990,
PODC '90.
[2]
Eric C. Rosen,et al.
The New Routing Algorithm for the ARPANET
,
1980,
IEEE Trans. Commun..
[3]
Avi Wigderson,et al.
Completeness theorems for non-cryptographic fault-tolerant distributed computation
,
1988,
STOC '88.
[4]
Robert G. Gallager,et al.
Broadcasting Topology Information in Computer Networks
,
1987
.
[5]
Michael O. Rabin,et al.
Efficient dispersal of information for security, load balancing, and fault tolerance
,
1989,
JACM.
[6]
Shimon Even,et al.
Graph Algorithms
,
1979
.
[7]
TiwariPrasoon.
Lower bounds on communication complexity in distributed computer networks
,
1987
.
[8]
Jeffrey M. Jaffe,et al.
SNA Networks of Small Systems
,
1985,
IEEE J. Sel. Areas Commun..
[9]
Andrew Chi-Chih Yao,et al.
Some complexity questions related to distributive computing(Preliminary Report)
,
1979,
STOC.
[10]
Prasoon Tiwari.
Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version)
,
1984,
FOCS.
[11]
John J. Metzner,et al.
An Improved Broadcast Retransmission Protocol
,
1984,
IEEE Trans. Commun..
[12]
Larry Carter,et al.
Universal Classes of Hash Functions
,
1979,
J. Comput. Syst. Sci..