An algorithm for generating node disjoint routes in Kautz digraphs

Abstract

The authors focus on a particular class of interconnection networks: Kautz networks. These networks have nice properties: a network with degree d and N=d/sup k/+d/sup k-1/ nodes (for any cardinal d, k>0), has a diameter of at most /sup d/log N, the degree d is fixed and independent of the network size. The network is fault-tolerant and the connectivity is d. There is a straightforward mapping from standard computation graphs such as a linear array, a ring and a tree to a Kautz network. The network allows for a simple routing algorithm, even when nodes or links are faulty. There exists d node disjoint paths between any pair of vertices. The paper presents an algorithm to generate these node disjoint routes. The routes are delivered with increasing length and are free of loops. It proves that these routes are node disjoint and as short as possible.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>