Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3419394.3423627acmconferencesArticle/Chapter ViewAbstractPublication PagesimcConference Proceedingsconference-collections
research-article

TopoScope: Recover AS Relationships From Fragmentary Observations

Published: 27 October 2020 Publication History

Abstract

Knowledge of the Internet topology and the business relationships between Autonomous Systems (ASes) is the basis for studying many aspects of the Internet. Despite the significant progress achieved by latest inference algorithms, their inference results still suffer from errors on some critical links due to limited data, thus hindering many applications that rely on the inferred relationships. We take an in-depth analysis on the challenges inherent in the data, especially the limited coverage and biased concentration of the vantage points (VPs). Some aspects of them have been largely overlooked but will become more exacerbated when the Internet further grows. Then we develop TopoScope, a framework for accurately recovering AS relationships from such fragmentary observations. TopoScope uses ensemble learning and Bayesian Network to mitigate the observation bias originating not only from a single VP, but also from the uneven distribution of available VPs. It also discovers the intrinsic similarities between groups of adjacent links, and infers the relationships on hidden links that are not directly observable. Compared to state-of-the-art inference algorithms, TopoScope reduces the inference error by up to 2.7-4 times, discovers the relationships for around 30,000 upper layer hidden AS links, and is still more accurate and stable under more incomplete or biased observations.

Supplementary Material

MP4 File (imc2020-87-long.mp4)
TopoScope is an AS relationship inference framework that combines empirical rules and probability models and makes them complement each other. Besides, TopoScope also supports hidden link inference and allows flexible extensions. TopoScope performs more stable and accurate in almost all datasets, and the better inference capability also helps it to achieve a better performance in practical applications like route leak detection and BGP path inference.
MP4 File (imc2020-87-short.mp4)
TopoScope is an AS relationship inference framework that combines empirical rules and probability models and makes them complement each other. Besides, TopoScope also supports hidden link inference and allows flexible extensions. TopoScope performs more stable and accurate in almost all datasets, and the better inference capability also helps it to achieve a better performance in practical applications like route leak detection and BGP path inference.

References

