Skip to Main content Skip to Navigation
Reports

Optimal routing in the De Bruijn networks

Abstract : 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).
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00075429
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 6:11:48 PM
Last modification on : Saturday, January 27, 2018 - 1:31:05 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 11:07:38 PM

Identifiers

  • HAL Id : inria-00075429, version 1

Collections

Citation

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

Share

Metrics

Record views

200

Files downloads

187