Fault tolerant routing and broadcasting in de Bruijn networks

In this paper, we study fault tolerant routing and broadcasting in interconnection networks based on de Bruijn graph (dBG) for constructing large scale multiprocessors networks. Our paper presents a new approach to provide fault tolerance routing and broadcasting which haven't been investigated. The proposed approach is based on multi level discrete set concept in order to find a fault free shortest path among several paths provided. In the proposed fault tolerant broadcasting, we can achieve k (network diameter) as maximum time step to finish broadcast process and there is no overhead in the broadcast message.