Optimal Broadcast with Partial Knowledge

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.

[1]  Baruch Awerbuch,et al.  Broadcast with partial knowledge (preliminary version) , 1991, PODC '91.

[2]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[3]  John J. Metzner,et al.  An Improved Broadcast Retransmission Protocol , 1984, IEEE Trans. Commun..

[4]  Robert G. Gallager,et al.  Event driven topology broadcast without sequence numbers , 1989, IEEE Trans. Commun..

[5]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[6]  Baruch Awerbuch,et al.  The maintenance of common data in a distributed system , 1997, JACM.

[7]  Jeffrey M. Jaffe,et al.  SNA Networks of Small Systems , 1985, IEEE J. Sel. Areas Commun..

[8]  Shimon Even,et al.  Graph Algorithms , 1979 .

[9]  Baruch Awerbuch,et al.  Applying static network protocols to dynamic networks , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  Shmuel Katz,et al.  Self-stabilizing extensions for message-passing systems , 1990, PODC '90.

[11]  John J. Metzner,et al.  Efficient Replicated Remote File Comparison , 1991, IEEE Trans. Computers.

[12]  Prasoon Tiwari,et al.  Lower bounds on communication complexity in distributed computer networks , 1984, JACM.

[13]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[14]  Baruch Awerbuch,et al.  Distributed control for PARIS , 1990, PODC '90.

[15]  Robert G. Gallager,et al.  Broadcasting Topology Information in Computer Networks , 1987 .

[16]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[17]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[18]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[19]  Boaz Patt-Shamir,et al.  Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.