Optimal routing in the De Bruijn networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

Optimal routing in the De Bruijn networks


In this paper, we consider the problem of optimal routing in an interconnection network, called the De Bruijn network, where the sites are linked in the form of a De Bruijn graph. We provide the distance functions for the undirected as well as the directed De Bruijn graphs. The optimal routing problem is then reduced to that of pattern matching. We use Morris and Pratt's failure function and Weiner's prefix tree to develop algorithms that find the shortest paths in the uni-directional and in the bi-directional De Bruijn networks, respectively. These algorithms are linear in time and in space (in the diameter of the graph).
Fichier principal
Vignette du fichier
RR-1130.pdf (914.23 Ko) Télécharger le fichier

Dates and versions

inria-00075429 , version 1 (24-05-2006)


  • HAL Id : inria-00075429 , version 1


Zhen Liu. Optimal routing in the De Bruijn networks. [Research Report] RR-1130, INRIA. 1990, pp.20. ⟨inria-00075429⟩
145 View
116 Download


Gmail Facebook Twitter LinkedIn More