A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization

The reliable mapping of virtual networks is one of the hot issues in network virtualization researches. Unlike the traditional protection mechanisms based on redundancy and recovery mechanisms, we take the solution of the survivable virtual topology routing problem for reference to ensure that the rest of the mapped virtual networks keeps connected under a single node failure condition in the substrate network, which guarantees the completeness of the virtual network and continuity of services. In order to reduce the cost of the substrate network, a hybrid reliable heuristic mapping method based on survivable virtual networks (Hybrid-RHM-SVN) is proposed. In Hybrid-RHM-SVN, we formulate the reliable mapping problem as an integer linear program. Firstly, we calculate the primary-cut set of the virtual network subgraph where the failed node has been removed. Then, we use the ant colony optimization algorithm to achieve the approximate optimal mapping. The links in primary-cut set should select a substrate path that does not pass through the substrate node corresponding to the virtual node that has been removed first. The simulation results show that the acceptance rate of virtual networks, the average revenue of mapping, and the recovery rate of virtual networks are increased compared with the existing reliable mapping algorithms, respectively.

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

Survivable Mapping of Virtual Networks onto a Shared Substrate Network

Principles, Methodologies, and Service-Oriented Approaches for Cloud Computing ◽

10.4018/978-1-4666-2854-0.ch014 ◽

2013 ◽

pp. 325-343

Author(s):

Vishal Anand

Keyword(s):

Performance Metrics ◽

Heuristic Algorithms ◽

Network Virtualization ◽

Future Internet ◽

Mixed Integer ◽

Virtual Networks ◽

Future Internet Architecture ◽

Computing Services ◽

Underlying Network ◽

Substrate Network

The virtualization of both servers and substrate networks will enable the future Internet architecture to support a variety of Cloud computing services and architectures, and prevent its ossification. Since multiple virtual networks (VN) or virtual infrastructure (VI) and services now share the resources of the same underlying network in a network virtualization environment, it is important that efficient techniques are developed for the mapping of the VNs onto the substrate network. Furthermore, due to the sharing of resources, the survivable design of VNs is also very important, since now even small failures in the substrate network will cause the disruption of a large number of VNs that may be mapped on to the substrate network. In this work, the author studies the problem of survivable virtual network mapping (SVNM) and first formulates the problem using mixed integer linear programming (MILP). The author then devises two kinds of algorithms for solving the SVNM problem efficiently: (1) Lagrangian relaxation-based algorithms including LR-SVNM-M and LR-SVNM-D and (2) Heuristic algorithms including H-SVNM-D and H-SVNM-M. The author then compares the performance of the algorithms with other VI mapping algorithms under various performance metrics using simulation. The simulation results and analysis show that the algorithms can be used to balance the tradeoff between time efficiency and mapping cost.

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

Assignment of Virtual Networks to Substrate Network for Software Defined Networks

International Journal of Cloud Applications and Computing ◽

10.4018/ijcac.2018100103 ◽

2018 ◽

Vol 8 (4) ◽

pp. 29-48

Author(s):

Ali Akbar Nasiri ◽

Farnaz Derakhshan

Keyword(s):

Virtual Network ◽

Management Service ◽

Virtual Network Embedding ◽

Virtual Networks ◽

Network Embedding ◽

Network Resources ◽

Central Controller ◽

Network Controller ◽

Physical Resources ◽

Substrate Network

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.

Download Full-text

Topological Embedding Feature Based Resource Allocation in Network Virtualization

Mathematical Problems in Engineering ◽

10.1155/2014/271493 ◽

2014 ◽

Vol 2014 ◽

pp. 1-10 ◽

Cited By ~ 1

Author(s):

Hongyan Cui ◽

Shaohua Tang ◽

Fangfang Sun ◽

Yue Xu ◽

Xiaoli Yang

Keyword(s):

Load Balance ◽

Network Virtualization ◽

Utilization Efficiency ◽

