CN105262669A - Virtual network mapping method - Google Patents

Abstract

The invention discloses a virtual network mapping method which includes the steps that 1, a request queue and a service gateway queue are generated; 2, whether a virtual request resource which is not mapped successfully exits or not is judged, and if yes, step 3 is executed; if not, virtual resource request mapping is ended; 3, a service gateway is selected; 4, underlying cluster selection is conducted; 5, whether virtual resource request mapping is solvable or not is judged, if yes, virtual network mapping is conducted, an underlying physical network resource state is updated, the request is deleted, and step 2 is executed; if not, step 6 is executed; 6, whether the underlying cluster range is smaller than the service gateway management region or not is judged, if yes, the underlying cluster range is broadened, and step 5 is executed; if not, the service gateway is deleted, and step 7 is executed; 7, whether the service gateway queue is empty or not, and if not, step 3 is executed; if yes, step 8 is executed; 8, whether times of queuing again exceed the preset times or not is judged, if yes, the request is rejected, and step 2 is executed; if not, the request is sent to a waiting queue, and step 2 is executed. By means of the virtual network mapping method, the mapping success number is maximized.

Description

A kind of mapping method of virtual network

Technical field

The present invention relates to communication technical field, particularly relate to a kind of mapping method of virtual network.

Background technology

Along with the develop rapidly of science and technology and the powerful driving of social demand, and the generation cost of the evolution of the data mode of production and data sharply declines, and the data that the mankind produce just exponentially level increase.Due to the sharply expansion of data scale, all trades and professions accumulation data volume more and more huger, data type also more and more various, become increasingly complex, surmounted the limit of power of traditional data management system and tupe.Up to now, along with the paces of we appearance 5G, temporarily also there is no the technology of the wireless link capacity that air-link resources can be made significantly to increase.The available bandwidth that LTE is just current, close to the spectrum efficiency limit, therefore, the suggestion of most radio new technology will cause only having the capacity progressively improving single wireless link.In order to realize the remarkable increase of 5G capacity, we will face huge challenge.

In the face of the unprecedented challenge that wireless communication industry faces, meet growing network capacity requirements, support a large amount of on-line joining process device and larger data transfer rate, future wireless network should be able to provide service customization (virtual) network, Here it is our so-called MyNET, to meet the requirement of different business amount demand and each service.Simultaneously, on network operation, it will be one of the technology of most critical that service-oriented virtual network creates (SONAC) automatically, enable to run multiple virtual network, and serving multiple and while the service of depositing, sharing common network resource pond efficiently.

In order to facilitate 5G network transformation to change, network function virtual (NFV) and software definition networking (SDN) two large technology arise at the historic moment.Based on the principle of NFV and SDN, multiple virtual network can via a public network infrastructure support, and wherein each virtual network is the concrete definition to a service, meets service mode and requirement.In order to provide necessary flexibility to enable to realize customized network and control/management framework flexibly, the network node of selection should be able to be designed to the node of NFV ability.Have the network node of NFV ability can be counted as the container of function element, it can be configured according on the basis of demand.

Following wireless network must customer-centric, user's request is extracted into virtual network requests, and then forms the virtual network combined by logic function node and logical links.Finally, virtual network mapping algorithm is used to carry out virtual network to be mapped in bottom-layer network the service carrying out processing completing user request in a network.But existing virtual network algorithm easily shines into the failure of link maps in link maps process because node mapping is unreasonable, cause virtual network to be mapped to power low.

Summary of the invention

The object of the invention is to overcome the deficiencies in the prior art, a kind of mapping method of virtual network is provided, introduce time window, virtual resource request in time window is sorted, then with different levels mapping area selection is carried out to virtual network requests, thus reach Loss reducing and transmission delay, and realize mapping the maximization of successful quantity.

The object of the invention is to be achieved through the following technical solutions: a kind of mapping method of virtual network, comprises the following steps:

S1. generate the request queue in current time window and gateway queue, the virtual resource request in request queue is arranged according to its priority order from high to low;

S2. judge in request queue, whether to there is the not mapped success of virtual resource request:

If there is the not mapped success of virtual resource request, then jump procedure S3;

If there is not the not mapped success of virtual resource request, then the virtual resource request terminated in this time window maps, and waits for next time window;

S3. select the virtual resource request that request queue medium priority is the highest, and from gateway queue, select gateway for it;

S4. use in the management area of gateway and close on principle and carry out bottom bunch and select;

S5. judge that virtual resource request maps integer programming problem and whether can separate:

Can separate if this virtual resource request maps integer programming problem, then carry out virtual network mapping, and upgrade bottom Physical Network resource status, from request queue, delete this virtual resource request, jump procedure S2;

If this virtual resource request maps integer programming problem intangibility, jump procedure S6;

S6. judge whether the scope of bottom bunch is more than or equal to the management area of this gateway:

If bottom bunch scope is less than the management area of this gateway, then expand the scope of bottom bunch, jump procedure S5;

If bottom bunch scope is more than or equal to the management area of this gateway, then from gateway queue, delete this gateway, jump procedure S7;

S7. judge whether gateway queue is empty:

If gateway queue is not empty, then jump procedure S3;

If gateway queue is empty, then jump procedure S8;

S8. judge whether the number of times that requeues of virtual resource request exceedes preset times:

If the number of times that requeues of virtual resource request exceedes preset times, then refuse this virtual resource request, jump procedure S2;

If the number of times that requeues of virtual resource request does not exceed preset times, then waiting list is delivered in this virtual resource request, and the number of times that requeued adds one.

For the step of each virtual resource request dispatching priority in request queue is in step S1: the virtual resource request in request queue is asked for resource according to it to be arranged from small to large, asks for the virtual resource request that resource is less, and its priority is higher.

The computing formula that resource is asked in virtual resource request is:

$DM\left(G^V\right)={\mathrm{\α}}^v\underset{n^v\∈N^V}{\Σ}CPU\left(n^v\right)+{\mathrm{\β}}^v\underset{e^v\∈E^V}{\Σ}BW\left(e^v\right)---\left(1\right)$

Wherein, G ^vfor virtual network network topology, N ^vfor the node set of virtual network topology, E ^vfor the link set of virtual network topology, n ^vfor single virtual network node in virtual network topology, e ^vfor wall scroll virtual network link in virtual network topology, CPU is for referring to virtual network node n ^vthe capability requirement of logic functional block, BW is for referring to virtual network link e ^vbandwidth demand, α ^vand β ^vfor the weight regulating parameter for balance CPU and bandwidth.

When selecting gateway in step S3, in gateway queue, the computing formula of the priority of gateway is:

$SR\left(G^S\right)=1/DIS*\left(\underset{i=1}{\overset{\∂}{\Σ}}{m}^{1/i}\right)*\[{\mathrm{\α}}^s\underset{n^s\∈N^S}{\Σ}CPU\left(n^s\right)+{\mathrm{\β}}^s\underset{e^s\∈E^S}{\Σ}BW\left(e^s\right)\]---\left(2\right)$

Wherein, G ^sit is network topology in SGW region; SR comprehensive resources is G ^sthe resource size of each factor is considered in this panel region; 1/DIS is the constraint considering geographical position factor; it is then the constraint considering connection status; N ^sit is the node set of network topology in SGW region; E ^sit is the link set of network topology in SGW region; n ^sit is single virtual network node in network topology in SGW region; e ^sit is wall scroll virtual network link in network topology in SGW region; CPU refers to SGW region interior nodes n ^sthe capability requirement of logic functional block; BW refers to network link e in SGW region ^sbandwidth demand; α ^sand β ^sit is the weight regulating parameter for balance CPU and bandwidth.

Virtual resource request in step S1 in request queue comprises in the new request and previous time window arrived according to Poisson distribution and to map unsuccessfully and the number of times that requeues does not reach the virtual resource request of preset times.

The step of the bottom Physical Network resource that the virtual resource request left takies in the previous time window of release is also comprised before step S1.

It is leave after virtual resource request completes service that the mode that virtual resource request is left comprises two kinds: one; Two is that control system detects that this virtual resource request is closed in the service that virtual resource request is dangerous, control system.

The invention has the beneficial effects as follows:

(1) the present invention considers node mapping and link maps, solves the failure of shining into link maps in link maps process because node mapping is unreasonable, thus lift map success rate, reduce unnecessary or irrational node mapping;

(2) after each time window starts, virtual resource request in request queue is asked for resource according to it arrange from small to large, first map in virtual network mapping process and ask for the little virtual resource request of resource, the virtual resource request of asking for resource request large is allowed to map below, the virtual resource number of request obtaining successful connection is greatly improved, and then in each time window, process more virtual resource request, reach and maximize linking number;

