首页 | 本学科首页   官方微博 | 高级检索  
     检索      

通信网络路由新算法
引用本文:戴伏生,宋立众.通信网络路由新算法[J].南京邮电大学学报(自然科学版),2005,25(2):7-11.
作者姓名:戴伏生  宋立众
作者单位:哈尔滨工业大学威海校区,信息工程系,山东,威海,264209
基金项目:哈尔滨工业大学(威海)自然科学基金(HIT(WH).2002.7)资助项目
摘    要:通信网向高可靠性、高利用率和高服务质量方面发展,现有路由算法已难以适应发展要求,需要寻找新算法。研究出一种易于多处理器并行运算的快速路由算法,采用逻辑代数运算规则,按照逐步变换、整合及删除中间节点关联分组方式计算,对于有n个节点的网络只需n-2次整合运算就能得到网络两节点间全部路由,且不会出现违反通信传输规则的闭环问题。详细论证了算法的正确性与合理性,简介了算法的并行运算可行性问题。通过算例详细说明算法的计算过程。

关 键 词:通信网  路由算法  图论  逻辑代数
文章编号:1000-1972(2005)02-0007-05
修稿时间:2004年6月16日

A New Routing Algorithm for Communication Networks
DAI Fu-sheng,SONG Li-zhong.A New Routing Algorithm for Communication Networks[J].Journal of Nanjing University of Posts and Telecommunications,2005,25(2):7-11.
Authors:DAI Fu-sheng  SONG Li-zhong
Institution:DAI Fu-sheng,SONG Li-zhongDepartment of Information Engineering,Harbin Institute of Technology,Weihai 264209,China
Abstract:With the advancement of high reliability, high availability rate and high service quality of communication networks, the existing routing algorithm is hard to meet the requirement and it is necessary to find a new one. In this paper, a fast routing algorithm is proposed.It is suitable for parallel calculation of multi-processor. The logic algebraic calculation rules are applied and the calculations are performed by transforming step by step, integrating or deleting the middle nodes and grouping based on relation. For a network with n nodes, all the routes between two nodes of the network can be obtained through incorporating calculation of n-2 times.The closed loop problem, which disobeys the transmission rule, will not appear. The validity and the feasibility of the algorithm are demonstrated and parallel calculation is illustrated. The calculation procedure is shown in details by an example.
Keywords:Communication networks  Routing algorithm  Graph theory  Logic algebra
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号