Virtual link priority mapping method based on path sorting

Abstract

The invention discloses a virtual link priority mapping method based on path sorting, and relates to the technical field of communication. Firstly, constructing a physical network topology G, and copying an auxiliary graph G_copy; calculating the weight of each virtual link of the link request bandwidth corresponding to the current service, and arranging the weights in an inverted order to obtaina new set VLs_sorted; sequentially taking out a certain virtual link VL according to an inverted sequence; respectively setting a mapping node candidate set vnode1_cand and a mapping node candidate set vnode2_cand of the virtual nodes at the two ends; and selecting one node from each of the candidate paths to generate at least one shortest candidate path, sequentially scoring the shortest candidate paths, arranging the shortest candidate paths in an inverted order to obtain a candidate path set path_cand_xgb, and sequentially selecting the candidate paths from the candidate path set path set path_cand_xgb to perform link mapping on the G_copy; and finally, calculating resource quantity of idle computing resources meeting the computing resource quantity requested by the virtual node on thephysical node mapped by each virtual node on the path, setting node resource occupation and link resource occupation in G, and enabling mapping of the virtual link VL to be successful. According to the invention, resource distribution is optimized, the stability of virtual link mapping is improved, and the blocking rate in the transmission process is reduced.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a virtual link priority mapping method based on path sorting. Background technique [0002] In the face of the rapid development of new services such as big data and cloud computing, the explosive growth of Internet services and the diversification of user needs, network resources have become particularly tense. In order to alleviate the pressure on network resources, researchers have proposed network virtualization technology. Through the virtual network resource mapping algorithm, multiple logically isolated virtual networks can share the underlying physical network data resources to achieve flexible management of network resources. [0003] At present, there have been a large number of literatures on the virtual link mapping problem, mainly based on the allocation of network virtual resources based on different objectives. Combined with different allocation objectives, ...

AI Technical Summary

Problems solved by technology

However, in the process of calculating weights, resources of different dimensions are used as weights for direct weighting, which makes it difficult to explain the rationality and difficult to deploy in actual networks.

Images