摘要
已有的路由保护方案都没有考虑网络中节点的重要程度,然而在实际网络中不同节点在网络中的重要程度是不相同的。针对该问题,提出一种基于节点多样性的域内路由保护算法(intra-domain routing protection algorithm based on node diversity,RPBND)。计算节点构造以目的为根的最短路径树(shortest path tree,SPT),从而保证RPBND算法和目前互联网部署的路由算法的兼容性;在该最短路径树的基础上构造特定结构的有向无环图(directed acyclic graph,DAG),从而最大化路由可用性。实验结果表明,RPBND极大地提高了路由可用性,降低了故障造成的网络中断时间,为ISP部署域内路由保护方案提供了充分的依据。
The existing routing protection schemes do not consider the importance of nodes in the network,however,the importance of different nodes in the network is not the same in real networks.To solve this problem,this paper proposed an intra-domain routing protection algorithm based on node diversity(RPBND).Firstly,the computing node constructed a shortest path tree rooted at the destination node,which ensured the compatibility between RPBND and the current deployment intra-domain routing algorithm.Then,it built a directed acyclic graph(DAG)on the basis of the shortest path tree to maximize the Internet routing availability.The experiment results show that RPBND greatly improves the Internet routing availability and reduces the network disruption time caused by the faults,which provides the sufficient basis for ISP to deploy the intra-domain routing protection scheme.
作者
张伟
耿海军
Zhang Wei;Geng Haijun(Computer Application Teaching&Research Section,China University of Labor Relations,Beijing 100048,China;School of Software Engineering,Shanxi University,Taiyuan 030006,China)
出处
《计算机应用研究》
CSCD
北大核心
2020年第1期275-278,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(61702315).
关键词
域内路由
路由保护
节点多样性
路由可用性
intra-domain routing
routing protection
node diversity
Internet routing availability
作者简介
张伟(1982-),男,讲师,硕士,主要研究方向为计算机网络等;通信作者:耿海军(1983-),男,副教授,博士,主要研究方向为网络体系结构和路由算法等(ghj123025449@163.com)
