有向双环网络最优路由算法

Optimal Routing Algorithm for Unidirectional Double Loop-network

最优路由的研究对于网络节点的传输具有重要意义,但关于有向双环网络节点的最优路由研究,目前尚无统一的算法。现有有向双环网络的最优路由算法,主要集中在单位步长双环网络及一些特殊双环网络上,对于为数较多的非单位步长有向双环网络最优路由的研究较少。已知有向双环网络的MDD图形为L形瓦,基于L形瓦参数设计提出一种通用的有向双环网络最优路由算法。该算法适用于单位步长和非单位步长有向双环网络。仿真结果表明,与基于[+h]边优先路由及基于二叉树的最优路由算法相比,该算法无需建造竹筏及二叉树的空间,执行效率明显提高。

Research on the optimal routing is significant for the transmission between network nodes,and there is no clear unified,efficient algorithms for the research on the optimal routing of Double-loop Network（DLN）. Currently,research focuses on the optimal routing of the unit-step and some kind of special DLN,has little work on the non-unit step Unidirectional Double-loop Network（UDLN）which have a greater number. This paper gives general optimal routing algorithm between any two nodes for UDLN on the four parameters of L-shape tile since the Minimum Distance Diagram（MDD）of UDLN is known as L-shape tile,which is suitable for both unit-step and non-unit step UDLN,achieving the unity of optimal routing of directed double-loop network algorithm. Specially,the optimal algorithm for unit-step UDLN is improved based on the general routing algorithm. Compared with[ ＋h]link prior routing algorithm and bintree optimal routing algorithm,the algorithm doesnot need space to build bamboo raft or bintree and efficiency of the algorithm is better than other algorithms. Simulation experiments show the validity of the algorithm.