Broadcasting on incomplete WK-recursive networks
The WK-recursive networks, which were originally proposed by Vecchia and Sanges, have suffered from a rigorous restriction on the number of nodes. Like other incomplete networks; the incomplete WK-recursive networks have been proposed to relieve this restriction. In this paper, broadcasting on the incomplete WK-recursive networks is discussed. The proposed broadcasting algorithm is optimal with respect to message complexity. Besides, extensive experiments are made to evaluate its performance. Experimental results show that (1) the heights of the broadcasting trees do not exceed the diameters, (2) a high percentage of the nodes can receive the message from the source node via the shortest paths, (3) for those nonshortest transmission paths, the deviations are small, and (4) a high percentage of the broadcasting trees are Of minimum height, (C) 1999 Academic Press, Inc.
incomplete wk-recursive networks wk-recursive networks broadcasting algorithms graph-theoretic interconnection networks