A Shortest-Path Routing Algorithm for Incomplete WK-Recursive Networks

Abstract

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 iι, a shortest-path routing algorithm is then proposed. With O(d.˙t) time preprocessing, this algorithm take O(t) for each intermediate node to determine the next node along the shortest path where d＞1 is the size of the base building block and t≧1 is the level of expansion.