(3) principle of closing on based on many gateways realizes, and significant increase is mapped to power, promotes and successfully maps linking number;

(4) the present invention adopts and with different levelsly carries out the selection of bottom mapping area, in the gateway choice phase, consider geographic location constraint, first map at the gateway at the place that request produces, map unsuccessful ability and extend to other gateway regions according to mapping scheme; Geographical position factor is considered in gateway region, carry out bottom bunch to virtual resource request to select, the present invention greatly combining geographic location because usually carrying out the selection of bottom mapping area, make virtual resource request is produced ground in virtual resource request as much as possible and completes in little mapping area, thus reduce the transfer of data time delay and bandwidth consumption that bring across gateway region, cross-node.

Accompanying drawing explanation

Fig. 1 is the flow chart of a kind of mapping method of virtual network of the present invention;

Fig. 2 is the schematic diagram of an embodiment of cluster dividing in the present invention.

Embodiment

Below in conjunction with accompanying drawing, technical scheme of the present invention is described in further detail, but protection scope of the present invention is not limited to the following stated.

As shown in Figure 1, a kind of mapping method of virtual network, comprises the following steps:

S1. generate the request queue in current time window and gateway queue, the virtual resource request in request queue is arranged according to its priority order from high to low.

For the step of each virtual resource request dispatching priority in request queue is in step S1: the virtual resource request in request queue is asked for resource according to it to be arranged from small to large, asks for the virtual resource request that resource is less, and its priority is higher.

The computing formula that resource is asked in virtual resource request is:

$DM\left(G^V\right)={\mathrm{\α}}^v\underset{n^v\∈N^V}{\Σ}CPU\left(n^v\right)+{\mathrm{\β}}^v\underset{e^v\∈E^V}{\Σ}BW\left(e^v\right)---\left(1\right)$

Wherein, G ^vfor virtual network network topology, N ^vfor the node set of virtual network topology, E ^vfor the link set of virtual network topology, n ^vfor single virtual network node in virtual network topology, e ^vfor wall scroll virtual network link in virtual network topology, CPU is for referring to virtual network node n ^vcPU calculated capacity (computing capability of logic functional block) demand, BW is for referring to virtual network link e ^vbandwidth demand, α ^vand β ^vfor the weight regulating parameter for balance CPU and bandwidth, these weight parameter also may be used for representing the price of operator to CPU and bandwidth.

In request queue generative process, ask for resource (DM) to virtual resource request according to it to arrange from small to large, thus in virtual network mapping process, first map and ask for the little virtual resource request of resource, the virtual resource request of asking for resource large is allowed to map below, the number of request obtaining successful connection is greatly improved, and then in each time window, processes more virtual resource request, reach the object maximizing linking number.

Virtual resource request in step S1 in request queue comprises in the new request and previous time window arrived according to Poisson distribution and to map unsuccessfully and the number of times that requeues does not reach the virtual resource request of preset times.

The step of the bottom Physical Network resource that the virtual resource request left takies in the previous time window of release is also comprised before step S1.

It is leave after virtual resource request completes service that the mode that virtual resource request is left comprises two kinds: one; Two is that control system detects that this virtual resource request is closed in the service that virtual resource request is dangerous, control system.

S2. judge in request queue, whether to there is the not mapped success of virtual resource request:

If there is the not mapped success of virtual resource request, then jump procedure S3;

If there is not the not mapped success of virtual resource request, then the virtual resource request terminated in this time window maps, and waits for next time window.

S3. select the virtual resource request that request queue medium priority is the highest, and from gateway queue, select gateway for it.

When selecting gateway in step S3, in gateway queue, the computing formula of the priority of gateway is:

$SR\left(G^S\right)=1/DIS*\left(\underset{i=1}{\overset{\∂}{\Σ}}{m}^{1/i}\right)*\[{\mathrm{\α}}^s\underset{n^s\∈N^S}{\Σ}CPU\left(n^s\right)+{\mathrm{\β}}^s\underset{e^s\∈E^S}{\Σ}BW\left(e^s\right)\]---\left(2\right)$

