Membrane Computing Based Virtual Network Embedding Algorithm with Path Splitting

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.

Download Full-text

Toward efficient dynamic virtual network embedding strategy for cloud networks

International Journal of Distributed Sensor Networks ◽

10.1177/1550147718764789 ◽

2018 ◽

Vol 14 (3) ◽

pp. 155014771876478 ◽

Cited By ~ 1

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.

Download Full-text

Managing virtual network embedding through reconfiguration and expansion

SIMULATION ◽

10.1177/0037549717754134 ◽

2018 ◽

Vol 95 (11) ◽

pp. 1113-1125 ◽

Cited By ~ 1

Author(s):

Samuel Moreira Abreu Araújo ◽

Daniel Ludovico Guidoni ◽

Fernanda Sumika Hojo de Souza ◽

Geraldo Robson Mateus

Keyword(s):

State Of The Art ◽

Network Virtualization ◽

Future Internet ◽

Virtual Network ◽

Virtual Network Embedding ◽

Network Embedding ◽

Exact Approach ◽

Management Of Resources ◽

Np Hard Problem ◽

Simulation Results

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.

Download Full-text

EPVNE: An Efficient Parallelizable Virtual Network Embedding Algorithm

Wireless Communications and Mobile Computing ◽

10.1155/2019/8416592 ◽

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.

Download Full-text

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

Mathematical Problems in Engineering ◽

10.1155/2020/5452397 ◽

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.

Download Full-text

SVNE: Survivable Virtual Network Embedding Algorithms for Network Virtualization

IEEE Transactions on Network and Service Management ◽

10.1109/tnsm.2013.013013.110202 ◽

2013 ◽

Vol 10 (2) ◽

pp. 105-118 ◽

Cited By ~ 146

Author(s):

M. R. Rahman ◽

R. Boutaba

Keyword(s):

Network Virtualization ◽

Virtual Network ◽

Virtual Network Embedding ◽

Network Embedding

Download Full-text

COVE: Co-operative Virtual Network Embedding for Network Virtualization

Journal of Network and Systems Management ◽

10.1007/s10922-017-9408-1 ◽

2017 ◽

Vol 26 (1) ◽

pp. 79-107 ◽

Cited By ~ 5

Author(s):

Min Feng ◽

Jianxin Liao ◽

Sude Qing ◽

Tonghong Li ◽

Jingyu Wang

Keyword(s):

Network Virtualization ◽

Virtual Network ◽

Virtual Network Embedding ◽

Network Embedding

Download Full-text

Virtual Network Embedding Algorithms in the Network Virtualization Environment

Journal of Software ◽

10.3724/sp.j.1001.2012.04217 ◽

2014 ◽

Vol 23 (11) ◽

pp. 3045-3058 ◽

Cited By ~ 1

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

Download Full-text

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

Journal of Electrical and Computer Engineering ◽

10.1155/2012/358647 ◽

2012 ◽

Vol 2012 ◽

pp. 1-17 ◽

Cited By ~ 2

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.

Download Full-text