###
Journal of Software:2020.31(5):1536-1548

基于最小路径交叉度的域内路由保护方案
耿海军,施新刚,王之梁,尹霞,胡治国
(山西大学 软件学院, 山西 太原 030006;清华大学 网络科学与网络空间研究院, 北京 100084;清华大学 计算机科学与技术系, 北京 100084;山西大学 计算机科学与技术系, 山西 太原 030006)
Intra-domain Routing Protection Scheme Based on Minimum Intersection Paths
GENG Hai-Jun,SHI Xin-Gang,WANG Zhi-Liang,YIN Xia,HU Zhi-Guo
(School of Software Engineering, Shanxi University, Taiyuan 030006, China;Institute for Network Sciences and Cyberspace, Tsinghua University, Beijing 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;Department of Computer Science and Technology, Shanxi University, Taiyuan 030006, China)
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 194   Download 57
Received:October 30, 2017    Revised:August 09, 2018
> 中文摘要: 已有的路由保护方案面临下面两个问题:(1)默认路径和备份路径包含的公共边数量较高,如ECMP和LFA等;(2)为了计算两条包含公共边数量较少的路径,限制默认路径不能使用最短路径,如红绿树方案等.针对上述两个问题,首先将计算默认路径和备份路径描述为一个整数规划问题,然后提出采用启发式方法求解该问题,接着介绍了转发算法,最后通过仿真实验和真实实验对算法进行了测试.实验结果表明,该算法不仅具有较低的计算复杂度,而且可以降低默认路径和最短路径包含的公共边的数量,提升网络可用性.
Abstract:The existing routing protection schemes are facing the following two problems: (1) the default path and the backup path contain a large number of common edges, such as ECMP and LFA; (2) in order to calculate two paths which have a small number of common edges, the shortest path cannot be used in the network, such as red-green tree method. To solve the above two problems, this study first describes the problem of computing backup paths and default paths as an integer programming model, and then a heuristic method is proposed to solve the problem. Next, the forwarding algorithm is introduced. Finally, the proposed algorithm is tested by simulation experiment and real experiment. Experiments show that the proposed algorithm not only has lower computational complexity, but also reduces the number of common edges contained in the default paths and the shortest paths, and greatly improve the network availability.
文章编号:     中图分类号:TP393    文献标志码:
基金项目:国家自然科学基金(61702315,61872226);山西省高等学校科技创新项目(201802013);国家重点研发计划(2018YFB1800401);山西省自然科学基金(201701D121052);山西省重点研发计划(国际科技合作)(201903D421003) 国家自然科学基金(61702315,61872226);山西省高等学校科技创新项目(201802013);国家重点研发计划(2018YFB1800401);山西省自然科学基金(201701D121052);山西省重点研发计划(国际科技合作)(201903D421003)
Foundation items:National Natural Science Foundation of China (61702315, 61872226); Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi Province (201802013); National Key Research and Development Program of China (2018YFB1800401); Natural Science Foundation of Shanxi Province (201701D121052); Key Research and Development Program of Shanxi Province (International Science and Technology Cooperation Project) (201903D421003)
Reference text:

耿海军,施新刚,王之梁,尹霞,胡治国.基于最小路径交叉度的域内路由保护方案.软件学报,2020,31(5):1536-1548

GENG Hai-Jun,SHI Xin-Gang,WANG Zhi-Liang,YIN Xia,HU Zhi-Guo.Intra-domain Routing Protection Scheme Based on Minimum Intersection Paths.Journal of Software,2020,31(5):1536-1548