2 results
Now showing1 - 2 of 2
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , Optimal virtual network embedding: Energy aware formulationNetwork Virtualization is a key component of the Future Internet, providing the dynamic support of different networks with different paradigms and mechanisms in the same physical infrastructure. A major challenge in the dynamic provision of virtual networks is the embedding approach taking energy efficiency into account, while not affecting the overall Virtual Network (VN) acceptance ratio. Previous research focused on either designing heuristic-based algorithms to address the efficient embedding problem or to address the energy impact. This paper proposes an integer linear programming formulation, Energy Aware-Virtual Network Embedding-Node-Link Formulation (EA-VNE-NLF), that solves the online virtual network embedding as an optimization problem, striving for the minimum energy consumption and optimal resource allocation per VN mapping. Two different objective functions are proposed: (i) addressing primarily the resource consumption problem - Bandwidth Consumption Minimization (BCM); (ii) addressing primarily the energy consumption problem - Energy Consumption Minimization (ECM). The performance of each objective function is evaluated by means of simulation and compared with an existing objective function, Weighted Shortest Distance Path (WSDP), that is considered state of the art of the resource allocation problem. The simulation results show that the objective function BCM reduces the energy consumption of the physical network by 14.4%, and improves the embedding factor by 4.3%, consuming almost the same amount of resources as requested, and slightly worsening the VN acceptance ratio by 2.3%. ECM reduces the energy consumption of the physical network by 31.4% and improves the embedding factor by 4.1%, without affecting the VN acceptance ratio when compared to WSDP.Publicationtype: Journal Article148 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , Virtual network mapping - an optimization problem(Springer, 2012-07-27); ; ; ; Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks on the same physical infrastructure, providing the dynamic creation and support of different networks with different paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides on the efficient embedding of virtual resources into physical ones. Since this problem is known to be -hard, previous research focused on designing heuristic-based algorithms; most of them do not consider a simultaneous optimization of the node and the link mapping, leading to non-optimal solutions. This paper proposes an integer linear programming formulation to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping. A link∈-∈node formulation is used and the multi-commodity flow constrain is applied. In addition, a heuristic algorithm for virtual network embedding is also proposed and compared against the optimal formulation. The performance of the integer linear programming formulation and of the heuristic is evaluated by means of simulation. Simulation experiments show significant improvements of the virtual network acceptance ratio, in average additional 10% of the virtual network requests are accepted when using the integer linear programming formulation, which corresponds, in average, to more 7 virtual networks accommodated on the physical network. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.Publicationtype: Conference Paper35