计算机工程 ›› 2019, Vol. 45 ›› Issue (6): 103-107,114.doi: 10.19678/j.issn.1000-3428.0051991

• 体系结构与软件技术 • 上一篇    下一篇

一种基于iSPF的下游路径规则实现方法

耿海军1,尹霞2   

  1. 1.山西大学 软件学院,太原 030006; 2.清华大学 计算机科学与技术系,北京 100084
  • 收稿日期:2018-07-02 出版日期:2019-06-15 发布日期:2019-06-15
  • 作者简介:耿海军(1983—),男,讲师、博士,主研方向为软件定义网络、路由算法;尹霞,教授、博士。
  • 基金项目:

    国家自然科学基金(61702315)。

An implementation method of downstream path criterion based on iSPF

GENG Haijun1,YIN Xia2   

  1. 1.School of Software Engineering,Shanxi University,Taiyuan 030006,China;2.Department of Computer Science and Technology,Tsinghua University,Beijing 100084,China
  • Received:2018-07-02 Online:2019-06-15 Published:2019-06-15

摘要:

互联网服务提供商通过部署下游路径规则(DC)实现本地重路由,为降低DC实现方法的计算开销,平衡故障保护率与计算开销间的关系,提出一种基于增量最短路径优先(iSPF)算法的DC实现方法DC-iSPF。将计算节点到邻居节点的链路代价设置为0,在更新后的拓扑上运行iSPF算法,从而计算出所有符合DC规则的邻居节点。实验结果表明,与TBFH算法和DMPA算法相比,DC-iSPF方法能够降低计算开销,提升故障保护率。

关键词: 实时应用, 路由保护, 最短路径树, 增量最短路径优先, 下游路径规则, 网络故障

Abstract:

Internet Service Providers(ISP) implement local rerouting by deploying Downstream Path Criterion(DC).To reduce the computational overhead of DC implementation method and balance the relationship between fault protection rate and computational overhead,a DC implementation method DC-iSPF based on incremental Shortest Path First(iSPF) algorithm is proposed.The link cost from computing node to neighboring node is set to 0,and the iSPF algorithm is run on the updated topology to calculate all neighboring nodes that conform to DC.Experimental results show that compared with TBFH algorithm and DMPA algorithm,DC-iSPF method can reduce computational overhead and improve fault protection rate.

Key words: real-time application, routing protection, Shortest Path Tree(SPT), incremental Shortest Path First(iSPF), Downstream Path Criterion(DC), network failure

中图分类号: