基于弧形不相交生成树的多链路故障恢复方法  

Multi-link Failure Recovery Method Based on Arc-disjoint Spanning Trees

作　　者：蒋成[1] 

机构地区：[1]湖北工程学院教务处,湖北孝感432000

出　　处：《计算机工程》2016年第7期65-71,共7页Computer Engineering

摘　　要：IP网络的设计以光学主干网络为基础,光学组件发生故障后会导致IP网络多条链路失能,传统的光层恢复方法计算复杂性较高,且实用性不强。针对上述问题,基于弧形不相交生成树的IP快速重选路由网络模型,利用报文转发算法对平均路径长度进行比较,提出一种改进的多链路故障恢复方法。仿真结果表明,对k-边连通网络而言,只要并发链路故障数小于等于(k-1)个,该方法均能实现故障恢复,在恢复多处故障的同时可降低路径伸展度和平均路径长度。IP networks are designed over optical backbone networks, so the failure of optical components often leads to multi-link failure in the IP network. The traditional failure recovery methods have higher computational complexity and are not practical. Aiming at the above problems, this paper analyzes the IP fast rerouting network model based on the Arc-disjoint Spanning Tree （ADST） , uses packet forwarding algorithm to compare the average path length, and proposes an improved multi-link failure recovery method. Simulation results show that, for the k-edge connected network, the proposed method can achieve failure recovery as long as the number of concurrent link failures are less than k - 1. The proposed method can reduce the path stretch and average path length while recovering multiple failures.

关 键 词：IP网络 链路故障 弧形不相交生成树 路由 可扩展性 平均路径长度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]