An algorithm for generating node disjoint routes in Kautz diagraphs


Smit, Gerard J.M. and Havinga, Paul J.M. and Jansen, Pierre G. (1991) An algorithm for generating node disjoint routes in Kautz diagraphs. In: Fifth International Parallel Processing Symposium, 30 April - 2 May 1991, Anaheim, USA (pp. pp. 102-107).

open access
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=dk+dk-1 nodes (for any cardinal d, k>0), has a diameter of at most dlog 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
Item Type:Conference or Workshop Item
Copyright:© 1991 IEEE
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 119230