期刊文献+

一种基于转发图的域内路由保护算法

An Intra-Domain Routing Protection Algorithm Based on Forwarding Graph
下载PDF
导出
摘要 业界提出利用路由保护算法来解决网络中的故障问题,然而已有的路由保护算法存在4个方面的问题:1)无法应对网络中所有可能的单故障情形;2)需要额外辅助机制的协助;3)不支持增量部署;4)每个结点存储多个到达目的地址的备份下一跳.提出一种基于转发图的域内路由保护算法(an intradomain routing protection algorithm based on forwarding graph,RPBFG)来解决这4个问题.首先建立了以最大化故障保护率为目标、以转发图包含反向最短路径树为约束条件的路由保护模型;然后提出了利用遗传算法构造满足上述目标的转发图;最后根据构造的转发图计算出所有结点到达目的结点的备份下一跳.在11个真实拓扑结构中比较了RPBFG,NPC,U-turn,MARA-MA,MARA-SPE在故障保护率和路径拉伸度的性能.实验结果表明,RPBFG可以应对网络中所有可能的单故障;在平均路径拉伸度方面,RPBFG比NPC,U-turn,MARA-MA,MARA-SPE分别降低了0.11%,0.72%,37.79%,36.26%. Currently,intra-domain routing protocols which are deployed on the Internet respond to network failures through a global convergence mechanism.In the process of routing convergence,a large number of data packets will be discarded,leading to network interruption.The industry proposes to use routing protection methods to solve the above problem.However,the existing routing protection methods have the following four problems:1)they cannot cope with all possible single failures in the network;2)they need the assistance of additional auxiliary mechanisms;3)they do not support incremental deployment;4)each node stores multiple backup next hops for each destination,increasing storage and computation costs.We propose an intra-domain routing protection algorithm based on forwarding graph(RPBFG)to solve the above four problems of existing routing protection algorithms.We first establish a routing protection model with the goal of maximizing the failure protection ratio and the constraint that the forwarding graph contains the reverse shortest path tree;then a genetic algorithm is proposed to construct a forwarding graph that satisfies the above goal;finally,the backup next hop of all nodes arriving at the destination node is calculated according to the constructed forwarding graph.We compare the performance of RPBFG,NPC,U-turn,MARA-MA and MARA-SPE in 11 real topologies,including failure protection ratio and path stretch.The experimental results show that RPBFG can deal with all possible single failures in the network,and that is to say the failure protection ratio of RPBFG is 100%,while the average failure protection ratio of NPC,U-turn,MARA-MA and MARA-SPE is 45.05%,74.53%,89.78%and 91.24%respectively.In the aspect of path stretch,RPBFG decreased by 0.11%,0.72%,37.79%and 36.26%respectively compared with NPC,U-turn,MARA-MA and MARA-SPE.The research results will help to promote the progress of Internet service providers in deploying intra-domain routing protection schemes in real networks.
作者 耿海军 孟卓 姚姗姗 杨静 池浩田 尹霞 Geng Haijun;Meng Zhuo;Yao Shanshan;Yang Jing;Chi Haotian;Yin Xia(School of Computer and Information Technology,Shanxi University,Taiyuan 030006;School of Automation and Software Engineering,Shanxi University,Taiyuan 030006;Industry of Big Data Science and Industry,Shanxi University,Taiyuan 030006;Department of Computer Science and Technology,Tsinghua University,Beijing 100084)
出处 《计算机研究与发展》 EI CSCD 北大核心 2024年第2期529-538,共10页 Journal of Computer Research and Development
基金 山西省应用基础研究计划项目(20210302123444,20210302123455) 山西省高等学校科技创新项目(2022L002) 中国高校产学研创新基金项目(2021FNA02009) 国家自然科学基金项目(61702315,61906115) 山西省重点研发计划项目(201903D421003,202202020101004) 国家重点研发计划项目(2018YFB1800401)。
关键词 路由保护 网络故障 故障保护率 路径拉伸度 有向无环图 转发图 routing protection network failure failure protection ratio path stretch directed acyclic graph forwarding graph
  • 相关文献

参考文献2

二级参考文献20

  • 1周明 孙树栋.遗传算法原理及引用[M].北京:国防工业出版社,1999..
  • 2A. Markus, G. Renner, J. Vdncza. Genetic algorithms in free form curve design. Mathematical Methods for Curves and Surfaces, Nashivilte, 1995.
  • 3P. N. Azariadisa, A. C. Nearchoua, N. A. Aspragathosa. An evolutionary algorithm for generating planar developments of arbitrarily curved surfaces. Computers in Industry, 2002, 47(3):357--368.
  • 4M. Manela, N. Thornhill, J. A. Campbell. Fitting spline functions to noisy data using a genetic algorithm. The 5th Int'l Conf. on Cenetic Algorithms, Urbana-Champaign, IL, USA,1993.
  • 5Y. H. Chen, C. Y. Liu. Quadric surface extraction using genetic algorithms. Computer-Aided Design, 1999, 31(1): 101- 10.
  • 6J. Lampinen, J. T. Alander. Shape design and shape optimization by genetic algorithms. Advances in Computational Mechanics with High Performance Computing. Edinburgh, Scotland, 1998.
  • 7J. Lampinen. Cam shape optimization by genetic algorithm.Computer-Aided Design, 2003, 35(8) : 727-737.
  • 8J. M. Lindstrom. Bayesian estimation of free-knot spline using reversible jumps. Computational Statistic & Data Analysis, 2002,41(2) : 255--269.
  • 9M. Grossman. Parametric curve fitting. The Computer Journal,1971, 17(2): 169-172.
  • 10E. T. Y. Lee. Choosing nodes in parametric curve interpolation.Computer-Aided Design, 1989, 21(6): 363--370.

共引文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部