scholarly journals Toward efficient dynamic virtual network embedding strategy for cloud networks

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771876478 ◽  
Author(s):  
Duc-Lam Nguyen ◽  
Hyungho Byun ◽  
Naeon Kim ◽  
Chong-Kwon Kim
Keyword(s):  
Network Virtualization ◽  
Virtual Network ◽  
Virtual Network Embedding ◽  
Virtual Networks ◽  
Network Embedding ◽  
Acceptance Ratio ◽  
Computing Services ◽  
Virtual Links ◽  
Physical Infrastructure ◽  
Cloud Computing Services

Network virtualization is one of the most promising technologies for future networking and considered as a critical information technology resource that connects distributed, virtualized cloud computing services and different components such as storage, servers, and application. Network virtualization allows multiple virtual networks to coexist on the same shared physical infrastructure simultaneously. One of crucial factors in network virtualization is virtual network embedding which provisions a method to allocate physical substrate resources to virtual network requests. In this article, we investigate virtual network embedding strategies and related issues for resource allocation of an Internet provider to efficiently embed virtual networks that are requested by virtual network operators who share the same infrastructure provided by the Internet provider. In order to achieve that goal, we design a heuristic virtual network embedding algorithm that simultaneously embeds virtual nodes and virtual links of each virtual network request onto the physic infrastructure. Via extensive simulations, we demonstrate that our proposed scheme significantly improves the performance of virtual network embedding by enhancing the long-term average revenue as well as acceptance ratio and resource utilization of virtual network requests compared to prior algorithms.

Membrane Computing Based Virtual Network Embedding Algorithm with Path Splitting

2014 ◽  
Vol 687-691 ◽  
pp. 2997-3002 ◽  
Author(s):  
Qi Lian ◽  
Zhi Qiang Wu
Keyword(s):  
Membrane Computing ◽  
Network Virtualization ◽  
Future Internet ◽  
Virtual Network ◽  
Virtual Network Embedding ◽  
Network Embedding ◽  
Acceptance Ratio ◽  
Virtual Links ◽  
Average Revenue

Network virtualization is recognized as an important enabler technology to diversify the future Internet and the Virtual Network Embedding problem is major challenge to fulfill it. In this paper, we proposed a parallel Virtual Network Embedding algorithm with Path splitting on the basis of membrane Computing (VNEPC). And more importantly, it is one phase embedding algorithm that maps virtual nodes and virtual links in the same phase without decomposing the VNE problem. Extensive simulation results show that our proposed VNEPC algorithm outperforms the existing algorithms in long-term average revenue, acceptance ratio and long-term R/C ratio.

scholarly journals Virtual Network Embedding: A Hybrid Vertex Mapping Solution for Dynamic Resource Allocation

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Adil Razzaq ◽  
Markus Hidell ◽  
Peter Sjödin
Keyword(s):  
Network Virtualization ◽  
Virtual Network ◽  
Virtual Network Embedding ◽  
Virtual Networks ◽  
Network Embedding ◽  
Mapping Approach ◽  
Resource Requirements ◽  
Mapping Process ◽  
Dynamic Resource ◽  
Mapping Solution

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.

scholarly journals EPVNE: An Efficient Parallelizable Virtual Network Embedding Algorithm

2019 ◽  
Vol 2019 ◽  
pp. 1-10
Author(s):  
Yuanzhen Li ◽  
Yingyu Zhang
Keyword(s):  
Heuristic Algorithms ◽  
Network Virtualization ◽  
Research Work ◽  
Virtual Network ◽  
Virtual Network Embedding ◽  
Network Embedding ◽  
Virtual Node ◽  
Mapping Algorithm ◽  
Acceptance Ratio ◽  
Multiple Substrate

Virtual network embedding (VNE) problem is a key issue in network virtualization technology, and much attention has been paid to the virtual network embedding. However, very little research work focuses on parallelized virtual network embedding problems which assumes that the substrate infrastructure supports parallel computing and allows one virtual node to be mapped to multiple substrate nodes. Based on the work of Liang and Zhang, we extend the well-known VNE to parallelizable virtual network embedding (PVNE) in this paper. Furthermore, to the best of our knowledge, we give the first formulation of the PVNE problem. A new heuristic algorithm named efficient parallelizable virtual network embedding (EPVNE) is proposed to reduce the cost of embedding the VN request and increase the VN request acceptance ratio. EPVNE is a two-stage mapping algorithm, which first performs node mapping and then performs link mapping. In the node mapping phase, we present a simple and efficient virtual node and physical node sorting formula and perform the virtual node mapping in order. When mapping virtual nodes, we map virtual nodes to physical nodes that just meet the CPU requirements. Substrate nodes with more CPU resources will be retained for subsequent virtual network mapping requests. In the link mapping phase, Dijkstra’s algorithm is used to find a substrate path for each virtual link. Finally, simulations are carried out and simulation results show that our algorithm performs better than the existing heuristic algorithms.

