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.

A Graph Theoretic Algorithm for Virtual Network Embedding

2014 ◽  
Vol 10 (2) ◽  
pp. 1-14 ◽  
Author(s):  
Isha Pathak ◽  
Deo Prakash Vidyarthi
Keyword(s):  
Network Virtualization ◽  
Virtual Network ◽  
Theory Approach ◽  
Virtual Network Embedding ◽  
Network Embedding ◽  
Performance Study ◽  
Characteristic Parameters ◽  
Physical Network ◽  
Graph Theoretic ◽  
Cloud Network

Cloud computing has emerged as an upcoming platform to provide all types of services to the users. Virtualization is a core activity in Cloud that supports multiple services and virtualization at various levels is supported in Cloud. Network virtualization is an important aspect that gives the network illusion to the users that they can access without bothering about the actual physical network. Virtual network embedding is the problem of mapping the virtual nodes and virtual links of the virtual network to actual physical nodes and links with optimization of certain characteristic parameters. The work, in this paper, addresses the virtual network embedding problem to optimize some characteristic parameters such as running time and residual physical network using graph theory approach. The proposed model has been simulated, for its performance study, and result reveals the efficacy of the proposed method.

A branch-and-price algorithm for the single-path virtual network embedding problem

Networks ◽  
2017 ◽  
Vol 71 (3) ◽  
pp. 188-208 ◽  
Author(s):  
Leonardo F.S. Moura ◽  
Luciano P. Gaspary ◽  
Luciana S. Buriol
Keyword(s):  
Virtual Network ◽  
Embedding Problem ◽  
Virtual Network Embedding ◽  
Network Embedding ◽  
Branch And Price ◽  
Price Algorithm ◽  
Single Path

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

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.

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.

Sign in / Sign up

Export Citation Format

Share Document