Shortest Path Routing and Fault-Tolerant Routing on de Bruijn Networks

Abstract

We first propse a shortest path routing algorithm on a binary de Bruijn network while researchers have not got a shortest one before. The time required for finding the shortest path in a 2m-node binary de bruijn network is O(m2). Then , based on our shortest path routing algorithm, we propose a fault-tolerant routing scheme. It is assumed that at most one node fails in the network. In our scheme, two node-disjoint paths are found. One is the shortest path, and the other path is of length at most m+log2m+4.