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

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

作　　者：李颖[1] 陈业斌[2] 

机构地区：[1]马鞍山师范高等专科学校,安徽马鞍山243041 [2]安徽工业大学计算机学院,安徽马鞍山243002

出　　处：《华中科技大学学报（自然科学版）》2009年第5期45-48,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：安徽省教育厅重大资助项目(ZD2008005-1);安徽省教育厅自然科学研究基金资助项目(KJ2007B078)

摘　　要：将有向双环网络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.

关 键 词：双环网络 最短路径 最优路由 L形瓦 节点 [+r]边 [+s]边 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]