Virtual Network ◽

Star Topology ◽

Network Utilization ◽

Topology Mapping ◽

Substrate Network ◽

Simulation Results ◽

Degree Of Convergence

Virtualization provides a powerful way to run multiple virtual networks on a shared substrate network, which needs accurate and efficient mathematical models. Virtual network embedding is a challenge in network virtualization. In this paper, considering the degree of convergence when mapping a virtual network onto substrate network, we propose a new embedding algorithm based on topology mapping convergence-degree. Convergence-degree means the adjacent degree of virtual network’s nodes when they are mapped onto a substrate network. The contributions of our method are as below. Firstly, we map virtual nodes onto the substrate nodes with the maximum convergence-degree. The simulation results show that our proposed algorithm largely enhances the network utilization efficiency and decreases the complexity of the embedding problem. Secondly, we define the load balance rate to reflect the load balance of substrate links. The simulation results show our proposed algorithm achieves better load balance. Finally, based on the feature of star topology, we further improve our embedding algorithm and make it suitable for application in the star topology. The test result shows it gets better performance than previous works.

Download Full-text

A Multi-Objective Approach for VNE Problems using multiple ILP formulations

CLEI electronic journal ◽

10.19153/cleiej.19.2.1 ◽

2016 ◽

Cited By ~ 1

Author(s):

Cristian Aceval ◽

Enrique Dávalos ◽

Víctor Franco ◽

Benjamín Barán

Keyword(s):

Performance Metrics ◽

Optimal Allocation ◽

Network Virtualization ◽

Future Internet ◽

Virtual Network ◽

Virtual Networks ◽

Multi Objective ◽

Acceptance Ratio ◽

Important Challenge ◽

Basic Infrastructure

Network Virtualization is a key technology for the Future Internet, allowing the deployment of multiple independent virtual networks that use resources of the same basic infrastructure. An important challenge in the dynamic provision of virtual networks resides in the optimal allocation of physical resources (nodes and links) to requirements of virtual networks. This problem is known as Virtual Network Embedding (VNE).For the resolution of this problem, previous research has focused on designing algorithms based on the optimization of a single objective. On the contrary, in this work we present a multi-objective algorithm, called VNE-MO-ILP, for solving dynamic VNE problem, which calculates an approximation of the Pareto Front considering simultaneously resource utilization and load balancing. Experimental results show evidences that the proposed algorithm is better or at least comparable to a state-of-the-art algorithm. Two performance metrics were simultaneously evaluated: (i) Virtual Network Request Acceptance Ratio and (ii) Revenue/Cost Relation.The size of test networks used in the experiments shows that the proposed algorithm scales well in execution times, for networks of 84 nodes.

Download Full-text

Virtual Network Embedding Based on Security Level with VNF Placement

Security and Communication Networks ◽

10.1155/2019/5640134 ◽

2019 ◽

Vol 2019 ◽

pp. 1-11 ◽

Cited By ~ 2

Author(s):

Dhanu Dwiardhika ◽

Takuji Tachibana

Keyword(s):

Network Security ◽

Virtual Network ◽

Security Level ◽

Virtual Network Embedding ◽

Virtual Networks ◽

Network Embedding ◽

Numerical Examples ◽

Substrate Network ◽

The Cost

In this paper, in order to embed virtual networks by considering network security, we propose a virtual network embedding based on security level with VNF placement. In this method, virtual networks are embedded in a substrate network by considering security and some security VNFs are placed in order to increase the security level of substrate networks. By using our proposed method, many virtual networks can be embedded by considering security level. As a result, the reward can be increased and the cost of placing VNFs is not increased so much. We evaluate the performance of our proposed method with simulation. The performance of this method is compared with the performance of a method that places VNFs randomly and the performance of a method without placing VNFs. From numerical examples, we investigate the effectiveness of this method. In numerical examples, we show that the proposed method is effective in embedding virtual networks by considering network security.

Download Full-text