Network failures are unavoidable and occur frequently.When the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence process.During this period,a large number of mes...Network failures are unavoidable and occur frequently.When the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence process.During this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be solved.Industry usually employs routing protection algorithms to improve intra-domain routing availability.However,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in practice.To address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source purposes.Firstly,the backup path with the minimum path coincidence with the shortest path is described as an integer programming problem.Then the simulated annealing algorithm ERPBONT is used to find the optimal solution.Finally,the algorithm is tested on the simulated topology and the real topology.The experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.展开更多
基金This work is supported by the Hainan Provincial Natural Science Foundation of China(620RC562)the Natural Science Foundation of Shanxi Province(Grant Nos.20210302123444,20210302123455)+5 种基金the China University industry university research innovation fund(No.2021FNA02009)the Open Project Program of the Key Laboratory of Embedded System and Service Computing of Ministry of Education(Tongji University)ESSCKF 2021-04the National Natural Science Foundation of China(Grant Nos.61702315,61802092)the Applied Basic Research Plan of Shanxi Province(No.201901D211168)the Program of Hainan Association for Science and Technology Plans to Youth R&D Innovation(QCXM201910)the Key R&D Program(International Science and Technology Cooperation Project)of Shanxi Province China(No.201903D421003).
文摘Network failures are unavoidable and occur frequently.When the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence process.During this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be solved.Industry usually employs routing protection algorithms to improve intra-domain routing availability.However,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in practice.To address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source purposes.Firstly,the backup path with the minimum path coincidence with the shortest path is described as an integer programming problem.Then the simulated annealing algorithm ERPBONT is used to find the optimal solution.Finally,the algorithm is tested on the simulated topology and the real topology.The experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.
