基于贪婪路由协议的动态单/多链路故障恢复策略  

DYNAMIC RECOVERY STRATEGY FOR SINGLE AND MULTI-LINK BREAKDOWNS BASED ON GREEDY ROUTING PROTOCOL

作　　者：於文刚[1] 于春玲[1] 朱玉全[2] 

机构地区：[1]江苏食品药品职业技术学院信息工程系,江苏淮安223003 [2]江苏大学计算机科学与通信工程学院,江苏镇江212013

出　　处：《计算机应用与软件》2014年第12期169-174,228,共7页Computer Applications and Software

基　　金：江苏省现代教育技术研究项目(2012-R-21983);淮安市科技支撑计划项目(HAG2011056)

摘　　要：针对现有的贪婪方法不能有效处理拓扑结构中链路故障的问题,提出单链路故障和多链路故障本地化恢复策略。首先,通过利用克莱因伯格的贪婪嵌入给出单链路故障恢复策略;然后,将其扩展到多链路故障的情况;最后,在基于Python/C++的仿真环境下对提出的技术进行评估。实验结果表明,该技术仅需要非常有限的资源,且造成的路由质量损耗也有限,可以实现快速切换,可依网络生成树中链路数目扩展。该技术的可扩展性、简单性和低开销使其适合于大型网络。Considering that current greedy technique can’ t handle the breakdowns in topological structure effectively, this paper proposes the localised recovery strategy for single link breakdowns and multi-link breakdowns.First, we give the recovery strategy for single link breakdowns by using greedy embedding of Robert Kleinberg.Then, we expand it to multi-link breakdowns situation.Finally, we evaluate the proposed technologies in Python/C＋＋-based simulation environment.Experimental results show that the technologies need just very limit resources, and the routing quality loss caused is limit as well, it can switch quickly and expand according to the link number of networks spanning tree.The technologies proposed are fit for big networks because of their expandability, simplicity and low cost.

关 键 词：单链路故障 多链路故障 贪婪路由协议 本地恢复策略 网络生成树 

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