scholarly journals Clustering-based energy-aware virtual network embedding

2017 ◽  
Vol 13 (8) ◽  
pp. 155014771772671
Author(s):  
Xu Liu ◽  
Zhongbao Zhang ◽  
Junning Li ◽  
Sen Su

Virtual network embedding has received a lot of attention from researchers. In this problem, it needs to map a sequence of virtual networks onto the physical network. Generally, the virtual networks have topology, node, and link constraints. Prior studies mainly focus on designing a solution to maximize the revenue by accepting more virtual networks while ignoring the energy cost for the physical network. In this article, to bridge this gap, we design a heuristic energy-aware virtual network embedding algorithm called EA-VNE-C, to coordinate the dynamic electricity price and energy consumption to further optimize the energy cost. Extensive simulations demonstrate that this algorithm significantly reduces the energy cost by up to 14% over the state-of-the-art algorithm while maintaining similar revenue.

2015 ◽  
Vol 93 ◽  
pp. 448-459 ◽  
Author(s):  
Zhongbao Zhang ◽  
Sen Su ◽  
Junchi Zhang ◽  
Kai Shuang ◽  
Peng Xu

2015 ◽  
Vol 91 ◽  
pp. 184-195 ◽  
Author(s):  
Márcio Melo ◽  
Susana Sargento ◽  
Ulrich Killat ◽  
Andreas Timm-Giel ◽  
Jorge Carapinha

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Adil Razzaq ◽  
Markus Hidell ◽  
Peter Sjödin

Virtual network embedding (VNE) is a key area in network virtualization, and the overall purpose of VNE is to map virtual networks onto an underlying physical network referred to as a substrate. Typically, the virtual networks have certain demands, such as resource requirements, that need to be satisfied by the mapping process. A virtual network (VN) can be described in terms of vertices (nodes) and edges (links) with certain resource requirements, and, to embed a VN, substrate resources are assigned to these vertices and edges. Substrate networks have finite resources and utilizing them efficiently is an important objective for a VNE method. This paper analyzes two existing vertex mapping approaches—one which only considers if enough node resources are available for the current VN mapping and one which considers to what degree a node already is utilized by existing VN embeddings before doing the vertex mapping. The paper also proposes a new vertex mapping approach which minimizes complete exhaustion of substrate nodes while still providing good overall resource utilization. Experimental results are presented to show under what circumstances the proposed vertex mapping approach can provide superior VN embedding properties compared to the other approaches.


Author(s):  
Sen Su ◽  
Zhongbao Zhang ◽  
Xiang Cheng ◽  
Yiwen Wang ◽  
Yan Luo ◽  
...  

SIMULATION ◽  
2018 ◽  
Vol 95 (11) ◽  
pp. 1113-1125 ◽  
Author(s):  
Samuel Moreira Abreu Araújo ◽  
Daniel Ludovico Guidoni ◽  
Fernanda Sumika Hojo de Souza ◽  
Geraldo Robson Mateus

Network virtualization concerns an important issue for the future internet. There have been many advances in the state of the art, but there are still challenges to be explored. The virtual network embedding problem is one of these, and is an NP-hard problem. Aiming to improve the embedding task, reconfiguration and expansion appear as possible strategies for the service provider. In this work, we explore the management of resources in order to improve the acceptance of requests deciding when and how reconfiguration and expansion shall apply. An exact approach based on integer linear programming along with a heuristic approach is evaluated. Simulation results indicate both reconfiguration and expansion strategies are able to improve the acceptance, but reconfiguration should be considered first as it can provide significant improvements in managing the fragmentation problem. Expansion comes as a secondary decision if necessary.


Sign in / Sign up

Export Citation Format

Share Document