Wherein, G ^sit is network topology in SGW region; SR comprehensive resources is G ^sthe resource size of each factor is considered in this panel region; 1/DIS is the constraint considering geographical position factor; it is then the constraint considering connection status; N ^sit is the node set of network topology in SGW region; E ^sit is the link set of network topology in SGW region; n ^sit is single virtual network node in network topology in SGW region; e ^sit is wall scroll virtual network link in network topology in SGW region; CPU refers to SGW region interior nodes n ^scPU calculated capacity (computing capability of logic functional block) demand; BW refers to network link e in SGW region ^sbandwidth demand; α ^sand β ^sbe the weight regulating parameter for balance CPU and bandwidth, simultaneously in actual applications, these weight parameter also may be used for representing the price of operator to CPU and bandwidth.

In with different levels network management and control framework of mobile communications network, under PGW (public data network gateway), manage multiple SGW (gateway) region.UE (subscriber equipment) under each SGW region is if need to access Internet, and data then need just can go out Internet by PGW.In order to avoid carrying out the mapping of bottom module across SGW region, the service request of the present invention to each user selects specific SGW region to map virtual network.Before each time window starts, by global controller, a SGW queue is configured to each SGW region.This SGW queue is consideration priority, and what priority was higher will come more.SGW queue No. 1 position will be decided to be forever the place SGW that virtual network requests produces, then the SGW by other forms by SGW queue backward.

For the queue of other SGW composition, consider the geographical position between gateway, connection state and territory, gateway institute area under control residue physical resource etc. because usually producing this gateway queue.The conveniently formation of SGW queue, each factor is considered that carrying out quantification forms formula (2) by the present invention, what this formula described is the comprehensive resources size of each SGW region for the SGW region, place of virtual resource request, and comprehensive resources is larger, and priority is higher.

In formula (2), introduce 1/DIS and limit geographical position, wherein DIS is the SGW (x that this SGW region (x, y) produces with virtual resource request _s, y _s) distance in region, embodying formula is:

$DIS=\sqrt{{(x-x_s)}^2+{(y-y_s)}^2},$

Therefore, distance is far away, and that is by less to the contribution of comprehensive resources.Meanwhile, introducing be the constraint to connection status, what wherein m characterized is join dependency parameter, and what I was decided to be 2, i sign in the present embodiment is the number that this SGW region needs to the SGW region that virtual network requests produces, what characterize is the upper limit of jumping figure, and the restriction according to network is generally decided to be 6.Due to may mulitpath be had between them, thus need a symbol of suing for peace to sue for peace to these paths, also need division jumping figure being carried out to a grade simultaneously.By using summation index model, can describe the connection status of these two SGW easily, jumping figure less, access path number is more, then larger to comprehensive resources contribution.

The present invention calculates the comprehensive resources of each SGW for the SGW region of generation virtual resource request to using formula (2) respectively except SGW other all SGW regions extra-regional producing virtual network requests.By sorting to these comprehensive resources, just SGW queue can be obtained.Carry out selection gateway successively according to this gateway queue, map when the success of selection gateway then performs virtual network; After queue is without gateway, then waiting list is delivered in virtual resource request.When the number of times delivering to waiting list is too much time, illustrate that bottom-layer network has now been that overload is not suitable for continuing to deliver to waiting list; Therefore setting preset times, the virtual resource request exceeded directly is refused, and then reduces a lot of process ossify, improve performance.

In gateway is selected, the present invention not only divides the structure SGW queue of class, also considers the multifactor generation SGW queue such as residue physical resource producing geographical position between gateway, connection state and territory, gateway institute area under control simultaneously.Consider the SGW producing virtual resource request will reduce the loss brought with configuration across SGW transmission greatly as the SGW region that priority is the highest; Consider the gateway queue in a gateway region simultaneously, could higher queue priority be obtained when the geographical position of the SGW of certain SGW distance generation virtual network requests is more close, connection state better and the residue physical resource in gateway region is larger.Consider geographical position, connection state, greatly can reduce the bandwidth consumption that transfer of data is brought; Consider that surplus resources is how many, be the number of connection successfully mapped that maximizes, improve system map performance.

S4. use in the management area of gateway and close on principle and carry out bottom bunch and select.

