Virtual network reliable mapping method capable of considering constraint of geographic position

Abstract

The invention discloses a virtual network reliable mapping method capable of considering constraint of a geographic position. The virtual network reliable mapping method capable of considering the constraint of the geographic position comprises the following steps of backing up virtual nodes and adjacent links in a virtual network to become a reinforced virtual network, so as to ensure the survivability of the virtual nodes; under the condition of meeting the constraint of the geographic position, firstly mapping the virtual nodes and the adjacent links in the virtual network, secondly mapping the backup virtual nodes and the backup adjacent links, so as to finish the mapping from the whole virtual network to an infrastructure network. Therefore, according to the virtual network reliable mapping method capable of considering the constraint of the geographic position, which is disclosed by the invention, the share of a node resource can be realized, the cost of mapping is reduced, and the increasing trend of the current social network information capacity can be fitted.

Description

technical field [0001] The invention belongs to the technical field of Internet communication, and more specifically relates to a virtual network reliable mapping method considering geographic location constraints. Background technique [0002] With the rapid development of Internet technology, the Internet has become an important infrastructure in modern society, and the existing Internet architecture has played an important role in promoting the rapid development of the Internet. However, with the emergence of new Internet applications, different applications have different requirements for the underlying network in terms of security, service quality, and scalability. It is difficult for the existing Internet architecture to keep up with the development needs of these applications. To some extent, it presents a rigid phenomenon, which makes it difficult for some new applications to be applied to the existing network architecture, such as differentiated services and IP mult...

AI Technical Summary

Problems solved by technology

The K-redundancy mapping algorithm adds a backup node to each virtual node. Although it solves the problems of difficult determination of the backup node and easy route selection when the corresponding link of the failure node is mapped, it still does not consider the constraints of the virtual node's geographical location. , does not match the actual situation

Images