适用于深空骨干网的位置递推路由算法  

A Routing Algorithm Based on Recurrence of Locations for Deep Space Backbone Network

作　　者：张林杰 阎长江 李光宇[2] 

机构地区：[1]军用通信网信息传输与分发技术国防科技重点实验室 [2]中国科学技术大学电子工程与信息科学系信息网络实验室

出　　处：《电子技术（上海）》2013年第7期20-23,共4页Electronic Technology

基　　金：国家重大专项"面向IMT-Advanced多小区多用户干扰抑制和抵消技术";编号:2010ZX03003-002

摘　　要：文章结合深空骨干网的特点,在已有深空通信路由算法基础上提出了基于位置递推的路由算法。该算法利用节点位置的递推性,根据节点在当前时刻的位置计算出节点在下一时刻的位置,得到网络状态图进行路由计算,与MARVIN,SOSPF等依靠广播链路状态信息更新路由表的算法相比减轻了路由表更新造成的网络负担;同时针对短暂的突发性中断提出了局部处理策略,限制了广播数据包的扩散,使网络拓扑更为稳定。同时将本算法与SOSPF,MARVIN算法等进行了仿真对比,验证了本算法的良好性能。Combining with the characteristics of deep space backbone network and on the basis of existing deep space routing algorithms this paper puts forward a Routing Algorithm Based on Recurrence of Locations（RABRL）.This algorithm makes use of recurrence of node locations to calculate the location at next moment according to the location at present moment,so that getting network status diagram for routing calculation.Compared with the algorithms such as MARVIN,SOSPF which rely on broadcast link status information to update routing table,this algorithm reduces the burdens due to updating routing table;in the same time aiming at the transitorily point-to-point link interrupt the paper proposes local processing strategy,so that limiting the spread of broadcast data packet,and making the network topology more stable.This algorithm is simulated and compared with SOSPF,MARVIN and the good performance is verified.

关 键 词：深空骨干网 位置辅助 链路异常处理 路由算法 

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