Fault tolerant routing algorithms for Hyper-de Bruijn networks

Fault tolerant routing has been investigated to overcome the failure encountered during routing in Very large scale integrated circuits (VLSI). In recent years, researchers have proposed the use of Hyper-de Bruijn graph as a physical topology for VLSI. In this paper, we proposed a new approach to provide fault tolerant routing which hasn´t been investigated on Hyper-de Bruijn network. The proposed approach is based on multi level discrete set concept in order to find a fault free shortest path among several paths provided. We also prove our fault tolerant routing algorithm to have the best performance among fault tolerant routing algorithms in Hyper-de Bruijn network.