This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Routing and Transmitting Problems in de Bruijn Networks
September 1996 (vol. 45 no. 9)
pp. 1056-1062

Abstract—De Bruijn graphs, both directed and undirected, have received considerable attention as architecture for interconnection networks. In this paper, we focus on undirected de Bruijn networks of radix d and dimension n, denoted by UB(d, n). We first discuss the shortest-path routing problem. We present properties of the shortest paths between any two vertices of UB(d, n) and propose two shortest-path routing algorithms, one of which has linear time complexity. Secondly, we study the transmitting problem. We establish a lower bound for the optimal transmitting time which implies in particular that the optimal transmitting problem is trivial for UB(d, n) when d≥ 5. We present a transmitting scheme on undirected binary de Bruijn networks UB(2, n) with transmitting time n− 1 for n≥ 5, and conjecture that the optimal transmitting time is n− 1 for UB(2, n), and n for UB(3, n) and UB(4, n).

[1] N. Alon, "Transmitting in the n-Dimensional Cube," Discrete Applied Math., vol. 37/38, pp. 9-11, 1992.
[2] J.C. Bermond, Discrete Applied Math., special issue on Interconnection Networks, vol. 37/38, 1992.
[3] J.C. Bermond, Z. Liu, and M. Syska, "Mean Eccentricities of de Bruijn Networks," Rapport de Recherche INRIA, no. 2,114, 1993.
[4] J.C. Bermond and C. Peyrat, "de Bruijn and Kautz Networks: A Competitor for the Hypercube?" Hypercube and Distributed Computers, F. Andréand J.P. Verjus, (eds.), pp. 279-293. Elsevier Science Publishers, 1989.
[5] J. Bond, Construction de Grands Réseaux d'Interconnexions, Thése de Troisíeme Cycle, Universitéde Paris-Sud, Orsay, 1984.
[6] N.G. de Bruijn, "A Combinatorial Problem," Proc. Akademe Van Wetenschappen, vol. 49, pp. 758-764, 1946.
[7] A.H. Esfahanian and S.L. Hakimi, “Fault-Tolerant Routing in de Bruijn Communication Networks,” IEEE Trans. Computers, vol. 34, no. 9, pp. 777-788, Sept. 1985.
[8] T.Y. Ho, L.H. Hsu, and T.Y. Sung, "Transmitting on Various Network Topologies," Networks vol. 27, pp. 145-157, 1996.
[9] D.F. Hsu, Networks, Special Issue on Interconnection Networks and Algorithms, vol. 23, 1993.
[10] Z. Liu, "Optimal Routing in the de Bruijn Networks," Proc. 10th Int'l Conf. Distributed Computing Systems, pp. 537-544, May 1990,Paris, France.
[11] C. Peyrat, Vulnérabilitédans les grand réseaux d'interconnexion, PhD thesis, Universitéde Paris-Sud, Centre d'Orsay,, 1984.
[12] D.K. Pradhan and S.M. Reddy, "A Fault-Tolerant Communication Architecture for Distributed Systems," IEEE Trans. Computers, vol. 31, pp. 863-870, 1982.
[13] P. Weiner, "Linear Pattern Matching Algorithms," Proc. IEEE 14th Annual Symp. Switching and Automata Theory, pp. 1-11, 1973.

Index Terms:
Interconnection networks, de Bruijn networks, shortest paths, string matching, prefix trees, transmitting.
Citation:
Zhen Liu, Ting-Yi Sung, "Routing and Transmitting Problems in de Bruijn Networks," IEEE Transactions on Computers, vol. 45, no. 9, pp. 1056-1062, Sept. 1996, doi:10.1109/12.537129
Usage of this product signifies your acceptance of the Terms of Use.