基于链路位置的SDN数据平面故障恢复方法

A Failure Recovery Algorithm of SDN Data Plane Based on Link Location

  • 摘要: 在软件定义网络中,为了实现链路故障的快速恢复,通常采用主动式恢复方法。现有主动式恢复方法的备份路径设计往往难以兼顾故障恢复的备份资源消耗和恢复时延。为了在节省备份资源的基础上减少恢复时延,文章提出了一种主动式单链路故障恢复方案(LBR),对主路径中的前半部分和后半部分链路采取分而治之的方式,不同故障位置的链路规划不同的备份路径,以实现快速故障恢复和对备份流表项资源的合理利用。最后,将LBR方案与基于最短路径重路由的方案(ST方案和FLR方案)、回溯方案(DT方案)进行对比实验。实验结果表明LBR方案实现了恢复时延和资源利用上的有效平衡:与基于最短路径重路由的方案相比,LBR方案能更有效地利用备份资源;与回溯方案相比,在主路径节点数为4~11时,LBR方案的恢复时延减少了34%~44%。

     

    Abstract: In software defined network (SDN), in order to achieve fast recovery from link failure, proactive recovery scheme is adopted. The backup path design of the existing proactive recovery schemes are difficult to balance the backup resource consumption and recovery delay of failure recovery. In order to reduce the recovery delay on the basis of saving backup resources, a proactive single-link failure recovery scheme is proposed, which adopts a divide-and-conquer method for the first half and the second half of the work path. Different backup paths are planned for links at different locations to achieve fast failure recovery and reasonable utilization of backup resources. The experimental results show that the LBR scheme can effectively use backup resources and achieve fast recovery. Comparing with the shortest path-based rerouting scheme(ST scheme and FLR scheme), the LBR scheme can more effectively use backup resources. Comparing with the backtracking scheme(DT scheme), the LBR scheme reduces failure recovery time by 34% to 44% when the number of primary path nodes is 4~11.

     

/

返回文章
返回