Issue No.04 - April (1997 vol.8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.588608
<p><b>Abstract</b>—The WK-recursive networks own two structural advantages: expansibility and equal degree. A network is <it>expansible</it> if no changes to node configuration and link connection are necessary when it is expanded, and of <it>equal degree</it> if its nodes have the same degree no matter what the size is. However, the number of nodes contained in a WK-recursive network is restricted to <it>d</it><super><it>t</it></super>, where <it>d</it> > 1 is the size of the basic building block and <it>t</it>≥ 1 is the level of expansion. The incomplete WK-recursive networks, which were proposed to relieve this restriction, are allowed to contain an arbitrary number of basic building blocks, while preserving the advantages of the WK-recursive networks.</p><p>Designing shortest-path routing algorithms for incomplete networks is in general more difficult than for complete networks. The reason is that most incomplete networks lack a unified representation. One of the contributions of this paper is to demonstrate a useful representation, i.e., the multistage graph representation, for the incomplete WK-recursive networks. On the basis of it, a shortest-path routing algorithm is then proposed. With <it>O</it>(<it>d</it>·<it>t</it>) time preprocessing, this algorithm takes <it>O</it>(<it>t</it>) time for each intermediate node to determine the next node along the shortest path.</p>
Graph-theoretic interconnection network, incomplete WK-recursive network, multistage graph representation, routing, shortest-path routing algorithm, WK-recursive network.
Ming-Yang Su, Gen-Huey Chen, Dyi-Rong Duh, "A Shortest-Path Routing Algorithm for Incomplete WK-Recursive Networks", IEEE Transactions on Parallel & Distributed Systems, vol.8, no. 4, pp. 367-379, April 1997, doi:10.1109/71.588608