CN104320324B - A kind of mapping method of virtual network based on link interference - Google Patents
A kind of mapping method of virtual network based on link interference Download PDFInfo
- Publication number
- CN104320324B CN104320324B CN201410660555.9A CN201410660555A CN104320324B CN 104320324 B CN104320324 B CN 104320324B CN 201410660555 A CN201410660555 A CN 201410660555A CN 104320324 B CN104320324 B CN 104320324B
- Authority
- CN
- China
- Prior art keywords
- mrow
- node
- link
- mapping
- msub
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The invention discloses a kind of mapping method of virtual network based on link interference, is characterized in virtual network maps, the topology information of entrance link weighting of noise infrastructure network time dimension;The ranking value of Algorithms for Page Ranking computing basic facility network node is used according to the available bandwidth resources of infrastructure network link and interference;The ranking value of dummy node is calculated according to the node computing resource of virtual network requests and link bandwidth demand;Node mapping is carried out using greedy matching algorithm;The available bandwidth and interference value of weighted basis facility network link enter downlink map using shortest path first;The average yield of infrastructure provider and the average receptance of virtual network requests can significantly be improved using the mapping method of virtual network based on link interference using the present invention.
Description
Technical field
The invention belongs to technical field of the computer network, and in particular to the mapping method of virtual network based on link interference.
Background technology
IEEE global communication international conference《Diversification internet》(IEEE GlobeCom,
Vol.2, pp.755-760,2005) one it the article pointed out that network virtualization technology can decouple conventional the Internet service provider
Based on infrastructure provider and Internet Service Provider, and allow the same bottom base of network share of multiple Internet Service Providers
Infrastructure Internet resources.In network virtualization environment, infrastructure provider is responsible for structure, maintenance and management bottom Physical Network
Network equipment;Internet Service Provider leases resource according to demand for services to infrastructure provider, builds and runs the void of customization
Intend network, and end-to-end service is provided.20th international telecommunication service meeting charrette《Resource in network virtualization
Distribution challenge》(20th ITC Specialist Seminar, vol.18, pp18-20,2009) one the article pointed out, network virtual
It is virtual network mapping to change the significant challenge faced, i.e., according to the virtual network requests (Virtual of service provider
Network Request) node and link resource requirement, reasonably be its distribution basis infrastructure provider network money
Source.
Found through being retrieved to existing literature, map this non-determined type multinomial hardly possible (NP-hard) to solve virtual network
Problem, existing method are two stages mainly by the decoupling of virtual network mapping problems:Node maps and link maps.The U.S.
ACM's data communication speciality group《Introspect virtual network mapping:Infrastructure network support path splits and migration》
(ACM SIGCOMM, vol.38 (2), pp.17-29,2008) text is proposed based on a kind of virtual network of time window model
Mapping method, but it only considered infrastructure network Local resource information in node mapping.《Arranged based on topology ambiguity node
The virtual network mapping of sequence》Base of (ACM SIGCOMM, vol.41 (2), pp.38-47,2011) one text in time window model
On plinth, based on random walk (Random Walk) thought, it is proposed that a kind of random walk-greedy matching-shortest path (RW-
MM-SP) method, but it does not have fully excavate infrastructure network and the Global Topological letter of virtual network in node mapping
Breath.《The leading virtual network mapping of income based on global resource information》(IEEE GlobeCom,pp.2294-2299,
2013) text is based on webpage sorting (PageRank) algorithm, further excavates infrastructure network and the overall situation of virtual network is opened up
Flutter resource information, it is proposed that a kind of leading mapping method of virtual network (RD-VNE) of income.But virtual network mapping is one
The process of individual online (On Line), above-mentioned virtual network mapping algorithm, which is intended to, excavates infrastructure network and virtual network
The topology information of Spatial Dimension, and the topology information of infrastructure network time dimension is have ignored, greedy optimization current virtual
The mapping result of network, so as to cause these existing mapping method of virtual network to have bearing the character of much blindness on time dimension.
The content of the invention
The purpose of the present invention is to propose to a kind of mapping method of virtual network based on link interference, weighed using link interference
The topology information on infrastructure network time dimension is measured, and is taken into account in node mapping and link maps, it is existing to reduce
Blindness of some mapping method of virtual network on time dimension, realize the average receipts for further improving infrastructure provider
The purpose of the average receptance of benefit and virtual network requests.
Mapping method of virtual network of the invention based on link interference, including:In each time window on a timeline,
Use income formula
The income Revenue of each virtual network requests in reached in time window and request queue is calculated, wherein
VvAnd EvVirtual network requests VNR is represented respectivelyiNode set and link set, r_cpu (u) represents dummy node u (u ∈
Vv) computational resource requirements, r_bw (u, v) represent virtual link (u, v) ((u, v) ∈ Ev) bandwidth resources demand, αCAnd αBPoint
Not Biao Shi the computing resource of infrastructure provider and the unit price of bandwidth resources, τiFor the life span of virtual network requests;So
Afterwards, virtual network mapping is carried out successively from big to small according to the income Revenue of virtual network requests:If node maps and chain
Road mapping is all successful, then virtual network requests map the available resources for successfully, updating infrastructure network;If mapping failure and
The number of request mapping failure is then added it in request queue, delay is remapped not less than upper limit Th;It is if virtual
The number of network request mapping failure reaches upper limit Th, then actively refuses the virtual network requests;
It is characterized in that:
In virtual network mapping, the topology information of entrance link weighting of noise infrastructure network time dimension;According to
The available bandwidth resources of infrastructure network link and interference use the row of Algorithms for Page Ranking computing basic facility network node
Sequence value, and according to the ranking value of the node computing resource and link bandwidth demand of virtual network requests calculating dummy node, use
Greedy matching algorithm carries out node mapping;The available bandwidth and interference value of weighted basis facility network link are calculated using shortest path
Method enters downlink map;Specific operating procedure is as follows:
The first step:Use link interference formula
The interference of all links of computing basic facility network, wherein I (u, v) represent infrastructure network link (u, v)
Link interference, VsRepresent infrastructure network node set, symbol CB(i) and deg (i) (i=u, v) represents infrastructure respectively
Network node i (i=u, v) betweenness center (Betweenness Centrality) and degree centrality (Degree
Centrality);
Second step:Use infrastructure network node sequencing formula
The ranking value AR of all nodes of computing basic facility network, wherein ARi(i=u, v) represents infrastructure network section
Point i ranking value, N (i) (i=u, v) represent the node set being joined directly together with node i, parameter ε ∈ (0,1), infrastructure networks
The bandwidth resources availability m (u, v) of network link (u, v) is defined as:
Wherein a_bw (u, v) represents the available bandwidth resources of infrastructure network link (u, v), and norm () represents to return
One changes operation, γ ∈ (0,1);
3rd step:Use dummy node sort formula
Calculate the ranking value RR of all dummy nodes, wherein RRi(i=u, v) represents dummy node i ranking value, N (i)
The node set that (i=u, v) is represented and node i is joined directly together, d ∈ (0,1),
4th step:Node maps, and specific mapping flow is as follows:The non-mapping node collection of initialization is combined into virtual network requests
Node set Vv, facility set of network nodes V based on enabled node sets;Operation is repeated below until node mapping knot
Beam:If non-mapping node set is empty set, node maps successfully, and node mapping terminates;Otherwise, wherein ranking value RR is selected
Maximum dummy node vNode, the node that can meet dummy node vNode computational resource requirements is searched in enabled node set
Form feasible node set;If feasible node set is empty set, node mapping failure, node mapping terminates;Otherwise, select
Mapping results of the node sNode maximum wherein ranking value AR as dummy node vNode, and by dummy node vNode and base
Infrastructure network node sNode is never removed in mapping node set and enabled node set respectively;
5th step:Link maps, specific mapping flow are as follows:The non-mapping link collection of initialization is combined into virtual network requests
Link set Ev, the available resource information of backup infrastructure network;Operation is repeated below until link maps make after terminating
With the available resource information of backup information reduction infrastructure network:If non-mapping link collection is combined into empty set, link maps
Success, link maps terminate;Otherwise, the maximum virtual link vLink of bandwidth resources demand is selected never in mapping link set,
By all nodes of infrastructure network and it can meet that the link of virtual link vLink bandwidth resources demands extracts to form one
The infrastructure network topology of individual simplification, uses link metric calculation formula
The weights of the infrastructure network topology link of computational short cut, wherein χ (u, v) represent infrastructure network link
The weights of (u, v), β ∈ (0,1);The base mapped using dummy node of the shortest path first at virtual link vLink both ends
Link metric and minimum path P are searched between Infrastructure node;If path P is not present, link maps failure, link reflects
Penetrate end;Otherwise the mapping result using path P as virtual link vLink, the available bandwidth money of all links in path P is updated
Source, and will be removed in virtual link vLink never mapping link set;
6th step:Result with link maps is mapped according to node, updates the available resource information of infrastructure network.
The inventive method weighs the topology information of infrastructure network time dimension due to taking entrance link interference,
And apply it in node mapping and link maps, ignore infrastructure network compared to traditional virtual network mapping algorithm
The topology information of time dimension, the present invention all employ the time dimension of infrastructure network in node mapping and link maps
Topology information is aided in;, can using the inventive method due to considering the topology information of infrastructure network time dimension
Reduce the blindness that virtual network is mapped on time dimension, it will be apparent that improve the average yield and virtual net of infrastructure network
The average receptance of network request.
Brief description of the drawings
Fig. 1 is to be based on time window model virtual network mapping flow.
Fig. 2 is the average yield comparison diagram of the infrastructure network provider of three kinds of mapping method of virtual network.
Fig. 3 is the average receptance comparison diagram of the virtual network requests of three kinds of mapping method of virtual network.
Embodiment
The present invention is further described in detail with reference to the accompanying drawings and examples.
Embodiment 1:
Mapping method of virtual network of the invention based on link interference, including:In each time window on a timeline,
Using income formula (1), i.e.,
The income Revenue of each virtual network requests in reached in time window and request queue is calculated, wherein
VvAnd EvVirtual network requests VNR is represented respectivelyiNode set and link set, r_cpu (u) represents dummy node u (u ∈
Vv) computational resource requirements, r_bw (u, v) represent virtual link (u, v) ((u, v) ∈ Ev) bandwidth resources demand, αCAnd αBPoint
Not Biao Shi the computing resource of infrastructure provider and the unit price of bandwidth resources, τiFor the life span of virtual network requests;So
Afterwards, virtual network mapping is carried out successively from big to small according to the income Revenue of virtual network requests:If node maps and chain
Road mapping is all successful, then virtual network requests map the available resources for successfully, updating infrastructure network;If mapping failure and
The number of request mapping failure is then added it in request queue, delay is remapped not less than upper limit Th;It is if virtual
The number of network request mapping failure reaches upper limit Th, then actively refuses the virtual network requests;
Fig. 1 gives the virtual network mapping flow based on time window model, as shown in fig. 1:Based on time window
The virtual network of model maps, and a virtual network mapping is carried out at the end of each time window on a timeline, specifically
Flow it is as follows:
Discharge resource (S1):In release time window shared by all virtual network requests left because life cycle terminates
Infrastructure network resource, update the available resource information of infrastructure network;
Collect virtual network requests (S2):All virtual networks in reached in acquisition time window and request queue please
Ask, the income Revenue of each virtual network requests is calculated using income formula (1), and according to income descending sort;
Virtual network maps (S3):Using the present invention based on the mapping method of virtual network of link interference according to income
The orders of Revenue from big to small are mapped virtual network requests successively, including node mapping and link maps;Such as
The node mapping of fruit wherein any one virtual network requests and link maps are all successful, then the virtual network requests are mapped to
Work(, and update the available resource information of infrastructure network;If the number of mapping failure and failure is not above setting in advance
The upper limit Th put, then add it to request queue, and delay is remapped;If the mapping frequency of failure exceedes upper limit Th, lead
It is dynamic to refuse the virtual network requests.
The mapping method of virtual network based on link interference in the present embodiment specifically comprises the following steps:
The first step:Using link interference formula (2), i.e.,
The interference of all links of computing basic facility network, wherein I (u, v) represent infrastructure network link (u, v)
Link interference, VsRepresent infrastructure network node set, symbol CB(i) and deg (i) (i=u, v) represents infrastructure respectively
Network node i (i=u, v) betweenness center and degree centrality;Particularly point out, link interference is only needed in infrastructure network
Just need to update again when topology changes;
Second step:Using infrastructure network node sequencing formula (3), i.e.,
The ranking value AR of all nodes of computing basic facility network, wherein ARi(i=u, v) represents infrastructure network section
Point i ranking value, N (i) (i=u, v) represent the node set being joined directly together with node i, and parameter ε ∈ (0,1) are used to ensure often
Individual infrastructure network node has unique node sequencing value, the bandwidth resources availability m of infrastructure network link (u, v)
(u, v) is defined as
Wherein a_bw (u, v) represents the available bandwidth resources of infrastructure network link (u, v), and norm () represents to return
One changes operation, and γ ∈ (0,1) are used for the available bandwidth of link and the compromise of interference;
3rd step:Using dummy node sort formula (4), i.e.,
Calculate the ranking value RR of all dummy nodes, wherein RRi(i=u, v) represents dummy node i ranking value, N (i)
(i=u, v) represents the node set being joined directly together with node i,D ∈ (0,1) are used to compromise virtually
The influence of network request node computational resource requirements and link bandwidth resource demand to node sequencing value;
4th step:Node maps, and specific mapping flow is as follows:
4A is step by step:The non-mapping node collection of initialization is combined into the node set V of virtual network requestsv, available section point set
It is combined into infrastructure network node set Vs;
4B is step by step:If non-mapping node set is empty set, node maps successfully, and node mapping terminates;Otherwise,
The maximum dummy node vNode of wherein ranking value RR are selected, being searched in enabled node set can meet that dummy node vNode is counted
The node for calculating resource requirement forms feasible node set;
4C is step by step:If feasible node set is empty set, node mapping failure, node mapping terminates;Otherwise select
Select mapping results of the maximum node sNode of wherein ranking value AR as dummy node vNode, and by dummy node vNode with
Infrastructure network node sNode is never removed in mapping node set and enabled node set respectively;
4D is step by step:4B is repeated step by step with 4C step by step until node mapping terminates;
5th step:Link maps, specific mapping flow are as follows:
5A is step by step:The non-mapping link collection of initialization is combined into the link set E of virtual network requestsv, backup basis is set
Apply the available resource information of network;
5B is step by step:If non-mapping link collection is combined into empty set, link maps success, link maps terminate, otherwise,
Never the maximum virtual link vLink of bandwidth resources demand is selected in mapping link set, by all sections of infrastructure network
Point and it can meet that the link of virtual link vLink bandwidth resources demands extracts to form a simplified infrastructure network and open up
Flutter, using link metric calculation formula (5) i.e.
The weights of the infrastructure network topology link of computational short cut, wherein χ (u, v) represent infrastructure network link
The weights of (u, v), β ∈ (0,1) are used for compromise link available bandwidth resources and interference;
5C is step by step:The basis mapped using dummy node of the shortest path first at virtual link vLink both ends
Link metric and minimum path P are searched between infrastructure node;
5D is step by step:If path P is not present, link maps failure, link maps terminate;Otherwise path P is made
For virtual link vLink mapping result, the available bandwidth resources of all links in path P are updated, and by virtual link vLink
Never removed in 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 terminate;And
At the end of link maps, the available resource information of infrastructure network is reduced using backup information;
6th step:Result with link maps is mapped according to node, updates the available resource information of infrastructure network.
Here is that mapping method of virtual network of the simulation comparison present invention based on link interference is taken in the present embodiment and is showed
The performance of some RW-MM-SP and RD-VNE mapping method of virtual network, the performance indications of contrast include:Infrastructure provider
Average yield and virtual network requests average receptance;
The average yield of infrastructure provider:The average yield of infrastructure provider is defined as infrastructure network and connect
The virtual network requests income Revenue sums and the ratio of time received, i.e.,Wherein R (t) represents that t connects
The income sum for all virtual network requests received;
The average receptance of virtual network requests:The average receptance of virtual network requests is defined as infrastructure network and connect
The ratio between the number for the virtual network requests received and the virtual network requests sum of arrival, i.e.,Wherein ATRepresent moment T it
The sum of the virtual network requests of preceding receiving, RTRepresent the sum of virtual network requests reached before moment T;
Emulation in the present embodiment specifically sets as follows:
Infrastructure network:Generate the basis with 100 nodes and 570 links at random using GT-ITM topological tools
Facility network topology, and the available computational resources of infrastructure network interior joint and the available bandwidth resources of link are uniformly to divide
Random value of the cloth 50 to 100;
Virtual network requests:The arrival process of virtual network requests is Poisson process, and every 100 time quantums averagely reach
5 virtual network requests;The life span of virtual network requests obeys exponential distribution, and the mean survival time is 500 times
Unit;For each virtual network requests, virtual network topology is randomly generated by GT-ITM topological tools, and dummy node number is equal
Even to be distributed between 2 to 20, the probability being connected between dummy node is 0.5;The computing resource and virtual link of dummy node
Bandwidth resources demand be the random value being evenly distributed between 1 to 50;
Specific setting in the present embodiment to the correlation formula parameter in the inventive method is as follows:The ginseng of income formula (1)
Number αC,αBIt is both configured to 1;The parameter ε of infrastructure network node sequencing formula (3) does not include any effective information, therefore, will
It is arranged to 0.01, and parameter γ is arranged to 0.9;The parameter d of dummy node sort formula (4) is arranged to 0.85;Link metric is public
The parameter beta of formula (5) is arranged to 0.3;
Each analogue simulation run time of the present embodiment is 50000 time quantums, during this period of time, there are about 2500
Virtual network requests reach;The mapping failure upper limit Th of each virtual network requests is arranged to 0, represents that mapping failure is then actively refused
Exhausted virtual network requests;Represented eventually for the result of contrast using the average value of 100 analog simulation results, specific contrast
As a result reference picture 2 and Fig. 3;Wherein, Fig. 2 is the average yield of the infrastructure network provider of three kinds of mapping method of virtual network
Comparison diagram, Fig. 3 are the average receptance comparison diagrams of the virtual network requests of three kinds of mapping method of virtual network.Solid line in Fig. 2
A1 represents what is changed over time using the average receipts of the infrastructure provider of the mapping method of virtual network based on link interference
Curve, dotted line A2 and following dotted line A3 above represent to use two kinds of virtual network mapping sides of RD-VNE and RW-MM-SP respectively
The curve that the average yield of the infrastructure provider of method changes over time;Solid line B1 in Fig. 3 represents that use is done based on link
The curve that the average receptance for the virtual network mapping scheme virtual network requests disturbed changes over time, dotted line B2 above is with
The dotted line B3 in face represents averagely to receive using the virtual network requests of RD-VNE and RW-MM-SP mapping method of virtual network respectively
The curve that rate changes over time.
As seen from Figure 2, more existing RD-VNE and RW-MM-SP mapping method of virtual network, the present invention are based on link
The virtual network mapping algorithm of interference can significantly improve the average yield of infrastructure provider;Wherein, it is empty compared with RW-MM-SP
Intend network mapping method, the average yield of infrastructure network improves about 5%;Compared with RD-VNE virtual network mapping algorithms, basis
The average yield of facility network improves about 4%;As seen from Figure 3, more existing RD-VNE and RW-MM-SP virtual networks are reflected
Shooting method, the virtual network mapping algorithm of the invention based on link interference can significantly improve the average receiving of virtual network requests
Rate;Wherein, about 5% is improved compared with RW-MM-SP mapping method of virtual network, the average receptance of virtual network requests;Compared with RD-VNE
Mapping method of virtual network, the average receptance of virtual network requests improve about 4%;Therefore, using the void based on link interference
The average yield of infrastructure provider and the average receptance of virtual network requests can significantly be improved by intending network mapping method.
Claims (1)
1. a kind of mapping method of virtual network based on link interference, including:In each time window on a timeline, use
Income formula
<mrow>
<mi>Re</mi>
<mi>v</mi>
<mi>e</mi>
<mi>n</mi>
<mi>u</mi>
<mi>e</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>VNR</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mo>{</mo>
<msup>
<mi>&alpha;</mi>
<mi>C</mi>
</msup>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>u</mi>
<mo>&Element;</mo>
<msub>
<mi>V</mi>
<mi>v</mi>
</msub>
</mrow>
</munder>
<mi>r</mi>
<mo>_</mo>
<mi>c</mi>
<mi>p</mi>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msup>
<mi>&alpha;</mi>
<mi>B</mi>
</msup>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>)</mo>
<mo>&Element;</mo>
<msub>
<mi>E</mi>
<mi>v</mi>
</msub>
</mrow>
</munder>
<mi>r</mi>
<mo>_</mo>
<mi>b</mi>
<mi>w</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
<mo>}</mo>
<msub>
<mi>&tau;</mi>
<mi>i</mi>
</msub>
</mrow>
Calculate the income Revenue, wherein V of each virtual network requests in reached in time window and request queuevAnd Ev
Virtual network requests VNR is represented respectivelyiNode set and link set, r_cpu (u) represents dummy node u, u ∈ Vv, meter
Resource requirement is calculated, r_bw (u, v) represents virtual link (u, v), (u, v) ∈ Ev, bandwidth resources demand, αCAnd αBRepresent respectively
The computing resource of infrastructure provider and the unit price of bandwidth resources, τiFor the life span of virtual network requests;Then, according to
The income Revenue of virtual network requests carries out virtual network mapping successively from big to small:If node maps and link maps
All successful, then virtual network requests map the available resources for successfully, updating infrastructure network;If mapping failure and the request
The number of failure is mapped not less than upper limit Th, then is added it in request queue, delay is remapped;If virtual network please
The number for asking mapping to fail reaches upper limit Th, then actively refuses the virtual network requests;
It is characterized in that:
In virtual network mapping, the topology information of entrance link weighting of noise infrastructure network time dimension;According to basis
The available bandwidth resources of facility network link and interference use the ranking value of Algorithms for Page Ranking computing basic facility network node,
And the ranking value of dummy node is calculated according to the node computing resource and link bandwidth demand of virtual network requests, use greedy
Node mapping is carried out with algorithm;The available bandwidth and interference value of weighted basis facility network link are carried out using shortest path first
Link maps;Specific operating procedure is as follows:
The first step:Use link interference formula
<mrow>
<mi>I</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mrow>
<msub>
<mi>C</mi>
<mi>B</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mi>deg</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>+</mo>
<mfrac>
<mrow>
<msub>
<mi>C</mi>
<mi>B</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mi>deg</mi>
<mrow>
<mo>(</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>&Element;</mo>
<msub>
<mi>V</mi>
<mi>s</mi>
</msub>
</mrow>
The interference of all links of computing basic facility network, wherein I (u, v) represent the link of infrastructure network link (u, v)
Interference, VsRepresent infrastructure network node set, symbol CB(i) and deg (i) (i=u, v) represents infrastructure network respectively
The betweenness center and degree centrality of node i;
Second step:Use infrastructure network node sequencing formula
<mrow>
<msub>
<mi>AR</mi>
<mi>u</mi>
</msub>
<mo>=</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mi>&epsiv;</mi>
<mo>)</mo>
</mrow>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>v</mi>
<mo>&Element;</mo>
<mi>N</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>)</mo>
</mrow>
</mrow>
</munder>
<mfrac>
<mrow>
<mi>m</mi>
<mrow>
<mo>(</mo>
<mi>v</mi>
<mo>,</mo>
<mi>u</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>AR</mi>
<mi>v</mi>
</msub>
</mrow>
<mrow>
<msub>
<mi>&Sigma;</mi>
<mrow>
<mi>w</mi>
<mo>&Element;</mo>
<mi>N</mi>
<mrow>
<mo>(</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
</mrow>
</msub>
<mi>m</mi>
<mrow>
<mo>(</mo>
<mi>w</mi>
<mo>,</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>+</mo>
<mi>&epsiv;</mi>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>&Element;</mo>
<msub>
<mi>V</mi>
<mi>s</mi>
</msub>
</mrow>
The ranking value AR of all nodes of computing basic facility network, wherein ARi(i=u, v) represents infrastructure network node i
Ranking value, N (i) (i=u, v) represent the node set being joined directly together with node i, parameter ε ∈ (0,1), infrastructure network chain
The bandwidth resources availability m (u, v) on road (u, v) is defined as:
<mrow>
<mi>m</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mi>&gamma;</mi>
<mi>n</mi>
<mi>o</mi>
<mi>r</mi>
<mi>m</mi>
<mrow>
<mo>(</mo>
<mi>a</mi>
<mo>_</mo>
<mi>b</mi>
<mi>w</mi>
<mo>(</mo>
<mrow>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mi>&gamma;</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
<mi>o</mi>
<mi>r</mi>
<mi>m</mi>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<mrow>
<mi>I</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>)</mo>
</mrow>
</mrow>
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 sort formula
<mrow>
<msub>
<mi>RR</mi>
<mi>u</mi>
</msub>
<mo>=</mo>
<mi>d</mi>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>v</mi>
<mo>&Element;</mo>
<mi>N</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>)</mo>
</mrow>
</mrow>
</munder>
<mfrac>
<mrow>
<mi>r</mi>
<mo>_</mo>
<mi>b</mi>
<mi>w</mi>
<mrow>
<mo>(</mo>
<mi>v</mi>
<mo>,</mo>
<mi>u</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>RR</mi>
<mi>v</mi>
</msub>
</mrow>
<mrow>
<msub>
<mi>&Sigma;</mi>
<mrow>
<mi>w</mi>
<mo>&Element;</mo>
<mi>N</mi>
<mrow>
<mo>(</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
</mrow>
</msub>
<mi>r</mi>
<mo>_</mo>
<mi>b</mi>
<mi>w</mi>
<mrow>
<mo>(</mo>
<mi>w</mi>
<mo>,</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mi>d</mi>
<mo>)</mo>
</mrow>
<mi>c</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>&Element;</mo>
<msub>
<mi>V</mi>
<mi>v</mi>
</msub>
</mrow>
1
Calculate the ranking value RR of all dummy nodes, wherein RRi(i=u, v) expression dummy node i ranking value, N (i) (i=u,
V) node set that expression is joined directly together with node i, d ∈ (0,1),
4th step:Node maps, and specific mapping flow is as follows:The non-mapping node collection of initialization is combined into the section of virtual network requests
Point set Vv, facility set of network nodes V based on enabled node sets;Operation is repeated below until node mapping terminates:Such as
The non-mapping node set of fruit is empty set, then node maps successfully, and node mapping terminates;Otherwise, select wherein ranking value RR maximum
Dummy node vNode, in enabled node set search can meet dummy node vNode computational resource requirements node composition
Feasible node set;If feasible node set is empty set, node mapping failure, node mapping terminates;Otherwise, select wherein
Mapping results of the node sNode maximum ranking value AR as dummy node vNode, and dummy node vNode and basis are set
Network node sNode is applied never to remove in mapping node set and enabled node set respectively;
5th step:Link maps, specific mapping flow are as follows:The non-mapping link collection of initialization is combined into the chain of virtual network requests
Road set Ev, the available resource information of backup infrastructure network;Operation is repeated below after link maps terminate using standby
The available resource information of part information reverting infrastructure network:If non-mapping link collection is combined into empty set, link maps are successful,
Link maps terminate;Otherwise, the maximum virtual link vLink of bandwidth resources demand is selected never in mapping link set, by base
All nodes of Infrastructure network extract to form a letter with the link that can meet virtual link vLink bandwidth resources demands
The infrastructure network topology of change, uses link metric calculation formula
<mrow>
<mi>&chi;</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mi>&beta;</mi>
<mi>n</mi>
<mi>o</mi>
<mi>r</mi>
<mi>m</mi>
<mrow>
<mo>(</mo>
<mi>I</mi>
<mo>(</mo>
<mrow>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mi>&beta;</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
<mi>o</mi>
<mi>r</mi>
<mi>m</mi>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<mrow>
<mi>a</mi>
<mo>_</mo>
<mi>b</mi>
<mi>w</mi>
<mrow>
<mo>(</mo>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>)</mo>
</mrow>
</mrow>
The weights of the infrastructure network topology link of computational short cut, wherein χ (u, v) expression infrastructure networks link (u,
V) weights, β ∈ (0,1);The basis mapped using dummy node of the shortest path first at virtual link vLink both ends is set
Apply and link metric and minimum path P are searched between node;If path P is not present, link maps failure, link maps knot
Beam;Otherwise the mapping result using path P as virtual link vLink, the available bandwidth resources of all links in path P are updated,
And it will be removed in virtual link vLink never mapping link set;
6th step:Result with link maps is mapped according to node, updates the available resource information of infrastructure network.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410660555.9A CN104320324B (en) | 2014-11-18 | 2014-11-18 | A kind of mapping method of virtual network based on link interference |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410660555.9A CN104320324B (en) | 2014-11-18 | 2014-11-18 | A kind of mapping method of virtual network based on link interference |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104320324A CN104320324A (en) | 2015-01-28 |
CN104320324B true CN104320324B (en) | 2017-12-12 |
Family
ID=52375498
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410660555.9A Active CN104320324B (en) | 2014-11-18 | 2014-11-18 | A kind of mapping method of virtual network based on link interference |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104320324B (en) |
Families Citing this family (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105072671B (en) * | 2015-06-30 | 2018-11-23 | 国网山东省电力公司潍坊供电公司 | A kind of advanced self-adapting dispatching method for measuring sensor node in system network |
CN105743786B (en) * | 2016-03-04 | 2019-03-22 | 北京邮电大学 | A kind of software definition wireless network mapping method and device |
CN106301924A (en) * | 2016-08-18 | 2017-01-04 | 北京邮电大学 | A kind of mapping method of virtual network and device |
CN108462632B (en) * | 2016-12-09 | 2020-07-14 | 湖南工程学院 | Backbone path extraction method for directed complex network |
CN108243044B (en) * | 2016-12-27 | 2021-08-24 | 山东财兜信息科技有限公司 | Service deployment method and device |
CN107277832A (en) * | 2017-06-12 | 2017-10-20 | 重庆邮电大学 | A kind of mapping method of wireless dummy network |
CN109831337B (en) * | 2019-03-06 | 2022-03-22 | 重庆邮电大学 | Grouping mapping method for adjacent nodes in wireless network virtualization |
CN109921934B (en) * | 2019-03-11 | 2021-06-11 | 湖南大学 | Virtual network mapping method based on path splitting and energy consumption perception |
CN110166362B (en) * | 2019-05-22 | 2021-04-30 | 电子科技大学 | Service function graph low-delay mapping method based on node screening |
CN110191382B (en) * | 2019-06-27 | 2020-03-27 | 北京邮电大学 | Virtual link priority mapping method based on path sorting |
CN110380906B (en) * | 2019-07-25 | 2022-03-04 | 哈尔滨工业大学 | Large-scale multidimensional fusion virtual network mapping method |
CN111245701B (en) * | 2020-01-20 | 2021-08-31 | 中国电子科技集团公司第五十四研究所 | Link priority virtual network mapping method based on maximum weighted matching |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1802815A (en) * | 2003-06-06 | 2006-07-12 | 微软公司 | Method and system for global routing and bandwidth sharing |
CN103428805A (en) * | 2013-08-07 | 2013-12-04 | 湖南大学 | Wireless network virtualization mapping method based on anti-interference performance of links |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9686099B2 (en) * | 2012-04-27 | 2017-06-20 | Hewlett Packard Enterprise Development Lp | Updating virtual network maps |
US9465637B2 (en) * | 2013-03-29 | 2016-10-11 | Dell Products, Lp | System and method for automating virtual network provisioning |
-
2014
- 2014-11-18 CN CN201410660555.9A patent/CN104320324B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1802815A (en) * | 2003-06-06 | 2006-07-12 | 微软公司 | Method and system for global routing and bandwidth sharing |
CN103428805A (en) * | 2013-08-07 | 2013-12-04 | 湖南大学 | Wireless network virtualization mapping method based on anti-interference performance of links |
Also Published As
Publication number | Publication date |
---|---|
CN104320324A (en) | 2015-01-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104320324B (en) | A kind of mapping method of virtual network based on link interference | |
CN111147307A (en) | Service function chain reliable deployment method based on deep reinforcement learning | |
CN103761309B (en) | Operation data processing method and system | |
CN108566659B (en) | 5G network slice online mapping method based on reliability | |
CN108684046B (en) | Random learning-based access network service function chain deployment method | |
US9342370B2 (en) | Server migration | |
CN112738820A (en) | Dynamic deployment method and device of service function chain and computer equipment | |
CN111368888A (en) | Service function chain fault diagnosis method based on deep dynamic Bayesian network | |
CN107391542A (en) | A kind of open source software community expert recommendation method based on document knowledge collection of illustrative plates | |
CN110995619B (en) | Service quality aware virtual network mapping method and device | |
Chemodanov et al. | A near optimal reliable composition approach for geo-distributed latency-sensitive service chains | |
CN109347657B (en) | Method for constructing virtual data domain of scientific and technological service under SDN mode | |
CN102932479A (en) | Virtual network mapping method for realizing topology awareness based on historical data | |
Petale et al. | Failure-based controller placement in software defined networks | |
CN113010313A (en) | Load balancing method and device, electronic equipment and computer storage medium | |
CN105471893B (en) | A kind of distributed equivalent data flow connection method | |
Rui et al. | Analysis of cascade fault optimization based on regional fault and traffic reallocation in complex networks | |
CN106789312A (en) | A kind of secure resources optimizing distribution method based on cloud computing | |
US10873502B2 (en) | System and method for joint embedding and backup provisioning in virtual networks | |
CN108512765B (en) | Network content diffusion method based on network node distributed Pagerank | |
CN113541986B (en) | Fault prediction method and device for 5G slice and computing equipment | |
Yao et al. | Multi-agent reinforcement learning for network load balancing in data center | |
CN109450684B (en) | Method and device for expanding physical node capacity of network slicing system | |
CN108923961B (en) | Multi-entry network service function chain optimization method | |
CN108833162B (en) | Network node sequencing method and virtual network mapping method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |