Shortest path routing and fault-tolerant routing on de Bruijn networks
Jyh-Wen Mao, Chang‐Biau Yang · Networks · 2000
In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the binary de Bruijn network of 2m nodes is O(m2). Then, based on our shortest path routing algorithm, we propose two fault-tolerant routing schemes. It is assumed that at most one node fails in the network. In our schemes, two node-disjoint paths are found. Our first fault-tolerant routing algorithm guarantees that one of the two paths is the shortest path, and the other is of length at most m + log2 m + 4. Our second algorithm can find two node-disjoint paths with lengths at most m and m + 4, respectively, if the shortest path is not required in the fault-tolerant routing. © 2000 John Wiley & Sons, Inc.