一种基于结构化备份子图的路由系统失效恢复方法  

A Failure Recovery Method for Routing System Based on Structured Backup Subgraph

作　　者：王禹[1] 王振兴[1] 张连成[1] 

机构地区：[1]解放军信息工程大学,郑州450002

出　　处：《电子与信息学报》2013年第9期2254-2260,共7页Journal of Electronics & Information Technology

基　　金：国家863计划项目(2009AA01A334;2008AA01A323;2008AA01A326)资助课题

摘　　要：鉴于当前路由系统失效恢复未能有效解决备份拓扑存储代价、冗余恢复能力以及自治域利益保护等问题,该文在致瘫攻击易造成网络级联失效的背景下提出一种基于结构化备份子图的失效恢复方法 3R(Robust Route Recovery)。首先,设计拓扑关键点和重要邻接点生成算法,满足了备份子图基数小、增长率低的实际存储需求,且具备同一子图内多点冗余恢复特性;其次,为充分考量自治域利益诉求,设计基于流量权重的相邻链路排序算法,折中路由失效恢复与私有路由策略的双重需求;在此基础上,利用多次迭代生成各冗余恢复集合的备份子图。实验结果证实了方法的有效性。Current failure recovery for routing system has not effectively resolved issues including storage cost, redundant recovery and AS （Autonomous System） benefit protection. In the background of cascading failure prone to happen under paralyzing attack, a failure recovery approach 3R （Robust Route Recovery） based on structured backup subgraph is proposed. First, to reduce space complexity, two algorithms for topology keypoint and important adjacent nodes are designed to satisfy both demands of small radix and low increasing rate, as well as the redundant recovery feature for multi-node in the same subgraph. Second, considering the AS benefit request, sort for neighboring links based on traffic weight is implemented to make tradeoff between the failure recovery and private routing policy. Finally, structured backup subgraphs according to the redundant recovery sets are generated through multiple iterations. Simulation results show the effectiveness of 3R approach.

关 键 词：路由系统 失效恢复 结构化备份子图 存储代价 冗余恢复 

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