Consider that geographical position factor carries out graduate cluster dividing to bottom-layer network.According to closing on principle, as shown in Figure 2, the base station G of the virtual resource request accepting user is decided to be bunch 1, the base station A direct-connected with G, base station D are added as bunches 2, then base station C, the base station B direct-connected with base station A, base station D, base station G, base station E are added and carry out amplification and form bunches 3, finally being added by the base station F direct-connected with base station A, base station B, base station C, base station D, base station E, base station G increases forms bunches 4, the like until all base station, SGW region is contained in region.When concrete bottom bunch is selected prioritizing selection sequence little bunch, little bottom is bunch not all right carries out virtual network mapping toward large bunch more successively.After bottom bunch chooses, the virtual network node bottom layer node that can only be connected under this bunch carries out establishment augmentation bottom-layer network.MIP (mixed integer programming problem) and multiple data stream problem can be used very easily to solve virtual network mapping problems for augmentation bottom-layer network, see and whether can map successfully.If map successfully, directly carry out virtual network mapping, virtual network topology is mapped to bottom-layer network, then upgrade bottom-layer network.Otherwise, if map unsuccessfully, amplification bottom bunch carries out judging whether to map successfully again, and the rest may be inferred when bottom bunch is greatly unsuccessful to also mapping time equal with SGW region, leaves out this SGW, call the next SGW region of SGW queue, until map success or refuse this virtual resource request.

Select based on the bottom bunch closing on principle consideration, we carry out selecting and judge by the graduate bottom bunch that carries out, dummy node, virtual link can be allowed so greatly to be that core carries out centralization mapping with geographical position, and then to have sizable actual benefit to saving bandwidth, minimizing time delay.

S5. judge that virtual resource request maps integer programming problem and whether can separate:

Can separate if this virtual resource request maps integer programming problem, then carry out virtual network mapping, and upgrade bottom Physical Network resource status, from request queue, delete this virtual resource request, jump procedure S2;

If this virtual resource request maps integer programming problem intangibility, jump procedure S6.

In the present embodiment, the mixed integer programming problem that the virtual network solved maps carries out modeling for the purpose of minimum losses.Map for a virtual network, computing capability shared after it is mapped to bottom-layer network and link bandwidth take less, and this virtual network mapping problems loss to bottom-layer network is less.Based on the problems referred to above, set up following object module:

Target:

$\underset{uv\∈E^S}{\Σ}\frac{{\mathrm{\α}}_{uv}}{R_E(u,v)+\mathrm{\δ}}\underset{i}{\Σ}{f}_{uv}^i+\underset{w\∈N^S}{\Σ}\frac{{\mathrm{\β}}_w}{R_N\left(w\right)+\mathrm{\δ}}\underset{m\∈N^{S^{\′}}\backslash N^s}{\Σ}{x}_{mw}c\left(m\right)---\left(3\right);$

Restriction:

Capacity limit:

$\underset{i}{\Σ}(f_{uv}^i+f_{vu}^i)\≤R_E(u,v)x_{uv},\∀u,v\∈N^{S^{\′}}---\left(4\right);$

$R_N\left(w\right)\≥x_{mw}c\left(m\right),\∀m\∈N^{S^{\′}}\backslash N^S,\∀w\∈N^S---\left(5\right);$

Flow restriction:

$\underset{w\∈N^{S^{\′}}}{\Σ}{f}_{uw}^i-\underset{v\∈N^{S^{\′}}}{\Σ}{f}_{vu}^i=0,\∀i,\∀u\∈N^{S^{\′}}\{s_i,t_i\}---\left(6\right);$

$\underset{w\∈N^S}{\Σ}{f}_{s_{i}w}^i-\underset{w\∈N^S}{\Σ}{f}_{{\mathrm{ws}}_i}^i=b\left(e_i^V\right),\∀i---\left(7\right);$

$\underset{w\∈N^S}{\Σ}{f}_{t_{i}w}^i-\underset{w\∈N^S}{\Σ}{f}_{{\mathrm{wt}}_i}^i=-b\left(e_i^V\right),\∀i---\left(8\right);$

Unit and binary system retrain:

$\underset{w\∈N^S}{\Σ}{x}_{mw}=1,\∀m\∈N^{S^{\′}}\backslash N^S---\left(9\right);$

$x_{uv}\≤R_E(u,v),\∀u,v\∈N^{S^{\′}}---\left(10\right);$

$x_{uv}=x_{vu},\∀u,v\∈N^{S^{\′}}---\left(11\right);$

Range constraint:

$f_{uv}^i\≥0,\∀u,v\∈N^{S^{\′}}---\left(12\right);$