[1]
Ankur Ankan and Abinash Panda. 2015. pgmpy: Probabilistic graphical models using python. In SCIPY 2015. Citeseer.
[2]
Maria Apostolaki, Gian Marti, Jan Müller, and Laurent Vanbever. 2019. SABRE: Protecting bitcoin against routing attacks. In NDSS.
[3]
Maria Apostolaki, Aviv Zohar, and Laurent Vanbever. 2017. Hijacking bitcoin: Routing attacks on cryptocurrencies. In 2017 IEEE Symposium on Security and Privacy (SP). IEEE, 375--392.
[4]
Steven Michael Bellovin and Emden R Gansner. 2003. Using link cuts to attack Internet routing. (2003).
[5]
Henry Birge-Lee, Liang Wang, Jennifer Rexford, and Prateek Mittal. 2019. SICO: Surgical Interception Attacks by Manipulating BGP Communities. In CCS '19.431--448.
[6]
CAIDA. [n. d.]. Inferred AS to organization mapping dataset. ([n. d.]). http://www.caida.org/data/as-organizations/.
[7]
Hyunseok Chang, Ramesh Govindan, Sugih Jamin, Scott J Shenker, and Walter Willinger. 2004. Towards capturing representative AS-level Internet topologies. Computer Networks 44, 6 (2004), 737--755.
[8]
Kai Chen, Chengchen Hu, Wenwen Zhang, Yan Chen, and Bin Liu. 2009. On the eyeshots of BGP vantage points. In GLOBECOM 2009-2009 IEEE Global Telecommunications Conference. IEEE, 1--6.
[9]
Tianqi Chen and Carlos Guestrin. 2016. Xgboost: A scalable tree boosting system. In Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining.785--794.
[10]
Avichai Cohen, Yossi Gilad, Amir Herzberg, and Michael Schapira. 2016. Jump-starting BGP security with path-end validation. In Proceedings of the 2016 ACM SIGCOMM Conference.342--355.
[11]
Amogh Dhamdhere, David D Clark, Alexander Gamero-Garrido, Matthew Luckie, Ricky KP Mok, Gautam Akiwate, Kabir Gogia, Vaibhav Bajpai, Alex C Snoeren, and Kc Claffy. 2018. Inferring persistent interdomain congestion. In SIGCOMM'18. ACM, 1--15.
[12]
Giuseppe Di Battista, Maurizio Patrignani, and Maurizio Pizzonia. 2003. Computing the types of the relationships between autonomous systems. In IEEE INFOCOM 2003, Vol. 1. IEEE, 156--165.
[13]
Xenofontas Dimitropoulos, Dmitri Krioukov, Marina Fomenkov, Bradley Huffaker, Young Hyun, KC Claffy, and George Riley. 2007. AS relationships: Inference and validation. ACM SIGCOMM Computer Communication Review 37, 1 (2007), 29--40.
[14]
John C Doyle, David L Alderson, Lun Li, Steven Low, Matthew Roughan, Stanislav Shalunov, Reiko Tanaka, and Walter Willinger. 2005. The "robust yet fragile" nature of the Internet. Proceedings of the National Academy of Sciences 102, 41 (2005), 14497--14502.
[15]
Peyman Faratin, David D Clark, Steven Bauer, and William Lehr. 2007. Complexity of Internet interconnections: Technology, incentives and implications for policy. (2007).
[16]
Guoyao Feng, Srinivasan Seshan, and Peter Steenkiste. 2019. UNARI: an uncertainty-aware approach to AS relationships inference. In Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies.272--284.
[17]
Nir Friedman, Dan Geiger, and Moises Goldszmidt. 1997. Bayesian network classifiers. Machine learning 29, 2-3 (1997), 131--163.
[18]
Lixin Gao. 2001. On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on networking 9, 6 (2001), 733--745.
[19]
Lixin Gao and Jennifer Rexford. 2001. Stable Internet Routing without Global Coordination. IEEE/ACM Trans. Netw. 9, 6 (2001), 681--692.
[20]
Phillipa Gill, Michael Schapira, and Sharon Goldberg. 2011. Let the market drive deployment: A strategy for transitioning to BGP security. ACM SIGCOMM computer communication review 41, 4 (2011), 14--25.
[21]
Vasileios Giotsas, Matthew Luckie, Bradley Huffaker, and KC Claffy. 2014. Inferring complex AS relationships. In Proceedings of the 2014 Conference on Internet Measurement Conference.23--30.
[22]
Vasileios Giotsas, Matthew Luckie, Bradley Huffaker, and Kc Claffy. 2015. IPv6 AS relationships, cliques, and congruence. In International Conference on Passive and Active Network Measurement. Springer, 111--122.
[23]
Vasileios Giotsas and Shi Zhou. 2011. Inferring AS relationships from BGP attributes. Technical Report.
[24]
Vasileios Giotsas and Shi Zhou. 2013. Improving the discovery of IXP peering links through passive BGP measurements. In 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 121--126.
[25]
Sharon Goldberg, Michael Schapira, Peter Hummon, and Jennifer Rexford. 2010. Howsecure are secure interdomain routing protocols. ACM SIGCOMM Conference 40, 4 (2010), 87--98.
[26]
Enrico Gregori, Alessandro Improta, Luciano Lenzini, and Chiara Orsini. 2011. The impact of IXPs on the AS-level topology structure of the Internet. Computer Communications 34, 1 (2011), 68--82.
[27]
Enrico Gregori, Alessandro Improta, Luciano Lenzini, Lorenzo Rossi, and Luca Sani. 2011. BGP and inter-AS economic relationships. In International Conference on Research in Networking. Springer, 54--67.
[28]
Enrico Gregori, Alessandro Improta, Luciano Lenzini, Lorenzo Rossi, and Luca Sani. 2013. Discovering the geographic properties of the Internet AS-level topology. Networking Science 3, 1-4 (2013), 34--42.
[29]
Enrico Gregori, Alessandro Improta, Luciano Lenzini, Lorenzo Rossi, and Luca Sani. 2014. A novel methodology to address the internet as-level data incompleteness. IEEE/ACM Transactions on Networking 23, 4 (2014), 1314--1327.
[30]
Yihua He, Georgos Siganos, Michalis Faloutsos, and Srikanth Krishnamurthy. 2008. Lord of the links: a framework for discovering missing links in the internet topology. IEEE/ACM Transactions On Networking 17, 2 (2008), 391--404.
[31]
Isolario. [n. d.]. Isolario. ([n. d.]). https://www.isolario.it/.
[32]
Elisa Jasinska, Nick Hilliard, Robert Raszuk, and Niels Bakker. 2015. Internet exchange bgp route server. Technical Report. Internet-Draft draft-ietf-idr-ix-bgp-route-server-09, IETF Secretariat.
[33]
Yuchen Jin, Colin Scott, Amogh Dhamdhere, Vasileios Giotsas, Arvind Krishnamurthy, and Scott Shenker. 2019. Stable and Practical AS Relationship Inference with ProbLink. In NSDI '19.581--598.
[34]
Min Suk Kang and Virgil D. Gligor. 2014. Routing Bottlenecks in the Internet: Causes, Exploits, and Countermeasures. In CCS '14.321--333.
[35]
M. S. Kang, S. B. Lee, and V. D. Gligor. 2013. The Crossfire Attack. In 2013 IEEE Symposium on Security and Privacy.127--141.
[36]
Ethan Katz-Bassett, David R Choffnes, Ítalo Cunha, Colin Scott, Thomas Anderson, and Arvind Krishnamurthy. 2011. Machiavellian routing: improving internet availability with BGP poisoning. In Proceedings of the 10th ACM Workshop on Hot Topics in Networks.1--6.
[37]
Matthew Luckie, Bradley Huffaker, Amogh Dhamdhere, Vasileios Giotsas, et al. 2013. AS relationships, customer cones, and validation. In Proceedings of the 2013 conference on Internet measurement conference. ACM, 243--256.
[38]
Robert Lychev, Sharon Goldberg, and Michael Schapira. 2013. BGP security in partial deployment: Is the juice worth the squeeze?. In Proceedings of the ACM SIGCOMM 2013.171--182.
[39]
Ratul Mahajan, David Wetherall, and Tom Anderson. 2002. Understanding BGP misconfiguration. ACM SIGCOMM Computer Communication Review 32, 4 (2002), 3--16.
[40]
IXP Service Matrix. [n. d.]. IXP. ([n. d.]). https://www.euro-ix.net/en/tools/ixp-service-matrix/.
[41]
Todd K Moon. 1996. The expectation-maximization algorithm. IEEE Signal processing magazine 13, 6 (1996), 47--60.
[42]
Rishab Nithyanand, Oleksii Starov, Adva Zair, Phillipa Gill, and Michael Schapira. 2016. Measuring and mitigating AS-level adversaries against Tor. In NDSS.
[43]
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 Proceedings of the Internet Measurement Conference 2018.265--278.
[44]
Ricardo Oliveira, Dan Pei, Walter Willinger, Beichuan Zhang, and Lixia Zhang. 2009. The (in) completeness of the observed internet AS-level structure. IEEE/ACM Transactions on Networking 18, 1 (2009), 109--122.
[45]
PeeringDB. [n. d.]. PeeringDB. ([n. d.]). https://www.peeringdb.com/.
[46]
Robi Polikar. 2012. Ensemble learning. In Ensemble machine learning. Springer, 1--34.
[47]
RIS. [n. d.]. RIPE(RIS). ([n. d.]). https://www.ripe.net/ris/.
[48]
Max Schuchard, Abedelaziz Mohaisen, Denis Foo Kune, Nicholas Hopper, Yongdae Kim, and Eugene Y Vasserman. 2010. Losing control of the internet: using the data plane to attack the control plane. In Proceedings of the 17th ACM conference on Computer and communications security.726--728.
[49]
Xingang Shi, Yang Xiang, Zhiliang Wang, Xia Yin, and Jianping Wu. 2012. Detecting prefix hijackings in the internet with argus. In Proceedings of the 2012 Internet Measurement Conference.15--28.
[50]
Jared M Smith and Max Schuchard. 2018. Routing around congestion: Defeating DDoS attacks and adverse network conditions via reactive BGP routing. In 2018 IEEE Symposium on Security and Privacy (SP). IEEE, 599--617.
[51]
Kotikalapudi Sriram, Doug Montgomery, Brian Dickson, Keyur Patel, and Andrei Robachevsky. 2017. Methods for Detection and Mitigation of BGP Route Leaks. draft-ietf-idr-route-leak-detection-mitigation-06 (2017).
[52]
Lakshminarayanan Subramanian, Sharad Agarwal, Jennifer Rexford, and Randy H Katz. 2002. Characterizing the Internet hierarchy from multiple vantage points. In Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 2. IEEE, 618--627.
[53]
Yixin Sun, Anne Edmundson, Nick Feamster, Mung Chiang, and Prateek Mittal. 2017. Counter-raptor: Safeguarding tor against active routing attacks. In 2017 IEEE Symposium on Security and Privacy (SP). IEEE, 977--992.
[54]
Muoi Tran, Min Suk Kang, Hsu-Chun Hsiao, Wei-Hsuan Chiang, Shu-Po Tung, and Yu-Su Wang. 2019. On the Feasibility of Rerouting-based DDoS Defenses. In 2019 IEEE Symposium on Security and Privacy (SP). IEEE, 1169--1184.
[55]
Ioannis Tsamardinos, Laura E. Brown, and Constantin F. Aliferis. 2006. The max-min hill-climbing Bayesian network structure learning algorithm. Machine Learning 65, 1 (2006), 31--78.
[56]
Yuhai Tu. 2000. How robust is the Internet? Nature 406, 6794 (2000), 353--354.
[57]
Jinu Susan Varghese and Lu Ruan. 2016. A machine learning approach to edge type inference in Internet AS graphs. In 2016 IEEE INFOCOM WKSHPS. IEEE, 71--76.
[58]
Route Views. [n. d.]. University of Oregon Route Views Project. ([n. d.]). http://www.routeviews.org/routeviews/.
[59]
Kiri Wagstaff, Claire Cardie, Seth Rogers, Stefan Schrödl, et al. 2001. Constrained k-means clustering with background knowledge. In Icml, Vol. 1.577--584.
[60]
Walter Willinger and Matthew Roughan. 2013. Internet topology research redux. ACM SIGCOMM eBook: Recent Advances in Networking (2013).
[61]
Jianhong Xia and Lixin Gao. 2004. On the evaluation of AS relationship inferences [Internet reachability/traffic flow applications]. In IEEE Global Telecommunications Conference, 2004. GLOBECOM'04., Vol. 3. IEEE, 1373--1377.
[62]
Yan Yang, Xingang Shi, Xia Yin, and Zhiliang Wang. 2016. The Power of Prefix Hijackings in the Internet Hierarchy. In 2016 IEEE Trustcom. IEEE, 228--235.
[63]
Yan Yang, Xia Yin, Xingang Shi, Zhiliang Wang, Jiong He, Tom ZJ Fu, and Marianne Winslett. 2019. Inter-domain routing bottlenecks and their aggravation. Computer Networks 162 (2019), 106839.
[64]
Beichuan Zhang, Raymond Liu, Daniel Massey, and Lixia Zhang. 2005. Collecting the Internet AS-level topology. ACM SIGCOMM Computer Communication Review 35, 1 (2005), 53--61.

