计算机科学 ›› 2015, Vol. 42 ›› Issue (1): 106-109.doi: 10.11896/j.issn.1002-137X.2015.01.025
王明鸣,孟相如,徐有,崔文岩
WANG Ming-ming, MENG Xiang-ru, XU You and CUI Wen-yan
摘要： 为进一步提高网络单故障快速恢复能力,基于改进的Remote Loop-Free Alternates(rLFA)重路由技术,提出一种采用混沌粒子群并考虑网络物理传输代价和拥塞代价的重路由选择算法。首先基于rLFA的隧道建立方法对其进行改进,结合引入隧道技术的链路增补方法来实现故障全覆盖,通过设置权重因子来保证在不同业务量下的重路由选择针对性。实验表明,改进的rLFA能进一步提高网络单故障覆盖率,同时结合链路增补方法在保证故障完全覆盖的情况下能够大幅度减少链路增补数量；路由选择算法能够动态选择不同业务量下的重路由路径,在提高网络单故障环境下的传输效率的同时也实现了负载均衡。
| [1] Zinin A A.Basic specification for IP fast-reroute:loop-free alternate[EB/OL].http://tools.ietf.org/html/draft-ietf-rtgwg-ipfrr-spec-base-05.txt,2006 [2] Atlas A.U-turn alternates for IP/LDP fast-reroute[EB/OL].IETF Internet Draft,draft-atlas-ip-local-protect-uturn-02.txt.2005 [3] Bryant S,Filsfils C,Previdi S.IP fast reroute using tunnels[EB/OL].http://tools.ietf.org/html/draft-bryant-ipfrr-tunnels-00.txt,2004 [4] Bryant S,Shand M,Previdi S.IP fast reroute using Not-via addresses[S].IETF Draft,2010 [5] Iyer S,Bhattacharyya S,Taft N,et al.An approach to alleviate link overload as observed on an IP backbone[C]∥Proceedings of IEEE INFOCOMM’03.San Francisco,USA,2003:406-416 [6] Wang,Nelakuditi S.IP fast reroute with failure inferencing[C]∥Proceedingof INM’07,The 5-9’s Workshop at ACM SIGCOMM.2007:268-273 [7] Csikor L,Tapolcai J,Rétvári G.Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates[J].Computer Communications,2013,6(6):645-655 [8] Su Hui-kai.A Local Fast-Reroute mechanism for single node or link protection in hop-by-hop routed networks[J].ComputerCommunications,2012,5(8):970-979 [9] Retvari G,Tapolcai J,Enyedi G,et al.IP Fast ReRoute:LoopFree Alternates revisited[C]∥INFOCOM.2011:2948-2956 [10] Menth M,Hartmann M,Martin R,et al.Loop-free alternatesand not-via addresses:A proper combination for IP fast reroute?[J].Computer Networks,2010,4(8):1300-1315 [11] Tseng Po-kai,Chung Wei-ho.Joint coverage and link utilization for fast IP local protection[J].Computer Networks,2012,6(15):3385-3400 [12] Xu Ming-wei,Li Qing,Pan Ling-tao,et al.Minimum Protection Cost Tree:A tunnel-based IP Fast Reroute Scheme[J].Compu-ter Communications,2012,5(17):2082-2092 [13] Xu Ming-wei,Yang Yuan,Li Qi.Selecting shorter alternate paths for tunnel-based IP Fast ReRoute in linear time[J].Computer Networks,2012,6(2):845-857 [14] Bryant S,Filfils C,Shand M,et al.Remote LFA FRR[S].IETF draft,2013 [15] Csikor L,Retvari G.IP Fast Reroute with Remote Loop-FreeAlternates:the Unit Link Cost Case[C]∥ICUMT.2012:663-669 [16] Survivable fixed telecommunication Network Design library(SNDlib) [EB/OL].http://sndlib.zib.de [17] Fortz B,Thorup M.Internet traffic engineering by optimizing OSPF weights[C]∥Proceedings of IEEE infocom 2000.Te-Aviv,Israel,2000:519-528 [18] 刘洪波,王秀坤,谭国真.粒子群优化算法的收敛性分析及其混沌改进算法[J].控制与决策,2006,21(6):636-640 [19] Mérindol P,Francois P,Bonaventure O,et al.An efficient algorithm to enable path diversity in link state routing networks[J].Computer Networks,2011,55(5):1132-1149 [20] Betker A,Gerlach C,Hulsermann R,et al.Reference transport network scenarios[R].MultiTera Project,Tech.Rep.2004 [21] 陈铎龙,孟相如,梁霄,等.基于动态流量的多拓扑链路权值优化算法[J].计算机科学,2013,0(4):86-90 |
| No related articles found! |
|
||
首页