$x_{uv}\∈\{0,1\},\∀u,v\∈N^{S^{\′}}---\left(13\right).$

Simultaneously target formula (3) minimizes expending of virtual network mapping also to provide load balancing.R _e(u, v) is link (as the bandwidth) restriction representing uv link, for realizing load balancing; R _nw () is capacity (as the CPU) restriction of bottom layer node w, for realizing load balancing; α _uvbe used for the important link parameter of control load equilibrium when the mapping virtual resource request time, wherein 1≤α _uv≤ R _e(u, v); β _wbe used for the important node parameter of control load equilibrium when the mapping virtual resource request time, wherein 1≤β _w≤ R _n(w); E _s, E _s'the former bottom link set, the latter represents augmentation bottom link set; N _s, N _s'the set of the former bottom layer node, the latter represents that augmentation bottom layer node (comprising first node) is gathered; δ be represent one be tending towards 0 normal number, be used for avoiding the denominator when calculating target function to be tending towards 0; C (m) is capacity (as the CPU) value of node m; it is the flow that i-th virtual link causes to bottom link uv; x _uva binary variable, when time be 1, otherwise be 0.Concrete physical meaning, for have traffic consumes namely to have virtual link to take at bottom link uv, is 1.

In capacity-constrained, formula (4) is the bandwidth restriction of link, considers that the amphicheirality of link flow limits any link uv of bottom link in the present embodiment.Formula (5) is bottom layer node capacity limit, only have the bottom layer node (being namely connected and the bottom layer node communicated with first node) that maps by dummy node just have capacity consumption.

In traffic constraints, formula (6) is the flow conservation for bottom layer node u, and the flow namely flowing into u node from each node equals the flow that u node flows out to each node.Formula (7) and formula (8) are the flow conservations of source node and destination node, and source node only has outflow flow, and destination node only has inflow flow, wherein what represent is the bandwidth demand of i-th virtual link of virtual network V.

Unit is about intrafascicular with binary system, and formula (9) has one for any one first node and only has one to be attached thereto and the bottom layer node communicated.Formula (10) and formula (11) guarantee to have to arbitrary bottom link uv the value that arranges x and the x of any direction is equal.

In range constraint, formula (12) is the limited field showing the bandwidth consumption that i-th virtual link causes to bottom link uv in order to reduce the scope of solving according to actual conditions.Formula (13) is the x value of bottom link is 0 or 1.Conveniently use linear programming problem, need to relax into lower inequality to it:

$x_{uv}\≥0,\∀u,v\∈N^{S^{\′}}---\left(14\right).$

S6. judge whether the scope of bottom bunch is more than or equal to the management area of this gateway:

If bottom bunch scope is less than the management area of this gateway, then expand the scope of bottom bunch, jump procedure S5;

If bottom bunch scope is more than or equal to the management area of this gateway, then from gateway queue, delete this gateway, jump procedure S7;

S7. judge whether gateway queue is empty:

If gateway queue is not empty, then jump procedure S3;

If gateway queue is empty, then jump procedure S8;

S8. judge whether the number of times that requeues of described virtual resource request exceedes preset times:

If the number of times that requeues of described virtual resource request exceedes preset times, then refuse this virtual resource request, jump procedure S2;

If the number of times that requeues of described virtual resource request does not exceed preset times, then waiting list is delivered in this virtual resource request, and the number of times that requeued adds one.

The above is only the preferred embodiment of the present invention, be to be understood that the present invention is not limited to the form disclosed by this paper, should not regard the eliminating to other embodiments as, and can be used for other combinations various, amendment and environment, and can in contemplated scope described herein, changed by the technology of above-mentioned instruction or association area or knowledge.And the change that those skilled in the art carry out and change do not depart from the spirit and scope of the present invention, then all should in the protection range of claims of the present invention.

Claims (7)

1. a mapping method of virtual network, is characterized in that: comprise the following steps:

S1. generate the request queue in current time window and gateway queue, the virtual resource request in request queue is arranged according to its priority order from high to low;

S2. judge in request queue, whether to there is the not mapped success of virtual resource request:

If there is the not mapped success of virtual resource request, then jump procedure S3;

If there is not the not mapped success of virtual resource request, then the virtual resource request terminated in this time window maps, and waits for next time window;

S3. select the virtual resource request that request queue medium priority is the highest, and from gateway queue, select gateway for it;

