An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d, k)

Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorithms can only work in binary dBG. In this paper, we investigate broadcasting in bidirectional dBG for a degree greater than or equal to two. A distributed broadcast algorithm for one-to-all broadcasting in the all port communication is proposed for dBG(d,k).

[1]  Zhen Liu,et al.  Routing and Transmitting Problems in de Bruijn Networks , 1996, IEEE Trans. Computers.

[2]  Sabine R. Öhring,et al.  Optimal fault-tolerant communication algorithms on product networks using spanning trees , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[3]  Dhiraj K. Pradhan,et al.  Optimal broadcasting in binary de Bruijn networks and hyper-deBruijn networks , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[4]  Abdol-Hossein Esfahanian,et al.  A distributed broadcast algorithm for binary De Bruijn networks , 1988, Seventh Annual International Phoenix Conference on Computers an Communications. 1988 Conference Proceedings.

[5]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.