Research on Algorithm for Virtual Network Embedding Based on Integer Programming

Abstract

The virtual network embedding problem is a majorchallenge in this field. Its target is to efficiently map the virtual nodes and virtual linksonto the substrate network resources. Due to multiple objectives and multipleconstraints, finding the optimal solution turns out to be a very difficult problem. This paper describes the virtual network embedding, integer programming form to design an algorithm for virtual network embedding based on integer programming to improve the benefit / cost ratio of the virtual network mapping. Introduction Network virtualization has been identified as a promising technology toovercome the current ossification of the Internet by running multiple network servicesand experiments simultaneously on the same substrate network. First, a subset of nodes in the virtual network is found to be a node set of the virtual nodes. The nodes are satisfied with the distance of the virtual nodes in DV. Then, all virtual nodes are connected to each of the nodes, the link between these virtual nodes and their nodes is a link, and the bandwidth of each link is set up in the extended enhanced graph. Each of the starting point and end point of a virtual link is connected to a node of the entity network, and the optimal route is equivalent to the virtual link to find an optimal path for the virtual link to meet the demand of the network. Some two value constraints are used to ensure that each virtual node can only be connected to one of the nodes of the node as a node of the node. The main goal is to increase the average income of virtual network embedding. Its limiting conditions include capacity constraints, traffic constraints, two element constraints and domain constraints. Node mapping and link mapping can be done at the same time without the need to do additional calculations. The algorithm proposed in this paper is also added to the target function to increase the acceptance rate of the network map by adding the key index CI in Topology-Awareness. Algorithm for Virtual Network EmbeddingBased on Integer Programming Virtual Network Embedding. Virtual network embedding is a key problem of network virtualization. Virtual network mapping problem is a major challenge in this field. Its goal is to embed the virtual nodes and virtual links embedded in virtual network requests into the network resources effectively. Previous research focused on the design of heuristic algorithm or attempts to solve the solution through two stages, that is, the node mapping is the first stage, and the link mapping is the second stage. In this paper, a new algorithm of virtual network embedding based on integer programming is proposed in this paper. First, a set of nodes of a distance close to each virtual node is found as its meta node set. Then, all virtual nodes and its element nodes are focused on each node, so as to build an enhanced network model based on the original physical network. On the basis of this model, the virtual network mapping problem is defined as an objective function and some constraints. A topology dependent factor is added to the objective function. This method solves the problem of virtual network mapping in one step. The simulation results clearly show that the proposed algorithm greatly improves the performance of virtual embedding, improves the 3rd International Conference on Machinery, Materials and Information Technology Applications (ICMMITA 2015) © 2015. The authors Published by Atlantis Press 1 embedding acceptance rate, increases the cost and benefits and reduces the cost of virtual network mapping cost. Integer Programming Form. The goal of the virtual network mapping is to obtain the maximum benefit of the virtual network, which is based on the premise of satisfying the conditions. Suppose the benefit of t is ( ( )) v R G t , then the goal of the virtual network mapping is shown as follows to maximize the long-term average benefit: