Optimal Broadcasting in Almost Trees and Partial k-trees

We consider message broadcasting in networks that have almost tree topology. The source node of the input network has a single message which has to be broadcasted to all nodes of the network. In every time unit each node that has already received the message can send it to one of its neighbors. A broadcasting scheme prescribes in which time unit a given node should send a message to which neighbor. It is minimum if it achieves the smallest possible time for broadcasting the message from the source to all nodes. We give the following algorithms to construct a minimum broadcasting scheme for different types of weakly cyclic networks: A linear-time algorithm for networks whose cycles are node-disjoint and in which any simple path intersects at most O(1) cycles. An O(nlogn)-time algorithm for networks whose cycles are edge-disjoint and in which a node can belong to at most O(1) cycles. An O(nk log n) -time algorithm for networks whose each edge-biconnected component is convertible to a tree by removal of at most k edges. We also present an O(n4k+s)-time algorithm for constructing a minimum broadcasting scheme for partial k-trees.

[1]  Pierre Fraigniaud,et al.  Methods and problems of communication in usual networks , 1994, Discret. Appl. Math..

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

[3]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[4]  Klaus Jansen,et al.  The Minimum Broadcast Time Problem , 1994, Canada-France Conference on Parallel and Distributed Computing.

[5]  Lennart Johnsson.  Matrix Multiplication on Boolean Cubes using Generic Communication Primitives , 1989 .

[6]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[7]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

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

[9]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[10]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

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

[12]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[13]  Jan van Leeuwen,et al.  Graph Algorithms , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

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

[15]  Juraj Hromkovič,et al.  Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping) , 1996 .

[16]  Amotz Bar-Noy,et al.  Broadcasting Multiple Messages in Simultaneous Send/receive Systems , 1994, Discret. Appl. Math..

[17]  Andreas Jakoby,et al.  The complexity of broadcasting in planar and decomposable graphs , 1998, Discret. Appl. Math..

[18]  Amotz Bar-Noy,et al.  Designing broadcasting algorithms in the postal model for message-passing systems , 1992, SPAA '92.

[19]  Dominique Barth,et al.  Approximation algorithms for structured communication problems , 1997, SPAA '97.

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

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

[22]  R. Ravi,et al.  Rapid rumor ramification: approximating the minimum broadcast time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[23]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[24]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .