CN104320324A - Virtual network mapping method based on link interference - Google Patents

Abstract

The invention discloses a virtual network mapping method based on link interference. The virtual network mapping method is characterized in that in virtual network mapping, link interference is introduced to measure topological information of the time dimension of an infrastructure network; according to available bandwidth resources and interference of links of the infrastructure network, a webpage sorting algorithm is used for calculating sorting values of nodes of the infrastructure network; according to the nodes requested by a virtual network, bandwidth requirements of the resources and the links are calculated, and the sorting values of the virtual nodes are calculated; node mapping is carried out by using a greedy matching algorithm; the available bandwidth and interference values of the links of the infrastructure network are weighted, and a shortest path algorithm is used for carrying out link mapping. By the adoption of the virtual network mapping method based on link interference, the average yield of infrastructure providers and the average acceptance rate of virtual network requirements can be increased substantially.

Description

A kind of mapping method of virtual network based on link interference

Technical field

The invention belongs to technical field of the computer network, be specifically related to the mapping method of virtual network based on link interference.

Background technology

" diversification internet " (IEEE GlobeCom of IEEE global communication international conference, vol.2, pp.755-760,2005) one the article pointed out, network virtualization technology can by infrastructure provider and Internet Service Provider based on the decoupling zero of conventional the Internet service provider, and allow the network of multiple Internet Service Provider to share same underlying infrastructure Internet resources.In network virtualization environment, infrastructure provider is responsible for structure, maintenance and management bottom physical network device; Internet Service Provider leases resource according to demand for services to infrastructure provider, builds and runs the virtual network customized, and providing end-to-end service." the Resourse Distribute challenge in network virtualization " (20th ITC Specialist Seminar of 20th international telecommunication service meeting charrette, vol.18, pp18-20,2009) one the article pointed out, the significant challenge that network virtualization faces is that virtual network maps, namely according to the node of virtual network requests (Virtual Network Request) and the resource requirement of link of service provider, be reasonably the Internet resources of its distribution basis infrastructure provider.

