Identifying BGP routing table transfers

被引:10
|
作者
Cheng, Pei-chun [1 ]
Zhang, Beichuan [2 ]
Massey, Daniel [3 ]
Zhang, Lixia [1 ]
机构
[1] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
[2] Univ Arizona, Dept Comp Sci, Tucson, AZ 85721 USA
[3] Colorardo State Univ, Dept Comp Sci, Ft Collins, CO 80523 USA
基金
美国国家科学基金会;
关键词
BGP; Session reset; Routing table transfer;
D O I
10.1016/j.comnet.2010.09.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
BGP routing updates collected by monitoring projects such as RouteViews and RIPE have been a vital source to our understanding of the global routing system. However the collected BGP data contains both the updates generated by actual route changes, and the updates of BGP routing table transfers resulted from BGP session resets between operational routers and the data collection stations. Since the latter is caused by measurement artifact, it is important to accurately separate out the latter from the former. In this paper, we present the design and evaluation of the minimum collection time (MCT) algorithm. Given a BGP update stream, MCT can identify the start and duration of each routing table transfer in the stream with high accuracy. We evaluated MCT performance by using three months of BGP data from all RIPE collectors. Our results show that out of the total 1664 BGP resets with 166 monitors, MCT can identify BGP routing table transfers with over 95% accuracy, and pinpoint the exact starting time of the detected table transfers in 83% of such cases. Accurate detection of BGP table transfers enables users to separate out real BGP routing changes and measurement artifacts, and can be used to measure and diagnose the BGP session failures. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:636 / 649
页数:14
相关论文
共 50 条
  • [41] The vehicle routing problem with transfers
    Aguayo, Maichel M.
    Aviles, Francisco N.
    Sarin, Subhash C.
    Archetti, Claudia
    COMPUTERS & OPERATIONS RESEARCH, 2025, 177
  • [42] On routing table growth
    Bu, T
    Gao, LX
    Towsley, D
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2002, 32 (01) : 77 - 77
  • [43] Virtual Multi-Homing: On the feasibility of combining overlay routing with BGP routing
    Li, Z
    Mohapatra, P
    Chuah, CN
    NETWORKING 2005: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS SYSTEMS, 2005, 3462 : 1348 - 1352
  • [44] BGP-ELF: Enhancing BGP To Eliminate Routing Loops and Oscillations without Path Vectors
    Garica-Luna-Aceves, J. J.
    2022 IEEE FUTURE NETWORKS WORLD FORUM, FNWF, 2022, : 197 - 202
  • [45] BGP routing design and optimization of large scale network
    Lang, Liu
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON AUTOMATION, MECHANICAL CONTROL AND COMPUTATIONAL ENGINEERING, 2015, 124 : 1014 - 1018
  • [46] Reasoning on BGP routing filters using tree automata
    Battaglia, Caroline
    Bruyere, Veronique
    Gauwin, Olivier
    Pelsser, Cristel
    Quoitin, Bruno
    COMPUTER NETWORKS, 2014, 65 : 232 - 254
  • [47] Modeling the routing of an autonomous system with C-BGP
    Quoitin, B
    Uhlig, S
    IEEE NETWORK, 2005, 19 (06): : 12 - 19
  • [48] The Solution of BGP Routing Conflicts Based on Priority Pool
    Chen Chunkai
    Wang Lu
    2012 WORLD AUTOMATION CONGRESS (WAC), 2012,
  • [49] SPV: Secure Path Vector routing for securing BGP
    Hu, YC
    Perrig, A
    Sirbu, M
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) : 179 - 192
  • [50] Time window mechanism to improve bgp routing convergence
    Wang, Li-Jun
    Wu, Jian-Ping
    Ruan Jian Xue Bao/Journal of Software, 2008, 19 (11): : 2979 - 2989