scholarly journals Novel Node-Ranking Approach for SDN-Based Virtual Network Embedding

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Chaowei Shi ◽  
Xiangru Meng ◽  
Qiaoyan Kang ◽  
Xiaoyang Han
Keyword(s):  
Heuristic Algorithms ◽  
Network Virtualization ◽  
Virtual Network ◽  
Virtual Network Embedding ◽  
Network Embedding ◽  
Arithmetic Operations ◽  
Acceptance Ratio ◽  
Node Ranking ◽  
Link Utilization ◽  
The One

Network virtualization is considered as a key technology for the future network. The emergence of software-defined network (SDN) provides a platform for the research and development of network virtualization. One of the key challenges in network virtualization is virtual network embedding (VNE). Some of the previous VNE algorithms perform virtual node embedding, which combines the nodes’ resource attributes and local topology attributes by arithmetic operations. On the one hand, it is not easy to distinguish the topological differences between SN and VN only by simple topology metrics. On the other hand, it is easy to ignore the different weight impacts of different metrics using only arithmetic operations, which will lead to an unbalanced embedding solution. To deal with these issues, we propose a novel node-ranking approach based on topology-differentiating (VNE-NRTD) for SDN-based virtual network embedding. Owing to the topological difference between SN and VN, different node metrics are used to quantify the substrate nodes and virtual nodes, respectively. Then, the nodes are ranked using the modified set pair analysis (SPA) method to avoid the unbalanced embedding solution. On this basis, we introduce the global bandwidth of the network topology into node-ranking to further improve the efficiency of node embedding. The simulation results show that the VNE-NRTD algorithm proposed in this paper outperforms other latest heuristic algorithms in terms of the VNR acceptance ratio, long-term average R/C ratio, substrate node utilization, and substrate link utilization.

COVE: Co-operative Virtual Network Embedding for Network Virtualization

2017 ◽  
Vol 26 (1) ◽  
pp. 79-107 ◽  
Author(s):  
Min Feng ◽  
Jianxin Liao ◽  
Sude Qing ◽  
Tonghong Li ◽  
Jingyu Wang
Keyword(s):  
Network Virtualization ◽  
Virtual Network ◽  
Virtual Network Embedding ◽  
Network Embedding

Virtual Network Embedding Algorithms in the Network Virtualization Environment

2014 ◽  
Vol 23 (11) ◽  
pp. 3045-3058 ◽  
Author(s):  
Su-De QING ◽  
Jian-Xin LIAO ◽  
Xiao-Min ZHU ◽  
Jing-Yu WANG ◽  
Qi QI
Keyword(s):  
Network Virtualization ◽  
Virtual Network ◽  
Virtual Network Embedding ◽  
Network Embedding

Online Virtual Network Embedding Based on Virtual Links’ Rate Requirements

2018 ◽  
Vol 15 (4) ◽  
pp. 1630-1644 ◽  
Author(s):  
Christian Aguilar-Fuster ◽  
Mahboobeh Zangiabady ◽  
Jose Zapata-Lara ◽  
Javier Rubio-Loyola
Keyword(s):  
Virtual Network ◽  
Virtual Network Embedding ◽  
Network Embedding ◽  
Virtual Links

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
Keyword(s):  
Energy Consumption ◽  
Energy Cost ◽  
State Of The Art ◽  
Electricity Price ◽  
Virtual Network ◽  
Virtual Network Embedding ◽  
Virtual Networks ◽  
Network Embedding ◽  
Energy Aware ◽  
Physical Network

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.

A Dynamic Resource Provisioning VNE Algorithm Based on Graph Theory

2018 ◽  
pp. 73-97
Author(s):  
Isha Pathak ◽  
Deo Prakash Vidyarthi ◽  
Atul Tripathi
Keyword(s):  
Graph Theory ◽  
Network Virtualization ◽  
Resource Provisioning ◽  
Virtual Network ◽  
Embedding Problem ◽  
Theory Approach ◽  
Virtual Network Embedding ◽  
Network Access ◽  
Network Embedding ◽  
Performance Study

Business has transformed drastically over the years and cloud computing has emerged as an upcoming platform to provide all types of services, especially in the domain of digital business. Virtualization in cloud is a core activity, done at various levels, to support multiple services. Network virtualization is a significant aspect that liberates the users for seamless network access. Virtual network embedding is a process in which the demand of virtual nodes and virtual links are fulfilled by physical/substrate nodes and links while optimizing certain characteristic parameters. This chapter addresses the virtual network embedding problem to optimize parameters such as running time, residual physical network, and embedding cost using graph theory approach. It also minimizes the exhaustion of substrate network resources and still using its resources efficiently. In this chapter, a concept of graph theory has been applied for the virtual network embedding problem. The proposed model has been simulated for its performance study, and results reveal the efficacy of the method.

Sign in / Sign up

Export Citation Format

Share Document