BGP路由稳定性建模与分析
|
摘要
BGP (Border Gateway Protocol)作为Internet路由体系结构的核心协议,其稳定性已成为人们所关心的焦点。本文以BGP路由稳定性作为研究对象,着重研究了影响BGP路由稳定性的关键问题,并提出了相应的稳定性解决方案,为Internet稳定运行提供了可靠的数据分析方法和快速的故障解决方案。通过理论研究、仿真分析、实验证实的研究方法,主要做了以下几个方面的工作：
BGP路由抽象模型的研究和建立。本文以Internet路由体系结构为研究对象,深入研究了Internet路由系统的基本理论和动态行为规律,基于静态或动态数学模型,系统分析了BGP路由抖动、收敛延时、路由配置故障等影响BGP路由稳定性的关键问题。结合图论和拓扑学的已有知识给出BGP路由抽象模型,以简化对BGP路由稳定性问题的研究。
BGP路由抖动的检测和消除方法研究。要从根本上解决路由抖动问题,最实际的方法就是找到路由抖动的源头并加以抑制。根据Griffin的BGP路由模型提出了改进的稳定路径问题模型,运用竞争有向图理论,用形式化方法详细描述了BGP路由抖动问题的本质,建立了抖动路由到路由策略冲突的映射关系,提出了基于消除策略冲突的路由抖动检测和消除方法,较好地解决了BGP路由策略所引发的路由抖动问题。
BGP路由收敛性分析和改进。通过对BGP路由慢收敛现象的研究,发现造成BGP路由慢收敛的4个主要原因：1)链路或路由器失败造成的BGP路由探索延时；2)BGP最小路由通告时间会推迟BGP最佳路由的通告时间；3) AS(Autonomous System)间路由策略会影响BGP路由收敛时间；4)路由抖动抑制机制也会增加BGP路由收敛时间。研究发现,随着网络规模和连接密度的增加,BGP路由的收敛时间和消息开销都迅速增大,Tdown(路由失效)收敛时间上限达到O(n),其中n是AS节点数,消息开销上限达到|EN|·n,其中|EN|是AS间直连的链路数量。针对BGP路由慢收敛问题,本文提出了基于安全路径向量协议模型的路由收敛改进算法,通过检测AS间失效链路的根源节点,并在路由更新消息中携带根源节点信息,使接收更新的节点可以迅速撤销所有与根源节点相关的失效路由,从而提高收敛速度,减少路由更新消息开销。改进算法克服了BGP路由普遍采用的路由抖动抑制技术引起的网络收敛变慢问题,Tdown收敛时间上限下降为O(d),其中d是网络直径,更新消息开销下降为(?)EN(?), BGP路由收敛速度得到了显著提高。
在BGP路由配置故障检测方法的研究中,本文主要针对路由源配置故障和路由输出配置故障进行分析。根据目前静态和动态检测方法中存在的问题,提出了两种路由配置故障检测方法：
第一种方法,通过分析AS间关系和BGP路由通告原则,提出基于BGP路由输出规则的路由配置故障检测算法,该算法实现简单,便于实施,整个算法的时间复杂度为O(n·d),适合部署在AS间关系较为简单的BGP网络中。
第二种方法,采用数理统计中随机变量的假设检验方法,通过分析一段时间内BGP对等体之间路由更新消息的统计量变化,实现基于广义似然比检验(Generalized Likelihood Ratio Test)的异常路由更新检测,进而推断BGP路由错误配置情况。该算法的结果不受AS之间的具体连接关系的影响,适合部署在AS间连接关系复杂的BGP网络中。
在仿真实验过程中,本文使用美国Oregon大学Route View项目提供的在线BGP路由信息和欧洲IP资源网络协调中心RIPE NCC的RIS (Routing Information Service)项目网站上提供的路由信息作为实验数据。采用美国Michigan大学开发的MRT (Multi-threaded Routing Toolkit)来构造网络检测平台,用MRT所提供的动态注入BGP路由的功能,构造了脚本驱动的故障注入工具,将实验设定的路由故障注入到相应的仿真网络中。采用SSFNet (Scalable Simulation Framework Network)进行仿真实验,证实了本文所设计算法的仿真实验结果和理论分析结论基本吻合。
BGP (Border Gateway Protocol) as the key agreement of the Internet routing system, its stability has become the focus of our concern. This paper mainly researched the critical problems influencing the stability of BGP routing, and proposed the corresponding solutions to it, which provide the reliable data-based analytical methods and fast fault solutions for the stable operation of the Internet. By means of theoretical study, simulation analysis, and research methods of experimental proof the key aspects of the work were made as follows.
The study and establishment of an abstract model of BGP routing. Targeted to the Internet routing system, the basic theory of it and the dynamic law of behavior were deeply studied. On the basis of the static or dynamic mathematical model, the paper systematically analyzed the key issues which affect the BGP routing stability such as the BGP routing flap, convergence delay, and routing configuration fault, etc. In terms of the relevant knowledge of the protocol, an abstract model of BGP routing was given in order to simplify the stability of BGP routing issues.
The study of BGP routing flap detection and elimination method. In order to fundamentally solve the routing flap problem, the most practical way is to find out the source of routing flap and then restrain it. In view of Griffin's BGP routing model, this paper proposed an improved model of the Stable Path Problem, and utilized the Dispute Diagraph Theory and described the nature problem of BGP routing flap in detail with the formal methods. In addition, the paper established the mapping of the flapping route to the routing policy conflict and offered BGP routing flap detection algorithm and elimination methods on the basis of eliminating the policy conflict and better solved the problems of the routing flap triggered by BGP routing conflict.
The analysis and improvement of BGP routing convergence. Through study to the phenomenon of slow convergence of BGP routing, the paper found the following four reasons resulted in the convergence delay:The link or router failure will lead to the delay of BGP routing exploration; The MRAI will postpone the best routing advertisement time; The routing policy between AS (Autonomous System) will affect the BGP routing convergence time and routing flap suppression system will increase the BGP routing convergence time. The study found that the BGP protocol convergence time and message overhead have increased rapidly as the network scale and the linkage density increases. While the upper boundary of Tdown convergence time reached O(n), where n is the AS number of nodes, the upper boundary of the message overhead reached|EN|·n,where|EN|is the number of direct links between AS. In the light of the slow convergence problem of BGP routing, this paper presented an algorithm to improve the routing convergence based on the safe path vector protocol model. By detecting the root nodes of AS link failure and carrying the root node information in a routing-update message, all the routing failure related to the root node can be quickly removed when receiving the updating nodes, so as to improve the convergence speed and reduce the overhead of routing-update message. The improved algorithm overcomes the slow network convergence problems caused by the routing flap suppression which have been widely used in BGP routing. Thus the upper boundary of Tdown convergence time fall off to O(d), where d is the network diameter, and the overhead of routing-update message go down to|EN|, the speed of BGP routing convergence will be increased remarkably.
In the study of detecting the BGP routing configuration faults, this paper mainly analyzed the routing source fault configuration and the output fault configuration. According to the common problems existed in the current static and dynamic testing methods, two methods of detection to the routing configuration faults were proposed:
The first method, in accordance with the analysis of the relationship between AS and the principles of BGP routing advertisement, the detection algorithm of BGP routing configuration faults based on the BGP routing output regulation was put forward. The time complexity of the algorithm which is easy to realize and implement is viewed as O(n·d) which can be fit for the deployment in the BGP network of a simple relationship between AS.
The second method, the hypothesis testing method of random variable in mathematical statistics was adopted to analyze the change statistics of routing-update message between BGP routers in a period of time and then to realize the detection of the anomalous routing updates based on Generalized Likelihood Ratio. Accordingly, the circumstances of BGP routing configuration faults can be deduced. The results of the algorithm are not influenced by the specific connection relationship between AS, which can be fit for the deployment in the BGP network of a complicated relationship between AS.
In the simulation process, the paper adopted the on-line BGP routing information provided by Route View project of United States Oregon University and the project website of European IP Resource Network Coordination Center RIPE NCC's RIS (Routing Information Service) as an important source of experiment data. The network monitoring platform was constructed with the MRT (Multi-threaded Routing Toolkit) which were developed by Michigan University of the United States and a script-driven fault injection tool was created in application of the functions of dynamic injection into BGP routing offered by MRT in order to inject the setting route faults into the corresponding simulation network. So the results of simulation in this paper basically tally with the conclusion of theoretical analysis in the simulation experiments conducted by the SSFNet (Scalable Simulation Framework Network).
BGP路由抽象模型的研究和建立。本文以Internet路由体系结构为研究对象,深入研究了Internet路由系统的基本理论和动态行为规律,基于静态或动态数学模型,系统分析了BGP路由抖动、收敛延时、路由配置故障等影响BGP路由稳定性的关键问题。结合图论和拓扑学的已有知识给出BGP路由抽象模型,以简化对BGP路由稳定性问题的研究。
BGP路由抖动的检测和消除方法研究。要从根本上解决路由抖动问题,最实际的方法就是找到路由抖动的源头并加以抑制。根据Griffin的BGP路由模型提出了改进的稳定路径问题模型,运用竞争有向图理论,用形式化方法详细描述了BGP路由抖动问题的本质,建立了抖动路由到路由策略冲突的映射关系,提出了基于消除策略冲突的路由抖动检测和消除方法,较好地解决了BGP路由策略所引发的路由抖动问题。
BGP路由收敛性分析和改进。通过对BGP路由慢收敛现象的研究,发现造成BGP路由慢收敛的4个主要原因：1)链路或路由器失败造成的BGP路由探索延时；2)BGP最小路由通告时间会推迟BGP最佳路由的通告时间；3) AS(Autonomous System)间路由策略会影响BGP路由收敛时间；4)路由抖动抑制机制也会增加BGP路由收敛时间。研究发现,随着网络规模和连接密度的增加,BGP路由的收敛时间和消息开销都迅速增大,Tdown(路由失效)收敛时间上限达到O(n),其中n是AS节点数,消息开销上限达到|EN|·n,其中|EN|是AS间直连的链路数量。针对BGP路由慢收敛问题,本文提出了基于安全路径向量协议模型的路由收敛改进算法,通过检测AS间失效链路的根源节点,并在路由更新消息中携带根源节点信息,使接收更新的节点可以迅速撤销所有与根源节点相关的失效路由,从而提高收敛速度,减少路由更新消息开销。改进算法克服了BGP路由普遍采用的路由抖动抑制技术引起的网络收敛变慢问题,Tdown收敛时间上限下降为O(d),其中d是网络直径,更新消息开销下降为(?)EN(?), BGP路由收敛速度得到了显著提高。
在BGP路由配置故障检测方法的研究中,本文主要针对路由源配置故障和路由输出配置故障进行分析。根据目前静态和动态检测方法中存在的问题,提出了两种路由配置故障检测方法：
第一种方法,通过分析AS间关系和BGP路由通告原则,提出基于BGP路由输出规则的路由配置故障检测算法,该算法实现简单,便于实施,整个算法的时间复杂度为O(n·d),适合部署在AS间关系较为简单的BGP网络中。
第二种方法,采用数理统计中随机变量的假设检验方法,通过分析一段时间内BGP对等体之间路由更新消息的统计量变化,实现基于广义似然比检验(Generalized Likelihood Ratio Test)的异常路由更新检测,进而推断BGP路由错误配置情况。该算法的结果不受AS之间的具体连接关系的影响,适合部署在AS间连接关系复杂的BGP网络中。
在仿真实验过程中,本文使用美国Oregon大学Route View项目提供的在线BGP路由信息和欧洲IP资源网络协调中心RIPE NCC的RIS (Routing Information Service)项目网站上提供的路由信息作为实验数据。采用美国Michigan大学开发的MRT (Multi-threaded Routing Toolkit)来构造网络检测平台,用MRT所提供的动态注入BGP路由的功能,构造了脚本驱动的故障注入工具,将实验设定的路由故障注入到相应的仿真网络中。采用SSFNet (Scalable Simulation Framework Network)进行仿真实验,证实了本文所设计算法的仿真实验结果和理论分析结论基本吻合。
BGP (Border Gateway Protocol) as the key agreement of the Internet routing system, its stability has become the focus of our concern. This paper mainly researched the critical problems influencing the stability of BGP routing, and proposed the corresponding solutions to it, which provide the reliable data-based analytical methods and fast fault solutions for the stable operation of the Internet. By means of theoretical study, simulation analysis, and research methods of experimental proof the key aspects of the work were made as follows.
The study and establishment of an abstract model of BGP routing. Targeted to the Internet routing system, the basic theory of it and the dynamic law of behavior were deeply studied. On the basis of the static or dynamic mathematical model, the paper systematically analyzed the key issues which affect the BGP routing stability such as the BGP routing flap, convergence delay, and routing configuration fault, etc. In terms of the relevant knowledge of the protocol, an abstract model of BGP routing was given in order to simplify the stability of BGP routing issues.
The study of BGP routing flap detection and elimination method. In order to fundamentally solve the routing flap problem, the most practical way is to find out the source of routing flap and then restrain it. In view of Griffin's BGP routing model, this paper proposed an improved model of the Stable Path Problem, and utilized the Dispute Diagraph Theory and described the nature problem of BGP routing flap in detail with the formal methods. In addition, the paper established the mapping of the flapping route to the routing policy conflict and offered BGP routing flap detection algorithm and elimination methods on the basis of eliminating the policy conflict and better solved the problems of the routing flap triggered by BGP routing conflict.
The analysis and improvement of BGP routing convergence. Through study to the phenomenon of slow convergence of BGP routing, the paper found the following four reasons resulted in the convergence delay:The link or router failure will lead to the delay of BGP routing exploration; The MRAI will postpone the best routing advertisement time; The routing policy between AS (Autonomous System) will affect the BGP routing convergence time and routing flap suppression system will increase the BGP routing convergence time. The study found that the BGP protocol convergence time and message overhead have increased rapidly as the network scale and the linkage density increases. While the upper boundary of Tdown convergence time reached O(n), where n is the AS number of nodes, the upper boundary of the message overhead reached|EN|·n,where|EN|is the number of direct links between AS. In the light of the slow convergence problem of BGP routing, this paper presented an algorithm to improve the routing convergence based on the safe path vector protocol model. By detecting the root nodes of AS link failure and carrying the root node information in a routing-update message, all the routing failure related to the root node can be quickly removed when receiving the updating nodes, so as to improve the convergence speed and reduce the overhead of routing-update message. The improved algorithm overcomes the slow network convergence problems caused by the routing flap suppression which have been widely used in BGP routing. Thus the upper boundary of Tdown convergence time fall off to O(d), where d is the network diameter, and the overhead of routing-update message go down to|EN|, the speed of BGP routing convergence will be increased remarkably.
In the study of detecting the BGP routing configuration faults, this paper mainly analyzed the routing source fault configuration and the output fault configuration. According to the common problems existed in the current static and dynamic testing methods, two methods of detection to the routing configuration faults were proposed:
The first method, in accordance with the analysis of the relationship between AS and the principles of BGP routing advertisement, the detection algorithm of BGP routing configuration faults based on the BGP routing output regulation was put forward. The time complexity of the algorithm which is easy to realize and implement is viewed as O(n·d) which can be fit for the deployment in the BGP network of a simple relationship between AS.
The second method, the hypothesis testing method of random variable in mathematical statistics was adopted to analyze the change statistics of routing-update message between BGP routers in a period of time and then to realize the detection of the anomalous routing updates based on Generalized Likelihood Ratio. Accordingly, the circumstances of BGP routing configuration faults can be deduced. The results of the algorithm are not influenced by the specific connection relationship between AS, which can be fit for the deployment in the BGP network of a complicated relationship between AS.
In the simulation process, the paper adopted the on-line BGP routing information provided by Route View project of United States Oregon University and the project website of European IP Resource Network Coordination Center RIPE NCC's RIS (Routing Information Service) as an important source of experiment data. The network monitoring platform was constructed with the MRT (Multi-threaded Routing Toolkit) which were developed by Michigan University of the United States and a script-driven fault injection tool was created in application of the functions of dynamic injection into BGP routing offered by MRT in order to inject the setting route faults into the corresponding simulation network. So the results of simulation in this paper basically tally with the conclusion of theoretical analysis in the simulation experiments conducted by the SSFNet (Scalable Simulation Framework Network).
引文
[1]Stallings W高速网络与互联网-性能与服务质量(第二版),北京：电子工业出版社,2003.2-18
[2]Govindna R and Reddy A. An analysis of Internet inter-domain topology and route stability,16th Annual Joint Conference of the IEEE Computer and Communications Societies, LOS ALAMITOS, CA, USA:IEEE Computer Society Press,1997.2:850-857
[3]J. Hawkinson, T. Bates. Guidelines for creation, selection, and registration of an Autonomous System (AS), RFC1930, March 1996
[4]Rosen E. Exterior Gateway Protocol (EGP), RFC827, October 1982
[5]Rekhter Y, Li T. A Border Gateway Protocol 4 (BGP 4), RFC 1654, July 1994
[6]Rekhter Y and Li T. A border gateway Protocol (BGP 4), RFC1771, March 1995
[7]Rekhter Y, Li T. A Border Gateway Protocol 4 (BGP 4), RFC4271,January 2006
[8]Rekhter Y, Gross P. Application of the Border Gateway Protocol in the Internet, RFC1655, July 1994
[9]Rekhter Y, Gross P. Application of the Border Gateway Protocol in the Internet, RFC1772, July 1995
[10]Huston G. ISP Survial Guide:Strategies for Running a Competitive ISP [M]. Hoboken, NJ:John Wiley & Sons,1998.2-10
[11]Govindan R, Alaettinoglu C, Eddy G, et.al. An architecture for stable, analyzable Internet routing, IEEE Network,1999,13(1):29-35
[12]Huston G. Interconnection, peering and settlements-Part Ⅰ, Internet Protocol Journal,1999.23(2):32-40
[13]Labovitz C, Malan G R and Jahanian F. Internet routing instability, IEEE/ACM Transactions on Networking,1998,6(5):515-528
[14]Wang L, Zhao X and Pei D. Observation and analysis of BGP behavior under stress,the second ACM SIGCOMM Workshop on Internet measurement workshop, New York, USA:ACM press,2002:183-195
[15]Labovitz C, A. Almja and A.Bose et al. Delayed Internet routing convergence, IEEE/ACM Transactions on Networking,2001.9(3):293-306
[16]Reuven C, Amnon S. The "Global-ISP" paradigm, Computer Networks, 2007,51(8):1908-1921
[17]Misel S A. Wow, AS7007. NANOG mail archives, http://www.merit.edu /mail.archives/nanog/1997-04/msg00340.html,2003-5-8
[18]Varadhan K, Govindan R and Estrin D. Persistent route oscillations in Inter-Domain Routing, Computer Networks,2003.32:1-16
[19]Labovitz C, Mallan G add Jahanian F. Origins of Internet routing instability,the 1999 18th Annual Joint Conference of the IEEE Computer and Communications Societies, Piscataway, NJ, USA:IEEE press,1999.1:218-226
[20]Mahajan R, Wetherall D and Anderson T. Understanding BGP misconfiguration. the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, New York, USA:ACM Press,2002.3-16
[21]Feamster N, Rexford J, Modeling BGP route selection within an AS http://nms.csail.mit.edu/～feamster/papers/emu-ton2004.pdf,2004-4-23
[22]Manadhata P, Sekar V. Understanding BGP Anomalies:Detection, Analysis, and Prevention, http://www-2.cs.cmu.edu/～vyass/vyas-cv.pdf,2004-12-28
[23]Tang L, Li J, Li Y, et al. An investigation of the Internet's IP-layer connectivity, Computer Communications,2009,32(5):913-926
[24]Paxson V. End-to-end routing behavior in the Internet, IEEE/ACM Transactions on Networking,1997.5(5):601-615
[25]Griffin T G, Shepherd F B and Wilfong G. The stable paths problem and interdomain routing, IEEE Transactions on Networking,2002.10(2):232-243
[26]Zhang K, Yen A, Zhao X, Massey D and Zhang L. On Detection of Anomalous Routing Dynamics in BGP,the 3rd International IFIP Networking Conference, Berlin, Germany:Springer-Verlag,2004:259-270
[27]Agarwal S, Chuah C, Bhattacharyya S and Diot C. The Impact of BGP Dynamics on Intra-Domain Traffic, Performance Evaluation Review,2004.32(1):319-330
[28]Routing Information Service, http://www.ripe.net/projects/ris/rawdata.html 2009-8-10
[29]University of Oregon Route Views Project, http://www.routeviews.org/ 2003-10-25
[30]Griffin T G, Shepherd F B and Wilfong G. Policy disputes in path-vector protocols,1999 International Conference on Network Protocols (ICNP'99), Los Alamitos, CA, USA:IEEE Computer Society press,1999:21-30
[31]Chang D, Govindan R, Heidemann J. The Temporal and Topological Characteristics of BGP Path Changes,11th IEEE International Conference on Network Protocols (INCP 2003), Los Alamitos, CA, USA:IEEE Computer Society press,2003:190-199
[32]Feldmann A, Maennel O and Mao Z. Locating Internet Routing Instabilities, ACM SIGCOMM 2004:Conference on Computer Communications, New York:ACM perss,2004.34(4):205-218
[33]Teixeira R, Rexford J. A Measurement Framework for Pin-Pointing Routing Changes, ACM SIGCOMM 2004 workshop, New York:ACM perss,2004:313-318
[34]Caesar M, Subramanian L and Katz R. Towards Localizing Root Causes of BGP Dynamics, http://www.cs.uiuc.edu/homes/caesar/papers/rootcause.pdf,2005-3-12
[35]Lad M, Nanavati A and Massey D. An algorithmic Approach to Identiyfing Link Failures,10th IEEE Pacific Rim International Symposium on Dependable Computing, Piscataway, NJ:IEEE Computer Society perss,2004:25-34
[36]Lad M, Zhang L and Massey D. Link-Rank:A Graphical Tool for Capturing BGP Routing Dynamics,2004 IEEE/IFIP Network Operations and Management Symposium, Piscataway, NJ, USA:IEEE perss,2004:627-640
[37]Padmanabhan V,Qiu L and Wang H. Server-based inference of Internet link lossiness,22nd Annual Joint Conference on the IEEE Computer and Communications Societies, piscataway, NJ, USA:IEEE press,2003.1:145-155
[38]Griffin T G and Wilfong G. On the correctness of IBGP configuration, ACM SIGCOMM 2002, New York, USA:ACM press,2002.32(4):17-29
[39]Feamster N, Balakrishnan H. Detecting BGP configuration faults with static analysis,2nd Symposium on Networked Systems Design and Implementation (NSDI'05), Berkeley, CA, USA:USENIX ASSOC,2005:43-56
[40]Feamster N,Rexford J. Network-wide prediction of BGP routes, IEEE/ACM Transactions on Networking,2007,15(2):253-266
[41]Govindan R, Aleattinoglu C and Varadhan K. Route servers for inter-domain routing, Computer Networks and ISND Systems,1998.30(12):1157-1174
[42]Routing Arbiter Project,, http://www.merit.edu/networkresearch/projecthistory/ routingartiber/,2009-1-25
[43]Alaettinoglu C, Bates T, Karrenberg D, et al.·Routing Policy Specification Language (RPSL), RFC2280, January 1998
[44]Alaettinoglu C, Villamizar C, Gerich E, et al. Routing Policy Specification Language (RPSL), RFC2622, June 1999
[45]Basu A, Shepherd F and Wilfong G, et al. Route oscillations in I-BGP with route reflection, ACM SIGCOMM 2002 Conference, New York,USA:CM press, 2002:235-247
[46]Eto M, Kadobayashi Y, Yamaguchi S. Improvement of Consistency among AS Policies on IRR database, http://www.jstage.jst.go.jp/article/ipsjdc/1/0/216/_pdf, 2005-7-26
[47]Griffin T G and Wilfong G. A safe path vector protocol,19th Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE perss: Piscataway, NJ, USA,2000.2:490-499
[48]Griffin T G and Wilfong G. Analysis of the MED Oscillation Problem in BGP,10th IEEE International Conference on Network Protocols, New York, USA:ACM press,2005:90-99
[49]Tangmunarunkit H, Govindan R, Shenker S et al. The Impact of Routing Policy on Internet Paths,20th Annual Joint Conference of the IEEE Computer and Communications Societies, Piscataway, NJ, USA:IEEE press,2004:736-742
[50]王立军,吴建平,徐恪.域间路由策略冲突的收敛性分析.清华大学学报(自然科学版),2006,46(10)：1755-1758
[51]王立军i,吴建平.改善BGP路由收敛的时间窗口机制.软件学报,2008,19(11)：2979-2989
[52]Gao L. and Rexford J. Stable Internet routing without global coordination, IEEE/ACM Transactions on Networking,2001.9(6):681-692
[53]Gao L, Griffin T G and Rexford J. Inherently safe backup routing with BGP.20th Annual Joint Conference on the IEEE Computer and Communications Soeieties (IEEE INFOCOM 2001), Piscataway, NJ, USA:IEEE press,2001.547-556
[54]Labovitz C, Ahuja A and Jahanian F. Experimental study of Internet stability and wide-area backbone failures, International Symposium on Fault-Tolerant Computing, Los Alamitos, CA, USA:IEEE Computer Soeiety press,1999:278-285
[55]Clement J, Chin K. Power-law and stable distribution of BGP paths, In proceedings of 5th International Conference on Information Technology and Applications, ICITA,2008:567-569
[56]Wang L, Massey D, Zhang L. Persistent detection and recovery of state inconsistencies, Computer Networks,2007,51(6):1444-1458
[57]Rexford J, Wang J and Zhang Y. BGP routing stability of popular destination, Proceedings of the 2nd Internet Measurement Workshop (IMW2002). New York, USA:ACM press,2002.197-202
[58]Donnet B. Incentives for BGP guided IP-level topology discovery, in Proceedings, Traffic Monitoring and Analysis-First International Workshop, TMA 2009: 101-108
[59]Donnet B, Friedman T. Internet topology discovery:a survey, IEEE Communications Surveys and Tutorials,2007,9(4):2-15
[60]赵锋,苏金树,王宝生.一种基于通告时间截的BGP收敛性改进机制.国防利技大学学报,2006,28(3)：54-58
[61]Josh K, Stephanie F, Jennifer R. Autonomous security for autonomous systems, Computer Networks,2008,52(15):2908-2923
[62]The SSFNet Porject, http://www.ssfnet.org,2008-11-16
[63]Internet Performance Measurement and Analysis Porject, http://www.merit.edu/ networkresearch/projecthistory/ipma/index.php,2009-3-19
[64]Route Views Porject, http://www.routeviews.org/,2009-2-22
[65]Routing Information Service Porject, http://www.ripe.net/,2009-6-7
[66]Griffin T G and Wilfong G. An analysis of BGP convergent properties, the 1999 ACM SIGCOMM Conference Applications, Technologies, Architectures, and Protocols for Computer Communication, New York, USA:ACM press, 1999:277-288
[67]Hongjun Wang, Dadong Wang, Haiying Liang, et al. Eliminating BGP Oscillations Caused by Policy Conflicts. International Symposium on Communications and Information Technologies 2005. Beijing,2005:194-197
[68]Flluer V, Li T, Varadhan K. Classless Inter-Domain Routing (CIDR):an Address Assignment and Aggregation Strategy, RFC1519, September 1998
[69]BGP Routing Table Analysis Reports, http://bgp.potaroo.net,2009-2-1
[70]Sobrinho J. Network Routing with Path Vector Protocols:Theory and Applications, Computer Communication Review,2003.33(4):49-60
[71]Labovitz C, Almja A and Bose A. An experimental study of Internet routing convergence, http://www.acm.org/sigs/sigcomm/sigcomm2000/conf/abstract/ 5-2.htm,2001-10-9
[72]Sahoo A, Kant K, Mohapatra P. Characterization of BGP recovery under large scale failures, in:Proceedings of the ICC 2006, Istanbul, Turkey, June 11-15, 2006:949-954
[73]Pei D, Zhang B, Massey D and Zhang L. An analysis of Path-Vector Routing Protocol Convergence Algorithms, http://www.cs.colostate.edu/-massey/pubs/tr/ massey_uclatr040009.pdf,2004-9-10
[74]Lv Jun, Li Xing, Ran Congsen, et al. A New Algorithm for Network Anomaly Detection, Computing in the Global Information Technology, Aug.2006:49-54
[75]Minei I, Marques-Pedro R. Scalability considerations in BGP/MPLS IP VPNs, IEEE Communications Magazine,2007,45(4):26-31
[76]Cobb J, Musunuri R. Enforcing Convergence in Inter-Domain Routing. GLOBECOM' 04-IEEE Global Telecommunications Conference, New York:IEEE press,2004.3:1353-1358
[77]Villamizar C, Chandra R and Govindan R. BGP route flap damping, RFC2439, November 1998
[78]Colitti L, Battista D, Patrignani M, et al. Investigating prefix propagation through active BGP probing, Microprocessors and Microsystems, 2007,31(7):460-474
[79]Akashi O, Fukuda K, Hirotsu T, et al. Policy-based BGP-control architecture for inter-AS routing adjustment, Computer Communications,2008,331 (13):2996-3002
[80]Rajendran R, Rubenstein D, Wasserman M. A Theoretical Method for BGP Policy Verification, http://www.ee.columbia.edu/～kumar/papers/p2004-02.pdf 2004-10-9
[81]Meyer, J. Schmitz, C.Orange, et al. Using RPSL in Practice, RFC2650, August 1999
[82]Zang Z, Luo G, Yin C. Verification of Interdomain Routing System Based on Formal Methods, Tsinghua Science & Technology,2009,14(1):83-89
[83]Andrej V, Roman N. Policy relationship annotations of predefined AS-level topologies, Computer Networks,2008,52(15):2859-2871
[84]Mao Z, Govindan R, Varghese G. Route Flap Damping Exacerbates Internet Routing Convergence, ACM SIGCOMM 2002 Conference, New York, USA:ACM press,2002:221-233
[85]Cobb J, Gouda M and Musunuri R. A stabilizing solution to the stable Path Problem,6th International Symposium on Self-Stabilizing Systems(SSS 2003), Berlin, Germany:Springer-Verlag,2003:169-183
[86]Sahoo A, Kant K, Mohapatra P. Improving BGP convergence delay for large scale failures, in:Proceedings of DSN 2006, Philadelphia, Pennsylvania, June 25-28, 2006:323-332
[87]Dan Pei, B. Zhang. An analysis of convergence delay in path vector routing protocols, Computer Networks 2006,30(3):398-421
[88]Sun W, Mao Z, Shin K G. Differentiated BGP update processing for improved routing convergence, in:Proceedings of the ICNP 2006, Santa Barbara, California, November 12-15,2006:280-289
[89]Lijun W, JiangPing W, Ke X, Modified flap damping mechanism to improve inter-domain routing convergence, Computer Communications 2007.30(7): 1588-1599
[90]Duan Z, Chandrashekar J and Krasky J, et al. Damping BGP route flaps,23rd IEEE International Performance, Computiing, and Communications Conference, Piscataway, NJ, USA:IEEE press,2004.23:131-138
[91]Musunuri R and Cobb J. Enforcing IBGP convergence,12th IEEE International Conference on Newtorking, Piscataway, NJ:IEEE press,2004:511-517
[92]Luo J, Xie J, Hao R et al. An approach to accelerate convergence for Path vector protocol, GLOBECOM'02-IEEE Global Telecommunications Conference, New York:IEEE press,2002:2390-2394
[93]Bonaventure O, Filsfils C, Francois P. Achieving sub-50 milliseconds recovery upon BGP peering link failures, IEEE/ACM Transactions on Networking, 2007,15(5):1123-1135
[94]Bressoud T C, Rastogi R and Smith M A. Optimal Configuration for BGP Route Selection,22nd Annual Joint Conference on the IEEE Computer and Communications Societies, Piscataway, NJ, USA:IEEE press,2003.916-926
[95]Pei D, Zhao X, Wang L, et al. Improving BGP Convergence Through Consistency Assertions, IEEE INFOCOM, New York:IEEE perss,2002:902-911
[96]Barr A, Aefk Y, Schwarz S. Improved BGP convergence via ghost flushing.22nd Annual Joint Conference on the IEEE Computer and Communications Societies, New York:IEEE press,2003:927-937
[97]Bhargavan K, Obradovic D and Gunter C. Formal verification of distance-vector routing protocols, Journal of the ACM,2002.49(4):538-576
[98]Griffin T G and Premore B. An experimental analysis of BGP convergence time, 2001 International Conference on Network Protocols, Los Alamitos, CA, USA:IEEE Computer Society press,2001:53-61
[99]Labovitz C, wattenhofer R and Venkatachary S. The impact of Internet Policy and topology on delayed routing convergence,20th Annual Joint Conference on the IEEE Computer and Communications Societies (IEEE INFOCOM 2001), New York, USA:IEEE press,2001:537-546
[100]Jeong S, Youn C, Choi T. Policy Management for BGP Routing Convergence Using Inter-AS Relationship. Journal of Communications and Networks, 2007.3(4):342-350
[101]N. Laskovic and Lj. Trajkovic, BGP with an adaptive minimal route advertisement interval, in Proceedings of the IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, United states,2006:135-142
[102]S. Halabi and D. McPherson, Internet Routing Architectures. Indianapolis, IN:Cisco Press,2000
[103]Dolev D, Jamin S, Mokryn O, et al. Internet resiliency to attacks and failures under BGP policy routing, Computer Networks,2006,50(16):3183-3196
[104]Zhao X, Massey D, Pei D et al. A Study on the Routing Convergence of Latin American Networks, IFIP/ACM Latin America Networking Conference, New York, USA:ACM perss,2003:35-43
[105]Nykvist J, Motyckova L. Simulating Convergence Properties of BGP,11th International Conference on Computer Communications and Networks, New York, USA:IEEE press,2002:124-129
[106]Pei D, Azuma M, Nguyen N, et al. Improving BGP Convergence Through Root Cause, Computer Network,2005.48(2):175-194
[107]Bless R, Lichtwald G, Schmidt M. Fast scope rerouting for BGP,11th IEEE International conference on Networks, New York:IEEE press,2003:25-30
[108]王立军,吴建平,徐恪.解决策略冲突导致BGP路由发散的自适应机制.软件学报,2008,19(6)：1465-1472
[109]Chen E and Stewart J. A frame work for inter-domain route aggregation, RFC2519, Feberary,1999
[110]W. Shen, Lj. Trajkovic. BGP route flap damping algorithms, in Proc. SPECTS'05, Philadelphia, PA, July 2005:488-495
[111]T. D. Feng, R. Ballantyne, and Lj. TrajkoviC, Implementation of BGP in a network simulator, in Proc. ATS'04, Arlington, VA, April 2004:149-154
[112]Bremler-Barr A, Chen N, Kangasharju J, et al. Bringing order to BGP: Decreasing time and message complexity, Computer Networks,2009,53(12): 2241-2256
[113]Xiao L, He G, Nahrstedt K. BGP session lifetime modeling in congested networks, Computer Networks,2006,50(17):3315-3333
[114]Sriram K, Montgomery D, Borchert O, et al. Study of BGP peering session attacks and their impacts on routing performance, IEEE Journal on Selected Areas in Communications,2006,24(10):1901-1915
[115]Francois P, Bonaventure O, Decraene B, et al. Avoiding disruptions during maintenance operations on BGP sessions, IEEE Transactions on Network and Service Management,2007,4(3):1-11
[116]Siganos G, Faloutsos M. Analyzing BGP Policies:Methodology and Tool, IEEE INFOCOM 2004-Conference on Computer Communications. Piscataway, NJ, USA:IEEE press,2004:1640-1651
117] Zhao X, Pei D, Wang L, et al. Detection of invalid routing announcement in the Internet, the 2002 International Conference on Dependable Systems and Networks, Piscataway, NJ, USA:IEEE Computer Society press,2002:59-68
[118]Kumari W. Route table prefix monitoring, NANOG mail archives, http://www.merit.edu/mail.archives/nanog/msg20765.html,2009-6-11
[119]Pei D, Aiello W, Gilbert A, et al. Origin Disturbances in BGP, http://www.patrickmcdaniel.org/pubs/td-62tjf8.pdf,2005-8-20
[120]Chang D, Govindan R, Heidemann J. An Empirical Study of Router Response to Large BGP Routing Table Load, the 2nd Internet Measurement Workshop (IMW2002), New York:ACM press,2002:203-208
[121]Huston G. Analyzing the Internet's BGP Routing Table, The Internet Protocol Journal,2001.4(1):1-10
[122]Meng X, Xu Z, Zhang B, et al. IPv4 Address Allocation and the BGP Routing Table Evolution, ACM SIGCOMM Computer Communication Review, 2005.35(1):71-80
[123]Bu T, Gao L, Towsley D. On characterizing BGP routing table growth, GLOBECOM?05-IEEE Global Telecommunications Conference, New York, USA: IEEE perss,2005:2185-2189
[124]Xu Z, Meng X, Zhang L, et al. Impact of IPv4 address allocation practice on BGP routing table growth, IEEE 18th Annual Workshop on Computer Communications, New York, USA:IEEE perss,2003:172-178
[125]Narayan H, Govindan R, Varghese G. The Impact of Address Allocation and Routing on the Structure and Implementation of Routing Tables, Computer Communication Review,2003.33(4):125-136
[126]Kruegel C, Mutz D, Robertson W, et al. Topology-based Detection of Anomalous BGP Messages, Sixth International Symposium on Recent Advances in Intrusion Detection, Berlin, Germany:Springer-Verlag,2003:17-35
[127]Aiello W, Loannidis J, McDaniel P. Origin authentication in interdomain routing, Proceedings of the ACM Conference on Computer and Communications Security, New York:ACM press,2003:165-178
[128]Sahoo A, Kant K, Mohapatra P, BGP convergence delay after multiple simultaneous router failures:Characterization and solutions, Computer Communications,2009(32),7-10:1207-1218
[129]Staplcton-Gray R. BGP routing integrity checker and prefix-list filter generation tool, in Proceedings-Cyber security Applications and Technology Conference for Homeland Security, Piscataway, NJ, United States,2009:224-226
[130]Aranda G, Pedro A. Detection of trial and error traffic engineering with BGP-4, In Proceedings of the 5th International Conference on Networking and Services, 2009:131-136
[131]Sriram K,Borchert O, Kim O. A Comparative analysis of BGP anomaly detection and robustness algorithms, In Proceedings-Cybersecurity Applications and Technology Conference for Homeland Security,2009:25-38
[132]Feamster N, Balakrishnan H. Towards a Logic for Wide-Area Internet Routing, ACM SIGCOMM Workshop, New York:ACM press,2003:289-300
[133]Feamster N, Balakrishnan H. Verifying the Correctness of Wide-Area Internet Routing, http://citeseer.ist.psu.edu/feamster04verifying.html,2005-7-19
[134]Villamizar C, Alaettinoglu C, MeyerD, et al. Routing Policy system security, RFC2725, December 1999
[135]Goodell G, Aiello W, Griffin T G. Working around BGP:An incremental approach to improving security and accuracy of interdomain routing, ISOC NDSS'03, 2003:75-85
[136]Ng J. Extensions to BGP to support secure origin BGP (soBGP), http://smakd.potaroo.net/ietf/idref/draft-ng-sobgp-bgp-extensions/index.html, 2005-3-21
[137]Seo K, Lynn C, and Kent S. Public-key infrastructure for the secure border gateway protocol (S-BGP),2nd DARPA Information Survivability Conference and Exposition, Los Alamitos, CA, USA:IEEE Computer Society press,2001: 239-253
[138]王瑞军,王洪君,张春宏,等.区分自治系统关系的域间路由体系研究.计算机研究与发展,2004,41(5)：835-842
[139]Kent S. Securing the Border Gateway Protocol:A status update,7th International Conference on Communications and Multimedia Security, Berlin, Germany: Springer-Verlag,2003:40-53
[140]Deshpande S, Thottan M, Sikdar B. An online scheme for the isolation of BGP misconfiguration errors, IEEE Transactions on Network and Service Management,2008,5(2):78-90
[141]Subramanian L, Agarwal S and Rexford J. Characterizing the Internet hierarchy from multiple vantage points, IEEE INFOCOM 2002, Piscataway, NJ, USA:IEEE press,2002.2:618-627
[142]P.Barford, A. Bestavros and J.Byers et al. On the marginal utility of network topology measurements, In:Proc. of the First ACM SIGCOMM Workshop on Internet Measurement Workshop 2001.New York, NY:ACM press,2002:5-17
[143]Chan Hw, Dash D, Perrig A, et al. Modeling adoptability of secure BGP protocols, Computer Communication Review,2006,36(4):279-290
[144]Donnet B., Bonaventure O. On BGP communities, ACM SIGCOMM Computer Communication Review,2008,38(2):55-59
[145]Donnet B, Bonaventure O. Improved algorithms for network topology discovery, LNCS,2005,3431:149-162
[146]Raghavan V, Riley G, Jaafar T. Realistic topology modeling for the Internet BGP infrastructure,2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS,2008.9:1-8
[147]Carl G, Kesidis G. Large-scale testing of the Internet's Border Gateway Protocol (BGP) via topological scale-down, ACM Transactions on Modeling and Computer Simulation,2008,18(3),11:1-30
[148]Leguay J, Latapy M, Friedman T, et al. Describing and simulating internet routes, Computer Networks,2007,51(8):2067-2085
[149]Dimitropoulos-Xenofontas A, Riley-George F. Efficient large-scale BGP simulations, Computer Networks,2006,50(12):2013-2027
[150]Sagy B, Mira G, Avishai W. A geographic directed preferential internet topology model, Computer Networks,2007,51(14):4174-4188
[151]Li T, Zhu Y, Xu K, et al. Performance model and evaluation on geographic-based routing, Computer Communications,2009,32(2):343-348
[152]Wang J, Chiu D, Lui J. A game-theoretic analysis of the implications of overlay network traffic on ISP peering, Computer Networks,2008,52(15):2961-2974
[153]Felix J G C, Gregorio M P, Antonio F G S. Multi-layer framework for analysing and managing routing configurations, Computers & Electrical Engineering, 2009(35)5:634-643
[154]Joan F, David R K, Vahab S M, et al. Subjective-cost policy routing, Theoretical Computer Science,2007,378(2):175-189
[155]Wai Cheung, Heung Wong, Riquan Zhang. Generalized likelihood ratio test for varying-coefficient models with different smoothing variables, Computational Statistics & Data Analysis,2007,51(9):4543-4561
[156]Erik Hartikainen, Svante Ekelin, PJohan M. Change detection and estimation for network-measurement applications, In Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks, Chania, Crete Island, Greece, Oct.2007:1-10
[157]XU K. HE H. BGP parallel computing model based on the iteration tree, Journal of China Universities of Posts and Telecommunications,2008,15(SUPPL.):1-8
[2]Govindna R and Reddy A. An analysis of Internet inter-domain topology and route stability,16th Annual Joint Conference of the IEEE Computer and Communications Societies, LOS ALAMITOS, CA, USA:IEEE Computer Society Press,1997.2:850-857
[3]J. Hawkinson, T. Bates. Guidelines for creation, selection, and registration of an Autonomous System (AS), RFC1930, March 1996
[4]Rosen E. Exterior Gateway Protocol (EGP), RFC827, October 1982
[5]Rekhter Y, Li T. A Border Gateway Protocol 4 (BGP 4), RFC 1654, July 1994
[6]Rekhter Y and Li T. A border gateway Protocol (BGP 4), RFC1771, March 1995
[7]Rekhter Y, Li T. A Border Gateway Protocol 4 (BGP 4), RFC4271,January 2006
[8]Rekhter Y, Gross P. Application of the Border Gateway Protocol in the Internet, RFC1655, July 1994
[9]Rekhter Y, Gross P. Application of the Border Gateway Protocol in the Internet, RFC1772, July 1995
[10]Huston G. ISP Survial Guide:Strategies for Running a Competitive ISP [M]. Hoboken, NJ:John Wiley & Sons,1998.2-10
[11]Govindan R, Alaettinoglu C, Eddy G, et.al. An architecture for stable, analyzable Internet routing, IEEE Network,1999,13(1):29-35
[12]Huston G. Interconnection, peering and settlements-Part Ⅰ, Internet Protocol Journal,1999.23(2):32-40
[13]Labovitz C, Malan G R and Jahanian F. Internet routing instability, IEEE/ACM Transactions on Networking,1998,6(5):515-528
[14]Wang L, Zhao X and Pei D. Observation and analysis of BGP behavior under stress,the second ACM SIGCOMM Workshop on Internet measurement workshop, New York, USA:ACM press,2002:183-195
[15]Labovitz C, A. Almja and A.Bose et al. Delayed Internet routing convergence, IEEE/ACM Transactions on Networking,2001.9(3):293-306
[16]Reuven C, Amnon S. The "Global-ISP" paradigm, Computer Networks, 2007,51(8):1908-1921
[17]Misel S A. Wow, AS7007. NANOG mail archives, http://www.merit.edu /mail.archives/nanog/1997-04/msg00340.html,2003-5-8
[18]Varadhan K, Govindan R and Estrin D. Persistent route oscillations in Inter-Domain Routing, Computer Networks,2003.32:1-16
[19]Labovitz C, Mallan G add Jahanian F. Origins of Internet routing instability,the 1999 18th Annual Joint Conference of the IEEE Computer and Communications Societies, Piscataway, NJ, USA:IEEE press,1999.1:218-226
[20]Mahajan R, Wetherall D and Anderson T. Understanding BGP misconfiguration. the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, New York, USA:ACM Press,2002.3-16
[21]Feamster N, Rexford J, Modeling BGP route selection within an AS http://nms.csail.mit.edu/～feamster/papers/emu-ton2004.pdf,2004-4-23
[22]Manadhata P, Sekar V. Understanding BGP Anomalies:Detection, Analysis, and Prevention, http://www-2.cs.cmu.edu/～vyass/vyas-cv.pdf,2004-12-28
[23]Tang L, Li J, Li Y, et al. An investigation of the Internet's IP-layer connectivity, Computer Communications,2009,32(5):913-926
[24]Paxson V. End-to-end routing behavior in the Internet, IEEE/ACM Transactions on Networking,1997.5(5):601-615
[25]Griffin T G, Shepherd F B and Wilfong G. The stable paths problem and interdomain routing, IEEE Transactions on Networking,2002.10(2):232-243
[26]Zhang K, Yen A, Zhao X, Massey D and Zhang L. On Detection of Anomalous Routing Dynamics in BGP,the 3rd International IFIP Networking Conference, Berlin, Germany:Springer-Verlag,2004:259-270
[27]Agarwal S, Chuah C, Bhattacharyya S and Diot C. The Impact of BGP Dynamics on Intra-Domain Traffic, Performance Evaluation Review,2004.32(1):319-330
[28]Routing Information Service, http://www.ripe.net/projects/ris/rawdata.html 2009-8-10
[29]University of Oregon Route Views Project, http://www.routeviews.org/ 2003-10-25
[30]Griffin T G, Shepherd F B and Wilfong G. Policy disputes in path-vector protocols,1999 International Conference on Network Protocols (ICNP'99), Los Alamitos, CA, USA:IEEE Computer Society press,1999:21-30
[31]Chang D, Govindan R, Heidemann J. The Temporal and Topological Characteristics of BGP Path Changes,11th IEEE International Conference on Network Protocols (INCP 2003), Los Alamitos, CA, USA:IEEE Computer Society press,2003:190-199
[32]Feldmann A, Maennel O and Mao Z. Locating Internet Routing Instabilities, ACM SIGCOMM 2004:Conference on Computer Communications, New York:ACM perss,2004.34(4):205-218
[33]Teixeira R, Rexford J. A Measurement Framework for Pin-Pointing Routing Changes, ACM SIGCOMM 2004 workshop, New York:ACM perss,2004:313-318
[34]Caesar M, Subramanian L and Katz R. Towards Localizing Root Causes of BGP Dynamics, http://www.cs.uiuc.edu/homes/caesar/papers/rootcause.pdf,2005-3-12
[35]Lad M, Nanavati A and Massey D. An algorithmic Approach to Identiyfing Link Failures,10th IEEE Pacific Rim International Symposium on Dependable Computing, Piscataway, NJ:IEEE Computer Society perss,2004:25-34
[36]Lad M, Zhang L and Massey D. Link-Rank:A Graphical Tool for Capturing BGP Routing Dynamics,2004 IEEE/IFIP Network Operations and Management Symposium, Piscataway, NJ, USA:IEEE perss,2004:627-640
[37]Padmanabhan V,Qiu L and Wang H. Server-based inference of Internet link lossiness,22nd Annual Joint Conference on the IEEE Computer and Communications Societies, piscataway, NJ, USA:IEEE press,2003.1:145-155
[38]Griffin T G and Wilfong G. On the correctness of IBGP configuration, ACM SIGCOMM 2002, New York, USA:ACM press,2002.32(4):17-29
[39]Feamster N, Balakrishnan H. Detecting BGP configuration faults with static analysis,2nd Symposium on Networked Systems Design and Implementation (NSDI'05), Berkeley, CA, USA:USENIX ASSOC,2005:43-56
[40]Feamster N,Rexford J. Network-wide prediction of BGP routes, IEEE/ACM Transactions on Networking,2007,15(2):253-266
[41]Govindan R, Aleattinoglu C and Varadhan K. Route servers for inter-domain routing, Computer Networks and ISND Systems,1998.30(12):1157-1174
[42]Routing Arbiter Project,, http://www.merit.edu/networkresearch/projecthistory/ routingartiber/,2009-1-25
[43]Alaettinoglu C, Bates T, Karrenberg D, et al.·Routing Policy Specification Language (RPSL), RFC2280, January 1998
[44]Alaettinoglu C, Villamizar C, Gerich E, et al. Routing Policy Specification Language (RPSL), RFC2622, June 1999
[45]Basu A, Shepherd F and Wilfong G, et al. Route oscillations in I-BGP with route reflection, ACM SIGCOMM 2002 Conference, New York,USA:CM press, 2002:235-247
[46]Eto M, Kadobayashi Y, Yamaguchi S. Improvement of Consistency among AS Policies on IRR database, http://www.jstage.jst.go.jp/article/ipsjdc/1/0/216/_pdf, 2005-7-26
[47]Griffin T G and Wilfong G. A safe path vector protocol,19th Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE perss: Piscataway, NJ, USA,2000.2:490-499
[48]Griffin T G and Wilfong G. Analysis of the MED Oscillation Problem in BGP,10th IEEE International Conference on Network Protocols, New York, USA:ACM press,2005:90-99
[49]Tangmunarunkit H, Govindan R, Shenker S et al. The Impact of Routing Policy on Internet Paths,20th Annual Joint Conference of the IEEE Computer and Communications Societies, Piscataway, NJ, USA:IEEE press,2004:736-742
[50]王立军,吴建平,徐恪.域间路由策略冲突的收敛性分析.清华大学学报(自然科学版),2006,46(10)：1755-1758
[51]王立军i,吴建平.改善BGP路由收敛的时间窗口机制.软件学报,2008,19(11)：2979-2989
[52]Gao L. and Rexford J. Stable Internet routing without global coordination, IEEE/ACM Transactions on Networking,2001.9(6):681-692
[53]Gao L, Griffin T G and Rexford J. Inherently safe backup routing with BGP.20th Annual Joint Conference on the IEEE Computer and Communications Soeieties (IEEE INFOCOM 2001), Piscataway, NJ, USA:IEEE press,2001.547-556
[54]Labovitz C, Ahuja A and Jahanian F. Experimental study of Internet stability and wide-area backbone failures, International Symposium on Fault-Tolerant Computing, Los Alamitos, CA, USA:IEEE Computer Soeiety press,1999:278-285
[55]Clement J, Chin K. Power-law and stable distribution of BGP paths, In proceedings of 5th International Conference on Information Technology and Applications, ICITA,2008:567-569
[56]Wang L, Massey D, Zhang L. Persistent detection and recovery of state inconsistencies, Computer Networks,2007,51(6):1444-1458
[57]Rexford J, Wang J and Zhang Y. BGP routing stability of popular destination, Proceedings of the 2nd Internet Measurement Workshop (IMW2002). New York, USA:ACM press,2002.197-202
[58]Donnet B. Incentives for BGP guided IP-level topology discovery, in Proceedings, Traffic Monitoring and Analysis-First International Workshop, TMA 2009: 101-108
[59]Donnet B, Friedman T. Internet topology discovery:a survey, IEEE Communications Surveys and Tutorials,2007,9(4):2-15
[60]赵锋,苏金树,王宝生.一种基于通告时间截的BGP收敛性改进机制.国防利技大学学报,2006,28(3)：54-58
[61]Josh K, Stephanie F, Jennifer R. Autonomous security for autonomous systems, Computer Networks,2008,52(15):2908-2923
[62]The SSFNet Porject, http://www.ssfnet.org,2008-11-16
[63]Internet Performance Measurement and Analysis Porject, http://www.merit.edu/ networkresearch/projecthistory/ipma/index.php,2009-3-19
[64]Route Views Porject, http://www.routeviews.org/,2009-2-22
[65]Routing Information Service Porject, http://www.ripe.net/,2009-6-7
[66]Griffin T G and Wilfong G. An analysis of BGP convergent properties, the 1999 ACM SIGCOMM Conference Applications, Technologies, Architectures, and Protocols for Computer Communication, New York, USA:ACM press, 1999:277-288
[67]Hongjun Wang, Dadong Wang, Haiying Liang, et al. Eliminating BGP Oscillations Caused by Policy Conflicts. International Symposium on Communications and Information Technologies 2005. Beijing,2005:194-197
[68]Flluer V, Li T, Varadhan K. Classless Inter-Domain Routing (CIDR):an Address Assignment and Aggregation Strategy, RFC1519, September 1998
[69]BGP Routing Table Analysis Reports, http://bgp.potaroo.net,2009-2-1
[70]Sobrinho J. Network Routing with Path Vector Protocols:Theory and Applications, Computer Communication Review,2003.33(4):49-60
[71]Labovitz C, Almja A and Bose A. An experimental study of Internet routing convergence, http://www.acm.org/sigs/sigcomm/sigcomm2000/conf/abstract/ 5-2.htm,2001-10-9
[72]Sahoo A, Kant K, Mohapatra P. Characterization of BGP recovery under large scale failures, in:Proceedings of the ICC 2006, Istanbul, Turkey, June 11-15, 2006:949-954
[73]Pei D, Zhang B, Massey D and Zhang L. An analysis of Path-Vector Routing Protocol Convergence Algorithms, http://www.cs.colostate.edu/-massey/pubs/tr/ massey_uclatr040009.pdf,2004-9-10
[74]Lv Jun, Li Xing, Ran Congsen, et al. A New Algorithm for Network Anomaly Detection, Computing in the Global Information Technology, Aug.2006:49-54
[75]Minei I, Marques-Pedro R. Scalability considerations in BGP/MPLS IP VPNs, IEEE Communications Magazine,2007,45(4):26-31
[76]Cobb J, Musunuri R. Enforcing Convergence in Inter-Domain Routing. GLOBECOM' 04-IEEE Global Telecommunications Conference, New York:IEEE press,2004.3:1353-1358
[77]Villamizar C, Chandra R and Govindan R. BGP route flap damping, RFC2439, November 1998
[78]Colitti L, Battista D, Patrignani M, et al. Investigating prefix propagation through active BGP probing, Microprocessors and Microsystems, 2007,31(7):460-474
[79]Akashi O, Fukuda K, Hirotsu T, et al. Policy-based BGP-control architecture for inter-AS routing adjustment, Computer Communications,2008,331 (13):2996-3002
[80]Rajendran R, Rubenstein D, Wasserman M. A Theoretical Method for BGP Policy Verification, http://www.ee.columbia.edu/～kumar/papers/p2004-02.pdf 2004-10-9
[81]Meyer, J. Schmitz, C.Orange, et al. Using RPSL in Practice, RFC2650, August 1999
[82]Zang Z, Luo G, Yin C. Verification of Interdomain Routing System Based on Formal Methods, Tsinghua Science & Technology,2009,14(1):83-89
[83]Andrej V, Roman N. Policy relationship annotations of predefined AS-level topologies, Computer Networks,2008,52(15):2859-2871
[84]Mao Z, Govindan R, Varghese G. Route Flap Damping Exacerbates Internet Routing Convergence, ACM SIGCOMM 2002 Conference, New York, USA:ACM press,2002:221-233
[85]Cobb J, Gouda M and Musunuri R. A stabilizing solution to the stable Path Problem,6th International Symposium on Self-Stabilizing Systems(SSS 2003), Berlin, Germany:Springer-Verlag,2003:169-183
[86]Sahoo A, Kant K, Mohapatra P. Improving BGP convergence delay for large scale failures, in:Proceedings of DSN 2006, Philadelphia, Pennsylvania, June 25-28, 2006:323-332
[87]Dan Pei, B. Zhang. An analysis of convergence delay in path vector routing protocols, Computer Networks 2006,30(3):398-421
[88]Sun W, Mao Z, Shin K G. Differentiated BGP update processing for improved routing convergence, in:Proceedings of the ICNP 2006, Santa Barbara, California, November 12-15,2006:280-289
[89]Lijun W, JiangPing W, Ke X, Modified flap damping mechanism to improve inter-domain routing convergence, Computer Communications 2007.30(7): 1588-1599
[90]Duan Z, Chandrashekar J and Krasky J, et al. Damping BGP route flaps,23rd IEEE International Performance, Computiing, and Communications Conference, Piscataway, NJ, USA:IEEE press,2004.23:131-138
[91]Musunuri R and Cobb J. Enforcing IBGP convergence,12th IEEE International Conference on Newtorking, Piscataway, NJ:IEEE press,2004:511-517
[92]Luo J, Xie J, Hao R et al. An approach to accelerate convergence for Path vector protocol, GLOBECOM'02-IEEE Global Telecommunications Conference, New York:IEEE press,2002:2390-2394
[93]Bonaventure O, Filsfils C, Francois P. Achieving sub-50 milliseconds recovery upon BGP peering link failures, IEEE/ACM Transactions on Networking, 2007,15(5):1123-1135
[94]Bressoud T C, Rastogi R and Smith M A. Optimal Configuration for BGP Route Selection,22nd Annual Joint Conference on the IEEE Computer and Communications Societies, Piscataway, NJ, USA:IEEE press,2003.916-926
[95]Pei D, Zhao X, Wang L, et al. Improving BGP Convergence Through Consistency Assertions, IEEE INFOCOM, New York:IEEE perss,2002:902-911
[96]Barr A, Aefk Y, Schwarz S. Improved BGP convergence via ghost flushing.22nd Annual Joint Conference on the IEEE Computer and Communications Societies, New York:IEEE press,2003:927-937
[97]Bhargavan K, Obradovic D and Gunter C. Formal verification of distance-vector routing protocols, Journal of the ACM,2002.49(4):538-576
[98]Griffin T G and Premore B. An experimental analysis of BGP convergence time, 2001 International Conference on Network Protocols, Los Alamitos, CA, USA:IEEE Computer Society press,2001:53-61
[99]Labovitz C, wattenhofer R and Venkatachary S. The impact of Internet Policy and topology on delayed routing convergence,20th Annual Joint Conference on the IEEE Computer and Communications Societies (IEEE INFOCOM 2001), New York, USA:IEEE press,2001:537-546
[100]Jeong S, Youn C, Choi T. Policy Management for BGP Routing Convergence Using Inter-AS Relationship. Journal of Communications and Networks, 2007.3(4):342-350
[101]N. Laskovic and Lj. Trajkovic, BGP with an adaptive minimal route advertisement interval, in Proceedings of the IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, United states,2006:135-142
[102]S. Halabi and D. McPherson, Internet Routing Architectures. Indianapolis, IN:Cisco Press,2000
[103]Dolev D, Jamin S, Mokryn O, et al. Internet resiliency to attacks and failures under BGP policy routing, Computer Networks,2006,50(16):3183-3196
[104]Zhao X, Massey D, Pei D et al. A Study on the Routing Convergence of Latin American Networks, IFIP/ACM Latin America Networking Conference, New York, USA:ACM perss,2003:35-43
[105]Nykvist J, Motyckova L. Simulating Convergence Properties of BGP,11th International Conference on Computer Communications and Networks, New York, USA:IEEE press,2002:124-129
[106]Pei D, Azuma M, Nguyen N, et al. Improving BGP Convergence Through Root Cause, Computer Network,2005.48(2):175-194
[107]Bless R, Lichtwald G, Schmidt M. Fast scope rerouting for BGP,11th IEEE International conference on Networks, New York:IEEE press,2003:25-30
[108]王立军,吴建平,徐恪.解决策略冲突导致BGP路由发散的自适应机制.软件学报,2008,19(6)：1465-1472
[109]Chen E and Stewart J. A frame work for inter-domain route aggregation, RFC2519, Feberary,1999
[110]W. Shen, Lj. Trajkovic. BGP route flap damping algorithms, in Proc. SPECTS'05, Philadelphia, PA, July 2005:488-495
[111]T. D. Feng, R. Ballantyne, and Lj. TrajkoviC, Implementation of BGP in a network simulator, in Proc. ATS'04, Arlington, VA, April 2004:149-154
[112]Bremler-Barr A, Chen N, Kangasharju J, et al. Bringing order to BGP: Decreasing time and message complexity, Computer Networks,2009,53(12): 2241-2256
[113]Xiao L, He G, Nahrstedt K. BGP session lifetime modeling in congested networks, Computer Networks,2006,50(17):3315-3333
[114]Sriram K, Montgomery D, Borchert O, et al. Study of BGP peering session attacks and their impacts on routing performance, IEEE Journal on Selected Areas in Communications,2006,24(10):1901-1915
[115]Francois P, Bonaventure O, Decraene B, et al. Avoiding disruptions during maintenance operations on BGP sessions, IEEE Transactions on Network and Service Management,2007,4(3):1-11
[116]Siganos G, Faloutsos M. Analyzing BGP Policies:Methodology and Tool, IEEE INFOCOM 2004-Conference on Computer Communications. Piscataway, NJ, USA:IEEE press,2004:1640-1651
117] Zhao X, Pei D, Wang L, et al. Detection of invalid routing announcement in the Internet, the 2002 International Conference on Dependable Systems and Networks, Piscataway, NJ, USA:IEEE Computer Society press,2002:59-68
[118]Kumari W. Route table prefix monitoring, NANOG mail archives, http://www.merit.edu/mail.archives/nanog/msg20765.html,2009-6-11
[119]Pei D, Aiello W, Gilbert A, et al. Origin Disturbances in BGP, http://www.patrickmcdaniel.org/pubs/td-62tjf8.pdf,2005-8-20
[120]Chang D, Govindan R, Heidemann J. An Empirical Study of Router Response to Large BGP Routing Table Load, the 2nd Internet Measurement Workshop (IMW2002), New York:ACM press,2002:203-208
[121]Huston G. Analyzing the Internet's BGP Routing Table, The Internet Protocol Journal,2001.4(1):1-10
[122]Meng X, Xu Z, Zhang B, et al. IPv4 Address Allocation and the BGP Routing Table Evolution, ACM SIGCOMM Computer Communication Review, 2005.35(1):71-80
[123]Bu T, Gao L, Towsley D. On characterizing BGP routing table growth, GLOBECOM?05-IEEE Global Telecommunications Conference, New York, USA: IEEE perss,2005:2185-2189
[124]Xu Z, Meng X, Zhang L, et al. Impact of IPv4 address allocation practice on BGP routing table growth, IEEE 18th Annual Workshop on Computer Communications, New York, USA:IEEE perss,2003:172-178
[125]Narayan H, Govindan R, Varghese G. The Impact of Address Allocation and Routing on the Structure and Implementation of Routing Tables, Computer Communication Review,2003.33(4):125-136
[126]Kruegel C, Mutz D, Robertson W, et al. Topology-based Detection of Anomalous BGP Messages, Sixth International Symposium on Recent Advances in Intrusion Detection, Berlin, Germany:Springer-Verlag,2003:17-35
[127]Aiello W, Loannidis J, McDaniel P. Origin authentication in interdomain routing, Proceedings of the ACM Conference on Computer and Communications Security, New York:ACM press,2003:165-178
[128]Sahoo A, Kant K, Mohapatra P, BGP convergence delay after multiple simultaneous router failures:Characterization and solutions, Computer Communications,2009(32),7-10:1207-1218
[129]Staplcton-Gray R. BGP routing integrity checker and prefix-list filter generation tool, in Proceedings-Cyber security Applications and Technology Conference for Homeland Security, Piscataway, NJ, United States,2009:224-226
[130]Aranda G, Pedro A. Detection of trial and error traffic engineering with BGP-4, In Proceedings of the 5th International Conference on Networking and Services, 2009:131-136
[131]Sriram K,Borchert O, Kim O. A Comparative analysis of BGP anomaly detection and robustness algorithms, In Proceedings-Cybersecurity Applications and Technology Conference for Homeland Security,2009:25-38
[132]Feamster N, Balakrishnan H. Towards a Logic for Wide-Area Internet Routing, ACM SIGCOMM Workshop, New York:ACM press,2003:289-300
[133]Feamster N, Balakrishnan H. Verifying the Correctness of Wide-Area Internet Routing, http://citeseer.ist.psu.edu/feamster04verifying.html,2005-7-19
[134]Villamizar C, Alaettinoglu C, MeyerD, et al. Routing Policy system security, RFC2725, December 1999
[135]Goodell G, Aiello W, Griffin T G. Working around BGP:An incremental approach to improving security and accuracy of interdomain routing, ISOC NDSS'03, 2003:75-85
[136]Ng J. Extensions to BGP to support secure origin BGP (soBGP), http://smakd.potaroo.net/ietf/idref/draft-ng-sobgp-bgp-extensions/index.html, 2005-3-21
[137]Seo K, Lynn C, and Kent S. Public-key infrastructure for the secure border gateway protocol (S-BGP),2nd DARPA Information Survivability Conference and Exposition, Los Alamitos, CA, USA:IEEE Computer Society press,2001: 239-253
[138]王瑞军,王洪君,张春宏,等.区分自治系统关系的域间路由体系研究.计算机研究与发展,2004,41(5)：835-842
[139]Kent S. Securing the Border Gateway Protocol:A status update,7th International Conference on Communications and Multimedia Security, Berlin, Germany: Springer-Verlag,2003:40-53
[140]Deshpande S, Thottan M, Sikdar B. An online scheme for the isolation of BGP misconfiguration errors, IEEE Transactions on Network and Service Management,2008,5(2):78-90
[141]Subramanian L, Agarwal S and Rexford J. Characterizing the Internet hierarchy from multiple vantage points, IEEE INFOCOM 2002, Piscataway, NJ, USA:IEEE press,2002.2:618-627
[142]P.Barford, A. Bestavros and J.Byers et al. On the marginal utility of network topology measurements, In:Proc. of the First ACM SIGCOMM Workshop on Internet Measurement Workshop 2001.New York, NY:ACM press,2002:5-17
[143]Chan Hw, Dash D, Perrig A, et al. Modeling adoptability of secure BGP protocols, Computer Communication Review,2006,36(4):279-290
[144]Donnet B., Bonaventure O. On BGP communities, ACM SIGCOMM Computer Communication Review,2008,38(2):55-59
[145]Donnet B, Bonaventure O. Improved algorithms for network topology discovery, LNCS,2005,3431:149-162
[146]Raghavan V, Riley G, Jaafar T. Realistic topology modeling for the Internet BGP infrastructure,2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS,2008.9:1-8
[147]Carl G, Kesidis G. Large-scale testing of the Internet's Border Gateway Protocol (BGP) via topological scale-down, ACM Transactions on Modeling and Computer Simulation,2008,18(3),11:1-30
[148]Leguay J, Latapy M, Friedman T, et al. Describing and simulating internet routes, Computer Networks,2007,51(8):2067-2085
[149]Dimitropoulos-Xenofontas A, Riley-George F. Efficient large-scale BGP simulations, Computer Networks,2006,50(12):2013-2027
[150]Sagy B, Mira G, Avishai W. A geographic directed preferential internet topology model, Computer Networks,2007,51(14):4174-4188
[151]Li T, Zhu Y, Xu K, et al. Performance model and evaluation on geographic-based routing, Computer Communications,2009,32(2):343-348
[152]Wang J, Chiu D, Lui J. A game-theoretic analysis of the implications of overlay network traffic on ISP peering, Computer Networks,2008,52(15):2961-2974
[153]Felix J G C, Gregorio M P, Antonio F G S. Multi-layer framework for analysing and managing routing configurations, Computers & Electrical Engineering, 2009(35)5:634-643
[154]Joan F, David R K, Vahab S M, et al. Subjective-cost policy routing, Theoretical Computer Science,2007,378(2):175-189
[155]Wai Cheung, Heung Wong, Riquan Zhang. Generalized likelihood ratio test for varying-coefficient models with different smoothing variables, Computational Statistics & Data Analysis,2007,51(9):4543-4561
[156]Erik Hartikainen, Svante Ekelin, PJohan M. Change detection and estimation for network-measurement applications, In Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks, Chania, Crete Island, Greece, Oct.2007:1-10
[157]XU K. HE H. BGP parallel computing model based on the iteration tree, Journal of China Universities of Posts and Telecommunications,2008,15(SUPPL.):1-8
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |