The task of establishing datapaths between segments of a network is called routing and is performed by the Border Gateway Prototocol (BGP) on today’s Internet. Certain properties of the protocol allow the participating systems of making their routing decisions based on their own economical or political views, rather than system-wide parameters – while at the same time having to maintain global reachability and ensuring a high level of service availability. This way however, it is not guaranteed that the resulting paths will meet the network’s physical optimum criteria.
Ensuring BGP’s fast convergence is essential for securing a fair level of the Internet’s Quality of Service, and various theories are in existence, suggesting different solutions of the problem. The goal of this thesis is to perform simulations in order to assess the usability of some of these suggestions. The making of a software tool that is designed for running such simulations is presented. The tool is capable of simulating BGP’s behaviour by a diverse set of adjustable network settings, thus making it possible to examine the effect of these parameter changes on routing convergence. We also present the resulting simulated data, some of which provide surprising information.
The properties of the software make it useful for future work with only little or no modification of the source code. The types of supported further work may include research simulations of non-standard „BGP-like” routing protocols and Future Internet experiments.