A Multi-Objective Approach for VNE Problems using multiple ILP formulations
Network Virtualization is a key technology for the Future Internet, allowing the deployment of multiple independent virtual networks that use resources of the same basic infrastructure. An important challenge in the dynamic provision of virtual networks resides in the optimal allocation of physical...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Centro Latinoamericano de Estudios en Informática
2016-08-01
|
Series: | CLEI Electronic Journal |
Subjects: | |
Online Access: | http://www.clei.org/cleiej-beta/index.php/cleiej/article/view/416 |
_version_ | 1818028994747957248 |
---|---|
author | Cristian Aceval Enrique Dávalos Víctor Franco Benjamín Barán |
author_facet | Cristian Aceval Enrique Dávalos Víctor Franco Benjamín Barán |
author_sort | Cristian Aceval |
collection | DOAJ |
description | Network Virtualization is a key technology for the Future Internet, allowing the deployment of multiple independent virtual networks that use resources of the same basic infrastructure. An important challenge in the dynamic provision of virtual networks resides in the optimal allocation of physical resources (nodes and links) to requirements of virtual networks. This problem is known as Virtual Network Embedding (VNE).
For the resolution of this problem, previous research has focused on designing algorithms based on the optimization of a single objective. On the contrary, in this work we present a multi-objective algorithm, called VNE-MO-ILP, for solving dynamic VNE problem, which calculates an approximation of the Pareto Front considering simultaneously resource utilization and load balancing. Experimental results show evidences that the proposed algorithm is better or at least comparable to a state-of-the-art algorithm. Two performance metrics were simultaneously evaluated: (i) Virtual Network Request Acceptance Ratio and (ii) Revenue/Cost Relation.
The size of test networks used in the experiments shows that the proposed algorithm scales well in execution times, for networks of 84 nodes. |
first_indexed | 2024-12-10T05:12:38Z |
format | Article |
id | doaj.art-90b9fa61a1894100a68064c02c5b88e5 |
institution | Directory Open Access Journal |
issn | 0717-5000 |
language | English |
last_indexed | 2024-12-10T05:12:38Z |
publishDate | 2016-08-01 |
publisher | Centro Latinoamericano de Estudios en Informática |
record_format | Article |
series | CLEI Electronic Journal |
spelling | doaj.art-90b9fa61a1894100a68064c02c5b88e52022-12-22T02:01:03ZengCentro Latinoamericano de Estudios en InformáticaCLEI Electronic Journal0717-50002016-08-0119210.19153/cleiej.19.2.1A Multi-Objective Approach for VNE Problems using multiple ILP formulationsCristian Aceval0Enrique Dávalos1Víctor Franco2Benjamín Barán3Centro Nacional de Computación, Universidad Nacional de Asunción, ParaguayFacultad Politécnica, Universidad Nacional de Asunción, ParaguayFacultad Politécnica, Universidad Nacional de Asunción, ParaguayNational University of Asuncion, ParaguayNetwork Virtualization is a key technology for the Future Internet, allowing the deployment of multiple independent virtual networks that use resources of the same basic infrastructure. An important challenge in the dynamic provision of virtual networks resides in the optimal allocation of physical resources (nodes and links) to requirements of virtual networks. This problem is known as Virtual Network Embedding (VNE). For the resolution of this problem, previous research has focused on designing algorithms based on the optimization of a single objective. On the contrary, in this work we present a multi-objective algorithm, called VNE-MO-ILP, for solving dynamic VNE problem, which calculates an approximation of the Pareto Front considering simultaneously resource utilization and load balancing. Experimental results show evidences that the proposed algorithm is better or at least comparable to a state-of-the-art algorithm. Two performance metrics were simultaneously evaluated: (i) Virtual Network Request Acceptance Ratio and (ii) Revenue/Cost Relation. The size of test networks used in the experiments shows that the proposed algorithm scales well in execution times, for networks of 84 nodes.http://www.clei.org/cleiej-beta/index.php/cleiej/article/view/416ILPVNEVirtual network embeddingNetwork virtualizationMulti-objective optimization |
spellingShingle | Cristian Aceval Enrique Dávalos Víctor Franco Benjamín Barán A Multi-Objective Approach for VNE Problems using multiple ILP formulations CLEI Electronic Journal ILP VNE Virtual network embedding Network virtualization Multi-objective optimization |
title | A Multi-Objective Approach for VNE Problems using multiple ILP formulations |
title_full | A Multi-Objective Approach for VNE Problems using multiple ILP formulations |
title_fullStr | A Multi-Objective Approach for VNE Problems using multiple ILP formulations |
title_full_unstemmed | A Multi-Objective Approach for VNE Problems using multiple ILP formulations |
title_short | A Multi-Objective Approach for VNE Problems using multiple ILP formulations |
title_sort | multi objective approach for vne problems using multiple ilp formulations |
topic | ILP VNE Virtual network embedding Network virtualization Multi-objective optimization |
url | http://www.clei.org/cleiej-beta/index.php/cleiej/article/view/416 |
work_keys_str_mv | AT cristianaceval amultiobjectiveapproachforvneproblemsusingmultipleilpformulations AT enriquedavalos amultiobjectiveapproachforvneproblemsusingmultipleilpformulations AT victorfranco amultiobjectiveapproachforvneproblemsusingmultipleilpformulations AT benjaminbaran amultiobjectiveapproachforvneproblemsusingmultipleilpformulations AT cristianaceval multiobjectiveapproachforvneproblemsusingmultipleilpformulations AT enriquedavalos multiobjectiveapproachforvneproblemsusingmultipleilpformulations AT victorfranco multiobjectiveapproachforvneproblemsusingmultipleilpformulations AT benjaminbaran multiobjectiveapproachforvneproblemsusingmultipleilpformulations |