Vianney Kengne Tchendji ; Yannick Florian YANKAM - Dynamic resource allocations in virtual networks through a knapsack problem's dynamic programming solution

arima:5321 - Revue Africaine de Recherche en Informatique et Mathématiques Appliquées, January 9, 2020, Volume 31 - 2019 - CARI 2018 - https://doi.org/10.46298/arima.5321
Dynamic resource allocations in virtual networks through a knapsack problem's dynamic programming solutionArticle

Authors: Vianney Kengne Tchendji ORCID1; Yannick Florian YANKAM

The high-value Internet services that have been significantly enhanced with the integration of network virtualization and Software Defined Networking (SDN) technology are increasingly attracting the attention of end-users and major computer network companies (Google, Amazon, Yahoo, Cisco, ...). In order to cope with this high demand, network resource providers (bandwidth, storage space, throughput, etc.) must implement the right models to understand and hold the users' needs while maximizing profits reaped or the number of satisfied requests into the virtual networks. This need is even more urgent that users' requests can be linked, thereby imposing to the InP some constraints concerning the mutual satisfaction of requests, which further complicates the problem. From this perspective, we show that the problem of resource allocation to users based on their requests is a knapsack problem and can therefore be solved efficiently by using the best dynamic programming solutions for the knapsack problem. Our contribution takes the dynamic resources allocation as a multiple knapsack's problem instances on variable value requests.


Volume: Volume 31 - 2019 - CARI 2018
Published on: January 9, 2020
Accepted on: December 16, 2019
Submitted on: March 28, 2019
Keywords: fournisseur de services,service provider,Réseau virtuel,programmation dynamique,allocation des ressources,sac à dos,fournisseur d'infrastructures,infrastructure provider,knapsack,dynamic programming,ressource allocation,Virtual network,[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI],[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC],[INFO.INFO-MC]Computer Science [cs]/Mobile Computing

2 Documents citing this article

Consultation statistics

This page has been seen 588 times.
This article's PDF has been downloaded 686 times.