Improving shortest path routing in Hyper-de Bruijn networks

The Hyper de Bruijn networks have shown to have both advantages of Hypercube and de Bruijn network including short diameter for a large number of nodes, independence of degree and diameter, supporting for fault tolerance and shortest path routing. Therefore, in this article, we investigate the properties of Hyper de Bruijn Network in general cases (not binary case like the other authors) and propose an efficient shortest path routing algorithm in this topology.