Heuristics for Message Broadcasting in Arbitrary Networks

With the increasing popularity of interconnection networks, efficient information dissemination has become a popular research area. Broadcasting is one of the information dissemination primitives. Finding the optimal broadcasting scheme for any originator in an arbitrary network has been proved to be an NP-Hard problem. In this thesis, two new heuristics that generate broadcast schemes in arbitrary networks are presented. Both of them have O(|E|) time complexity. Moreover, in the broadcast schemes generated by the heuristics, each vertex in the network receives the message via a shortest path. Based on computer simulations of these heuristics in some commonly used topologies and network models, and comparing the results with the best existing heuristics, we conclude that the new heuristics show comparable performances while having lower complexity.

[1]  Sudipto Guha,et al.  Multicasting in heterogeneous networks , 1998, STOC '98.

[2]  Matthew Doar,et al.  A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[3]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[4]  Bin Shao,et al.  A heuristic for k-broadcasting in arbitrary networks , 2003, Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003..

[5]  Ralf Klasing,et al.  Broadcasting in Butterfly and deBruijn Networks , 1994, Discret. Appl. Math..

[6]  Iwona Wojciechowska,et al.  Broadcasting in grid graphs , 1999 .

[7]  Pierre Fraigniaud,et al.  Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks , 1997, SIROCCO.

[8]  Guy Kortsarz,et al.  Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract) , 2003, SODA '03.

[9]  Juraj Hromkovic,et al.  The Complexity of Systolic Dissemination of Information in Interconnection Networks , 1994, Canada-France Conference on Parallel and Distributed Computing.

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

[11]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[12]  Anukool Lakhina,et al.  BRITE: Universal Topology Generation from a User''s Perspective , 2001 .

[13]  Guo Tai Chen.  An algorithm for gossiping and broadcasting , 2006 .

[14]  Juraj Hromkovic,et al.  Optimal algorithms for dissemination of information in some interconnection networks , 2005, Algorithmica.

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

[16]  Andreas Jakoby,et al.  The Complexity of Broadcasting in Planar and Decomposable Graphs , 1994, WG.

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

[18]  Calin D. Morosan.  Studies of Interconnection Networks with Applications in Broadcasting , 2009 .

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

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

[21]  René Beier,et al.  A powerful heuristic for telephone gossiping , 2000, SIROCCO.

[22]  Roger L. Wainwright,et al.  A genetic algorithm for the minimum broadcast time problem using a global precedence vector , 1996, SAC '96.

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

[24]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[25]  Fan Chung Graham,et al.  Random evolution in massive graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[26]  Michael J. Dinneen.  The complexity of broadcasting in bounded-degree networks , 1994, ArXiv.

[27]  Arthur L. Liestman,et al.  Broadcasting in Bounded Degree Graphs , 1992, SIAM J. Discret. Math..

[28]  Klaus Jansen,et al.  The Minimum Broadcast Time Problem for Several Processor Networks , 1995, Theor. Comput. Sci..

[29]  Peter Scheuermann,et al.  Optimal Broadcasting in Point-to-Point Computer Networks , 1800 .

[30]  Pierre Fraigniaud,et al.  Approximation Algorithms for Broadcasting and Gossiping , 1997, J. Parallel Distributed Comput..

[31]  Pierre Fraigniaud,et al.  Comparison of Heuristics for One-to-All and All-to All Communications in Partial Meshes , 1999, Parallel Process. Lett..

[32]  Bin Shao,et al.  An efficient heuristic for broadcasting in networks , 2006, J. Parallel Distributed Comput..

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

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

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

[37]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

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

[39]  Andrzej Pelc,et al.  Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance , 2005, Texts in Theoretical Computer Science. An EATCS Series.

[40]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[41]  Guy Kortsarz,et al.  Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem , 2002, STOC '02.