OPTIMAL ONE TO MANY PARALLEL ROUTING ALGORITHM IN N STAR NETWORKS
Yi Ting Yang · Chinese Journal of Computers · 1999
An updated optimal one to many parallel routing algorithm in n star networks is presented. The new algorithm can find n -1 paths P 2,…,P n such that |P i|dist(v 1,v i) +4, where P i is the path from v i to v 1, |P i| means the length of the path P i, and dist(v 1,v i) stands for the shortest length from v i to v 1 . The time complexity of the new algorithm is the same as that of Chen's algorithm. While, the path lengths of the algorithm are shorter than that of Chen's algorithm, in which |P i|dist(v 1,v i)+6, 2in . Thus the new algorithm is better than all of the known one to many parallel routing algorithm in n star networks.