skip to main content
research-article

Inferring Catchment in Internet Routing

Published:19 June 2019Publication History
Skip Abstract Section

Abstract

BGP is the de-facto Internet routing protocol for exchanging prefix reachability information between Autonomous Systems (AS). It is a dynamic, distributed, path-vector protocol that enables rich expressions of network policies (typically treated as secrets). In this regime, where complexity is interwoven with information hiding, answering questions such as "what is the expected catchment of the anycast sites of a content provider on the AS-level, if new sites are deployed?", or "how will load-balancing behave if an ISP changes its routing policy for a prefix?", is a hard challenge. In this work, we present a formal model and methodology that takes into account policy-based routing and topological properties of the Internet graph, to predict the routing behavior of networks. We design algorithms that provide new capabilities for informative route inference (e.g., isolating the effect of randomness that is present in prior simulation-based approaches). We analyze the properties of these inference algorithms, and evaluate them using publicly available routing datasets and real-world experiments. The proposed framework can be useful in a number of applications: measurements, traffic engineering, network planning, Internet routing models, etc. As a use case, we study the problem of selecting a set of measurement vantage points to maximize route inference. Our methodology is general and can capture standard valley-free routing, as well as more complex topological and routing setups appearing in practice.

References

  1. Ruwaifa Anwar, Haseeb Niaz, David Choffnes, et al. 2015. Investigating interdomain routing policies in the wild. In Proc. ACM IMC . Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Guillermo Baltra, Robert Beverly, and Geoffrey G Xie. 2014. Ingress point spreading: A new primitive for adaptive active network mapping. In Proc. PAM . Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Andrew An Bian, Joachim M Buhmann, Andreas Krause, and Sebastian Tschiatschek. 2017. Guarantees for Greedy Maximization of Non-submodular Functions with Applications. In International Conference on Machine Learning (ICML) . Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Matthew Caesar and Jennifer Rexford. 2005. BGP routing policies in ISP networks. IEEE network, Vol. 19, 6 (2005), 5--11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. CAIDA. 2018. AS-Relationships Dataset. http://data.caida.org/datasets/as-relationships/. Dataset collected on 1st July 2018.Google ScholarGoogle Scholar
  6. CAIDA. 2018. Periscope Looking Glass API. http://www.caida.org/tools/utilities/looking-glass-api/.Google ScholarGoogle Scholar
  7. CAIDA. 2018. Routeviews Prefix-to-AS mappings (pfx2as) for IPv4 and IPv6. http://data.caida.org/datasets/routing/routeviews-prefix2as/.Google ScholarGoogle Scholar
  8. Ignacio Castro, Juan Camilo Cardona, Sergey Gorinsky, and Pierre Francois. 2014. Remote peering: More peering without internet flattening. In Proc. ACM CoNEXT. 185--198.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Danilo Cicalese, Diana Joumblatt, Dario Rossi, Marc-Olivier Buob, Jordan Augé, and Timur Friedman. 2015. A fistful of pings: Accurate and lightweight anycast enumeration and geolocation. In Proc. IEEE INFOCOM .Google ScholarGoogle ScholarCross RefCross Ref
  10. Cisco. 2019. BGP Best Path Selection Algorithm. https://www.cisco.com/c/en/us/support/docs/ip/border-gateway-protocol-bgp/13753--25.html .Google ScholarGoogle Scholar
  11. Gregory F Cooper. 1990. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial intelligence, Vol. 42, 2--3 (1990), 393--405. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ítalo Cunha, Pietro Marchetta, Matt Calder, et al. 2016. Sibyl: a practical Internet route oracle. In Proc. USENIX NSDI . Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Wouter B De Vries, Ricardo de O Schmidt, Wes Hardaker, et al. 2017. Broad and load-aware anycast mapping with verfploeter. In Proc. ACM IMC . Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Wouter B de Vries, Ricardo de O Schmidt, and Aiko Pras. 2016. Anycast and its potential for DDoS mitigation. In IFIP International Conference on Autonomous Infrastructure, Management and Security. Springer, 147--151.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Nick Feamster, Jared Winick, and Jennifer Rexford. 2004. A model of BGP routing for network engineering. In ACM SIGMETRICS PER, Vol. 32. 331--342. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Romain Fontugne, Anant Shah, and Emile Aben. 2018. The (thin) bridges of as connectivity: Measuring dependency using AS hegemony. In International Conference on Passive and Active Network Measurement .Google ScholarGoogle ScholarCross RefCross Ref
  17. Lixin Gao and Jennifer Rexford. 2001. Stable Internet routing without global coordination. IEEE/ACM TON, Vol. 9, 6 (2001), 681--692. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Timon Gehr, Sasa Misailovic, Petar Tsankov, Laurent Vanbever, Pascal Wiesmann, and Martin Vechev. 2018. Bayonet: probabilistic inference for networks. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation. 586--602. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Phillipa Gill, Michael Schapira, and Sharon Goldberg. 2011. Let the market drive deployment: A strategy for transitioning to BGP security. In ACM SIGCOMM CCR, Vol. 41. 14--25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Vasileios Giotsas, Matthew Luckie, Bradley Huffaker, et al. 2014. Inferring complex AS relationships. In Proc. ACM IMC .Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Enrico Gregori, Alessandro Improta, Luciano Lenzini, Lorenzo Rossi, and Luca Sani. 2012. On the incompleteness of the AS-level graph: a novel methodology for BGP route collector placement. In Proc. ACM IMC . Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Gonca Gürsun and Mark Crovella. 2012. On traffic matrix completion in the internet. In Proc. ACM IMC . Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Rowan Kloti, Vasileios Kotronis, Bernhard Ager, et al. 2015. Policy-compliant path diversity and bisection bandwidth. In Proc. IEEE INFOCOM .Google ScholarGoogle ScholarCross RefCross Ref
  24. Kevin B. Korb and Ann E. Nicholson. 2010. Bayesian Artificial Intelligence 2nd ed.). CRC Press, Inc. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Andreas Krause and Daniel Golovin. 2012. Submodular function maximization. Tractability: Practical Approaches to Hard Problems, Vol. 3, 19 (2012), 8.Google ScholarGoogle Scholar
  26. P Lapukhov, A Premji, and J Mitchell. 2016. Use of BGP for routing in large-scale data centers. RFC 7938.Google ScholarGoogle Scholar
  27. DK Lee, Keon Jang, Changhyun Lee, Gianluca Iannaccone, and Sue Moon. 2011. Scalable and systematic Internet-wide path and delay estimation from existing measurements. Computer Networks, Vol. 55, 3 (2011), 838--855. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Zhihao Li, Dave Levin, Neil Spring, and Bobby Bhattacharjee. 2018. Internet Anycast: Performance, Problems, and Potential. In Proc. ACM SIGCOMM . Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Kurt Lindqvist and Joe Abley. 2006. Operation of Anycast Services. RFC 4786.Google ScholarGoogle Scholar
  30. Aemen Lodhi, Nikolaos Laoutaris, Amogh Dhamdhere, and Constantine Dovrolis. 2015. Complexities in Internet peering: Understanding the "black" in the "black art". In Proc. IEEE INFOCOM .Google ScholarGoogle Scholar
  31. Matthew Luckie, Bradley Huffaker, Amogh Dhamdhere, et al. 2013. AS relationships, customer cones, and validation. In Proc. ACM IMC . Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Z Morley Mao, Lili Qiu, Jia Wang, and Yin Zhang. 2005. On AS-level path inference. In ACM SIGMETRICS PER, Vol. 33. 339--349. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Giovane C.M. Moura, Ricardo de O. Schmidt, John Heidemann, Wouter B. de Vries, Moritz Muller, Lan Wei, and Cristian Hesselman. 2016. Anycast vs. DDoS: Evaluating the November 2015 Root DNS Event. In Proc. ACM IMC . Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Wolfgang Mühlbauer, Anja Feldmann, Olaf Maennel, Matthew Roughan, and Steve Uhlig. 2006. Building an AS-topology model that captures route diversity. ACM SIGCOMM CCR, Vol. 36, 4 (2006), 195--206. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. NANOG mailing list archives. 2018. How to choose a transit provider? http://seclists.org/nanog/2018/Dec/281 .Google ScholarGoogle Scholar
  36. George Nomikos, Vasileios Kotronis, Pavlos Sermpezis, Petros Gigis, Lefteris Manassakis, Christoph Dietzel, Stavros Konstantaras, Xenofontas Dimitropoulos, and Vasileios Giotsas. 2018. O Peer, Where Art Thou?: Uncovering Remote Peering Interconnections at IXPs. In Proc. ACM IMC. 265--278. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Chiara Orsini, Alistair King, Danilo Giordano, Vasileios Giotsas, and Alberto Dainotti. 2016. BGPStream: a software framework for live and historical BGP data analysis. In Proc. ACM IMC. https://bgpstream.caida.org/. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Judea Pearl. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference 1 ed.). Morgan Kaufmann. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. PEERING. 2019. The PEERING testbed. https://peering.usc.edu/.Google ScholarGoogle Scholar
  40. Bruno Quoitin and Steve Uhlig. 2005. Modeling the routing of an autonomous system with C-BGP. IEEE network, Vol. 19, 6 (2005), 12--19. http://c-bgp.sourceforge.net//index.php. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Yakov Rekhter, Tony Li, and Susan Hares. 2006. A Border Gateway Protocol 4 (BGP-4). RFC 4271. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. RIPE NCC. 2018. RIPE Atlas. https://atlas.ripe.net/.Google ScholarGoogle Scholar
  43. RIPE NCC. 2018. Routing Information Service (RIS). https://www.ripe.net/analyse/internet-measurements/routing-information-service-ris .Google ScholarGoogle Scholar
  44. Brandon Schlinker, Kyriakos Zarifis, Italo Cunha, Nick Feamster, and Ethan Katz-Bassett. 2014. PEERING: An AS for Us. In Proceedings of the 13th ACM Workshop on Hot Topics in Networks (HotNets) . Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Pavlos Sermpezis and Xenofontas Dimitropoulos. 2017. Can SDN accelerate BGP convergence? A performance analysis of inter-domain routing centralization. In 2017 IFIP Networking Conference (IFIP Networking) and Workshops. IEEE, 1--9.Google ScholarGoogle ScholarCross RefCross Ref
  46. Pavlos Sermpezis and Vasileios Kotronis. 2019. GitHub repository with the Catchment Inference in Internet Routing code and algorithm implementation. https://github.com/FORTH-ICS-INSPIRE/anycast_catchment_prediction .Google ScholarGoogle Scholar
  47. Pavlos Sermpezis, Vasileios Kotronis, Petros Gigis, Xenofontas Dimitropoulos, Danilo Cicalese, Alistair King, and Alberto Dainotti. 2018. ARTEMIS: Neutralizing BGP hijacking within a minute. IEEE/ACM Transactions on Networking (TON), Vol. 26, 6 (2018), 2471--2486.Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. University of Oregon. 2018. Route Views Project. www.routeviews.org .Google ScholarGoogle Scholar
  49. Verizon. 2017. Seeing the World with RIPE Atlas. https://labs.ripe.net/Members/verizon_digital/seeing-the-world-with-ripe-atlas.Google ScholarGoogle Scholar
  50. Lan Wei and John Heidemann. 2018. Does anycast hang up on you? IEEE Transactions on Network and Service Management (2018).Google ScholarGoogle Scholar
  51. Haipeng Yao, Tianle Mai, Xiaobin Xu, Peiying Zhang, Maozhen Li, and Yunjie Liu. 2018. NetworkAI: An intelligent network architecture for self-learning control strategies in software defined networks. IEEE Internet of Things Journal, Vol. 5, 6 (2018), 4319--4327.Google ScholarGoogle ScholarCross RefCross Ref
  52. Changhe Yu, Julong Lan, Zehua Guo, and Yuxiang Hu. 2018. DROM: Optimizing the Routing in Software-Defined Networks With Deep Reinforcement Learning. IEEE Access, Vol. 6 (2018), 64533--64539.Google ScholarGoogle Scholar

Index Terms

  1. Inferring Catchment in Internet Routing

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!