Inferring relationship types and simulating BGP traffic between Autonomous Systems using the valley-free constraint
F.P. Kastelein (TU Delft - Electrical Engineering, Mathematics and Computer Science)
C. Dörr – Mentor
F.A. Kuipers – Graduation committee member
J. C.A. Van Der Lubbe – Graduation committee member
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
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.