Automatic Inference of BGP Community Semantics
Resumo
The Border Gateway Protocol (BGP) enables communication between Autonomous Systems (ASes) on the Internet. BGP offers significant flexibility for traffic engineering through BGP communities, which are operator-defined tags that convey information or requests in route announcements. Unfortunately, the absence of standardized semantics or centralized repositories for BGP communities complicates and limits their use, hindering the effective management of interdomain routing. This thesis develops techniques to infer BGP community semantics using public BGP data from routing collectors, overcoming the lack of documentation and providing datasets that can be automatically updated. We first propose a set of techniques to infer location communities, which are communities related to entities or locations traversed by a route. We apply our techniques to billions of routing records from public BGP collectors and show that they produce high precision (ranging from 86% to 93%) and recall (ranging from 72% to 81%). We also design and evaluate algorithms to automatically uncover BGP action communities and ASes that violate standard practices, revealing undocumented relationships between them (e.g., sibling relationships). Our experimental evaluation uncovers previously unknown AS relationships and shows that our algorithm to identify action communities achieves average precision and recall of 92.5% and 86.5%, respectively.
Referências
CAIDA (2021). CAIDA’s Geolocation Dataset. [link].
Chen, Z. et al. (2023). Improving the Inference of Sibling Autonomous Systems. In Proc. of the PAM Conference, pages 345–372.
da Silva Jr, B. A. (2024). Automatic Inference of BGP Community Semantics. PhD thesis, Federal University of Mato Grosso do Sul.
da Silva Jr, B. A. et al. (2022). Automatic Inference of BGP Location Communities. In Proc. of ACM SIGMETRICS / IFIP Performance.
da Silva Jr, B. A. et al. (2025). Uncovering BGP Action Communities and Community Squatters in the Wild. In Proc. of ACM SIGMETRICS.
Durand, J., Pepelnjak, I., and Döring, G. (2015). BGP7454: BGP Operations and Security. Technical report, RFC 7454, February.
Feldmann, A. et al. (2004). Locating Internet Routing Instabilities. In Proc. of ACM SIGCOMM, page 205–218.
Gao, L. (2001). On Inferring Autonomous System Relationships in the Internet. IEEE/ACM Transactions on Networking, 9(6):733–745.
Gao, L. and Rexford, J. (2001). Stable Internet Routing Without Global Coordination. IEEE/ACM Transactions on Networking, 9(6):12.
Garey, M. and Johson, D. (1979). Computers and Intractability – A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.
Giotsas, V. et al. (2014). Inferring Complex AS Relationships. In Proc. of ACM IMC, page 23–30.
Giotsas, V. et al. (2017). Detecting Peering Infrastructure Outages in the Wild. In Proc. of ACM SIGCOMM, pages 446–459.
Krenc, T. et al. (2023). Coarse-grained Inference of BGP Community Intent. In Proc. of ACM IMC, pages 66–72.
Meyer, D. (1997). University of Oregon Route Views Archive Project. [link].
Rekhter, Y. (2006). RFC 4271: A Border Gateway Protocol 4 (BGP-4).
RIPE (2024). RIS Project. [link].
Salamatian, L. et al. (2023). Who Squats IPv4 Addresses? ACM SIGCOMM CCR, 53(1):48–72.
Streibelt, F. et al. (2018). BGP Communities: Even More Worms in the Routing Can. In Proc. of ACM IMC, page 279–292.
Tools, I. (2024). WHOIS Servers List. [link].
