计算机应用与软件Issue(12)：169-174,228,7.DOI:10.3969/j.issn.1000-386x.2014.12.040
基于贪婪路由协议的动态单／多链路故障恢复策略
DYNAMIC RECOVERY STRATEGY FOR SINGLE AND MULTI-LINK BREAKDOWNS BASED ON GREEDY ROUTING PROTOCOL
摘要
Abstract
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.关键词
单链路故障/多链路故障/贪婪路由协议/本地恢复策略/网络生成树Key words
Single-link breakdowns/Multi-link breakdowns/Greedy routing protocol/Local recovery strategy/Networks spanning tree分类
信息技术与安全科学引用本文复制引用
於文刚,于春玲,朱玉全..基于贪婪路由协议的动态单／多链路故障恢复策略[J].计算机应用与软件,2014,(12):169-174,228,7.基金项目
江苏省现代教育技术研究项目（2012－R－21983）；淮安市科技支撑计划项目（ HAG2011056）。 （）
