ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

A flexible implementation of OSPF

Dénos, Cyril
(2019)

Files

Denos_62811300_2019.pdf
  • Open access
  • Adobe PDF
  • 738.91 KB
Download

Details

Supervisors
Bonaventure, Olivier
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] : ingénieur civil en informatique
Abstract
Routing protocols are at the core of every today's network. Network operators needs are evolving, but on the other hand, routing protocols implementations are not very flexible by design. This leads some operators to turn themselves toward solution such as Software Defined Networks that centralizes the control of the networks, allowing providing more complex services. In this thesis, we propose a new approach for implementing routing protocols and demonstrate its applicability on OSPF. We add a virtual machine into the protocol implementation that is able to execute some code written by a third party (most probably network operators). We show that with this approach, it is possible to add a new type of LSA and modify the Shortest Path First algorithm of OSPF based on this new LSA in a very simple manner. Our results also show that the overhead induced by the introduction of the virtual machine and the execution of the added code is acceptable.