Lower bounds for the noisy broadcast problem

We prove the first nontrivial (superlinear) lower bound in the noisy broadcast model of distributed computation. In this model, there are n + 1 processors P/sub 0/, P/sub 1/, ..., P/sub n/. Each P/sub i/, for i /spl ges/ 1, initially has a private bit x/sub i/ and the goal is for P/sub 0/ to learn f (x/sub l/, ..., x/sub n/) for some specified function f. At each time step, a designated processor broadcasts some function of its private bit and the bits it has heard so far. Each broadcast is received by the other processors but each reception may be corrupted by noise. In this model, Gallager (1988) gave a noise-resistant protocol that allows P/sub 0/ to learn the entire input in O(n log log n) broadcasts. We prove that Gallager's protocol is optimal up to a constant factor. Our lower bound follows from a lower bound in a new model, the generalized noisy decision tree model, which may be of independent interest.

[1]  Eyal Kushilevitz,et al.  Computation in noisy radio networks , 2005, SODA '98.

[2]  Ilan Newman,et al.  Computing in fault tolerance broadcast networks , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[3]  Giuseppe F. Italiano,et al.  Sorting and searching in the presence of memory faults (without redundancy) , 2004, STOC '04.

[4]  Rocco A. Servedio,et al.  Boosting in the presence of noise , 2003, STOC '03.

[5]  Miklós Ajtai,et al.  The invasiveness of off-line memory checking , 2002, STOC '02.

[6]  Xiaomin Chen,et al.  Computing Boolean functions from multiple faulty copies of input bits , 2002, Theor. Comput. Sci..

[7]  Andrzej Pelc,et al.  Searching games with errors - fifty years of coping with liars , 2002, Theor. Comput. Sci..

[8]  Y. Peres,et al.  Broadcasting on trees and the Ising model , 2000 .

[9]  Uriel Feige,et al.  Finding OR in a noisy broadcast network , 2000, Inf. Process. Lett..

[10]  Leonard J. Schulman,et al.  Signal propagation and noisy circuits , 1999, IEEE Trans. Inf. Theory.

[11]  Michael E. Saks,et al.  Lower bounds for leader election and collective coin-flipping in the perfect information model , 1999, STOC '99.

[12]  William S. Evans,et al.  Average-Case Lower Bounds for Noisy Boolean Decision Trees , 1999, SIAM J. Comput..

[13]  Péter Gács,et al.  Reliable Cellular Automata with Self-Organization , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[14]  M. Ben-Or,et al.  Fault-tolerant quantum computation with constant error , 1996, STOC '97.

[15]  Daniel A. Spielman,et al.  Highly fault-tolerant parallel computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[16]  Michael A. Bender,et al.  Fault tolerant data structures , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[17]  Michel Talagrand,et al.  How much are increasing sets positively correlated? , 1996, Comb..

[18]  L. Schulman.  Coding for interactive communication , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[19]  Frank Thomson Leighton,et al.  On the design of reliable Boolean circuits that contain partially unreliable gates , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[20]  Eli Upfal,et al.  Computing with Noisy Information , 1994, SIAM J. Comput..

[21]  M. Talagrand.  On Russo's Approximate Zero-One Law , 1994 .

[22]  P. Gács,et al.  Lower bounds for the complexity of reliable Boolean circuits with noisy gates , 1994, IEEE Trans. Inf. Theory.

[23]  Frank Thomson Leighton,et al.  Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults , 1993, SPAA '93.

[24]  Uriel Feige,et al.  On the Complexity of Finite Random Functions , 1992, Inf. Process. Lett..

[25]  Rüdiger Reischuk,et al.  Reliable computation with noisy circuits and decision trees-a general n log n lower bound , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[26]  Robert G. Gallager,et al.  Finding parity in a simple broadcast network , 1988, IEEE Trans. Inf. Theory.

[27]  Nicholas Pippenger,et al.  On networks of noisy gates , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[28]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[29]  W. Feller.  An Introduction to Probability Theory and Its Applications , 1959 .

[30]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .