有向双环网络G(N;r,s)的寻径策略

Optimal routing algorithm for directed double loop networks G(N;r,s)

将有向双环网络G(N;r,s)图论模型中的节点进行了重新排列,得到了新的L形瓦结构.给出了节点0到任一节点最短路径的表现形式,找出了分布在x轴和y轴上单一[+r]边和单一[+s]边的节点个数的上界.得出了求解任意两节点最短路径的算法,并用面向对象的Java语言实现了该算法.

A new L-shaped tile was presented by arranging all nodes for directed double-loop networks G（N; r, s） over again. The expression of the shortest path for 0 node to any other nodes is given, and the upper band of the numbers of nodes for single [＋r] side and single [＋s] side in tor x-axis and y-axis separately was found. The method to find the shortest path for any two nodes in directed doubleloop networks G（N; r, s） was given and executed with Java.