CN108270695A - A kind of mapping method of virtual network for keeping node adjacent - Google Patents
A kind of mapping method of virtual network for keeping node adjacent Download PDFInfo
- Publication number
- CN108270695A CN108270695A CN201810015657.3A CN201810015657A CN108270695A CN 108270695 A CN108270695 A CN 108270695A CN 201810015657 A CN201810015657 A CN 201810015657A CN 108270695 A CN108270695 A CN 108270695A
- Authority
- CN
- China
- Prior art keywords
- node
- physical
- resource
- dummy
- virtual network
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of mapping method of virtual network for keeping node adjacent, i.e. when virtual network carries out resource impact, when adjacent dummy node is mapped in physical resource in holding virtual network, it maps successful physical resource node and also keeps adjacent as possible, the invention belongs to resource management fields in network virtualization environment.This method includes the following steps：Set is built respectively for all dummy nodes and physical node；The dummy node of selection dummy node set interior joint resource requirement maximum performs mapping process on physical node；Set is rebuild to unmapped dummy node and physical node；The node of resource requirement maximum, performs mapping process on physical node in the selection node adjacent with maps virtual node.The present invention can greatly shorten the length of physical link, improve the utilization rate of physical resource, while optimize mapping result, improve the working efficiency of virtual network, so as to improve service quality.
Description
Technical field
It is more particularly to a kind of to keep adjacent virtual of node the present invention relates to resource management field in network virtualization environment
Network mapping method.
Background technology
Virtual network mapping problems is one of the problem of network virtualization is most crucial and asking full of challenge
Topic.The network topology of virtual network requests is not quite similar, therefore virtual network mapping must adapt to different topology requests.
When distributing resource, need meet the needs of node and link simultaneously.Virtual network requests are generally dynamic again, are being carried out currently
During physical source distributing, the information for the virtual network requests that will be reached after can not predicting.Moreover, even if virtual network requests
It is information static or that all virtual network requests can be predicted, virtual network mapping problems is still that a NP-hard is asked
Topic, can be converted into demultiplexer problem.However, even if node mapping exists it has been determined that in the case where stream is indivisible
A virtual link collection is most preferably distributed on one single-pathway, the mapping of virtual link is still a NP-hard problem, can be turned
Turn to indivisible flow problem.
So far, researcher has proposed many mapping method of virtual network to attempt to improve physical resource utilization rate, obtains
The mapping result more suitable under certain network environment.It is but required to examine since virtual network mapping is a NP-hard problem
The influence factor of worry is very more, some methods are just proposed premised on physical link resource infinity, other method then side
Link maps are overweighted, and opposite node maps then simple process.And this two class deviation can all there are problems that.
(1) when assuming link circuit resource infinity, node mapping method usually can obtain extraordinary effect, these methods can
It effectively improves the utilization rate of physical node resource, while can ensure node relative compact (i.e. euclidean distance between node pair is relatively small).And
In fact, link circuit resource can not possibly simultaneously be not present for infinity, this ideal situation.Therefore such node mapping method would generally be
It meets difficulty in link maps, most typical, the physical link resource between the physical node that two dummy nodes are be mapped to
Can not meet the needs of virtual link in its virtual network requests.Once these problems occur, will break down or even can
It is considered as virtual link mapping failure, fails so as to cause entire mapping process.
(2) if preferentially the more node of selection bandwidth resources is mapped, it can ensure physical node as far as possible really
Can meet the needs of virtual network requests with physical link resource.But since always preferential occupied bandwidth resource is the most abundant
Node may have some impact on the virtual network requests of rear arrival.
(3) such as node mapping and the completely separable processing of link maps are likely to result in adjacent in virtual network requests
Or similar node its corresponding physical node very remote situation of distance in physical network in the mapped.This distribution dispersion
Situation can frequently result in virtual link and occupy too many Internet resources, decline so as to cause the utilization rate of physical resource.
Corresponding change is made according to different network environments and mapping demand, the present invention discloses a kind of virtual network mapping side
Method has well solved the above problem.
Invention content
Present invention aims in view of the above shortcomings of the prior art, it is proposed that a kind of virtual network for keeping node adjacent
Mapping method, this method keep adjacent dummy node in practical object as much as possible in the case where slightly reducing mapping efficiency
It is adjacent in reason network, so as to greatly shorten the length of physical link, the utilization rate of physical resource is improved, while optimize mapping
As a result mapping method of virtual network.(increase two-step classic algorithm comparative illustration, be complete map in the case of, it is excellent
Change the explanation of mapping result)
The technical scheme adopted by the invention to solve the technical problem is that：A kind of virtual network mapping for keeping node adjacent
Method, this method include the following steps：
S1. for all physical nodes and dummy node structure physics and virtual resource set, virtual networks mapping；
S2. the dummy node of selection dummy node set interior joint resource requirement maximum performs on physical node mapped
Journey；
S3. new physics and virtual resource set are rebuild to unmapped physical node and dummy node；
S4. the node of resource requirement maximum in the non-mapping node adjacent with maps virtual node is selected, in physics section
Mapping process is performed on point.
Further, S1 of the present invention includes：
S11. physical resource can be described asWherein NPRepresent physics node set, EPRepresent physics
Link set, power(nP) represent node nP∈NPAttribute, such as computing capability, power(eP) represent link eP∈EPAttribute,
Such as amount of bandwidth.Equally, virtual network requests can be described asWherein weighWithIt represents respectively
The demand of virtual nodes and virtual link to resource, such as the computing capability and network bandwidth of request distribution.It please by virtual network
It asksIt is deployed to physical resourceOn virtual network mapping, be denoted as M:
GV→GP, wherein, node mapping is denoted as MN:NV→NP, link maps are denoted as ME:EV→EP。
S12. note dummy node collection is combined into N (nV), and physical node collection is combined into N (nP)；
Further, S2 of the present invention includes：
If S21. set N (nV) be empty, then success is mapped, is terminated；If set N (nV) it is not sky, find set N (nV) in
Node resource requires highest dummy node, is denoted as node
S22. set N (n are foundP) in the most physical node of remaining node resource, if it disclosure satisfy that nodeNeed
It asks, and inspection can be cut by 1-, be then denoted as nodeIf it disclosure satisfy that nodeDemand, but can not lead to
It crosses 1- and cuts inspection, then excluded set N (nP), return to step S22 is re-executed；If it is impossible to meet nodes for itNeed
It asks, then maps failure；
S23. by dummy nodeIt is mapped to physical nodeOn, and update physical nodeSurplus resources；
Further, S3 of the present invention includes：
S31. searching and dummy nodeThe set that the node not being mapped in adjacent dummy node is formed, is denoted as
S32. existThe dummy node of middle searching demand maximum, is denoted as nodeRemember nodeWith nodeBetween
Virtual link is
S33. searching and nodeIt is adjacent and between physical link disclosure satisfy thatThe physical node set of demand, note
For
Further, in one embodiment of the invention, the S4 further comprises the present invention：
S41. set is foundThe most node of interior joint resource, if it is impossible to meet nodes for itDemand, then will
NodeExclude setSkip to step S32；If it disclosure satisfy that nodeDemand but inspection can not be cut by 1-
It tests, is then excluded setReturn to step S41 is re-executed；If ultimately fail to find feasible node or not
There are satisfactionsThe link of link requirements, then by dummy nodeExclude setSkip to step S32；If it searches out
Node disclosure satisfy that nodeDemand and inspection is cut by 1-, then be denoted as nodeIf setIn own
Dummy node has not all been mapped by step S41 but successfully, update set N (nV) it is also non-mapped dummy node collection
It closes, skips to step S21；If setIn all dummy nodes all successfully mapped by step S41 and existing, then
Skip to step S44；
S42. by dummy nodeIt is mapped to physical nodeOn, update physical nodeSurplus resources；
S43. by dummy nodeExclude setSkip to step S32；
S44. searching and dummy nodeThe set that the node not being mapped in adjacent dummy node is formed, is denoted asSkip to step S32；
Advantageous effect：
1st, the mapping method of virtual network for keeping node adjacent of the invention can be in the situation for slightly reducing mapping efficiency
Under, keep adjacent dummy node adjacent in actual physics network as much as possible, so as to greatly shorten physical link
Length, improves the utilization rate of physical resource, while optimizes mapping result, improves the working efficiency of virtual network, so as to improve clothes
Business quality.
2nd, it is of the invention to have carried out reality with virtual network mapping algorithm-two-step virtual network mapping algorithm the most classical
It tests and compares.Experimental result can see in attached drawing 3- attached drawings 14.Two-step virtual network mapping algorithm is to be also the most succinctly
Virtual network mapping is exactly divided by virtual network mapping algorithm the most general, so-called two-step virtual network mapping algorithm
Simplest two parts --- dummy node maps and virtual link mapping.First, dummy node is carried out using greedy algorithm
The solution of mapping carries out the solution of virtual link mapping using k shortest path firsts later.
3rd, additional aspect and advantage of the invention will be set forth in part in the description, partly will from the following description
Become apparent or be recognized that by the practice of the present invention.
Description of the drawings
Fig. 1 is a kind of flow chart of mapping method of virtual network for keeping node adjacent of the embodiment of the present invention.
Fig. 2 is an example of the mapping method of virtual network for keeping node adjacent of the embodiment of the present invention.
Fig. 3 be the embodiment of the present invention keep the adjacent mapping method of virtual network of node and mapping success rate with virtual
Link existing probability variation diagram.
Fig. 4 be the embodiment of the present invention the virtual network requests for keeping the adjacent mapping method of virtual network of node in it is adjacent
Ratio still adjacent is with virtual link existing probability variation diagram after node mapping.
Fig. 5 is the side of the physical node utilization rate of the mapping method of virtual network for keeping node adjacent of the embodiment of the present invention
Difference is with virtual link existing probability variation diagram.
Fig. 6 is the mapping success rate of the mapping method of virtual network for keeping node adjacent of the embodiment of the present invention with virtual section
The variation diagram of point number value range.
Fig. 7 be the embodiment of the present invention the virtual network requests for keeping the adjacent mapping method of virtual network of node in it is adjacent
After node mapping still adjacent ratio with dummy node number value range variation diagram.
Fig. 8 is the side of the physical node utilization rate of the mapping method of virtual network for keeping node adjacent of the embodiment of the present invention
Difference with dummy node number value range variation diagram.
Fig. 9 is the mapping success rate of the mapping method of virtual network for keeping node adjacent of the embodiment of the present invention with virtual net
The variation diagram of the value range of dummy node resource in network request.
Figure 10 be the embodiment of the present invention the virtual network requests for keeping the adjacent mapping method of virtual network of node in phase
After neighbors mapping still adjacent ratio with the value range of dummy node resource variation diagram.
Figure 11 is the physical node utilization rate of the mapping method of virtual network for keeping node adjacent of the embodiment of the present invention
Variance with the value range of dummy node resource variation diagram.
Figure 12 is the mapping success rate of the mapping method of virtual network for keeping node adjacent of the embodiment of the present invention with virtual
The variation diagram of the value range of virtual link resource in network request.
Figure 13 be the embodiment of the present invention the virtual network requests for keeping the adjacent mapping method of virtual network of node in phase
After neighbors mapping still adjacent ratio with the value range of virtual link resource variation diagram.
Figure 14 is the physical node utilization rate of the mapping method of virtual network for keeping node adjacent of the embodiment of the present invention
Variance with the value range of virtual link resource variation diagram.
Specific embodiment
The embodiment of the present invention is described below in detail, the example of the embodiment is shown in the drawings, wherein from beginning to end
The same or similar element of same or similar symbolic indication or the element with same or like function.Below with reference to attached
The embodiment of figure description is exemplary, it is intended to for explaining the present invention, and is not considered as limiting the invention.
It is more particularly to a kind of to keep adjacent virtual of node the present invention relates to resource management field in network virtualization bad border
Network mapping method.The present invention keeps adjacent dummy node in reality as much as possible in the case where slightly reducing mapping efficiency
It is adjacent in the physical network of border, so as to greatly shorten the length of physical link, the utilization rate of physical resource is improved, is optimized simultaneously
One invention of the virtual network mapping of mapping result.
S1. for all dummy nodes and physical node structure set, mainly include：
S11. it is described for physical resource with virtual network requests, physical resource mainly includes information：Physical network is opened up
Flutter situation, physical node resource, physical link resource.Virtual network requests mainly include：For virtual network requests topology situation (i.e.
Virtual link situation between dummy node and dummy node), dummy node resource, virtual link resource.Therefore, undirected weighting can be used
Figure describes physical resource and virtual network requests well.Physical resource can be described asWherein NP
Represent physics node set, EPRepresent physics link set, power(nP) represent node nP∈NPAttribute, such as computing capability, power
(eP) represent link eP∈EPAttribute, such as amount of bandwidth.Equally, virtual network requests can be described as Wherein weighWithRepresent demand to resource of virtual nodes and virtual link respectively, such as the computing capability of request distribution and
Network bandwidth etc..By virtual network requestsIt is deployed to physical resource
On virtual network mapping, be denoted as M:GV→GP, wherein, node mapping is denoted as MN:NV→NP, link maps are denoted as ME:EV→EP。
S12. note dummy node collection is combined into N (nV), and physical node collection is combined into N (nP)；
S2. the dummy node of selection dummy node set interior joint resource requirement maximum performs on physical node mapped
Journey.Specifically, further comprise：
If S21. set N (nV) be empty, then success is mapped, is terminated；If set N (nV) it is not sky, find set N (nV) in
Node resource requires highest dummy node, is denoted as node
S22. it performsTo set N (nP) mapping process
Before mapping, set N (n are first foundP) in the most physical node of remaining node resource, judge its residue money
Whether source disclosure satisfy thatResource requirement, if it disclosure satisfy that nodeDemand, then need further to perform 1- and cut inspection,
Specifically, it is exactly：
MN It arrivesOn node mapping, constant k ∈
[1, | NV|].If MNMeetThen claim MNInspection is cut by k-,
In,
MN(S)={ nP|nP=MN(nV), nV∈ S }, to network G=(N, E, AN, AE) one of node set N divide and claim
One for G is cut.It cutsBy N be divided into S andTwo parts, if referred to as network G | S |-to cut sides e=(μ, v) full
Sufficient μ ∈ S,Then claim side e by cuttingIt is all by cuttingThe sum of the bandwidth on side be referred to as to cutAppearance
Amount, is denoted as ψ (G, S).
As node mapping MNWhen cutting inspection by k-, it is 93.9% to have reliable links to map corresponding probability, can
Node mapping of the overwhelming majority there is no reliable links mapping to be foreclosed.Here in order to avoid the excessively high time is complicated
Degree, the present invention carry the place that k- is needed to cut inspection in the mapping method of virtual network for keeping node adjacent and all only carry out 1-
Cut inspection.
If inspection can be cut by 1-, it is denoted as nodeIf it disclosure satisfy that nodeDemand, but cannot
Inspection is enough cut by 1-, then is excluded set N (nP), return to step S22 is re-executed；If it is impossible to meet nodes for it
Demand, then map failure；
S23. by dummy nodeIt is mapped to physical nodeOn, and update physical nodeSurplus resources；
S3. set is rebuild to unmapped dummy node and physical node.Specifically, further comprise：
S31. searching and dummy nodeThe set that the node not being mapped in adjacent dummy node is formed, is denoted as
S32. existThe dummy node of middle searching demand maximum, is denoted as nodeRemember nodeWith nodeBetween
Virtual link is
S33. searching and nodeIt is adjacent and between physical link disclosure satisfy thatThe physical node set of demand,
It is denoted as
S4. the node of resource requirement maximum in the node adjacent with maps virtual node is selected, is held on physical node
Row mapping process.Specifically, further comprise：
S41. set is foundThe most node of interior joint resource, if it is impossible to meet nodes for itDemand, then will
NodeExclude setSkip to step S32；If it disclosure satisfy that nodeDemand but inspection can not be cut by 1-
It tests, is then excluded setReturn to step S41 is re-executed；If ultimately fail to find feasible node or not
There are satisfactionsThe link of link requirements, then by dummy nodeExclude setSkip to step S32；If it searches out
Node disclosure satisfy that nodeDemand and inspection is cut by 1-, then be denoted as nodeIf setIn own
Dummy node has not all been mapped by step S41 but successfully, update set N (nV) it is also non-mapped dummy node collection
It closes, skips to step S21；If setIn all dummy nodes all successfully mapped by step S41 and existing, then
Skip to step S44；
S42. by dummy nodeIt is mapped to physical nodeOn, update physical nodeSurplus resources；
S43. by dummy nodeExclude setSkip to step S32；
S44. searching and dummy nodeThe set that the node not being mapped in adjacent dummy node is formed, is denoted asSkip to step S32；
Below with Fig. 2 come simplicity of explanation once this method.Virtual network requests given by Fig. 2 and the physics for mapping
Network, tri- node demands of virtual network requests a, b, c are respectively 20,15,10, and link requirements therebetween are respectively 10,
15,20, five node resources of physical network A, B, C, D, E for mapping are respectively 40,30,5,10,20, link therebetween
Resource is respectively 10,30,20,30,15, according to the above method, first looks for virtual network requests interior joint demand resource maximum
Node, as a nodes then look for the most node of physical network interior joint resource, as A nodes.By judging, A sections
The node resource meet demand of point, but inspection cannot be cut by 1-, so removal A nodes, later in remaining physical network
The most node of node resource, as B node are found in node.Through judgement, B node can meet the needs of a nodes and
Inspection is cut, therefore dummy node a is mapped on physical node B by 1-, update B node surplus resources are 10.It finds later
The most dummy node of the demand resource adjacent with a nodes, as b nodes, a, the virtual link demand between b nodes are 10.It
Find afterwards it is adjacent with physical node B and between link disclosure satisfy that the nodes of link requirements, as A and C, wherein node resource
Most is A nodes.By judging, A nodes can meet b nodes demand and cut inspection, therefore b nodes are reflected by 1-
It is mapped on A nodes, update A nodes surplus resources are 25.It finds later and adjacent with a nodes in virtual network requests removes b nodes
In addition and node that node resource demand is most, i.e. c nodes, a, the virtual link demand between c nodes is 20.Object is found later
In reason resource it is adjacent with B node disclosure satisfy that between link requirements node interior joint surplus resources maximum node, i.e. C saves
Point.By judging, C nodes cannot meet the node demand of dummy node c, and either with or without other nodes adjacent with A, therefore will
The dummy node a mapped, b, physical node B, A are excluded, remaining node are continued back at method and is initially carried out.It finds virtual
The most dummy node of demand resource in request, i.e. c nodes.The section that resource interior joint resource is most in physical network is found later
Point, i.e. E nodes.By judging, physical node E disclosure satisfy that the node resource demand of dummy node c, and can be cut by 1-
It examines, therefore c nodes is mapped on physical node E, complete mapping.
It is the simulation experiment result below：
In emulation experiment, (including virtual network requests dummy node number, the node of dummy node provides network topology situation
Source, link circuit condition, physical node, link circuit resource etc.) it is generated at random by GT-ITM.Emulator is by setting different parameters (such as
Virtual network requests dummy node number value range, node resource value range of dummy node etc.) simulate different void
Intend network request and physical network environment.In all cases to keeping the adjacent mapping method of virtual network of node (hereinafter referred to as
This method) it is emulated, and itself and classical two-step mapping method of virtual network (hereinafter referred to as two-step method) are compared
Compared with analysis simulation result obtains its performance in varied situations, where obtaining the advantage of this method, summarizes it and is applicable in ring
Border demonstrates its feasibility.
(1) virtual network requests and physical network ambient conditions A
Table 1：The generation relevant parameter of virtual network requests and bottom physical network
It is set according to table 1, simulation result such as Fig. 3, Fig. 4 is obtained in this case, shown in Fig. 5.In terms of mapping result, in object
Under the network environment for managing resource abundance, both of which has very high mapping success rate, and is keeping node adjacent, improves physics
Link utilization, optimization map the target of effect apparently, although this method can be (i.e. virtual with the raising of virtual link existing probability
The topological complexity raising of network request) and reducing effect, but it is more much higher than two-step method always, that is to say, that mapping effect
It is better very much.And section is all accomplished by the variance of physical node utilization rate better than both of which it can be seen from relatively low
The equilibrium of point pressure, wherein two-step method performance are more outstanding.
(2) virtual network requests and physical network ambient conditions B
Table 2：The generation relevant parameter of virtual network requests and bottom physical network
It is set according to table 2, simulation result such as Fig. 6, Fig. 7 is obtained in this case, shown in Fig. 8.In terms of mapping result, with
The increase (i.e. virtual network requests expand) of the value range of virtual network requests dummy node number, especially dummy node
When number is more than physical node number half, the mapping success rate of two methods all decreased significantly.And when in virtual network requests
The demand of virtual link relative to physical link resource it is higher when, the mapping success rate of this method is apparently higher than two-step method.
Meanwhile can also be obtained by Fig. 7, when the demand of virtual link in virtual network requests is higher relative to physical link resource,
This method still can reach relative to two-step method in a preferable virtual network requests still adjacent after adjacent node mapping
Ratio, that is, the utilization rate of virtual link can be improved, reach a preferable mapping effect.And by physical node utilization rate
Variance all than relatively low as can be seen that both of which has accomplished the equilibrium of node pressure, wherein two-step method better
Performance is more outstanding.
(3) virtual network requests and physical network ambient conditions C
Table 3：The generation relevant parameter of virtual network requests and bottom physical network
It is set according to table 3, simulation result such as Figure 10, Figure 11 in this case, shown in Figure 12.In terms of mapping result,
The variation of the value of dummy node resource is not very big on the influence of both methods various aspects in virtual network requests.But
Can significantly it reflect in this case from Figure 10, this method mapping success rate is generally higher than two-step method.Meanwhile by
Figure 11 can show that this method, which is mapped in, improves physical link utilization rate, improves service quality, apparent excellent in terms of optimization mapping result
In two-step method.And as seen from Figure 12, the raising of the value range of dummy node resource can reduce in virtual network requests
The balance degree of node pressure, although ascensional range is very big, absolute figure but very little, it can be said that two methods are in node
All performance is good in pressure equilibrium.
(4) virtual network requests and physical network ambient conditions D
Table 4：The generation relevant parameter of virtual network requests and bottom physical network
It is set according to table 4, simulation result such as Figure 12, Figure 13 is obtained in the case, shown in Figure 14.In terms of mapping result,
In virtual network requests virtual link resource requirement relative to physical link resource it is relatively low when, both of which, which can guarantee, to be compared
High mapping success rate.And when virtual link resource becomes larger relative to physical link resource, two methods are mapped to
Power all significantly decreases.But as shown in Figure 12, the mapping success rate of this method can be higher than two under harsh link condition
Step formula method.And as the main target of this method, Tu13Zhong is still adjacent after adjacent node mapping in virtual network requests
Ratio is much higher all than two-step method under conditions of various virtual link sizes, it is seen that it is improving physical link resource profit
With rate, optimization mapping result, aspect of improving service quality can be made fine.And the relatively low physical node profit reflected by Figure 14
With the variance of rate it is known that two methods all showed in terms of node pressure equilibrium it is excellent, this method be it is slightly inferior and
.
The simulation experiment result Analysis and summary:
In conclusion the mapping method of virtual network for keeping node adjacent of the present invention, in 4 kinds of virtual network requests above
With in physical network ambient conditions, with 4 main parameters of virtual network requests, (there are the general of link between two dummy nodes respectively
Rate, the value range of dummy node number, the value range of dummy node resource requirement, the value range of virtual link resource)
As independent variable, it is changed, analyzes in different virtual network requests in suitable numerical value relative to physical network situation
Keep node adjacent under topological complexity, virtual network requests scale, virtual network requests node, link requirements pressure
The performance of mapping method of virtual network, and itself and classical two-step mapping method of virtual network are compared.Summary
The analysis of simulation result of four kinds of situations can be seen that the mapping method of virtual network for keeping node adjacent and be filled in opposite physical resource
Foot, virtual network requests node resource demand is larger, virtual network requests link resource needs it is larger it is several in the case of have not
Wrong mapping success rate, only in virtual network requests, virtual link resource requirement will relative to real physical links resource
When asking very harsh, can just it embody than relatively low mapping success rate.Therefore, it in the mapping of most virtual networks, keeps
The adjacent mapping method of virtual network of node has than more satisfactory success rate, and feasibility is higher.And it is used as and keeps node
The characteristics of adjacent mapping method of virtual network and main target are still adjacent after adjacent node mapping in virtual network requests
Ratio all does well in virtual network requests and physical network ambient conditions.It can thus be seen that improving physical link
Resource utilization, optimization virtual network map effect, so as to improve the service quality aspect after mapping, the void for keeping node adjacent
Intending network mapping method can be made very good, and applicability is very high in the case of more demanding to virtual network mapping result.
Meanwhile simulation result is analyzed it is not difficult to find that the mapping method of virtual network for keeping node adjacent is keeping node pressure equilibrium side
Face is also done well, and has been properly arrived at now for the demand in terms of Network Load Balance.
It should be noted that any process described otherwise above or method description can be managed in flow chart or herein
Xie Wei represents the code for including the executable instruction of one or more the step of being used to implement specific logical function or process
Module, segment or part, and the range of the preferred embodiment of the present invention includes other realization, wherein can not press shown
The sequence for going out or discussing, including according to involved function by substantially similar way or in the opposite order, to perform function,
This should be understood by the embodiment person of ordinary skill in the field of patent.
In the description of this specification, reference term " one embodiment ", " example ", " is specifically shown " some embodiments "
The descriptions such as example " or " some examples " mean to combine the particular features, structures, materials, or characteristics packet that the embodiment or example describe
It includes at least one embodiment of the present invention or example.In the present specification, schematic expression of the above terms are not necessarily
Refer to identical embodiment or example.Moreover, the particular features, structures, materials, or characteristics of description can be at any one
Or it is combined in an appropriate manner in multiple embodiments or example.
Although the embodiments of the present invention has been shown and described above, it is to be understood that above-described embodiment is example
Property, it is impossible to be interpreted as the limitation to invention, those of ordinary skill in the art are not departing from the principle of the present invention and objective
In the case of can make changes, modifications, substitutions and variations to the above described embodiments within the scope of the invention.
Claims (5)
1. a kind of mapping method of virtual network for keeping node adjacent, which is characterized in that include the following steps：
S1. for all physical nodes and dummy node structure physics and virtual resource set, virtual networks mapping；
S2. the dummy node of selection dummy node set interior joint resource requirement maximum performs mapping process on physical node；
S3. new physics and virtual resource set are rebuild to unmapped physical node and dummy node；
S4. the node of resource requirement maximum in the non-mapping node adjacent with maps virtual node is selected, on physical node
Perform mapping process.
2. the mapping method of virtual network for keeping node adjacent as described in claim 1, which is characterized in that the S1 includes：
S11. the mapping method of virtual network for keeping node adjacent that is, when virtual network carries out resource impact, keeps virtual network
In adjacent dummy node when being mapped in physical resource, map successful physical resource node and also keep adjacent, physics as possible
Resource can be described asWherein NPRepresent physics node set, EPRepresent physics link set, power(nP)
Represent node nP∈NPAttribute, i.e. computing capability, power(eP) represent link eP∈EPAttribute, i.e. amount of bandwidth is equally, empty
Intend network request can be described asWherein weighWithVirtual nodes and virtual link pair are represented respectively
The demand of resource asks the computing capability and network bandwidth of distribution, by virtual network requestsPortion
Affix one's name to physical resource：
On virtual network mapping, be denoted as M:GV→GP, wherein, node mapping is denoted as MN:NV→NP,
Link maps are denoted as ME:EV→EP；
S12. note dummy node collection is combined into N (nV), physical node collection is combined into N (nP)。
3. the mapping method of virtual network for keeping node adjacent as described in claim 1, which is characterized in that the S2 includes：
If S21. set N (nV) be empty, then success is mapped, is terminated；If set N (nV) it is not sky, find set N (nV) interior joint
The highest dummy node of resource requirement, is denoted as node
S22. set N (n are foundP) in the most physical node of remaining node resource, if it disclosure satisfy that nodeDemand, and
And inspection can be cut by 1-, then it is denoted as nodeIf it disclosure satisfy that nodeDemand, but can not be cut by 1-
It examines, is then excluded set N (nP), return to step S22 is re-executed, if it is impossible to meet nodes for itDemand, then reflect
It is lost to lose；
S23. by dummy nodeIt is mapped to physical nodeOn, and update physical nodeSurplus resources.
4. the mapping method of virtual network for keeping node adjacent as described in claim 1, which is characterized in that the S3 includes：
S31. searching and dummy nodeThe set that the node not being mapped in adjacent dummy node is formed, is denoted as
S32. existThe dummy node of middle searching demand maximum, is denoted as nodeRemember nodeWith nodeBetween it is virtual
Link is
S33. searching and nodeIt is adjacent and between physical link disclosure satisfy thatThe physical node set of demand, is denoted as
5. the mapping method of virtual network for keeping node adjacent as described in claim 1, which is characterized in that the S4 includes：
S41. set is foundThe most node of interior joint resource, if it is impossible to meet nodes for itDemand, then by nodeExclude setSkip to step S32；If it disclosure satisfy that nodeDemand but inspection can not be cut by 1-, then
Excluded setReturn to step S41 is re-executed；If it ultimately fails to find feasible node or be not present
MeetThe link of link requirements, then by dummy nodeExclude setSkip to step S32；If the node searched out
It disclosure satisfy that nodeDemand and inspection is cut by 1-, then be denoted as nodeIf setIn it is all virtual
Node has not all been mapped by step S41 but successfully, update set N (nV) it is also non-mapped dummy node set,
Skip to step S21；If setIn all dummy nodes all successfully mapped by step S41 and existing, then skip to
Step S44；
S42. by dummy nodeIt is mapped to physical nodeOn, update physical nodeSurplus resources；
S43. by dummy nodeExclude setSkip to step S32；
S44. searching and dummy nodeThe set that the node not being mapped in adjacent dummy node is formed, is denoted asSkip to step S32.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810015657.3A CN108270695A (en) | 2018-01-08 | 2018-01-08 | A kind of mapping method of virtual network for keeping node adjacent |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810015657.3A CN108270695A (en) | 2018-01-08 | 2018-01-08 | A kind of mapping method of virtual network for keeping node adjacent |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108270695A true CN108270695A (en) | 2018-07-10 |
Family
ID=62773240
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810015657.3A Pending CN108270695A (en) | 2018-01-08 | 2018-01-08 | A kind of mapping method of virtual network for keeping node adjacent |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108270695A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112653580A (en) * | 2020-12-16 | 2021-04-13 | 国网河南省电力公司信息通信公司 | Virtual network resource allocation method based on active detection under network slice |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7543084B2 (en) * | 2005-02-25 | 2009-06-02 | International Business Machines Corporation | Method for destroying virtual resources in a logically partitioned data processing system |
| CN102904794A (en) * | 2012-09-27 | 2013-01-30 | 北京邮电大学 | Method and device for mapping virtual network |
| CN103179052A (en) * | 2011-12-20 | 2013-06-26 | 中国科学院声学研究所 | Virtual resource allocation method and system based on proximity centrality |
| CN103428805A (en) * | 2013-08-07 | 2013-12-04 | 湖南大学 | Wireless network virtualization mapping method based on anti-interference performance of links |
| CN104104621A (en) * | 2013-04-07 | 2014-10-15 | 中国科学院声学研究所 | Dynamic adaptive adjustment method of virtual network resources based on nonlinear dimensionality reduction |
| CN104320276A (en) * | 2014-10-28 | 2015-01-28 | 北京邮电大学 | Virtual network mapping method and system based on cut set |
| CN104579896A (en) * | 2014-11-20 | 2015-04-29 | 北京邮电大学 | Method and device for dividing virtual network |
| CN104821906A (en) * | 2015-04-08 | 2015-08-05 | 湖州师范学院 | Efficient energy-saving virtual network node mapping model and algorithm |
| US20160314079A1 (en) * | 2015-04-22 | 2016-10-27 | ColorTokens, Inc. | Object memory management unit |
| CN106681795A (en) * | 2016-12-09 | 2017-05-17 | 北京航空航天大学 | Virtual network mapping method utilizing local topological attributes of nodes and available resource capacity values |
-
2018
- 2018-01-08 CN CN201810015657.3A patent/CN108270695A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7543084B2 (en) * | 2005-02-25 | 2009-06-02 | International Business Machines Corporation | Method for destroying virtual resources in a logically partitioned data processing system |
| CN103179052A (en) * | 2011-12-20 | 2013-06-26 | 中国科学院声学研究所 | Virtual resource allocation method and system based on proximity centrality |
| CN102904794A (en) * | 2012-09-27 | 2013-01-30 | 北京邮电大学 | Method and device for mapping virtual network |
| CN104104621A (en) * | 2013-04-07 | 2014-10-15 | 中国科学院声学研究所 | Dynamic adaptive adjustment method of virtual network resources based on nonlinear dimensionality reduction |
| CN103428805A (en) * | 2013-08-07 | 2013-12-04 | 湖南大学 | Wireless network virtualization mapping method based on anti-interference performance of links |
| CN104320276A (en) * | 2014-10-28 | 2015-01-28 | 北京邮电大学 | Virtual network mapping method and system based on cut set |
| CN104579896A (en) * | 2014-11-20 | 2015-04-29 | 北京邮电大学 | Method and device for dividing virtual network |
| CN104821906A (en) * | 2015-04-08 | 2015-08-05 | 湖州师范学院 | Efficient energy-saving virtual network node mapping model and algorithm |
| US20160314079A1 (en) * | 2015-04-22 | 2016-10-27 | ColorTokens, Inc. | Object memory management unit |
| CN106681795A (en) * | 2016-12-09 | 2017-05-17 | 北京航空航天大学 | Virtual network mapping method utilizing local topological attributes of nodes and available resource capacity values |
Non-Patent Citations (4)
| Title |
|---|
| 曲桦，王丽霞，赵季红，王贺男: "面向差异化业务请求的虚拟网络映射算法", 《电信科学》 * |
| 梁召伟,吕光宏,王坤: "满足链路约束的拓扑聚集度虚拟网络映射算法", 《四川大学学报》 * |
| 熊文成，王颖，邱雪松，李文璟: "基于链路优先的快速协同虚拟网络映射算法", 《通信学报》 * |
| 赵志远，孟相如，苏玉泽，李振涛: "基于节点邻近感知与路径综合评估的虚拟网络映射算法", 《电子与信息学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112653580A (en) * | 2020-12-16 | 2021-04-13 | 国网河南省电力公司信息通信公司 | Virtual network resource allocation method based on active detection under network slice |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107277832A (en) | A kind of mapping method of wireless dummy network | |
| US9674081B1 (en) | Efficient mapping of table pipelines for software-defined networking (SDN) data plane | |
| CN113169899B (en) | Determining the size of a Network Service (NS) | |
| CN113037881B (en) | Cloud native service uninterrupted IP (Internet protocol) replacement method based on Kubernetes | |
| Zannou et al. | A task allocation in IoT using ant colony optimization | |
| CN113947181A (en) | Neural network accelerator model conversion method and device | |
| CN107360031B (en) | Virtual network mapping method based on optimized overhead-to-revenue ratio | |
| US10999369B2 (en) | Network topology templates for internal states of management and control planes | |
| CN108270695A (en) | A kind of mapping method of virtual network for keeping node adjacent | |
| CN114124384B (en) | QKD network virtualization method and quantum key cloud platform | |
| US9705978B1 (en) | Dependency graph management | |
| CN110515716B (en) | Cloud optimization scheduling method and system supporting priority and inverse affinity | |
| CN105553856A (en) | Method and device for realizing link-state packet updating | |
| US20160149794A1 (en) | Automatic network routing engine agnostic of underlying inventory or network management system | |
| CN108833162A (en) | A kind of network node sort method and mapping method of virtual network | |
| CN106709045A (en) | Node selection method and device in distributed file system | |
| CN112333095B (en) | Software-defined Wide Area Network (WAN) route calculation method and system based on kubernets expansion characteristic | |
| CN108021674A (en) | A kind of multi-level buffer delivery acceleration system of synchronization high in the clouds emulation data | |
| CN108683599A (en) | One kind determining method and system based on pretreated distribution network max-flow | |
| CN111970145B (en) | Internet of things equipment management and control method based on semantic virtual and task migration | |
| CN114650234B (en) | Data processing method, device and server | |
| CN107360210B (en) | Virtual machine allocation method for cloud computing data center considering energy consumption and access delay | |
| CN110086654A (en) | Active and standby controller dispositions method under software definition data center based on reliability | |
| CN109039706A (en) | Mist wireless access network collaborative content dispositions method based on graph theory | |
| Chen et al. | The declarative and reusable path composition for semantic Web-driven SDN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180710 |