Virtual Network Mappingalgorithm Based On Structure Optimization Research

In recent twenty years, the Internet, or called "network of networks", always play a vital rolein the industry modern society, culture, knowledge and business which are closely related topeople’s life by supporting a variety of network technology and application. But, due to its wideapplication and the nature of the multi-the provider, the development of the Internet is justlimited to simple update existing equipment or agreement.Network virtualization technology is then proposed, which to response the architecture of theInternet in the future. Network virtualization can provide an open, flexible network environment,and allow the service providers on the underlying physical network dynamically assembled intomultiple heterogeneous network architecture, which is a virtual network. Based on the flexibilityof the network environment, it will promote the diversified services and application deployment.An important challenge in the field of network virtualization is the virtual network mappingproblem, which aims to distribute the underlying physical distribution network node and linkresources for virtual node and link statically or dynamically, also need to satisfy their respectiveresource constraints at the same time. How to effectively use the physical resources needefficient virtual network mapping technology. This article mainly establishes related model fromthe perspective of resource allocation, and completed the next work:(1) The first two chapters mainly describes the research background, research status ofnetwork virtualization and basic technical characteristics. This paper introduces the difference ofthe network operation mode in the network virtualization technology and traditional networktechnology, the basic structure of virtual model is given by graphics. List out a few kinds offactors which influence the mapping, and for the classification of the virtual network mappingalgorithm in detail.(2) According to resource allocation problem under the environment of networkvirtualization. This paper proposes a modeling method based on bi-level programming. Firstly, virtual network providers from the perspective of maximizing their utility to decide theexpansion plan of virtual network. Secondly, the user choice routing through selfish routingstrategy, and the game of these two players reach equilibrium. This Stackelberg game isexpressed as a bi-level programming model. The top decision makers from the system point ofview is a virtual network system optimization model, the lower level from a user’s point of view,meet user’s selfish behavior user equilibrium model of Wardrop. The bi-level programmingmodel uses user’s routing behavior to combine two processes (the choice of virtual network nodeand link mapping) into a unified one. We obtain the solution of this model through heuristiciterative algorithm. The experimental data shows that the model has a good virtual requestreceptance, the network gains and resource utilization. In addition, we extend this model andincrease the constraint condition, make the algorithm more general.(3) By using Stackelberg game analyzed the relationship between the physical network andvirtual network, the mathematical models of this two revenue functions are established. Andunder the condition of incomplete information to solve the model, by showing that virtualnetwork concavity of the utility function, proved the existence of Nash equilibrium. At last,through the simulation result shows that the effectiveness of the proposed algorithm.