计算机技术与发展2011，Vol.21Issue(6)：1-3,8,4.
面向IP快速路径切换的OSPF冗余路径算法
OSPF Redundant Path Algorithm of a Fast Path Switching for IP
摘要
Abstract
In the IP network,bypass the failed link or node through the convergence of routing protocol when a link or node failed. This time at least 5 seconds for OSPF routing protocol,during the fault the packet will be dropped,most of the applications can accept this level of delay. However, delay-sensitive applications such as VolP, the delay of this magnitude is difficult to accept for users. Based on the existing routing protocols of shortest path tree (SPT) algorithm, proposed to support multiple redundant path tree calculation algorithm for IP fast reroute. In addition to calculating the shortest path,the algorithm calculates at least one disjoint acyclic backup path, when link or node of the shortest path fail, ensure that the packet switchs to the backup path quickly to improve IP network fault convergence time.关键词
开放最短路径优先/双向转发检测/快速重路由/快速路径切换/备份路径Key words
OSPF/BFD/fast reroute/ fast path switching/backup path分类
信息技术与安全科学引用本文复制引用
商荣亮,张晓哲,郦苏丹..面向IP快速路径切换的OSPF冗余路径算法[J].计算机技术与发展,2011,21(6):1-3,8,4.基金项目
国家自然科学基金资助项目(60803153) （60803153）
