QoS约束的链路故障多备份路径恢复算法

发布时间：2018-06-14 13:28

本文选题：链路故障恢复 + 多备份路径　；参考：《电子与信息学报》2016年08期

【摘要】：链路故障的恢复,不仅仅是选择一条连通的备份路径问题,还应考虑网络业务故障恢复过程中的QoS需求。针对此问题,该文基于多备份路径策略,构建概率关联故障模型和重路由流量丢弃量优化目标。并基于该优化目标,以业务的QoS需求为约束,建立故障恢复问题的数学模型,提出一种QoS约束的链路故障多备份路径恢复算法。该算法构建单条备份路径时,以最大程度地减少重路由流量丢弃为目标,并采用改进的QoS约束的k最短路径法进行拼接,且给与高优先级链路更多的保护资源。此外还证明了算法的正确性并分析了时间空间复杂度。在NS2环境下的仿真结果表明,该算法显著提升了链路故障恢复率和重路由流量QoS满足率,且QoS约束条件越强,相较于其它算法优势越明显。
[Abstract]:The problem of link fault recovery is not only to select a connected backup path, but also to consider the QoS requirements in the process of network service fault recovery. To solve this problem, this paper constructs a probabilistic associated fault model based on a multi-backup path strategy and an optimization target for rerouting traffic discards. Based on the optimization goal and taking the QoS requirement of service as the constraint, the mathematical model of fault recovery problem is established, and a QoS constrained multi-backup path recovery algorithm for link faults is proposed. When constructing a single backup path, the algorithm aims to minimize the drop of rerouting traffic, and uses the improved k shortest path method with QoS constraints to join, and provides more protection resources for high priority links. In addition, the correctness of the algorithm is proved and the complexity of time and space is analyzed. The simulation results in NS2 environment show that the proposed algorithm can significantly improve the link fault recovery rate and the QoS satisfaction rate of rerouting traffic, and the stronger the QoS constraints, the more obvious the advantages compared with other algorithms.
【作者单位】：空军工程大学信息与导航学院;清华大学电子工程系;
【基金】：国家自然科学基金(61201209;61401499) 陕西省自然科学基金(2013JQ8013;2015JM6340)~~
【分类号】：TN915.06

【相似文献】