计算机科学 ›› 2017, Vol. 44 ›› Issue (7): 68-73.doi: 10.11896/j.issn.1002-137X.2017.07.012

• 网络与通信 • 上一篇    下一篇

基于逐跳方式的单链路故障保护算法

耿海军,施新刚,王之梁,尹霞,尹少平   

  1. 山西大学软件学院 太原030013,清华大学计算机科学与技术系 北京100048,清华大学计算机科学与技术系 北京100048,清华大学计算机科学与技术系 北京100048,山西大学软件学院 太原030013
  • 出版日期:2018-11-13 发布日期:2018-11-13
  • 基金资助:
    本文受国家高技术研究发展计划(863计划)基金资助

Single-link Failure Protection Algorithm Based on Hop-by-Hop Routing

GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping   

  • Online:2018-11-13 Published:2018-11-13

摘要: 当网络中的某条链路出现故障时,互联网部署的域内路由协议需要重新收敛,在收敛过程中经过该链路的报文将会被丢弃。针对该问题,IETF(the Internet Engineering Task Force)提出了快速重路由保护框架,利用该框架可以有效地解决网络中单链路故障造成的报文丢失问题,然而该方案并不能完全保护网络中所有可能的单链路故障。基于该框架研究者提出了一种基于隧道的解决方案,该方案虽然可以提供100%的单链路故障保护,但是需要辅助机制的协助,开销较大,难以实际部署。因此,提出了一种基于逐跳方式的针对单链路故障的全保护方案,该方案可以解决网络中任意的单链路故障造成的报文丢失问题。

关键词: 路由保护,链路故障,域内路由

Abstract: When a link fails,the deployed intra-domain routing protocol need to re-convergen.During the process of re-convergence,packets which travel through the link will be dropped.Therefore,IETF proposed a framework,named IPFRR (IP Fast Re-Route),which can effectively reduce packet loss when a single-link failure occurs.However,IPFRR cannot provide complete protection against all single-link failure scenarios.Based on the framework,lots of IP-tunnel-based schemes have been proposed to solve the problem.However,these methods introduce extra overhead and need the assistance of an auxiliary mechanism.In this work,we aimed for hop-by-hop routing algorithm that can provide complete protection against all such single-link failure scenarios.

Key words: Routing protection,Link failure,Intra-domain routing

[1] LEE S,YU Y,NELAKUDITI S,et al.Proactive vs Reactive Ap-proaches to Failure Resilient Routing[C]∥INFOCOM.2004:1-9.
[2] KRIST P.Scalable and Efficient Multipath Routing:Complexity and Algorithms[C]∥2015 IEEE 23rd International Conference on Network Protocols (ICNP).IEEE,2015:376-385.
[3] NUCCI A,BHATTACHARYYA S,TAFT N,et al.IGP Link Weight Assignment for Operational Tier-1 Backbones[J].IEEE/ACM Transactions on Networking (TON),2007,15(4):789-802.
[4] MOTIWALA M,ELMORE M,FEAMSTER N,et al.Path splicing[C]∥SIGCOMM.2008:27-38.
[5] MOTIWALA M,FEAMSTER N,VEMPALA S.Path splicing:Reliable connectivity with rapid recovery[C]∥HotNets.2007:1-7.
[6] ERLEBACH T,MEREU A.Path splicing with guaranteed fault tolerance[C]∥GLOBECOM.2009:1-6.
[7] CHO S,ELHOURANI T,RAMASUBRAMANIAN S.Indepen-dent directed acyclic graphs for resilient multipath routing [J].IEEE/ACM Transactions on Networking (TON),2012,20(1):153-162.
[8] LAKSHMINARAYANAN K,CAESAR M,R ANGAN M,et al.Achieving convergence-free routing using failure-carrying packets[C]∥SIGCOMM.2007:241-252.
[9] YABG B,LIU J,SHENKER S,et al.Keep forwarding:Towards k-link failure resilient routing[C]∥INFOCOM.2014:1617-1625.
[10] KWONG K,GAO L,GUERIN R,et al.On the feasibility and efficacy of protection routing in IP networks[J].IEEE/ACM Transactions on Networking (ToN),2011,9(2):1543-1556.
[11] YUAN Q,WU J,CARDEI I.Smrs:A scalable multi-path routing scheme[J].International Journal of Parallel,Emergent and Distributed Systems,2009,24(1):69-84.
[12] ENYEDI G,RTVRI G,SZILGYI P,et al.IP Fast Re-Route:Lightweight Not-Via without Additional Addresses[C]∥INFOCOM.2009:157-168.
[13] GUMMADI,KRISHNA P,et al.Improving the reliability of internet paths with one-hop source routing[C]∥Conference on Symposium on Opearting Systems Design & Implementation USENIX Association.2004:13-13.
[14] FORTZ B,THORUP M.Optimizing OSPF/IS-IS Weights in a Changing World [J].IEEE Journal on Selected Areas in Communications,2006,20(4):756-767.
[15] ATLAS A,ZININ A.Basic specification for ip fast reroute:Loop-free alternates[C]∥RFC 5286.2008:1-32.
[16] YANG X,WETHERALL D.Source selectable path diversity via routing deflections[C]∥SIGCOMM.2006:159-170.
[17] ATLAS A.U-turn A lternates for Ip/LDp Fast-Reroute[C]∥IETF Internet Draft.2006:1-29.
[18] SRIDHARAN A,GUERIN R,DIOT C.Achieving near-optimal traffic engineering solutions for current ospf/is-is networks[J].IEEE/ACM Transactions on Networking (TON),2005,13(2):234-247.
[19] FRANCOIS P,BONAVENTURE O.An evaluation of ip-based fast reroute techniques[C]∥CoNEXT.2005:244-245.
[20] RETVRI G,CSIKOR L,TAPOLCAI J,et al.Optimizing igplink costs for improving ip-level resilience[C]∥Design of Reliable Communication Networks (DRCN).2011:62-69.
[21] MARKOPOULOU A,IANNACCONE G,BHATTACHARYYAS,et al.Characterization of Failures in an Operational IP Backbone Network[J].IEEE/ACM Transactions on Networking (TON),2008,16(4):749-762.
[22] NETWORK A B.Advanced networking for research and education.http://abilene.internet2.edu,2003.
[23] SPRING N,MAHAJAN R,WETHERALL D,et al.Measuring isp topologies with rocketfuel [J].IEEE/ACM Transactions on Networking,2004,12(1):2-16.
[24] MEDINA A,LAKHINA A,MATTA I,et al.Brite:An approa-ch to universal topology generation[C]∥IEEE International Workshop on Modeling,Analysis,and Simulation of Computer and Telecommunication Systems.2001:346-353.
[25] GJOKA M,RAM V,YANG X.Evaluation of ip fast rerouteproposals[C]∥Communication Systems Software and Middleware.2007:1-8.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!