摘要
近年来,新科学技术的推出、新业务种类的出现促进了网络的迅速发展,Internet承载了越来越多的流量,服务提供商(SP)发现Internet能带来潜在的高额利润,然而即使在可靠的网络中也无时无处不存在的各种故障使得服务不可用或者性能下降。为了保障用户业务的服务质量(Qos),主要研究在故障、攻击等意外情况下系统如何保证任务及时完成的网络生存性受到SP关注,而适用于实际纯IP网络的IP网络生存性以其成本低、细粒度、处理故障范围较大、保护时间较长成为目前的研究热点。本文不考虑安全性方面的问题。
IP网络生存性根据备份路径建立时间的先后分为主动性策略和被动性策略。而依据故障后当前网络状况自适应建立备份路径的被动性策略由于较长的故障处理时间不能满足现有业务99.999%服务可用性(service availability)的要求。因此本文主要围绕着基于主动策略的IP网络生存性故障处理技术进行了研究,研究的侧重点为处理频繁故障引起的路由振荡抑制机制、网络瞬时单链路/节点故障恢复机制和基于最小覆盖集的多链路故障解决方案。论文的主要工作包含以下几个方面:
(1)根据实际骨干网络中路由振荡的引发原因,通过分析路由收敛过程中收敛时间在各个阶段的决定因素,确定链路振荡与路由振荡之间的关系,将路由振荡抑制转化为链路振荡抑制,以本地处理的角度提出了动态自适应的调节Hello定时器的路由振荡抑制机制。仿真结果表明该机制不仅能很好的抑制振荡,且占用较小的网络资源,同时保证网络可靠性和稳定性。通过搭建试验网络证实该机制可与现有路由协议互通。
(2)分析了现有网络瞬时故障处理技术存在的问题,提出基于备份链路的单链路故障恢复机制,它综合考虑故障前后节点最短路径树的区别与联系,而不是仅专注于故障前或故障后的网络拓扑,为故障链路寻找备份链路,建立无环备份路径。该算法具有100%网络覆盖率、较低的算法复杂度,且改进了偏转路由对网络双向链路的限制和故障迟缓路由算法对硬件的依赖性,仿真结果证明它具有良好的性能。
(3)为了解决网络瞬时单节点故障问题,在BLSL算法基础上通过分析故障节点孩子子树之间以及与节点其他子树之间的关联,建立备份链路连接被分离的各个子树从而构建备份最短路径树获得备份路由表,并提出一种受限的松散源路由数据传输模式,它不仅保证备份路径中无路由环路,且减少了备份路由表条目。仿真结果证明该算法的备份路径与最优路径相差不多。
(4)将解决多链路故障的多拓扑技术归结为求解最小覆盖集问题,本文借鉴图论中图的最小生成树及其余树的相关知识提出了拓扑子图路由算法,每个拓扑子图保护部分链路,所有拓扑子图保护全部链路。该算法获得与余树中连续孤立节点个数相关的拓扑子图个数,解决了现有多拓扑技术无法理论证明备份拓扑个数的问题,仿真结果证明拓扑子图备份路径平均长度较小。
Internet has seen tremendous growth in the past decade with the introduction of new science and technology and the emergence of new services, so that service providers find out that more and more traffics in the Internet have the potential to bring more profits. But the failures happening everywhere and every time even in the robust network may make the service unavailable and performance digressive. Network survivability is popular among service providers to guarantee Qos. The main research content of survivability is a network how to complete the service on time dynamically in face of challenges such as failure and attack. As the pure IP network is exactly the component in real network, the IP network survivability becomes hot because of its lower cost、fine-grained、and longer time to protect. This dissertation don't take Network Security into account.
There are two directions: Reactive and Proactive based on the establish time of backup-path. But Reactive Policy wastes so much time on failure recovery time which can't satisfy real-time service Qos requirement such as VOIP. Therefore this dissertation focuses on the Proactive IP network survivability for routing flap suppression mechanism handling frequent failure、network single transient failure recovery mechanism and multi-link-failure solution based on minimum cover set. The main contributions are as follow:
(1)The causes of routing flap in real backbone network are analyzed. And the relationship of link flap and routing flap is given based on the determinants at every phases of routing convergence. The suppression of routing flap transfers into the suppression of link flap. A localized approach is proposed to suppress the routing flap through dynamically tuning the Hello timer. Simulation results show that this mechanism can achieve better performance in eliminating routing flap and consume much less computation resources at the same time. And a small network is built to verify it can interoperate with the existing routing protocol.
(2)After analysis of the existing failure recovery algorithms handling single failure, a single-link failure recovery mechanism based on backup-link is proposed. It considers about the differences and the relations between SPF of the node failure or not, and picks up backup-link to build loop-free backup-path. This mechanism not only has 100% network coverage and a lower algorithm complexity, but also improves the two-way link limitation of Defection Routing and the dependence of Failure Insensitive on hardware. Routing. Experiments prove the algorithm has better performance.
(3) In order to handle the single node failure problem, backup links are used to connect the depart sub-trees of failure node to the other sub-tree of the root node SPF after the analysis of their relationship based on BLSL algorithm. Loosely constrained routing is proposed to transfer data through routers in the backbone network. It is the way to keep loop-free routing in backup-path, and decreases the number of routing table entry at the same time. Simulation results prove that the backup path of this algorithm is almost the same as the shortest path and better than the others.
(4)Multi-topology technology which is used to solve the problem of multi-failures is the method to solve minimum cover set problem. Sub-topology routing algorithm is proposed based on the knowledge of Graph Theory about minimum spanning tree and its extended tree. Every sub-topology protects some links which don't belong to it, all sub-topology keep all links safe. The number of sub-topology in a network is depended on the number of the continuous isolated nodes in extended tree which can not prove by the other multi-topology technologies. And experiments certificate that the average backup path length in sub-topology is smaller and it has a lower the packet loss rate.
引文
[1]ISC,Internet Systems Consortium,www.isc.org.
[2]CNNIC,中国互联网络信息中心,www.cnnic.net.cn.
[3]C Boutremans,G Iannaccone,C Diot,Impact of link failures on VoIP performance,In Proc.of the 12th international workshop on Network and operating systems support for digital audio and video,May 2002,Florida,USA pp:63-71
[4]AP Markopoulou,FA Tobagi,MJ Karam,Assessing the quality of voice communications over internet backbones,IEEE/ACM Transactions on Networking (TON),2003.
[5]C Perkins,O Hodson,V Hardman,A survey of packet loss recovery techniques for streaming audio IEEE network,1998.
[6]PPhilip E.Agre,P2P and the promise of internet equality,Communications of the ACM,Feb.2003,vol(3):39-42.
[7]Iannaccone G,Bhattacharyya S,Chuah C,et.Al.Analysis of Link.Failures in an IP Backbone.In Proc.of ACM Sigcomm Internet Measurement Workshop IMW',Marseille,France,2002.
[8]Markopoulou A,Iannaccone G,Bhattacharyya S,et al.Characterization of Failures in an IP Backbone.Proceedings of IEEE INFOCOMM' 04.Hong Kong,2004.
[9]顾晓鸣,龚平,张卫国,马明凯,IP网路由故障的产生与仿真测试,系统路由故障的产生与仿真检测,系统仿真学报,2004,vol16(1):42-44.
[10]Moore D,Shannon C,Claffy K.Code Red:a case study on the spread and victims of an Internet worm.Proceedings of ACM SIGCOMM Internet Measurement Workshop,Marseille,France,2002,New York,USA,ACM Press,2002:273-284.
[11]Matthieu Arnold Henri Clouqueur,Wayne D.Grover,Availability of service in mesh-restorable transport networks,Jan.2004,Doctoral Thesis:University of Alberta
[12]C.Fraleigh,S.Moon,C.Diot,B.Lyles,and F.Tobagi.Packet-level traffic measurements from a tier-1 IP backbone.Sprint ATL Technical Report TR01-ATL-110101,November 2001.
[13]U.Hengartner,S.Moon,R.Mortier,and C.Diot.Detection and analysis of routing loops in packet traces.Sprint ATL Technical Report TR02-ATL-051001,May 2002.
[14]R.Bush,T.Griffin,and Z.M.Mao.Route Flap Damping:Harmful?http://www.ripe.net/ripe/meetings/archive/ripe-43/presentations/ripe43-routing-flap.pdf,2002.
[15]梁雄健,孙青华等.通信网可靠性管理.北京邮电大学出版社.2004-9.
[16]F.T.Boesch,Synthesis of Reliable Network:A Survey.IEEE Transactions on Reliability,1986,vol.35(3):237-252.
[17] Frank H, Frisch I T. Analysis and Design of Survivable Networks. IEEE Transaction of Communication Technology, 1970, vol.18(5):501-510.
[18] Westmark, V.R. A definition for information system survivability. Proceedings of the 37th Annual Hawaii International Conference on System Sciences, Hawaii, USA, 2004.
[19] P. Francois, Filsfils Clarence, Evans John, et al. Achieving sub-second IGP convergence in large IP networks. ACM SIGCOMM Computer Communication Review, 2005, Vol.35(2):35-44.
[20] M. Shand, S. Bryant, IP Fast Reroute Framework draft-ietf-rtgwg-ipfrr-framework-08 (work in Progress) , February 25,2008
[21] Shand, M. S. Bryant, A Framework for Loop-free Convergence, draft-ietf-rtgwg-lf-conv-frmwk-02(work in rogress) , February 2008.
[22] 张民贵, 刘斌, IP 网络的快速故障恢复, 电子学报,Aug2008, vol36(8):1595-1602.
[23] Lee, S. Yinzhe Yu Nelakuditi, S. Zhi-Li, et al. Proactive vs. Reactive Approaches to Failure Resilient Routing. Proceedings of IEEE Infocom 2004, Hong Kong, 2004.
[24] Shand M. IP fast reroute framework [ Z] . IETF Internet Draft (work in progress) ,J une 2005.
[25] Schollmeier G, Charzinski J , Kirstdter A , et al . Improving the resilience in IP networks [ A ] . Proceedings of High Perfor2 mance Switching and Routing , Torino , Italy ,2003 [ C ]. USA: IEEE press ,2003. 91 - 96.
[26] Iannaccone G,Chuah C2N ,et al. Feasibility of IP restoration in a tier 1 backbone [J ] . IEEE Network, 2004,18 (2): 13 -19.
[27] Nelakuditi, S., Lee, S., Yu, Y., Zhang, Z.-L., and Chuah, C.-N. Fast Local Rerouting for Handling Transient Link Failures. IEEE/ACM Trans. On Networking, Apr. 2007, vol2:359-372
[28] Basu and J. G. Riecke, Stability Issues in OSPF Routing, in Proceedings of SIGCOMM 2001, San Diego, California, USA, August 2001, pp. 225-236.
[29] Nucci, B. Schroeder, S. Bhattacharyya, et al. IGP Link Weight Assignment for Transient Link Failures. Proc. of the 18th International Teletraffic Congress (ITC), Berlin, Germany, 2003.
[30] M. Medard et al., Redundant Trees for Pre-planned Recovery in Arbitrary Vertex-redundant or Edge-redundant Graphs, in IEEE/ACM Transactions on Networking, October 1999, vol.7(5):641-652.
[31] Apostolopolous G. Using Multiple Topologies for IP-only Protection Against Network Failures, A Routing Performance Perspective, Crete ,Greece :ICS-FORTH,2006.
[32]J.P.Vasseur,M.Pickavet,P.Demeester,Network Recovery:Protection and Restoration of Optical,SONET-SDH,IP,and MPLS,Morgan Kaufmann 2004.
[33]石兵,宽带传输网络生存性及自愈技术的研究,电子科技大学,2006,博士论文
[34]Pierre Francois.Improving the Convergence of IP Routing Protocols[Ph.d thesis].Department of Computing Science and Engineering,UCL,Louvain-la-Neuve,Belgium,2007.
[1]R.Govindan,A.Reddy,An Analysis of Inter-Domain Topology and Route Stability,in Proceedings of the IEEE INFOCOM '97,Kobe,Japan,April 1997
[2]Aman Shaikh,Albert Greenberg,Experience in Black-box OSPF Measurement,in Proceedings of the ACM SIGCOMM Internet Measurement Workshop(IMW),pp.113-125,November 2001,http://www.cse.ucsc.edu/aman/publications.html
[3]U.Hengartner,S.Moon,R.Mortier,and C.Diot,Detection and analysis of routing loops in packet traces,in Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment.ACM Press,2002,pp.107-112
[4]Zinin,Analysis and Minimization of Microloops in Link-state Routing Protocols,Internet draft raft-zinin-microloop-analysis,work in progress
[5]Westmark,V.R.A definition for information system survivability.Proceedings of the 37th Annual Hawaii International Conference on System Sciences,Hawaii,USA,2004
[6]罗鹏程,金光,周经伦等,通信网可靠性研究综述,小型微型计算机系统,2000,vol.21(10):1073-1077.
[7]石兵,周明天,李兴明,多层网络抗毁机制的研究,计算机科学,2002,vol.29(1):46-52
[8]Avizienis A,Laprie J C,Randell B,et al.Basic concepts and taxonomy of dependable and secure computing.IEEE Transactions on Dependable and Secure Computing,2004,vol.1:11-33.
[9]K.Owens,V.Sharma,M.Oommen.Network survivability considerations for traffic engineered IP networks.2000,http://tools.ietf.org/html/draft-owens-te-network-survivability-00.
[10]S.Rai,B.Mukherjee,O.Deshpande.IP resilience within an.autonomous system:Current approaches,challenges,and future directions.2003,IEEE Communications Magazine,vol.43(10):142-149.
[11]Katz,D.and D.Ward,Bidirectional Forwarding Detection,draft-ietf-bfd-base-07(work in progress),January 2008.
[12]邵旭,丁伟,石晶林,张志群,一种简单的自适应快速收敛LSP环路预防算法,通信学报,2002,vol23(6):68-73.
[13]J.P.Vasseur,M.Pickavet,P.Demeester.Network Recovery:Protection and Restoration of Optical,SONET-SDH,IP,and MPLS.Morgan Kaufmann 2004.
[14]Fumagalli and L.Valcarenghi.IP restoration vs.WDM protection:Is there an optimal choice?.IEEE Network,2000,14(6):34-41.
[15]R.Bartos and M.Raman,A Heuristic Approach to Service Restoration in MPLS Networks,in Proceedings of ICC 2001,June 2001
[16]A Bremler-Barr,et.al Restoration by Path Concatenation:Fast Recover for MPLS Paths,In Proceedings of ACM symposium on Principles of Distributed Computing,2001
[17]Gianluca Iannaccone,Chert-Nee Chuah,Supratik Bhattacharyya,et al.Feasibility of IP restoration in a tier-1 backbone.IEEE Network Magazine,2004,18(2):13-19.
[18]P.Francois,C.Filsfils,J.Evans,et al.Achieving sub-second IGP convergence in large IP networks.ACM SIGCOMM Computer Communication Review,July 2005,35(2):35-44.
[19]Goyal,M.Ramakrishnan,K.K.Wu-chi Feng.Achieving faster failure detection in OSPF networks,In Proceedings of the International Conference on Communications (ICC) 2003,Volume 1,296-300.
[20]D.Dovolsky,I.Bryskin,D.Awduche Limited Flooding As a Scalability Improvement to OSPF,draft-dovolsky-ccamp-ospf-limited-flooding-00.txt,November 2002
[21]Cisco System,OSPF Incremental SPF,www.cisco.com/en/US/docs/ios/12_0s/feature/guide/ospfispf.html.
[22]M.Shand,S.Bryant,IP Fast Reroute Framework draft-ietf-rtgwg-ipfrr-framework-08(work in Progress),February 25,2008
[23]Atlas,A.Zinin.Basic specification for IP fast-reroute:loop-free alternate.http://tools.ietf.org/html/draft-ietf-rtgwg-ipfrr-spec-base-05.txt,2006.
[24]A.Atlas,U-turn alternates for IP/LDP fast-reroute,IETF Internet Draft,Feb.2005,draft-atlas-ip-local-protect-uturn-02.txt
[25]S.Bryant,C.Filsfils,S.Previdi.IP Fast Reroute using Tunnels.http://tools.ietf.org/html/draft-bryant-ipfrr-tunnels-00.txt.2004.
[26]S.Bryant,M.Shand.IP Fast Reroute using Not via Addresses.ftp://ftpeng.cisco.com/ftp/stbryant/draft-bryant-shand-IPFRR-notvia-addresses-00.txt.2005.
[27]S.Nelakuditi,S.Lee,Y.Yu,Z.-L.Zhang,and C.-N.Chuah,Fast local rerouting for handling transient link failures.IEEE/ACM Transaction on Networking,vol.15(2):359-372,2007.
[28]Wang and S.Nelakuditi,IP Fast Reroute with Failure Inferencing.In Proceedings of INM'07,The 5-9's Workshop at ACM SIGCOMM,August 2007
[29]hong,Z.,Nelakuditi,S.,Yu,Y.,Lee,S.,Wang,J.,and Chuah,C.Failure Inferencing based Fast Rerouting for Handling Transient Link and Node Failures,In Proc.of IEEE INFO- COM,pages 4:2859-2863,2005.134.
[30] S. Vellanki, A. L. N. Reddy. Improving Service Availability during Link Failure Transients through Alternate Routing. http://dropzone.tamu.edu/techpubs/2003/TAMU-ECE-2003 -02.pdf. 2003
[31] Z. Wang,J. Crowcroft.Shortest path first with emergency exits.ACM SIGCOMM Computer Communication Review,1990,(20)4:100-176.
[32] Sundar Iyer, Supratik Bhattacharyya, Nina Taft, et al. An approach to alleviate link overload as observed on an IP backbone.Proceedings of IEEE INFOCOMM' 03, San Francisco, USA. 2003.
[33] Schollmeier G, Charzinski J, Kirstdter A, et al. Improving the resilience in IP networks. Proceedings of High Performance Switching and Routing, Torino, Italy, IEEE press ,2003.91-96.
[34] V. Naidu. IP Fast Reroute using Multiple Path Algorithm ( MPA ) . http://www.watersprings. org/ pub/id/draft- venkata-ipfrr-mpa-00.txt.2004.
[35] Gyu Myoung Lee and Jin Seek Choi, A survey of multipath routing for traffic engineering. Term paper, Informations and Communications University, Korea, 2002
[36] M. Menth, R. Martin. Network Resilience through Multi-Topology Routing. Proceedings of Design of Reliable Communication Networks 2005 (DRCN 2005), Naples, Italy, 2005.
[37] P. Psenak et al. Multi-Topology (MT) Routing in OSPF, Network Working Group, Internet-Draft, draft-ietf-ospf-mt, work in progress
[38] Kvalbein, A. Hansen, A. F. Cicic, et al.Fast IP Network Recovery using Multiple Routing Configurations. Proceedings of IEEE Infocom 2006, Barcelona, Spain, 2006
[39] A. F. Hansen, A. Kvalbein, T. Cicic, S. Gjessing, O. Lysne, T. Jensen, Fast, Effective and Stable IP Recovery using Resilient Routing Layers, Proc. 19th Int'l. Teletraffic. Congress (ITC19), Aug.2008
[40] F. Hansen, A. Kvalbein, T. Cicic, et al. Resilient Routing Layers for Recovery in Packet Networks. Proceedings of Dependable Systems and Networks (DSN) , Yokohama, Japan, 2005.
[41] Francois P, Bonaventure O, Shand M, et al. Loop-free convergence using oFIB, IETF Internet Draft (work inprogress) ,Oct 2006.
[42] 张宇, 张宏莉,方滨兴, Internet 拓扑建模综述, 软件学报,2004, vol15(8): 1220-1226.
[43] Magoni D, Pansiot JJ. Evaluation of Internet topology generators by power law and distance indicators. In: Proc. of the IEEE ICON 2002. Singapore: IEEE, 2002, pp.401-406.
[44]Renesys.SSFNet,Scalable Simulation Framework for Network Models.http://www.ssfnet.org/.
[45]BRITE.Boston university representative internet topology generator,http://www.cs.bu.edu/brite
[1]J.Moy,OSPF Version 2.RFC 2328,April 1998.
[2]C.Alaettinoglu et al.,Terwards milli-second IGP convergence,IETF Internet Draft,Nov.2000,draft-alaettinoglu-ISISconvergence-00.txt.
[3]Zhuang,S.Q.Geeis,D.Stoica,I.Katz,R.H.,On failure detection algorithms in overlay networks,in Proc.of INFOCOM 2005,vol.3:2112-2123
[4]Z Li,L Yuan,P Mohapatra,CN Chuah,On the analysis of overlay failure detection and recovery,Computer Networks,2007
[5]Donghui Gao,Zhiyu Zhou and Hanyi Zhang,A Novel Algorithm for Fast Detection of Network Failure,Photonic Network Communications,2005
[6]Goyal et al.Achieving faster failure detection in OSPF networks,In Proc.of IEEE International Conference on Communications 2003,Alaska,May 2003,vol.1:296-300.
[7]Basu and J.G.Riecke,Stability Issues in OSPF Routing,In Proc.of SIGCOMM 2001,San Diego,California,USA,August 2001,pp.225-236.
[8]G.Iannaccone,C.Chuah,R.Mortier,S.Bhattacharyya,and C.Diot,Analysis of link failures in an IP backbone,In Proc.of ACM Sigcomm Internet Measurement Workshop,Nov.2002.
[9]Alaettionoglu Cengiz,Casner Stephen,Detailed Analysis of ISIS Routing Protocol on the Qwest Backbone,NANOG 24,Feburary 2002.
[10]Yasuhiro Ohara,Manav Bhatia,Osamu Nakamura,and Jun Murai,Route flapping effects on OSPF,In SAINT-03:Proceedings of the 2003 Symposium on Applications and the Internet Workshops(SAINT' 03 Workshops),Washington,DC,USA,IEEE Computer Society,2003,pp.232-237
[11]C.Villamizar,R.Chandra,and R.Govindan.BGP Route Flap Damping.RFC2439,Nov.1998.
[12]Z.Mao,R.Govindan,G.Varghese,R.Katz,Route Flap Damping Exacerbates Internet Routing Convergence,Sigcomm 2002
[1]Iannaccone G,Chuah CN,Mortier R et al.Analysis of link failures in an IP backbone.Proceedings of ACM SIGCOMM Internet Measurement Workshop,Marseille,France,2002.New York,USA:ACM Press,2002.237-242.
[2]Westmark V R,A definition for information system survivability,VTC 2004-Jan.HICSS 2004:120-126.
[3]J.P.Vasseur,M.Pickavet,P.Demeester,Network Recovery:Protection and Restoration of Optical,SONET-SDH,IP,and MPLS,Morgan Kaufmann 2004.
[4]K.Nichols et al.,Definition of the Differentiated Services Field(DS Field) in the IPv4and IPv6 Headers,Network Working Group,Request for Comments:2474,December 1998
[5]张民贵,刘斌,IP网络的快速故障恢复,电子学报 No.8,Aug 2008
[6]Shand M,IP fast reroute framework,IETF Internet Draft,2005,draft-ietf-rtgwg-ipfrr-framework-04.txt.
[7]于涛,陈山枝,李昕.偏转路由的网络故障处理技术.北京邮电大学学报,2007,30(6):1-6.
[8]YU Tao,CHEN Shan-zhi,LI Xin.Research on network failure handling Technology based on deflection routing.Journal of Beijing University of Posts and Telecommunications,2007,30(6):1-6.
[9]Heckmann O,Piringer M,Schmitt J et al.On realistic network topologies for simulation,VTC 2003-Spring ACM SIGCOMM workshop on Models,methods and tools for reproducible network research,2003:324-33
[10]Schollmeier G,Charzinski J,Kirstdter A,et al.Improving the resilience in IP networks.Proceedings of High Perfor2 mance Switching and Routing,Torino,Italy,2003.USA:IEEE press,2003.91-96.
[11]Sahasrabuddhe L,Ramamurthy S,Mukherjee B.Fault management in IP-over-WDM networks:WDM protection versus IP restoration.IEEE Journal on Selected Areas in Communications,2002,20(1):21-33.
[12]S.Nelakuditi,S.Lee,Y.Yu,Z.-L.Zhang,and C.-N.Chuah,Fast local rerouting for handling transient link failures.University of South Carolina,Tech.Rep.TR-2004-004,July 2004.
[13]G.Iannaccone,C.-N.Chuah,S.Bhattacharyya,and C.Diot,Feasibility of IP restoration in a tier-1 backbone,IEEE Network Magazine,Special Issue on Protection,Restoration and Disaster Recovery,2004.
[14]S.Nelakuditi,S.Lee,Y.Yu,and Z.-L.Zhang,Failure insensitive routing for ensuring service availability,in Proc.International Workshop on Quality of Service(IWQoS),2003.
[15]S.Lee,Y.Yu,S.Nelakuditi,Z.-L.Zhang,and C.-N.Chuah,Proactive vs reactive approaches to failure resilient routing,in Proc.IEEE Infocom,Hong Kong,2004.
[16]Failure Inferencing based Fast Re-routing,http://arena.cse.sc.edu/fifr.html.
[17]Aman Shaikh,Albert Greenberg,Experience in Black-box OSPF Measurement,in Proceedings of the ACM SIGCOMM Internet Measurement Workshop(IMW),pp.113-125,November 2001,http://www.cse.ucsc.edu/aman/publications.html
[18]P.Francois,C.Filsfils,J.Evans,et al.Achieving sub-second IGP convergence in large IP networks.ACM SIGCOMM Computer Communication Review,July 2005,35(2):35-44.
[1]Markopoulou A,Iannaccone G,Bhattacharyya S,et al.Characterization of Failures in an IP Backbone.Proceedings of IEEE INFOCOMM'04.Hong Kong,2004.
[2]P.Francois,Filsfils Clarence,Evans John,et al.Achieving sub-second IGP convergence in large IP networks.ACM SIGCOMM Computer Communication Review,2005,35(2),35-44.
[3]J.Broch,D.A,Maltz,D.B.Johson,Yih-Chun Hu,and J.Jetcheva.A performance Comparson of Multi-Hop Wireless Ad Hoc Network Routing Protocols.The Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM'98),Dallas,Texas,October 1998
[4]Intanagonwiwat C,Govindan R,Estrin D,Heidemann J,Silva F.Directed diffusion for wireless sensor networking.ACM/IEEE Transactions on Networking,2002,11(1):2-16.
[5]彭伟,卢锡城:移动自组网络中采用连通支配集的有效广播技术(英文),《软件学报》2001,13(4)
[6]于涛,陈山枝,秦臻,李听大规模灾害下基于连通支配集的重路由技术高技术通讯第18卷,第1期,2008,1,11-15.
[7]韩露,移动自组织网路由协议研究,华中科技大学,2006,博士学位论文.
[8]尹长青,无线自组织网络若干技术的研究,复旦大学,2004,博士学位论文.
[9]J.Wang,Z.Zhong,S.Nelakuditi,Handling Multiple Network Failures through Interface Specific Forwarding.Proceedings of Globecom'06,San Francisco,CA,USA,November 2006.
[10]S.Nelakuditi,S.Lee,Y.Yu,et al.Blacklist-aided forwarding in static multihop wirelessnetworks.Proceedings of 5th IEEE Communications Society Conference on Sensor,Mesh and Ad Hoc Communications and Networks-SECON05,Santa Clara,California,USA,Sept.2005.
[11]Karthik Lakshminarayanan,Matthew Caesar,Murali Rangan,et.al.Achieving Convergence Free Routing using.Failure-Carrying Packets.Proceedings of ACM.SIGCOMM 2007,Kyoto,Japan,2007.
[12]S.Nelakuditi,S.Lee,Y.Yu,et al.Blacklist-aided forwarding in static multihop wirelessnetworks.Proceedings of 5th IEEE Communications Society Conference on Sensor,Mesh and Ad Hoc Communications and Networks SECON05,Santa Clara,California,USA,Sept.2005.
[13]Karthik Lakshminarayanan,Matthew Caesar,Murali Rangan,et.al.Achieving Convergence Free Routing using.Failure-Carrying Packets.Proceedings of ACM.SIGCOMM 2007,Kyoto,Japan,2007.
[14]P.Psenak et al.Multi-Topology(MT) Routing in OSPF,Network Working Group,Internet-Draft,draft-ietf-ospf-mt,work in progress
[15]Kvalbein et al.,Fast IP Network Recovery using Multiple Routing Configurations,to appear in Proceedings of INFOCOM 2006,Spain,April 2006
[16]Hansen,A.F.,Cicic,T.,Gjessing,S.,Kvalbein,A.,Lysne,O.,Resilient routing layers for recovery in packet networks.In:to appear at The International Conference on Dependable Systems and Networks,2005,Yokohama,Japan,June 20