基于节点多样性的域内路由保护算法

Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》

张伟 耿海军

Abstract： 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 the RPBND and the current deployment intra-domain routing algorithm. Then, it builded a directed acyclic graph on the basis of the shortest path tree, which maximized 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 ISPs to deploy the intra-domain routing protection scheme.

 Hits 2407  Downloads 1363  Comment