A heuristic for k-broadcasting in arbitrary networks

We present a heuristic algorithm for k-broadcasting in an arbitrary network. This heuristic generates optimal k-broadcast time in grid graph when k/spl ges/2. In two-dimensional torus graph, it also generates optimal k-broadcast time when k/spl ges/3, while giving a bound of /spl lfloor/m/2/spl rfloor/+/spl lfloor/n/2/spl rfloor/+1 when k=2, where m and n are the number of rows and columns in the graph. In practice, the new heuristic outperforms best known 1-broadcast algorithm for three different network design models. The new algorithm runs fast. The time complexity of the algorithm is O(R /spl middot/ m), where R represents the rounds of broadcasting, and m stands for the total number of edges in the graph.

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

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

[3]  Linyuan Lu,et al.  Random evolution in massive graphs , 2001 .

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

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

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

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

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

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

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

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

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

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