Routing algorithms in hierarchical mesh networks with failure recovery

In this paper, the authors investigate hierarchical interconnection networks. A novel interconnection mesh network is presented. This network is made hierarchical by proper choice of node placements. Routing within this network is made very logical by basing it on a specific node numbering convention. The proposed algorithm is very intuitive and remains the same over all the layers of the hierarchy. Failure recovery is incorporated into the network at a structural level by restricting the number of links connecting different nodes at each hierarchical level, and at the routing algorithm level by switching in the unused links in case of failure.