A dynamic and resource sharing virtual network mapping algorithm

Network virtualization can effectively establish dedicated virtual networks to implement various network functions.However,the existing research works have some shortcomings,for example,although computing resource properties of individual nodes are considered,node storage properties and the network topology properties are usually ignored in Virtual Network(VN)modelling,which leads to the inaccurate measurement of node availability and priority.In addition,most static virtual network mapping methods allocate fixed resources to users during the entire life cycle,and the users’actual resource requirements vary with the workload,which results in resource allocation redundancy.Based on the above analysis,in this paper,we propose a dynamic resource sharing virtual network mapping algorithm named NMA-PRS-VNE,first,we construct a new,more realistic network framework in which the properties of nodes include computing resources,storage resources and topology properties.In the node mapping process,three properties of the node are used to measure its mapping ability.Second,we consider the resources of adjacent nodes and links instead of the traditional method of measuring the availability and priority of nodes by considering only the resource properties,so as to more accurately select the physical mapping nodes that meet the constraints and conditions and improve the success rate of subsequent link mapping.Finally,we divide the resource requirements of Virtual Network Requests(VNRs)into basic subrequirements and variable sub-variable requirements to complete dynamic resource allocation.The former represents monopolizing resource requirements by the VNRs,while the latter represents shared resources by many VNRs with the probability of occupying resources,where we keep a balance between resource sharing and collision among users by calculating the collision probability.Simulation results show that the proposed NMAPRS-VNE can increase the average acceptance rate and network revenue by 15%and 38%,and reduce the network cost and link pressure by 25%and 17%.

A Topology-Cognitive Algorithm Framework for Virtual Network Embedding Problem

The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and efficiently.Previous researches mainly focus on developing heuristic algorithms for general topology virtual network.In practice however,the virtual network is usually generated with specific topology for specific purpose.Thus,it is a challenge to optimize the heuristic algorithms with these topology information.In order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound algorithm.The compound algorithm is composed of several subalgorithms,which are optimized for specific topologies.We develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same framework.The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem.

A Survey of Embedding Algorithm for Virtual Network Embedding

Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.

An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

Node Ranking Strategy in Virtual Network Embedding: An Overview

Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been widely considered as a crucial issue,which is aimed to embed Virtual Networks(VNs)onto the shared substrate networks(SNs)efficiently.Recently,some VNE approaches have developed Node Ranking strategies to drive and enhance the embedding efficiency.Node Ranking Strategy rank/sort the nodes according to the attributes of the node,including both residual local attributes(CPU,Bandwidth,storage,Etc.)and the global topology attributes(Number of neighborhood Nodes,Delay to other nodes,Etc.).This paper presents an overview of Node Ranking Strategies in Virtual Network Embedding,and possible directions of VNE Node Ranking Strategy.

Topology Based Reliable Virtual Network Embedding from a QoE Perspective

In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.

Robust Virtual Network Embedding Based on Component Connectivity in Large-Scale Network

Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.

Efficient Virtual Network Embedding Algorithm Based on Restrictive Selection and Optimization Theory Approach