Through finding existing literature search, map this non-determined type multinomial difficulty (NP-hard) problem for solving virtual network, the decoupling zero of virtual network mapping problems is mainly two stages by existing method: node mapping and link maps." self-examination virtual network maps: the segmentation of infrastructure network support path and migration " (ACM SIGCOMM of Association for Computing Machinery's data communication special interest group, vol.38 (2), pp.17-29,2008) literary composition proposes the mapping method of virtual network based on a kind of time window model, but it only considered infrastructure network Local resource information in node mapping." mapping based on the virtual network of topology ambiguity node sequencing " (ACM SIGCOMM, vol.41 (2), pp.38-47,2011) literary composition is on the basis of time window model, based on random walk (Random Walk) thought, propose a kind of random walk-greediness coupling-shortest path (RW-MM-SP) method, but it does not have the Global Topological information fully excavating infrastructure network and virtual network in node mapping." virtual network leading based on the income of global resource information maps " (IEEE GlobeCom, pp.2294-2299,2013) literary composition is based on webpage sorting (PageRank) algorithm, the Global Topological resource information of further excavation infrastructure network and virtual network, proposes the mapping method of virtual network (RD-VNE) that a kind of income is leading.; virtual network mapping is the process of online (On Line); above-mentioned virtual network mapping algorithm is all intended to the topology information excavating infrastructure network and virtual network dimension; and have ignored the topology information of infrastructure network time dimension; the mapping result of greedy optimization current virtual network, thus cause these mapping method of virtual networks existing tool on time dimension to bear the character of much blindness.

Summary of the invention

The object of the invention is to propose a kind of mapping method of virtual network based on link interference, employing link interference weighs the topology information on infrastructure network time dimension, and considered in node mapping and link maps, to reduce the blindness of existing mapping method of virtual network on time dimension, realize the object improving the average yield of infrastructure provider and the average receptance of virtual network requests further.

The present invention is based on the mapping method of virtual network of link interference, comprising: in each time window on a timeline, use income formula

$\mathrm{Revenue}\left({\mathrm{VNR}}_i\right)=\{{\mathrm{\α}}^C\underset{u\∈V_v}{\mathrm{\Σ}}r\_\mathrm{cpu}\left(u\right)+{\mathrm{\α}}^B\underset{(u,v)\∈E_v}{\mathrm{\Σ}}r\_\mathrm{bw}(u,v)\}{\mathrm{\τ}}_i---\left(1\right)$

Window computing time interior that arrive and each virtual network requests in request queue income Revenue, wherein V _vand E _vrepresent virtual network requests VNR respectively _inode set and link set, r_cpu (u) represents dummy node u (u ∈ V _v) computational resource requirements, r_bw (u, v) represents virtual link (u, v) ((u, v) ∈ E _v) bandwidth resources demand, α ^cand α ^brepresent the computational resource of infrastructure provider and the unit price of bandwidth resources respectively, τ _ifor the life span of virtual network requests; Then, carry out virtual network mapping successively from big to small according to the income Revenue of virtual network requests: if node mapping and link maps are all successful, then virtual network requests maps successfully, upgrade the available resources of infrastructure network; If map unsuccessfully and this request map failed number of times do not exceed upper limit Th, then joined in request queue, postpone to remap; If virtual network requests maps failed number of times and reaches upper limit Th, then initiatively refuse this virtual network requests;

It is characterized in that:

In virtual network maps, the topology information of entrance link weighting of noise infrastructure network time dimension; According to the available bandwidth resources of infrastructure network link and the ranking value of interference use Algorithms for Page Ranking computing basic facility network node, and according to the node calculate resource of virtual network requests and the ranking value of link bandwidth demand calculating dummy node, use greedy matching algorithm to carry out node mapping; The available bandwidth of weighted basis facility network link and interference value use shortest path first to carry out link maps; Concrete operating procedure is as follows:

The first step: use link interference formula

$I(u,v)=\frac{C_B\left(u\right)}{\mathrm{deg}\left(u\right)}+\frac{C_B\left(v\right)}{\mathrm{deg}\left(v\right)},\∀u,v\∈V_s---\left(2\right)$

The interference of all links of computing basic facility network, wherein I (u, v) represents the link interference of infrastructure network link (u, v), V _srepresent infrastructure network node set, symbol C _b(i) and deg (i) (i=u, v) betweenness centrality (Betweenness Centrality) and degree centrality (Degree Centrality) of infrastructure network node i (i=u, v) is represented respectively;

Second step: use infrastructure network node sequencing formula

${\mathrm{AR}}_u=(1-\mathrm{\ϵ})\underset{v\∈N\left(u\right)}{\mathrm{\Σ}}\frac{m(v,u){\mathrm{AR}}_v}{{\mathrm{\Σ}}_{w\∈N\left(v\right)}m(w,v)}+\mathrm{\ϵ},\∀u,v\∈V_s---\left(3\right)$

The ranking value AR of all nodes of computing basic facility network, wherein AR _urepresent the ranking value of infrastructure network node u, N (u) represents the node set be directly connected with node u, parameter ε ∈ (0,1), the bandwidth resources availability m (u, v) of infrastructure network link (u, v) is defined as:

$m(u,v)=\mathrm{\γnorm}(a\_\mathrm{bw}(u,v))+(1-\mathrm{\γ})\mathrm{norm}\left(\frac{1}{I(u,v)}\right)$

Wherein a_bw (u, v) represents the available bandwidth resources of infrastructure network link (u, v), and norm () represents normalization operation, γ ∈ (0,1);

3rd step: use dummy node sequence formula

${\mathrm{RR}}_u=d\underset{v\∈N\left(u\right)}{\mathrm{\Σ}}\frac{r\_\mathrm{bw}(v,u){\mathrm{RR}}_v}{{\mathrm{\Σ}}_{w\∈N\left(v\right)}r\_\mathrm{bw}(w,v)}+(1-d)c\left(u\right),\∀u,v\∈V_v---\left(4\right)$

Calculate the ranking value RR of all dummy nodes, wherein RR _urepresent the ranking value of dummy node u, N (u) represents the node set be directly connected with node u, d ∈ (0,1),

4th step: node mapping, concrete mapping flow process is as follows: the non-mapping node set of initialization is the node set V of virtual network requests _v, facility set of network nodes V based on enabled node set _s; Be repeated below operation until node mapping terminates: if non-mapping node set is empty set, then node mapping success, node mapping terminates; Otherwise, select the dummy node vNode that wherein ranking value RR is maximum, in enabled node set, search for the node that can meet dummy node vNode computational resource requirements form feasible node set; If feasible node set is empty set, then node mapping failure, node mapping terminates; Otherwise dummy node vNode and infrastructure network node sNode as the mapping result of dummy node vNode, and never removes in mapping node set and enabled node set by node sNode respectively that select wherein ranking value AR maximum;

5th step: link maps, concrete mapping flow process is as follows: the non-mapping link set of initialization is the link set E of virtual network requests _v, the available resource information of backup infrastructure network; Be repeated below operation until link maps terminates the available resource information of rear use backup information reduction infrastructure network: if non-mapping link set is empty set, then link maps success, link maps terminates; Otherwise, never the virtual link vLink that bandwidth resource requirement is maximum is selected in mapping link set, all nodes of infrastructure network and the link that can meet virtual link vLink bandwidth resources demand are extracted the infrastructure network topology that formation one simplifies, use link metric computing formula

$\mathrm{\χ}(u,v)=\mathrm{\βnorm}\left(I(u,v)\right)+(1-\mathrm{\β})\mathrm{norm}\left(\frac{1}{a\_\mathrm{bw}(u,v)}\right)---\left(5\right)$

The weights of the infrastructure network topology link of computational short cut, wherein χ (u, v) represents the weights of infrastructure network link (u, v), β ∈ (0,1); Link metric and minimum path P is searched between the infrastructure node using shortest path first to map at the dummy node at virtual link vLink two ends; If path P does not exist, then link maps failure, link maps terminates; Otherwise using the mapping result of path P as virtual link vLink, upgrade the available bandwidth resources of all links in path P, and remove in virtual link vLink never mapping link set;

6th step: according to the result of node mapping and link maps, upgrades the available resource information of infrastructure network.

The inventive method weighs the topology information of infrastructure network time dimension owing to taking entrance link interference, and apply it in node mapping and link maps, ignore the topology information of infrastructure network time dimension compared to traditional virtual network mapping algorithm, the time dimension topology information that the present invention all employ infrastructure network in node mapping and link maps is assisted; Owing to considering the topology information of infrastructure network time dimension, adopt the inventive method can reduce virtual network and be mapped in blindness on time dimension, significantly improve the average yield of infrastructure network and the average receptance of virtual network requests.

Accompanying drawing explanation

Fig. 1 is based on time window model virtual network mapping flow process.

Fig. 2 is the average yield comparison diagram of the infrastructure network provider of three kinds of mapping method of virtual networks.

Fig. 3 is the average receptance comparison diagram of the virtual network requests of three kinds of mapping method of virtual networks.

Embodiment

Below in conjunction with drawings and Examples, the present invention is further described in detail.

Embodiment 1:

The present invention is based on the mapping method of virtual network of link interference, comprising: in each time window on a timeline, use income formula (1), namely

$\mathrm{Revenue}\left({\mathrm{VNR}}_i\right)=\{{\mathrm{\α}}^C\underset{u\∈V_v}{\mathrm{\Σ}}r\_\mathrm{cpu}\left(u\right)+{\mathrm{\α}}^B\underset{(u,v)\∈E_v}{\mathrm{\Σ}}r\_\mathrm{bw}(u,v)\}{\mathrm{\τ}}_i$

Window computing time interior that arrive and each virtual network requests in request queue income Revenue, wherein V _vand E _vrepresent virtual network requests VNR respectively _inode set and link set, r_cpu (u) represents dummy node u (u ∈ V _v) computational resource requirements, r_bw (u, v) represents virtual link (u, v) ((u, v) ∈ E _v) bandwidth resources demand, α ^cand α ^brepresent the computational resource of infrastructure provider and the unit price of bandwidth resources respectively, τ _ifor the life span of virtual network requests; Then, carry out virtual network mapping successively from big to small according to the income Revenue of virtual network requests: if node mapping and link maps are all successful, then virtual network requests maps successfully, upgrade the available resources of infrastructure network; If map unsuccessfully and this request map failed number of times do not exceed upper limit Th, then joined in request queue, postpone to remap; If virtual network requests maps failed number of times and reaches upper limit Th, then initiatively refuse this virtual network requests;

The virtual network that Fig. 1 gives based on time window model maps flow process, and as shown in fig. 1: the virtual network based on time window model maps, carry out a virtual network at the end of each time window on a timeline and map, concrete flow process is as follows:

Releasing resource (S1): the infrastructure network resource in release time window shared by all virtual network requests left because life cycle terminates, upgrades the available resource information of infrastructure network;

Collect virtual network requests (S2): arrive in acquisition time window with all virtual network requests in request queue, income formula (1) is used to calculate the income Revenue of each virtual network requests, and according to income descending sort;

Virtual network maps (S3): use the mapping method of virtual network that the present invention is based on link interference to map virtual network requests successively, comprising node mapping and link maps according to income Revenue order from big to small; If wherein the node mapping of any one virtual network requests and link maps are all successful, then this virtual network requests maps successfully, and upgrades the available resource information of infrastructure network; If to map unsuccessfully and the number of times of failure does not exceed the upper limit Th pre-set, then joined request queue, postpone to remap; If map the frequency of failure to exceed upper limit Th, then initiatively refuse this virtual network requests.

The mapping method of virtual network based on link interference in the present embodiment specifically comprises the steps:

The first step: use link interference formula (2), namely

$I(u,v)=\frac{C_B\left(u\right)}{\mathrm{deg}\left(u\right)}+\frac{C_B\left(v\right)}{\mathrm{deg}\left(v\right)},\∀u,v\∈V_s$

The interference of all links of computing basic facility network, wherein I (u, v) represents the link interference of infrastructure network link (u, v), V _srepresent infrastructure network node set, symbol C _bi () and deg (i) (i=u, v) represent betweenness centrality and the degree centrality of infrastructure network node i (i=u, v) respectively; Particularly point out, link interference only needs just to need when infrastructure network topology changes again to upgrade;

Second step: use infrastructure network node sequencing formula (3), namely

${\mathrm{AR}}_u=(1-\mathrm{\ϵ})\underset{v\∈N\left(u\right)}{\mathrm{\Σ}}\frac{m(v,u){\mathrm{AR}}_v}{{\mathrm{\Σ}}_{w\∈N\left(v\right)}m(w,v)}+\mathrm{\ϵ},\∀u,v\∈V_s$

The ranking value AR of all nodes of computing basic facility network, wherein AR _urepresent the ranking value of infrastructure network node u, N (u) represents the node set be directly connected with node u, parameter ε ∈ (0,1) for ensureing that each infrastructure network node has unique node sequencing value, infrastructure network link (u, v) bandwidth resources availability m (u, v) is defined as

$m(u,v)=\mathrm{\γnorm}(a\_\mathrm{bw}(u,v))+(1-\mathrm{\γ})\mathrm{norm}\left(\frac{1}{I(u,v)}\right)$

Wherein a_bw (u, v) represents the available bandwidth resources of infrastructure network link (u, v), and norm () represents normalization operation, and γ ∈ (0,1) is for the available bandwidth of link and the compromise of interference;

3rd step: use dummy node sequence formula (4), namely

${\mathrm{RR}}_u=d\underset{v\∈N\left(u\right)}{\mathrm{\Σ}}\frac{r\_\mathrm{bw}(v,u){\mathrm{RR}}_v}{{\mathrm{\Σ}}_{w\∈N\left(v\right)}r\_\mathrm{bw}(w,v)}+(1-d)c\left(u\right),\∀u,v\∈V_v$

Calculate the ranking value RR of all dummy nodes, wherein RR _urepresent the ranking value of dummy node u, N (u) represents the node set be directly connected with node u, d ∈ (0,1) for the compromise resource requirement of virtual network requests node calculate and link bandwidth resource demand on the impact of node sequencing value;

4th step: node mapping, concrete mapping flow process is as follows:

4A is step by step: the non-mapping node set of initialization is the node set V of virtual network requests _v, facility set of network nodes V based on enabled node set _s;

4B is step by step: if non-mapping node set is empty set, then node mapping success, and node mapping terminates; Otherwise, select the dummy node vNode that wherein ranking value RR is maximum, in enabled node set, search for the node that can meet dummy node vNode computational resource requirements form feasible node set;

4C is step by step: if feasible node set is empty set, then node mapping failure, and node mapping terminates; Otherwise the node sNode selecting wherein ranking value AR maximum is as the mapping result of dummy node vNode, and dummy node vNode and infrastructure network node sNode is never removed in mapping node set and enabled node set respectively;

4D is step by step: repeat 4B step by step with 4C step by step until node mapping terminates;

5th step: link maps, concrete mapping flow process is as follows:

5A is step by step: the non-mapping link set of initialization is the link set E of virtual network requests _v, the available resource information of backup infrastructure network;

5B is step by step: if non-mapping link set is empty set, then link maps success, link maps terminates, otherwise, never the virtual link vLink that bandwidth resource requirement is maximum is selected in mapping link set, all nodes of infrastructure network and the link that can meet virtual link vLink bandwidth resources demand are extracted the infrastructure network topology that formation one simplifies, use link metric computing formula (5) namely

$\mathrm{\χ}(u,v)=\mathrm{\βnorm}\left(I(u,v)\right)+(1-\mathrm{\β})\mathrm{norm}\left(\frac{1}{a\_\mathrm{bw}(u,v)}\right)$

The weights of the infrastructure network topology link of computational short cut, wherein χ (u, v) represents the weights of infrastructure network link (u, v), and β ∈ (0,1) is for link available bandwidth resources and the interference of compromising;

5C is step by step: search for link metric and minimum path P between the infrastructure node using shortest path first to map at the dummy node at virtual link vLink two ends;

5D is step by step: if path P does not exist, then link maps failure, and link maps terminates; Otherwise using the mapping result of path P as virtual link vLink, upgrade the available bandwidth resources of all links in path P, and remove in virtual link vLink never mapping link set;

5E is step by step: repeat 5B step by step, 5C step by step with 5D step by step, until link maps terminates; And at the end of link maps, use the available resource information of backup information reduction infrastructure network;

6th step: according to the result of node mapping and link maps, upgrades the available resource information of infrastructure network.

Here takes simulation comparison to the present invention is based on the mapping method of virtual network of link interference and the performance of existing RW-MM-SP and RD-VNE mapping method of virtual network in the present embodiment, and the performance index of contrast comprise: the average yield of infrastructure provider and the average receptance of virtual network requests;

The average yield of infrastructure provider: the average yield of infrastructure provider is defined as virtual network requests income Revenue sum and the ratio of time of infrastructure network acceptance, namely wherein R (t) represents the income sum of all virtual network requests that t accepts;

The average receptance of virtual network requests: the average receptance of virtual network requests is defined as the number of virtual network requests of infrastructure network acceptance and the ratio of the virtual network requests sum of arrival, namely wherein A _tthe sum of the virtual network requests accepted before representing moment T, R _tthe sum of the virtual network requests arrived before representing moment T;

Emulation in the present embodiment specifically arranges as follows:

Infrastructure network: use GT-ITM topological tools stochastic generation to have the infrastructure network topology of 100 nodes and 570 links, and the available computational resources of infrastructure network interior joint and the available bandwidth resources of link are the random value being evenly distributed on 50 to 100;

Virtual network requests: the arrival process of virtual network requests is Poisson process, every 100 time quantums on average arrive 5 virtual network requests; The life span obeys index distribution of virtual network requests, and the mean survival time be 500 time quantums; For each virtual network requests, virtual network topology is produced at random by GT-ITM topological tools, and dummy node number is evenly distributed between 2 to 20, and the probability be connected between dummy node is 0.5; The computational resource of dummy node and the bandwidth resources demand of virtual link are the random value be evenly distributed between 1 to 50;

As follows to specifically arranging of the correlation formula parameter in the inventive method in the present embodiment: the parameter alpha of income formula (1) ^c, α ^ball be set to 1; The parameter ε of infrastructure network node sequencing formula (3) does not comprise any effective information, and therefore, be set to 0.01, parameter γ is set to 0.9; The parameter d of dummy node sequence formula (4) is set to 0.85; The parameter beta of link metric formula (5) is set to 0.3;

Each analogue simulation running time of the present embodiment is 50000 time quantums, during this period of time, about has 2500 virtual network requests to arrive; The mapping failure upper limit Th of each virtual network requests is set to 0, represents to map and unsuccessfully then initiatively refuses virtual network requests; Finally use the mean value of 100 analog simulation results to represent for the result contrasted, concrete comparing result is with reference to Fig. 2 and Fig. 3; Wherein, Fig. 2 is the average yield comparison diagram of the infrastructure network provider of three kinds of mapping method of virtual networks, and Fig. 3 is the average receptance comparison diagram of the virtual network requests of three kinds of mapping method of virtual networks.Solid line A1 in Fig. 2 represents the time dependent curve of average receipts used based on the infrastructure provider of the mapping method of virtual network of link interference, and dotted line A2 above and dotted line A3 below represents the time dependent curve of average yield of the infrastructure provider using RD-VNE and RW-MM-SP two kinds of mapping method of virtual networks respectively; Solid line B1 in Fig. 3 represents the time dependent curve of average receptance used based on the virtual network mapping scheme virtual network requests of link interference, and dotted line B2 above and dotted line B3 below represents the time dependent curve of the average receptance of virtual network requests using RD-VNE and RW-MM-SP mapping method of virtual network respectively.

As seen from Figure 2, more existing RD-VNE and RW-MM-SP mapping method of virtual network, the virtual network mapping algorithm that the present invention is based on link interference can improve the average yield of infrastructure provider significantly; Wherein, comparatively RW-MM-SP mapping method of virtual network, the average yield of infrastructure network improves about 5%; Comparatively RD-VNE virtual network mapping algorithm, the average yield of infrastructure network improves about 4%; As seen from Figure 3, more existing RD-VNE and RW-MM-SP mapping method of virtual network, the virtual network mapping algorithm that the present invention is based on link interference can improve the average receptance of virtual network requests significantly; Wherein, comparatively RW-MM-SP mapping method of virtual network, the average receptance of virtual network requests improves about 5%; Comparatively RD-VNE mapping method of virtual network, the average receptance of virtual network requests improves about 4%; Therefore, the mapping method of virtual network based on link interference is used can to improve the average yield of infrastructure provider and the average receptance of virtual network requests significantly.

Claims (1)

1. based on a mapping method of virtual network for link interference, comprising: in each time window on a timeline, use income formula

$\mathrm{Revenue}\left({\mathrm{VNR}}_i\right)=\{{\mathrm{\α}}^C\underset{u\∈V_v}{\mathrm{\Σ}}r\_\mathrm{cpu}\left(u\right)+{\mathrm{\α}}^B\underset{(u,v)\∈E_v}{\mathrm{\Σ}}r\_\mathrm{bw}(u,v)\}{\mathrm{\τ}}_i$

Window computing time interior that arrive and each virtual network requests in request queue income Revenue, wherein V _vand E _vrepresent virtual network requests VNR respectively _inode set and link set, r_cpu (u) represents dummy node u, u ∈ V _v, computational resource requirements, r_bw (u, v) represents virtual link (u, v), (u, v) ∈ E _v, bandwidth resources demand, α ^cand α ^brepresent the computational resource of infrastructure provider and the unit price of bandwidth resources respectively, τ _ifor the life span of virtual network requests; Then, carry out virtual network mapping successively from big to small according to the income Revenue of virtual network requests: if node mapping and link maps are all successful, then virtual network requests maps successfully, upgrade the available resources of infrastructure network; If map unsuccessfully and this request map failed number of times do not exceed upper limit Th, then joined in request queue, postpone to remap; If virtual network requests maps failed number of times and reaches upper limit Th, then initiatively refuse this virtual network requests;

It is characterized in that:

In virtual network maps, the topology information of entrance link weighting of noise infrastructure network time dimension; According to the available bandwidth resources of infrastructure network link and the ranking value of interference use Algorithms for Page Ranking computing basic facility network node, and according to the node calculate resource of virtual network requests and the ranking value of link bandwidth demand calculating dummy node, use greedy matching algorithm to carry out node mapping; The available bandwidth of weighted basis facility network link and interference value use shortest path first to carry out link maps; Concrete operating procedure is as follows:

The first step: use link interference formula

$I(u,v)=\frac{C_B\left(u\right)}{\mathrm{deg}\left(u\right)}+\frac{C_B\left(v\right)}{\mathrm{deg}\left(v\right)},\∀u,v\∈V_s$

The interference of all links of computing basic facility network, wherein I (u, v) represents the link interference of infrastructure network link (u, v), V _srepresent infrastructure network node set, symbol C _bi () and deg (i), i=u, v, represent infrastructure network node i, i=u, v respectively, betweenness centrality and degree centrality;

Second step: use infrastructure network node sequencing formula

${\mathrm{AR}}_u=(1-\mathrm{\ϵ})\underset{v\∈N\left(u\right)}{\mathrm{\Σ}}\frac{m(v,u){\mathrm{AR}}_v}{{\mathrm{\Σ}}_{w\∈N\left(v\right)}m(w,v)}+\mathrm{\ϵ},\∀u,v\∈V_s$

The ranking value AR of all nodes of computing basic facility network, wherein AR _urepresent the ranking value of infrastructure network node u, N (u) represents the node set be directly connected with node u, parameter ε ∈ (0,1), the bandwidth resources availability m (u, v) of infrastructure network link (u, v) is defined as:

$m(u,v)=\mathrm{\γnorm}(a\_\mathrm{bw}(u,v))+(1-\mathrm{\γ})\mathrm{norm}\left(\frac{1}{I(u,v)}\right)$

Wherein a_bw (u, v) represents the available bandwidth resources of infrastructure network link (u, v), and norm () represents normalization operation, γ ∈ (0,1);

3rd step: use dummy node sequence formula

${\mathrm{RR}}_u=d\underset{v\∈N\left(u\right)}{\mathrm{\Σ}}\frac{r\_\mathrm{bw}(v,u){\mathrm{RR}}_v}{{\mathrm{\Σ}}_{w\∈N\left(v\right)}r\_\mathrm{bw}(w,v)}+(1-d)c\left(u\right),\∀u,v\∈V_v$

Calculate the ranking value RR of all dummy nodes, wherein RR _urepresent the ranking value of dummy node u, N (u) represents the node set be directly connected with node u, d ∈ (0,1),

4th step: node mapping, concrete mapping flow process is as follows: the non-mapping node set of initialization is the node set V of virtual network requests _v, facility set of network nodes V based on enabled node set _s; Be repeated below operation until node mapping terminates: if non-mapping node set is empty set, then node mapping success, node mapping terminates; Otherwise, select the dummy node vNode that wherein ranking value RR is maximum, in enabled node set, search for the node that can meet dummy node vNode computational resource requirements form feasible node set; If feasible node set is empty set, then node mapping failure, node mapping terminates; Otherwise dummy node vNode and infrastructure network node sNode as the mapping result of dummy node vNode, and never removes in mapping node set and enabled node set by node sNode respectively that select wherein ranking value AR maximum;

5th step: link maps, concrete mapping flow process is as follows: the non-mapping link set of initialization is the link set E of virtual network requests _v, the available resource information of backup infrastructure network; Be repeated below operation until link maps terminates the available resource information of rear use backup information reduction infrastructure network: if non-mapping link set is empty set, then link maps success, link maps terminates; Otherwise, never the virtual link vLink that bandwidth resource requirement is maximum is selected in mapping link set, all nodes of infrastructure network and the link that can meet virtual link vLink bandwidth resources demand are extracted the infrastructure network topology that formation one simplifies, use link metric computing formula

$\mathrm{\χ}(u,v)=\mathrm{\βnorm}\left(I(u,v)\right)+(1-\mathrm{\β})\mathrm{norm}\left(\frac{1}{a\_\mathrm{bw}(u,v)}\right)$

The weights of the infrastructure network topology link of computational short cut, wherein χ (u, v) represents the weights of infrastructure network link (u, v), β ∈ (0,1); Link metric and minimum path P is searched between the infrastructure node using shortest path first to map at the dummy node at virtual link vLink two ends; If path P does not exist, then link maps failure, link maps terminates; Otherwise using the mapping result of path P as virtual link vLink, upgrade the available bandwidth resources of all links in path P, and remove in virtual link vLink never mapping link set;

6th step: according to the result of node mapping and link maps, upgrades the available resource information of infrastructure network.