摘要
经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.
For the Dijkstra and Bellman-Floyd route algorithm of computer network, the optimal route can he achieved according to given network parameters, but the entire practicable routes which are included in the network can not be obtained. In the other hand, in some aspects such as the theoretical research of communication network and network management, the entire available routes between nodes are required to be obtained. A new algorithm is studied in this paper, which can calculate all the routes from source node to arbitrary aim node of the network by applying the logic algebraic calculation rules, integrating and deleting rows of relative matrix and integrating and deleting n -1 times for a network with n nodes. The validity and rationality of the algorithm are demonstrated in detail, at the same time, the feasibility of parallel calculation and compatibility with the classical route algorithm are briefly introduced. The calculation course of the algorithm is shown by an example in detail and the correctness is validated.
出处
《数学的实践与认识》
CSCD
北大核心
2006年第2期186-192,共7页
Mathematics in Practice and Theory
基金
哈尔滨工业大学[威海]自然科学基金(HIT[WH].2002.7)
关键词
通信网
路由算法
图论
逻辑代数
communication network
route algorithm
graphic theory
logic algebra
