Gestion des fonctions réseau et du trafic dans les réseaux virtualisés

Abstract

Network Function Virtualization (NFV) and Software Defined Networking (SDN) are two new paradigms that have recently been introduced that are changing the way networks are configured and maintained. NFV and SDN offer several advantages, including dynamic creation and reconfiguration of VNFs as well as dynamic traffic routing. In this context, we are interested, in the first part of this thesis, in the possibility of offering Service Function Chain (SFC) as a service (SFCaaS) where a chain of service could be offered as a service to a third party. An SFC is made up of a set of virtual network functions (VNFs) which are implemented in a virtual machine or container running on a dedicated server or device and which are linked by virtual links to carry traffic. Thus, we try to solve the problem of allocating resources to SFCs in the physical infrastructure and the routing of their traffic. We therefore formulate the problem as an Integer Linear Program (ILP) and propose a heuristic algorithm aimed at maximizing the total revenue of the SFC provider taking into account the cost of instances, the operating cost operational, and the cost of synchronization between VNF instances. In the second part of this thesis, we are interested in traffic management in multi-domain networks where each domain is administered and managed by a single network operator. Unfortunately, network operators typically do not work together to make their routing decisions and the overall performance of the multi-domain network. Motivated by the need to solve this problem, we propose a new multi-domain collaborative routing mechanism capable of efficiently routing inbound flows across multiple domains while ensuring their performance requirements in terms of delay and bandwidth and maximizing l overall use of the network. We therefore propose an entire linear program to solve this problem and develop a heuristic algorithm suitable for large scales. The results of the simulations show that the proposed mechanism is capable of considerably optimizing the use of the network and of maximizing the number of flows routed with guaranteed performance.

Date	24 Jan 2022
Original language	French
Awarding Institution	École de technologie supérieure
Supervisor	Mohamed Faten Zhani (Supervisor) & Abdelouahed Gherbi (Co-supervisor)