Research On Resource Mapping Algorithm And Management System For Network Virtualization Experiment Platform

In the past half century, the development of information technology, especially theadvances in computer and internet technology has greatly changed the way people work andlive. The increasingly diverse network applications and network technologies to the existinginternet system has brought new challenges, such as flexibility, scalability and manageability,making the existing network architecture need to continuously change to adapt to the newnetwork technologies and application requirements. However, due to all the existing internetservice provider (ISP) can not be agreed upon a common goal and strategy, the innovation ofthe existing network architecture can only be very slow. At the same time, any newtechnology for the architecture for large-scale adjustment is difficult to test and deploy in thecurrent internet.The virtualized network, making the problem solved. It allows multiple heterogeneousvirtual subnets in the virtual co-exist with a physical environment, rather than affecting thenormal operation of the existing network system. The nature of network virtualization is in apublic physical network, through the isolating mechanism relatively, relatively independent torun multiple virtual network to select the physical resources for the allocation and scheduling,making the physical network resources to maximize the use, reducing the network operatingcosts, improving the quality of network service. Network virtualization brings theseconvenient but also brings new challenges for network resource management.The current status of the network virtualization at home and abroad are introduced in thispaper at first, highlighting several important international researching network virtualizationprojects, including projects such as GENI, as OpenFlow. Secondly, the key technologies ofnetwork virtualization are introduced, including the design of virtual nodes and virtual links,the virtual network mapping, the identity of the identification and addressing in the virtualnetwork, the management and scheduling for the virtual network resource, and so on. In thisarticle, we improve the mapping algorithm on the virtual network of the virtual nodes andvirtual links, and this algorithm is used in the experimental platform for networkvirtualization.In the current, at home and abroad, studying the virtual node mapping algorithms most only considers the CPU utilization as the only resource, ignoring the impact of the memory.But in the actual mapping process, the memory size for generating virtual nodes has a greatinfluence. In this paper, for the virtual node mapping, we design a virtual node mappingalgorithm for the minimum busy. The so-called minimum busy refers to select the physicalnodes with more remaining CPU and memory firstly. Not just refer to the CPU as the onlyreference value. When there has enough memory, the CPU is as the main reference value.When the memory is not sufficient, the memory constraints limit the virtual node mapping.The value of busy degree can be the total CPU and memory resources compared to theremainder of the CPU and the remaining memory size. The smaller value descries the lowerbusy degree. This node mapping algorithm can effectively balance the physical network nodepressure to reduce the possibility of a bottleneck node, improving the physical network load,making the network resources used in balance.For the virtual link mapping algorithm, this article describes a path splitting virtual linkmapping algorithm. The so-called path splitting mapping algorithm is when the virtual linkcorresponding the virtual node can not meet the mapping needs, we can consider this virtuallink is mapped on two or more physical links for meeting the virtual link requirements. Thisalgorithm largely avoided the current greedy mapping algorithm can not meet the linkmapping needs. When a physical node corresponding to a virtual node on the physical linkcan not meet the constraints of the virtual link, in accordance with the ordinary greedymapping algorithm, it needs to be virtual node re-mapping, to meet the constraints of thevirtual link. By using the path splitting link mapping algorithm, we can calculate thebandwidth of multiple physical links on this physical node, able to meet the constraints of thevirtual link and virtual nodes do not need to re-map. Therefore, this link mapping algorithmcan effectively reduce the probability of virtual node quadratic remapping, improve thephysical net work resources utilization, make the network link load balance and ensure thereliability of the link.In the current, the research network virtualization technology is in the theoretical stage athome. There is no experiment platform for network virtualization. The fourth chapterdescribes the network virtualization experiment management platform; the platform is aprototype system of the experimental platform of network virtualization. Through thisplatform, users can submit virtual network request. The platform accepts the user’s request,according to the virtual node mapping algorithm and the virtual link mapping algorithm, mapsthe virtual nodes and virtual links in the request of the virtual network to the physical network.And the platform sends the configuration files to the physical nodes; the physical nodes receive the files, generating virtual nodes according to the configuration files, and configurethe virtual network to complete the virtual network mapping process. The users can login thevirtual network through the platform to configure their own network experiments for thevirtualization research.The platform uses the minimum peak-degree virtual node mapping algorithm andpath-splitting virtual link mapping algorithm mapping the virtual requests. After repeatedrequests, the two mapping algorithms can be effective virtual network mapping.