Cited By

View all
  • (2024)Hidden-SAGE: For the Inference of Complex Autonomous System Business Relationships Involving Hidden LinksElectronics10.3390/electronics1309161713:9(1617)Online publication date: 23-Apr-2024
  • (2023)Bias in Internet Measurement Platforms2023 7th Network Traffic Measurement and Analysis Conference (TMA)10.23919/TMA58422.2023.10198985(1-10)Online publication date: 26-Jun-2023
  • (2023)Replication: 20 Years of Inferring Interdomain Routing PoliciesProceedings of the 2023 ACM on Internet Measurement Conference10.1145/3618257.3624799(16-29)Online publication date: 24-Oct-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
IMC '20: Proceedings of the ACM Internet Measurement Conference
October 2020
751 pages
ISBN:9781450381383
DOI:10.1145/3419394
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 October 2020

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

IMC '20
IMC '20: ACM Internet Measurement Conference
October 27 - 29, 2020
Virtual Event, USA

Acceptance Rates

IMC '20 Paper Acceptance Rate 53 of 216 submissions, 25%;
Overall Acceptance Rate 277 of 1,083 submissions, 26%

Upcoming Conference

IMC '24
ACM Internet Measurement Conference
November 4 - 6, 2024
Madrid , AA , Spain

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)129
  • Downloads (Last 6 weeks)11