S4. use in the management area of gateway and close on principle and carry out bottom bunch and select;

S5. judge that virtual resource request maps integer programming problem and whether can separate:

Can separate if this virtual resource request maps integer programming problem, then carry out virtual network mapping, and upgrade bottom Physical Network resource status, from request queue, delete this virtual resource request, jump procedure S2;

If this virtual resource request maps integer programming problem intangibility, jump procedure S6;

S6. judge whether the scope of bottom bunch is more than or equal to the management area of this gateway:

If bottom bunch scope is less than the management area of this gateway, then expand the scope of bottom bunch, jump procedure S5;

If bottom bunch scope is more than or equal to the management area of this gateway, then from gateway queue, delete this gateway, jump procedure S7;

S7. judge whether gateway queue is empty:

If gateway queue is not empty, then jump procedure S3;

If gateway queue is empty, then jump procedure S8;

S8. judge whether the number of times that requeues of virtual resource request exceedes preset times:

If the number of times that requeues of virtual resource request exceedes preset times, then refuse this virtual resource request, jump procedure S2;

If the number of times that requeues of virtual resource request does not exceed preset times, then waiting list is delivered in this virtual resource request, and the number of times that requeued adds one, jump procedure S2.

2. a kind of mapping method of virtual network according to claim 1, it is characterized in that: for the step of each virtual resource request dispatching priority in request queue is in step S1: the virtual resource request in request queue is asked for resource according to it to be arranged from small to large, ask for the virtual resource request that resource is less, its priority is higher.

3. a kind of mapping method of virtual network according to claim 2, is characterized in that: the computing formula that resource is asked in virtual resource request is:

$DM\left(G^V\right)={\mathrm{\α}}^v\underset{n^v\∈N^V}{\Σ}CPU\left(n^v\right)+{\mathrm{\β}}^v\underset{e^v\∈E^V}{\Σ}BW\left(e^v\right)---\left(1\right)$

Wherein, G ^vfor virtual network network topology, N ^vfor the node set of virtual network topology, E ^vfor the link set of virtual network topology, n ^vfor single virtual network node in virtual network topology, e ^vfor wall scroll virtual network link in virtual network topology, CPU is for referring to virtual network node n ^vthe capability requirement of logic functional block, BW is for referring to virtual network link e ^vbandwidth demand, α ^vand β ^vfor the weight regulating parameter for balance CPU and bandwidth.

4. a kind of mapping method of virtual network according to claim 1, is characterized in that: when selecting gateway in step S3, and in gateway queue, the computing formula of the priority of gateway is:

$SR\left(G^S\right)=1/DIS*\left(\underset{i=1}{\overset{\∂}{\Σ}}{m}^{1/i}\right)*\[{\mathrm{\α}}^s\underset{n^s\∈N^S}{\Σ}CPU\left(n^s\right)+{\mathrm{\β}}^s\underset{e^s\∈E^S}{\Σ}BW\left(e^s\right)\]---\left(2\right)$

Wherein, G ^sit is network topology in SGW region; SR comprehensive resources is G ^sthe resource size of each factor is considered in this panel region; 1/DIS is the constraint considering geographical position factor; it is then the constraint considering connection status; N ^sit is the node set of network topology in SGW region; E ^sit is the link set of network topology in SGW region; n ^sit is single virtual network node in network topology in SGW region; e ^sit is wall scroll virtual network link in network topology in SGW region; CPU refers to SGW region interior nodes n ^sthe capability requirement of logic functional block; BW refers to network link e in SGW region ^sbandwidth demand; α ^sand β ^sit is the weight regulating parameter for balance CPU and bandwidth.

5. a kind of mapping method of virtual network according to claim 1, is characterized in that: the virtual resource request in step S1 in request queue comprises in the new request and previous time window arrived according to Poisson distribution and to map unsuccessfully and the number of times that requeues does not reach the virtual resource request of preset times.

6. a kind of mapping method of virtual network according to claim 1, is characterized in that: the step also comprising the bottom Physical Network resource that the virtual resource request left takies in the previous time window of release before step S1.

7. a kind of mapping method of virtual network according to claim 6, is characterized in that: it is leave after virtual resource request completes service that the mode that virtual resource request is left comprises two kinds: one; Two is that control system detects that this virtual resource request is closed in the service that virtual resource request is dangerous, control system.