Online Virtual Links Resource Allocation in Software-Defined Networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Online Virtual Links Resource Allocation in Software-Defined Networks

Résumé

Network virtualization is seen as a key networking paradigm for building diverse network services and architec-tures over a shared network infrastructure. Assigning network resources to virtual links and, more generally to virtual network topologies, efficiently and on-demand is one of the most challeng-ing components of any network virtualization solution. This paper addresses the problem of on-line resource allocation of multiple virtual links on a Software Defined Network (SDN) infrastructure. The application context that is targeted is primarily the on-line provisioning of virtual overlay networks even if it can be broadened to address more general virtual networks. Considering an SDN physical infrastructure allows a complete freedom in choosing the optimal physical paths and the associated resources that support the virtual links with no interference from any other network function (such as routing). However, for the time being, forwarding in an SDN network is resource consuming with a noticeable impact on the size of the flow tables. Hence, forwarding (i.e. switching) resources should be carefully considered by the network resource allocation algorithm. This paper proposes an Integer-Linear formulation of the above cited problem by con-sidering: (1) point-to-point as well as point-to-multipoint virtual links, each with an associated bandwidth requirement and a maximum transfer delay requirement, (2) two types of network resources, namely network links' bandwidth and nodes' switching resources, and (3) optionally, path splitting which allows a virtual link to be established on multiple physical paths. We report preliminary experimental results on a real network topology in an overloaded scenario (bandwidth requests largely exceed network capacity); they show that our algorithm outperforms shortest path heuristics with a gain on the admission rate (of virtual links requests) that ranges from 5 to 15% (compared to the most efficient heuristic) and with a computation time less than a few seconds.
Fichier principal
Vignette du fichier
paper.pdf (289.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01107598 , version 1 (21-01-2015)

Identifiants

  • HAL Id : hal-01107598 , version 1

Citer

Mikaël Capelle, Slim Abdellatif, Marie-José Huguet, Pascal Berthou. Online Virtual Links Resource Allocation in Software-Defined Networks. IFIP Networking 2015 Conference, May 2015, Toulouse, France. ⟨hal-01107598⟩
265 Consultations
498 Téléchargements

Partager

Gmail Facebook X LinkedIn More