Network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One main challenge in NV is virtual network embedding(VNE). VNE is a NPhard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. Heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in smallscaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT(Restrictive Selection and Optimization Theory), to solve the VNE problem. The VNERSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNERSOT, a simulation against typical and stateof-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request(VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.

Virtual network mapping algorithm for large-scale network environment

A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.

A Research on the Application of Virtual Network Technology in Computer Network Security

In the computer field,network security is a crucial integrant.It is necessary to pay attention on the application of virtual network technology,so as to raise the standard of computer network security to a new level[2].In view of this,this paper will analyze the application of virtual network technology in computer network security and propose some strategies for future reference.

Heuristic Solutions of Virtual Network Embedding： A Survey

Network virtualization(NV) is considered as an enabling tool to remove the gradual ossification of current Internet. In the network virtualization environment, a set of heterogeneous virtual networks(VNs), isolated from each other, share the underlying resources of one or multiple substrate networks(SNs) according to the resource allocation strategy. This kind of resource allocation strategy is commonly known as so called Virtual Network Embedding(VNE) algorithm in network virtualization. Owing to the common sense that VNE problem is NP-hard in nature, most of VNE algorithms proposed in the literature are heuristic. This paper surveys and analyzes a number of representative heuristic solutions in the literature. Apart from the analysis of representative heuristic solutions, a taxonomy of the heuristic solutions is also presented in the form of table. Future research directions of VNE, especially for the heuristics, are emphasized and highlighted at the end of this survey.

A PSO Based Multi-Domain Virtual Network Embedding Approach

This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then the global controller abstracts substrate network topology based on the candidate nodes and boundary nodes of each domain, and applies Particle Swarm Optimization Algorithm on it to divide virtual network requests. Each local controller then embeds the virtual nodes of the divided single-domain virtual network requests in the domain, and cooperates with other local controllers to embed the inter-domain virtual links. Simulation experimental results show that the proposed algorithm has good performance in reducing embedding cost with good stability and scalability.

Using the Cooperative Game for Service Placement of Virtual Network Functions

To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middleboxes into software-based virtualized function entities.Due to the demands of virtual services placement in NFV network environment, this paper models the service amount placement problem involving with the resources allocation as a cooperative game and proposes the placement policy by Nash Bargaining Solution(NBS). Specifically,we first introduce the system overview and apply the rigorous cooperative game-theoretic guide to build the mathematical model, which can give consideration to both the responding efficiency of service requirements and the allocation fairness.Then a distributed algorithm corresponding to NBS is designed to achieve predictable network performance for virtual instances placement.Finally, with simulations under various scenarios,the results show that our placement approach can achieve high utilization of network through the analysis of evaluation metrics namely the satisfaction degree and fairness index. With the suitable demand amount of services, the average values of two metrics can reach above 90%. And by tuning the base placement, our solution can enable operators to flexibly balance the tradeoff between satisfaction and fairness of resourcessharing in service platforms.

Defending Against Link Failure in Virtual Network Embedding Using a Hybrid Scheme

Nowadays network virtualization is utterly popular.As a result,how to protect the virtual networks from attacking on the link is increasingly important.Existing schemes are mainly backup-based,which suffer from data loss and are helpless to such attacks like data tampering.To offer high security level,in this paper,we first propose a multipath and decision-making(MD) scheme which applies multipath simultaneously delivery and decision-making for protecting the virtual network.Considering different security requirement for virtual link,we devise a hybrid scheme to protect the virtual links.For the critical links,MD scheme is adopted.For the other links,we adopt the Shared Backup Scheme.Our simulation results indicate the proposed scheme can significantly increase the security level of the critical link high in the loss of less acceptance ratio.

MAVIN:A MAC Address Coding Based Virtual Network Platform

Network virtualization is a promising way for network innovation. Efforts have been made to develop virtual network platforms for both network researches and business applications. In this paper, we aim to provide a new solution to address the shortcomings of existing solutions. We propose MAVIN- a MAC address coding based virtual network platform. MAVIN avoids changing the nodes of the current Internet, and can provide high performance virtual networks with user-specified network protocols and link performance parameters. Comparing to existing network virtualization schemes, MAVIN can achieve layer-2 virtualization which has no extra forwarding overhead. We implement the virtual router prototype of MAVIN and establish a real MAVIN platform to evaluate its performance. Evaluation results show that MAVIN can support high performance virtual networks with excellent scalability.

On Effective Virtual Networks Interconnection

The network services today require extremely agile and mobile, however, the traditional IP infrastructures are so rigid that cannot fit services well. A way should be put forward to automate the network to improve responsiveness to change. SDN and network virtualization(NV) are two hottest approaches to make networking more automated and scalable to support virtualized and cloud environments. Network virtualization combines hardware and software network resources and network functionality into a single virtual network. SDN is created to simplify traffic management and achieve operational efficiencies by establish and exercising central control over packet forwarding. In this paper, we focus on the situation where SDN controller needs to connect two virtual networks temporarily. We put forward three algorithms to try to make this connection more effective and evaluate these three algorithms.

Optimize the Deployment and Integration for Multicast-Oriented Virtual Network Function Tree

Due to the development of network technology,the number of users is increasing rapidly,and the demand for emerging multicast services is becoming more and more abundant,traffic data is increasing day by day,network nodes are becoming denser,network topology is becoming more complex,and operators’equipment operation and maintenance costs are increasing.Network functions virtualization multicast issues include building a traffic forwarding topology,deploying the required functions,and directing traffic.Combining the two is still a problem to be studied in depth at present,and this paper proposes a two-stage solution where the decisions of these two stages are interdependent.Specifically,this paper decouples multicast traffic forwarding and function delivery.The minimum spanning tree of traffic forwarding is constructed by Steiner tree,and the traffic forwarding is realized by Viterbi-algorithm.Use a general topology network to examine network cost and service performance.Simulation results show that this method can reduce overhead and delay and optimize user experience.

A Centralized Algorithm for Assigning MDC Video Application in Virtual Network

Providing services on demand is a major contributing factor to drive the increasingly development of the software defined network. However, it should supply all the current popular applications before it really attains widespread development. Multiple Description Coding(MDC) video applications, as a popular application in the current network, should be reasonably supported in this novel network virtualization environment. In this paper, we address this issue to assign MDC video application into virtual networks with an efficient centralized algorithm(CAMDV). Since this problem is an NP-hard problem, we design an algorithm that can effectively balance the user satisfaction and network resource cost. Previous work just builds a global multicast tree for each description to connect all the destination nodes by breadth-first search strategy or shortest path tree algorithm. But those methods could not achieve an optimal balance or a high-level user satisfaction. By introducing the hierarchical clustering scheme, our algorithm decomposes the whole mapping procedure into multicast tree construction and multipath description distribution. A serial of simulation experiments show that our centralized algorithm could achieve a better performance in balancing the user satisfaction and average mapping cost in comparison with its rivals.

Edge computing oriented virtual optical network mapping scheme based on fragmentation prediction

As edge computing services soar,the problem of resource fragmentation situation is greatly worsened in elastic optical networks(EON).Aimed to solve this problem,this article proposes the fragmentation prediction model that makes full use of the gate recurrent unit(GRU)algorithm.Based on the fragmentation prediction model,one virtual optical network mapping scheme is presented for edge computing driven EON.With the minimum of fragmentation degree all over the whole EON,the virtual network mapping can be successively conducted.Test results show that the proposed approach can reduce blocking rate,and the supporting ability for virtual optical network services is greatly improved.

Adaptive Partial Task Offloading and Virtual Resource Placement in SDN/NFV-Based Network Softwarization

Edge intelligence brings the deployment of applied deep learning(DL)models in edge computing systems to alleviate the core backbone network congestions.The setup of programmable software-defined networking(SDN)control and elastic virtual computing resources within network functions virtualization(NFV)are cooperative for enhancing the applicability of intelligent edge softwarization.To offer advancement for multi-dimensional model task offloading in edge networks with SDN/NFV-based control softwarization,this study proposes a DL mechanism to recommend the optimal edge node selection with primary features of congestion windows,link delays,and allocatable bandwidth capacities.Adaptive partial task offloading policy considered the DL-based recommendation to modify efficient virtual resource placement for minimizing the completion time and termination drop ratio.The optimization problem of resource placement is tackled by a deep reinforcement learning(DRL)-based policy following the Markov decision process(MDP).The agent observes the state spaces and applies value-maximized action of available computation resources and adjustable resource allocation steps.The reward formulation primarily considers taskrequired computing resources and action-applied allocation properties.With defined policies of resource determination,the orchestration procedure is configured within each virtual network function(VNF)descriptor using topology and orchestration specification for cloud applications(TOSCA)by specifying the allocated properties.The simulation for the control rule installation is conducted using Mininet and Ryu SDN controller.Average delay and task delivery/drop ratios are used as the key performance metrics.