Policy-based Routing Strategies in Large Networks

OData support
Supervisor:
Dr. Heszberger Zalán Tamás
Department of Telecommunications and Media Informatics

Nowadays, a lot of researches are dealing with algorithms that implements alternative network management functions. One of the most popular branches of these researches are about routing and more particularly about optimizing classical algorithms - mostly shortest path finding algorithms - in terms of used resources.

In communication networks, routing decisions are based on routing policies. There is no solution for the problem when we want to determine the policies by the observation of the network. However by using the mathematical models of routing policies, we will be able to create a simulator which helps discover this policies.

In this thesis my goal is to build a simulation framework that can determine the routing policies of real large-scale networks. The simulation framework uses the mathematical models of the routing policies. I will define a measuring system to compare the simulation results. I will use the simulator to examine the policies behind the route-defining decisions of the largest airlines.

Downloads

Please sign in to download the files of this thesis.