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

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.

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771876478 ◽  
Author(s):  
Duc-Lam Nguyen ◽  
Hyungho Byun ◽  
Naeon Kim ◽  
Chong-Kwon Kim

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.


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

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

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.


2014 ◽  
Vol 687-691 ◽  
pp. 2997-3002 ◽  
Author(s):  
Qi Lian ◽  
Zhi Qiang Wu

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.


Author(s):  
Isha Pathak ◽  
Deo Prakash Vidyarthi ◽  
Atul Tripathi

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.


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.


Sensors ◽  
2020 ◽  
Vol 20 (9) ◽  
pp. 2655 ◽  
Author(s):  
Yue Zong ◽  
Chuan Feng ◽  
Yingying Guan ◽  
Yejun Liu ◽  
Lei Guo

The emerging 5G applications and the connectivity of billions of devices have driven the investigation of multi-domain heterogeneous converged optical networks. To support emerging applications with their diverse quality of service requirements, network slicing has been proposed as a promising technology. Network virtualization is an enabler for network slicing, where the physical network can be partitioned into different configurable slices in the multi-domain heterogeneous converged optical networks. An efficient resource allocation mechanism for multiple virtual networks in network virtualization is one of the main challenges referred as virtual network embedding (VNE). This paper is a survey on the state-of-the-art works for the VNE problem towards multi-domain heterogeneous converged optical networks, providing the discussion on future research issues and challenges. In this paper, we describe VNE in multi-domain heterogeneous converged optical networks with enabling network orchestration technologies and analyze the literature about VNE algorithms with various network considerations for each network domain. The basic VNE problem with various motivations and performance metrics for general scenarios is discussed. A VNE algorithm taxonomy is presented and discussed by classifying the major VNE algorithms into three categories according to existing literature. We analyze and compare the attributes of algorithms such as node and link embedding methods, objectives, and network architecture, which can give a selection or baseline for future work of VNE. Finally, we explore some broader perspectives in future research issues and challenges on 5G scenario, field trail deployment, and machine learning-based algorithms.


2018 ◽  
Vol 8 (4) ◽  
pp. 29-48
Author(s):  
Ali Akbar Nasiri ◽  
Farnaz Derakhshan

Assigning multiple virtual network resources to physical network resources, called virtual network embedding (VNE), is known to be non-deterministic polynomial-time hard (NP-hard) problem. Currently software-defined networking (SDN) is gaining popularity in enterprise networks to improve the customizability and flexibility in network management service and reduced operational cost. A central controller in SDNs is an important factor that we need to take care of when we want to assign virtual networks to physical resources. In this work, we address virtual network embedding problems for SDNs. Indeed, our objective is to propose a method to assign virtual networks in the substrate network with minimum physical resources, and also minimizing delays between the virtual network controller and the switches in the virtual network. Our proposed algorithm considers the link and node constraints such as CPU and bandwidth constraints which is necessary to consider when we try to solve virtual network embedding problems.


Sign in / Sign up

Export Citation Format

Share Document