Reflects downloads up to 26 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Hidden-SAGE: For the Inference of Complex Autonomous System Business Relationships Involving Hidden LinksElectronics10.3390/electronics1309161713:9(1617)Online publication date: 23-Apr-2024
  • (2023)Bias in Internet Measurement Platforms2023 7th Network Traffic Measurement and Analysis Conference (TMA)10.23919/TMA58422.2023.10198985(1-10)Online publication date: 26-Jun-2023
  • (2023)Replication: 20 Years of Inferring Interdomain Routing PoliciesProceedings of the 2023 ACM on Internet Measurement Conference10.1145/3618257.3624799(16-29)Online publication date: 24-Oct-2023
  • (2023)Realizing Fine-Grained Inference of AS Path With a Generative Measurable ProcessIEEE/ACM Transactions on Networking10.1109/TNET.2023.327056531:6(3112-3127)Online publication date: Dec-2023
  • (2023)RoLL: Real-Time and Accurate Route Leak Location with AS Triplet FeaturesICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10278878(5240-5246)Online publication date: 28-May-2023
  • (2023)On the Effectiveness of BGP Hijackers That Evade Public Route CollectorsIEEE Access10.1109/ACCESS.2023.326112811(31092-31124)Online publication date: 2023
  • (2023)Subarea Route Fusion Mechanism Based on Virtual LinksEmerging Networking Architecture and Technologies10.1007/978-981-19-9697-9_20(246-257)Online publication date: 1-Feb-2023
  • (2022)Predicting Unseen Links Using Learning-based Matrix CompletionNOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium10.1109/NOMS54207.2022.9789897(1-9)Online publication date: 25-Apr-2022
  • (2022)Research on the derivation of AS hidden links and the Discovery of Critical AS2022 IEEE 47th Conference on Local Computer Networks (LCN)10.1109/LCN53696.2022.9843337(267-270)Online publication date: 26-Sep-2022
  • (2022)Cutting Through the Noise to Infer Autonomous System TopologyIEEE INFOCOM 2022 - IEEE Conference on Computer Communications10.1109/INFOCOM48880.2022.9796874(1609-1618)Online publication date: 2-May-2022
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media