Print Email Facebook Twitter Inferring relationship types and simulating BGP traffic between Autonomous Systems using the valley-free constraint Title Inferring relationship types and simulating BGP traffic between Autonomous Systems using the valley-free constraint Author Kastelein, Frits (TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor Doerr, Christian (mentor) Kuipers, Fernando (graduation committee) van der Lubbe, Jan (graduation committee) Degree granting institution Delft University of Technology Date 2018-11-15 Abstract In today's world, the Internet is the backbone of our society. The relatively unknown Border Gateway Protocol (BGP), and with its vulnerabilities, gives malicious parties an opportunity for abuse. By improving the currently known AS relation data set and by simulating BGP traffic this abuse is better spotted. Kastelein's topology generating algorithm outperforms the state-of-the-art topology generating algorithms and state-of-the-art AS relation data sets. The proposed BGP simulator misses vital information such as LOCAL_PREFERENCE values to accurately simulate BGP traffic. This lack of information results in longer BGP paths that are not matched with BGP paths from route collectors. Subject BGPvalley-freeAStopologyInternetsimulatoralgorithmrelationsrelationshipsAutonomous System To reference this document use: http://resolver.tudelft.nl/uuid:cf0d56c7-9dca-46ed-8ec7-69dada59c93f Embargo date 2019-11-01 Part of collection Student theses Document type master thesis Rights © 2018 Frits Kastelein Files PDF Thesis_Frits_Kastelein_final.pdf 3.64 MB Close viewer /islandora/object/uuid:cf0d56c7-9dca-46ed-8ec7-69dada59c93f/datastream/OBJ/view