论文部分内容阅读
经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.
The classical D IJKSTRA and BELLM AN-F LOYD communication network routing algorithms can only get the best route according to the specific network parameters but can not obtain all the available routes of the network. However, communication network theory research and network management often need to be obtained All the available routes between nodes.A new routing algorithm is developed, which complies with the rules of logical algebra and adopts the method of integration and deletion between rows and rows in the association matrix. The N nodes’ networks only need N-1 times to integrate and delete We can get all the routing results between two nodes from the source node to any node.We demonstrate the correctness and rationality of the algorithm in detail and introduce the feasibility of the parallel operation of the algorithm and the compatibility with the classical routing algorithm. Example detailed calculation of the algorithm, and verify its correctness.