Rapid rumor ramification: approximating the minimum broadcast time

Given an undirected graph representing a network of processors, and a source node containing a message that must be broadcast to all the nodes, find a scheme that accomplishes the broadcast in the minimum number of time steps. At each time step, any processor that has received the message is allowed to communicate the message to at most one of its neighbors in the network, i.e. can communicate via a telephone call to a neighbor. This has been termed the minimum broadcast time problem under the telephone model and is known to be NP-complete. The minimum broadcast time in a graph is closely related to the poise of the graph. The poise of a tree is defined to be the quantity (maximum degree of any node in the tree+diameter of the tree). The poise of a graph is the minimum poise of any of its spanning trees. Computing the poise of a graph is shown to be NP-hard and an algorithm for computing a spanning tree of approximately minimum poise is derived. This algorithm is then used to derive an O(log/sup 2/n/log log n)-approximation for the minimum broadcast time problem on an n-node graph. Our algorithm extends to many generalizations of the problem such as the multicast problem, a telephone model allowing conference calls, and to the closely related minimum gossip time problem.<<ETX>>

[1]  Arthur L. Liestman,et al.  Broadcast Networks of Bounded Degree , 1988, SIAM J. Discret. Math..

[2]  Prabhakar Raghavan,et al.  Provably good routing in graphs: regular arrays , 1985, STOC '85.

[3]  Peter Scheuermann,et al.  Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks , 1984, IEEE Transactions on Computers.

[4]  R. Ravi,et al.  Many birds with one stone: multi-objective approximation algorithms , 1993, STOC '93.

[5]  Philip N. Klein,et al.  Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities , 1990, STOC '90.

[6]  Dana S. Richards,et al.  Generalizations of broadcasting and gossiping , 1988, Networks.

[7]  R. Ravi,et al.  Spanning trees short or small , 1994, SODA '94.

[8]  David W. Krumme,et al.  Gossiping in Minimal Time , 1992, SIAM J. Comput..

[9]  E. J. COCKAYNE,et al.  Information Dissemination in Trees , 1981, SIAM J. Comput..

[10]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[11]  A. Farley,et al.  Broadcasting in Trees with Multiple Originators , 1981 .

[12]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  David Peleg,et al.  Tight Bounds on Minimum Broadcast Networks , 1991, SIAM J. Discret. Math..

[15]  Luisa Gargano,et al.  On the construction of minimal broadcast networks , 1989, Networks.

[16]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[17]  S. Louis Hakimi,et al.  Parallel Algorithms for Gossiping by Mail , 1990, Inf. Process. Lett..

[18]  Arthur L. Liestman.  Fault-tolerant broadcast graphs , 1985, Networks.

[19]  Douglas B. West.  A class of solutions to the gossip problem, part I , 1982, Discret. Math..

[20]  Arthur M. Farley.  Minimum-time line broadcast networks , 1980, Networks.

[21]  A. Farley.  Broadcast Time in Communication Networks , 1980 .

[22]  Guy Kortsarz,et al.  Approximation Algorithms for Minimum Time Broadcast , 1992, ISTCS.

[23]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[24]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[25]  Michael R. Fellows,et al.  Algebraic Constructions of Efficient Broadcast Networks , 1991, AAECC.

[26]  Guy Kortsarz,et al.  Approximation Algorithms for Minimum-Time Broadcast , 1995, SIAM J. Discret. Math..

[27]  Martin Middendorf,et al.  Minimum Broadcast Time is NP-Complete for 3-Regular Planar Graphs and Deadline 2 , 1993, Inf. Process. Lett..

[28]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[29]  Jose A. Ventura,et al.  A new method for constructing minimal broadcast networks , 1993, Networks.

[30]  P. Camerini,et al.  Complexity of spanning tree problems: Part I , 1980 .