CN107276664A - The empty net mapping method of mixing loaded based on thresholding formula - Google Patents
The empty net mapping method of mixing loaded based on thresholding formula Download PDFInfo
- Publication number
- CN107276664A CN107276664A CN201710651184.1A CN201710651184A CN107276664A CN 107276664 A CN107276664 A CN 107276664A CN 201710651184 A CN201710651184 A CN 201710651184A CN 107276664 A CN107276664 A CN 107276664A
- Authority
- CN
- China
- Prior art keywords
- node
- load
- mrow
- request
- formula
- 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.)
- Granted
Links
- 238000013507 mapping Methods 0.000 title claims abstract description 90
- 238000000034 method Methods 0.000 title claims abstract description 44
- 238000004422 calculation algorithm Methods 0.000 claims description 36
- 230000003068 static effect Effects 0.000 claims description 26
- 239000011800 void material Substances 0.000 claims description 18
- 238000004364 calculation method Methods 0.000 claims description 8
- 230000037361 pathway Effects 0.000 claims description 5
- 238000013461 design Methods 0.000 claims description 4
- 238000011156 evaluation Methods 0.000 claims description 2
- 230000007704 transition Effects 0.000 claims description 2
- 238000012545 processing Methods 0.000 abstract description 3
- 238000000354 decomposition reaction Methods 0.000 description 4
- 238000004088 simulation Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000005259 measurement Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/18521—Systems of inter linked satellites, i.e. inter satellite service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
Abstract
The invention discloses a kind of empty net mapping method of mixing loaded based on thresholding formula, comprise the following steps：S1：According to the request queue of satellite node, determine whether that request is remaining；S2：By searching for empty net, judge whether current request has global dummy node remaining；S3：The physical node set for meeting global node demand is selected in physical node；Calculate the average link load of the physical node set；Minimum node integrated load or maximum node integrated load are selected from physical node set, the mapping of the global node is completed；Discarding function is called, the processing mode of empty net request is obtained；Waiting list is delivered into empty net request comprising the global node；Mapped using backtracking method and node and its link are recalled in the request.The balanced load of Partial key Inter-satellite Links of the application, makes the distribution of satellite physical network load more balanced, while also improving the utilization rate of satellite resource.
Description
Technical field
It is specifically a kind of to be reflected based on the empty net of mixing that thresholding formula is loaded the invention belongs to satellite communication network technical field
Shooting method.
Background technology
With the development of information technology, the space information system using satellite network as core becomes current countries in the world
Study hotspot.Satellite network can not be influenceed by factors such as ground geographical position, meteorology, natural calamities, full-time with the whole world
Covering power.But simultaneously again because isomerism, distributivity, autonomy, scalability and dynamic etc. is presented in satellite network resources
Feature so that traditional satellite network resources administrative skill, which can not be met, to be continuously increased and the obvious multiple business need of feature difference
Ask.
In satellite network, because the high-speed cruising of satellite node and its topological yardstick of satellite environment are big so that satellite
The scarce resources such as the CPU of node, the bandwidth of inter-satellite link are difficult to obtain using compared with usury.
The content of the invention
In view of the above problems, in order to which the resource management architecture framework for preferably coordinating hierarchical carries out empty net mapping, this hair
A kind of method decomposed that loads of bright introducing nets division to design void, improves satellite resource utilization rate.
For the balanced load of Partial key Inter-satellite Links, make the distribution of satellite physical network load more balanced, together
When also improve the utilization rate of satellite resource, the technical proposal of the invention is realized in this way：
The empty net mapping method of mixing loaded based on thresholding formula, is comprised the following steps：
Step 1：Determine whether that request is remaining, if there is residue, advance to step 2；If without residue, mapping is finished, and is calculated
Method terminates；
Step 2：Judge whether current request has global dummy node remaining, if there is residue, advance to step 3；If without residue,
Skip to step 8；
Step 3：The physical node set for meeting global node demand is selected in physical node, if the collection is combined into sky,
Skip to step 7；Otherwise step 4 is advanced to；
Step 4：The average link load of the physical node set is calculated, if the average link load of physical node set is small
Threshold value is abandoned in link load static state, step 5 is advanced to；If the average link load of physical node set is more than or equal to link
Load static abandons threshold value and is less than the static inverter threshold value that maximum integrated load preferentially maps, or physical node set
Average link load is more than or equal to the static inverter threshold value that maximum integrated load preferentially maps, and skips to step 6；
Step 5：If the average link load of physical node set is less than the static inverter that maximum integrated load preferentially maps
Threshold value, from physical node set select minimum satellite vehicle node integrated load, complete the mapping of the global node, after the completion of jump
To step 2；If the average link load of physical node set is more than or equal to the static inverter door that maximum integrated load preferentially maps
Limit value, selects maximum satellite node integrated load to map the global node from physical node set；After the completion of mapping, skip to
Step 2；
Step 6：Discarding function is called, if value is 0, step 5 is skipped to；Otherwise step 7 is advanced to；
Step 7：Waiting list, the number of times that void net request is requeued are delivered into empty net request comprising the global node
DELAY has been pre-set, and then refuses the request more than DELAY；Skip to step 1；
Step 8：Mapped using backtracking method and node and its link are recalled in the request.
Further, the average link of physical node set, which is loaded, is：
SE(t,es) it is physical link esIn moment t utilization rate,Represent the m bar links of the node
Average link is loaded；Loaded for the average link of physical node collection.
Further, inter-satellite link load formulas is：
Wherein ev↑esRepresent virtual link evIt is mapped to physical link esOn, B (es) represent physical link total bandwidth, B (ev)
Represent to have mapped the bandwidth that virtual link is asked.
Further, minimum satellite vehicle node integrated load formula is：Wherein P represents a thing
Manage node set, SCFor satellite node integrated load, formula isSN(t,
ns) be satellite node load, formula isWherein nv↑nsRepresent dummy node nvMapping
To physical node nsOn, C (ns) represent physical node total CPU, C (nv) represent to have mapped the CPU of dummy node request.
Further, maximum satellite node integrated load formula is：
Further, it is layered under the virtual resource management framework in point domain, is born using k- based on satellite network
Carry decomposition and come design node division and empty net division.
Further, during the mixing void net mapping method loaded using thresholding formula, it is necessary first to Statistical Physics node
Remaining cpu resource, and set link load static state to abandon the static inverter door that threshold value γ and maximum integrated load preferentially map
Limit value η.
Further, infrastructure provider maps the successfully obtainable profit of empty net, calculation formula based on mapping income
For：B (e in formulav) it is that successfully empty guipure is wide for mapping, C (nv) be
The successful empty net node cpu resource of mapping, λ and μ are the weight coefficients for adjusting bandwidth and CPU；
Infrastructure provider successfully maps the provided resource of empty net based on mapping cost, and calculation formula is：B(ls) it is the bandwidth that physical pathway is supplied to virtual link.
As further, the drop probability of void net request is the empty net request in a time window, and void net is asked
According to mapping income R (GV) sequence, select RMAX(GV), calculation formula is：
As further, the formula for abandoning function is：
The beneficial effects of the invention are as follows：Empty net is divided by introducing the thought based on K nuclear decomposition, so that it is whole to reduce empty net
Net the complexity of mapping；Satellite node load is considered with inter-satellite link load, link load static state is set up and abandons thresholding
Value and link load static inverter threshold value, so as to improve the mapping income of empty net, are finally reached raising satellite resource utilization rate
Purpose.
Brief description of the drawings
The shared width of accompanying drawing 6 of the present invention：
Fig. 1 is flow chart of the present invention based on the empty net mapping method of mixing that thresholding formula is loaded；
Fig. 2 is the empty net mapping algorithm schematic diagram of thresholding formula load mixing；
Fig. 3 is mapping success rate (time) distribution map；
Fig. 4 is mapping success rate (speed) distribution map；
Fig. 5 is income/cost ratio (time) distribution map；
Fig. 6 is income/cost ratio (speed) distribution map.
Embodiment
In order that the object, technical solutions and advantages of the present invention are clearer, below in conjunction with the accompanying drawings with specific embodiment pair
The present invention is described in detail.
Before the empty net mapping method of the mixing loaded based on thresholding formula is described in detail, the correlation needed for this method is first introduced
Parameter and correlation computations formula.
Firstly, it is necessary to be proposed and quantified the physical resource that satellite communication network is included.This method needs following
Parameter：The total bandwidth and remaining bandwidth of physical link；Total cpu resource of physical node and remaining cpu resource quantity；Link load
Static state abandons threshold value and link load static inverter threshold value.
Secondly, this method relate to index of correlation parameter and its calculation formula.
(1) according to physical node nsTotal cpu resource C (ns) and mapped the cpu resource used and define the moment t physics
The remaining cpu resource of node is as follows：
Wherein nv↑nsRepresent dummy node nvIt is mapped to physical node nsOn, C (ns) represent physical node total CPU, C (nv)
Represent to have mapped the CPU that dummy node is asked.
(2) satellite node is loaded：Physical node nsIn moment t load SN(t,ns) used for physical node mapping
CPU and node cpu total amount ratio：
(3) inter-satellite link is loaded：Physical link esIn moment t utilization rate SE(t,es), i.e., the physical link has mapped and made
The ratio of bandwidth and link total bandwidth：
Wherein ev↑esRepresent virtual link evIt is mapped to physical link esOn, B (es) represent physical link total bandwidth, B (ev)
Represent to have mapped the bandwidth that virtual link is asked.
(4) satellite node integrated load：
(5) minimum satellite vehicle node integrated load:Wherein P represents a physical node set,
The remaining cpu resource of each physical node in the set is satisfied by the CPU request of dummy node.
(6) maximum satellite node integrated load:
(7) mapping income refers to that infrastructure provider maps the successfully obtainable profit of empty net, successful according to mapping
Empty guipure is wide and CPU is defined:
Wherein, B (ev) it is that successfully empty guipure is wide for mapping, C (nv) it is mapping successfully empty net node cpu resource, λ and μ are
Weight coefficient for adjusting bandwidth and CPU, it is understood that be their unit price, λ=μ=1 is set herein, it is not influenceed
It is general.
(8) mapping cost refers to that infrastructure provider successfully maps the provided resource of empty net, according to the physics of mapping
Node is defined as with physical pathway：
Wherein, B (ls) it is the bandwidth that physical pathway is supplied to virtual link.
(9) asked for the empty net in a time window, by the request of void net according to mapping income (Revenue) R (GV) row
Sequence, selects R (GV), then each void nets the drop probability asked and is：
(10) function is abandoned to be defined as：
If the transition formula evaluation 1, then waiting list is delivered into request or refusal is asked；If 0, then allow mapping.Wherein
Rand (x) represent one (0.00~0.99) a random number, namely x span.
Embodiment 1
This method is to each virtual subnet after division, first using the thought of two-stage global optimum, with satellite section
Point integrated load is standard, performs the preferential node mapping algorithm of minimum integrated load, the global section come in maps virtual subnet
Point.Simultaneously, it is contemplated that Inter-satellite Links bandwidth resources it is rare, in order to improve empty net mapping income, the algorithm is saved in the overall situation
In point mapping process, set up link load static state and abandon threshold value γ, if the selected physics for meeting global node CPU requirement
The average link load of set of node is not less than the discarding thresholding, i.e.,Then lost using the certain probability of obedience
Whether the algorithms selection abandoned maps, if wherein abandoning function F (ev) be 1, then deliver to waiting list or discarding.In addition, the calculation
Method is directed in the case where empty net request is continuously increased, and because the success rate of mapping algorithm can worse and worse, ample resources is idle
It is not used, therefore sets link load static state inverse to complete the mapping of follow-up large-scale virtual network in the algorithm
Become threshold value η, the value is relevant with the scale of empty net request, wherein η>γ, i.e., as F (ev)=0 and
Perform the preferential node mapping algorithm of maximum integrated load.
Shown in reference picture 1, the specific implementation step of the empty net mapping method of mixing loaded based on thresholding formula is as follows：
S1：According to the request queue of satellite node, determine whether that request is remaining, if there is residue, advance to step S2；If
Without residue, then mapping is finished, and algorithm terminates.
S2：By searching for empty net, if judging whether current request has global dummy node remaining, there is residue, advance to step
S3；If without residue, skipping to step S8.
S3：The physical node Snode set for meeting global node demand is selected in physical node, if the collection is combined into sky,
Then skip to step S7；Otherwise step S4 is advanced to.
S4：The average link load of the physical node set is calculated, ifAdvance to step
S5；Otherwise (i.e.OrSkip to step S6.
S5：IfMinimum node integrated load S is selected from physical node setmin, it is complete
Into the mapping of the global node, after the completion of skip to step S2；IfFrom physical node set
Select maximum node integrated load SmaxTo map the global node.After the completion of mapping, step S2 is skipped to.
S6：Discarding function is called, if value is 0, step S5 is skipped to；Otherwise step S7 is advanced to.
S7：Waiting list, the number of times DELAY that void net request is requeued are delivered into empty net request comprising the global node
It has been pre-set that, then refuse the request more than DELAY.Skip to step S1.
S8：Mapped using backtracking method and node and its link are recalled in the request, skip to step S1.
Embodiment 2
It is used as the further restriction to embodiment 1：Under the virtual resource management framework that point domain is layered based on satellite network, adopt
Load decomposition is carried out with k- loads to divide and empty net division come design node.
Load is decomposed
If a node u meets a certain bar link e end points in a network, u is claimed to be associated each other with e, and node u is closed
The link number of connection is referred to as u Connected degree.Assuming that represented for each empty net request with a non-directed graph G=(N, E), wherein
Have | N | individual node and | E | bar side.So load decomposition is defined as：
(1) non-directed graph is that the k- loads that empty net is asked can iteratively delete the node that all Connected degrees are less than k, directly
Obtained when into figure, all remaining node connectivities are at least k.
(2) if a node belongs to k- loads, and it is not belonging to (k+1)-load, then the load factor of this node is
k。
Node division is defined as follows：
Define 1：K- load processing is carried out to topological diagram, wherein load factor is described as global node for k node；
Define 2：K- load processing is carried out to topological diagram, the node that load factor is less than k is described as to recall node.
Empty net division rule：
Rule 1：Each virtual subnet after division, at most comprising two global nodes, it is ensured that the scale of virtual subnet is not
As for excessive；
Rule 2：Each virtual subnet after division, including at least a global node and in the absence of it is single backtracking node or
Global node, it is ensured that each node (no matter recalling or global node) belongs to one of virtual subnet, and avoids son
The problem of netting index mesh excessively leads to not be mapped in physical network.
Either the empty net mapping of the empty net mapping algorithm of the backtracking method in a stage or two-stage can not all meet satellite network
The characteristic of network, thus herein for satellite network utilization rate it is low the characteristics of, with reference to satellite node load with inter-satellite link load, build
The empty net mapping method of vertical thresholding formula load mixing.
Mapping algorithm is carried herein in order to more clearly explain, we are by taking Fig. 2 as an example.Physical network, line are represented on the right side of Fig. 2
Numeral above bar is represented above the total bandwidth of the numeral expression physical link in the remaining bandwidth of physical link, bracket, node
Numeral represent the remaining cpu resource of physical node, the cpu resource of physical node is set to 100.Link load static state is set to lose
It is 0.5 to abandon value in threshold value γ, this example；And under conditions of the algorithm realizes load balancing, in order to avoid extensive empty
The mapping asked is planned to invite to fail, static inverter the threshold value η, wherein η for setting maximum integrated load preferentially to map>Taken in γ, this example
It is worth for 0.7.Two virtual net requests are represented on the left of Fig. 2, wherein dummy node a and c is core node, and b, d are ordinary node.Due to
Now, the average link load for meeting a node set is less than thresholding γ, according to satellite node integrated load formula, this time
Point C possesses the integrated load of minimum, therefore core dummy node a is mapped on physical node C.For dummy node b, using single order
Section maps backtracking method to complete mapping, in this example, because physical node F, G are in the range of a C jump, and G has minimum
Integrated load, so node G to be mapped to dummy node b, physical link (C, G) maps virtual link (a, b).Now, for
Void net request VN-2, the average link load for meeting the physical node set of core dummy node c demands is 0.53, between γ and η
Between, therefore dummy node a is mapped using the algorithms selection physical node of certain probability dropping is obeyed, if abandoning function F (ev)
For 1, then waiting list or discarding are delivered to.The not only equilibrium load of Partial key satellite link is so done, while also making to defend
Star physical network load distribution is more balanced, improves the utilization rate stream of bottom physical network resource.
Embodiment 3
The method that the embodiment is proposed for the application carries out simulation analysis：
Algorithm measurement index：
(1) success rate is mapped
Mapping success rate (Mapping Success Ratio, MSR) is defined as the empty net request number VN mappedMAPWith
Void net request sum VNSUMRatio：
(2) income/cost ratio
Income/cost ratio (Revenue/Cost Ratio) is represented as an important measurement index of mapping algorithm
The service efficiency of physical network resource.The value is the ratio that floats between 0 to 1, and 1 represents being optimal of algorithm：
Simulated environment and result：
Network settings are 66 nodes and 450 links in emulation, wherein, the node number in each point of domain obeys [1012]
Be uniformly distributed, the unified cpu resource of node is 100MHZ, and chain travel permit number obeys being uniformly distributed for [80120], link bandwidth money
Being uniformly distributed for [2050] is obeyed in source, and unit is Mb/s, and m × m, m ∈ [10,12] symmetrical square are generated using MATLAB instruments
Value on battle array, diagonal represents node cpu, and its residual value represents the bandwidth between two nodes, if value is 0, then it represents that nothing between the node
Method communicates.The arrival process of void net request is modeled as obeying the Poisson process that desired value is 5 in each time window, and each empty net please
The life span asked is 10 time windows, and the tolerance DELAY values of void net request are set to 3 time windows, and each time window is set to 100
Individual chronomere.The node number of void net request is obeyed [28] and is uniformly distributed, the node number of the virtual subnet after division and
Cpu demand obeys being uniformly distributed for [25] and [515] respectively, virtual link bar number and its bandwidth request obey respectively [15] and
Being uniformly distributed [313], is tested for each, and simulation time is set to 1200 chronomeres, and simulation example is run 10 times, is calculated
Arithmetic mean of instantaneous value, is designated as Simulation results.
For the success rate of the empty net mapping of guarantee, the median of link load is taken as link load static state discarding threshold value,
I.e. γ is set to 0.5；Because empty network planning template strand road maximum bandwidth demand is 13Mb/s, therefore the maximum integrated load of switching is preferentially mapped
The static inverter threshold value η of algorithm is set to 0.74 (i.e. 37/50).
Thresholding formula is loaded empty net hybrid algorithm (Threshold stress with hybrid virtual by this section
Network mapping algorithm, TS-hybrid-VNM) compared with the progress emulation of following two methods：
(1) MinNS-SP-VNM --- the algorithm belongs to two benches mapping algorithm.Node mapping is using minimum node load
Priority algorithm (Minimum node stress priority), link maps use K shortest path mapping methods (k
Shortest Path)。
(2) Back-VNM --- the algorithm belongs to a stage mapping algorithm.First node mapping selection greedy algorithm, passes through examination
The thought of wrong backtracking method (backtracking algorithm), completes the mapping of whole virtual network.Wherein detection threshold is determined
For 3.
Fig. 3 and Fig. 4 represent the success rate of empty net mapping.Wherein Fig. 3 transverse axis is the time, is represented with time window in figure
(every 100 chronomeres are a time window).Because the life cycle of empty net request is 10 time windows, so at the tenth
Before time, as the empty quantity for netting request is continuously increased, the mapping success rates of these three algorithms is presented downward trend, but by
When in the 6th time window, the link load of physical network reaches discarding thresholding, therefore this paper TS-hybrid-VNM algorithms
Mapping success rate decreases.In the 9th time window, physical network load reaches peak value, the mapping success rate of three kinds of algorithms
Touch the bottom, but due to using thresholding is abandoned, reducing the load of physical network herein, and preferentially calculated using maximum load
Method so that the empty net mapping success rate of this period is higher than other two kinds of algorithms.It is empty due to existing after the tenth time window
Intend network life cycle to terminate, therefore release resource so that void net mapping success rate is lifted.Fig. 4 transverse axis is empty per time window
Net the speed reached, it can be seen that with the increase of empty network speed rate, this paper algorithms equally obtain higher mapping success rate.This paper algorithms
It is final so that the success of empty net when empty net arrival tends towards stability although in early stage less empty net can be caused to abandon
Rate is obviously improved, and in physical network load excessive, adds the successful possibility of extensive empty net request mapping.
Fig. 5 and Fig. 6 respectively describe income/cost of the empty net mapping under the influence of time and empty net arrival rate factor
Than.With the increase of empty net number, virtual link needs the physical pathway of a plurality of physical link composition to complete mapping, therefore 3 kinds are calculated
The Re/Cost ratios of method are all on a declining curve.But because this paper algorithms TS-hybrid-VNM employs discarding thresholding, to a greater extent
Ground ensures the relatively high empty net request of income, so in Figure 5 six time windows when there is RE/Cost than elevated phenomenon.From
It is also seen that in the case where empty net arrival rate gradually increases, the average Re/Cost ratios of this paper algorithms are also of a relatively high in Fig. 6.Phase
To other two kinds of algorithms, the algorithm finally improves empty net income, reduces empty net mapping cost.
The foregoing is only a preferred embodiment of the present invention, but protection scope of the present invention be not limited thereto,
Any one skilled in the art in the technical scope of present disclosure, technique according to the invention scheme and its
Inventive concept is subject to equivalent substitution or change, should all be included within the scope of the present invention.
Claims (10)
1. based on the empty net mapping method of mixing that thresholding formula is loaded, it is characterised in that comprise the following steps：
Step 1：Determine whether that request is remaining, if there is residue, advance to step 2；If without residue, mapping is finished, algorithm knot
Beam；
Step 2：Judge whether current request has global dummy node remaining, if there is residue, advance to step 3；If without residue, skipping to
Step 8；
Step 3：The physical node set for meeting global node demand is selected in physical node, if the collection is combined into sky, is skipped to
Step 7；Otherwise step 4 is advanced to；
Step 4：The average link load of the physical node set is calculated, if the average link load of physical node set is less than chain
Road load static abandons threshold value, advances to step 5；If the average link load of physical node set is more than or equal to link load
Static state abandons threshold value and the static inverter threshold value preferentially mapped less than maximum integrated load, or physical node set is averaged
Link load is more than or equal to the static inverter threshold value that maximum integrated load preferentially maps, and skips to step 6；
Step 5：If the average link load of physical node set is less than the static inverter thresholding that maximum integrated load preferentially maps
Value, from physical node set select minimum satellite vehicle node integrated load, complete the mapping of the global node, after the completion of skip to step
Rapid 2；If the average link load of physical node set is more than or equal to the static inverter threshold value that maximum integrated load preferentially maps,
Maximum satellite node integrated load is selected to map the global node from physical node set；After the completion of mapping, step is skipped to
2；
Step 6：Discarding function is called, if value is 0, step 5 is skipped to；Otherwise step 7 is advanced to；
Step 7：Waiting list, the number of times DELAY that void net request is requeued are delivered into empty net request comprising the global node
It has been pre-set that, then refuse the request more than DELAY；Skip to step 1；
Step 8：Mapped using backtracking method and node and its link are recalled in the request.
2. the empty net mapping method of mixing loaded according to claim 1 based on thresholding formula, it is characterised in that physical node collection
The average link of conjunction is loaded：
<mrow>
<mfrac>
<mn>1</mn>
<mi>n</mi>
</mfrac>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>n</mi>
</munderover>
<mfrac>
<mn>1</mn>
<mi>m</mi>
</mfrac>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msub>
<mi>S</mi>
<mi>E</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>,</mo>
<msub>
<mi>e</mi>
<mi>s</mi>
</msub>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
<mo>)</mo>
</mrow>
</mrow>
SE(t,es) it is physical link esIn moment t utilization rate,Represent that the m bar links of the node are averaged
Link load；Loaded for the average link of physical node collection.
3. the empty net mapping method of mixing loaded according to claim 2 based on thresholding formula, it is characterised in that inter-satellite link is born
Carrying formula is：
<mrow>
<msub>
<mi>S</mi>
<mi>E</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>,</mo>
<msub>
<mi>e</mi>
<mi>s</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mo>&ForAll;</mo>
<msub>
<mi>e</mi>
<mi>v</mi>
</msub>
<mo>&UpArrow;</mo>
<msub>
<mi>e</mi>
<mi>s</mi>
</msub>
</mrow>
</munder>
<mi>B</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>e</mi>
<mi>v</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mi>B</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>e</mi>
<mi>s</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>,</mo>
<mo>&ForAll;</mo>
<msub>
<mi>e</mi>
<mi>s</mi>
</msub>
<mo>&Element;</mo>
<msub>
<mi>E</mi>
<mi>S</mi>
</msub>
</mrow>
Wherein ev↑esRepresent virtual link evIt is mapped to physical link esOn, B (es) represent physical link total bandwidth, B (ev) represent
The bandwidth of virtual link request is mapped.
4. the empty net mapping method of mixing loaded according to claim 2 based on thresholding formula, it is characterised in that minimum satellite vehicle section
Putting integrated load formula is：Wherein P represents a physical node set, SCIntegrated for satellite node
Load, formula isSN(t,ns) be satellite node load, formula isWherein nv↑nsRepresent dummy node nvIt is mapped to physical node nsOn, C (ns) expression thing
Manage the total CPU, C (n of nodev) represent to have mapped the CPU of dummy node request.
5. the empty net mapping method of mixing loaded according to claim 4 based on thresholding formula, it is characterised in that maximum satellite section
Putting integrated load formula is：
6. the empty net mapping method of mixing loaded according to claim 1 based on thresholding formula, it is characterised in that based on satellite network
Under the virtual resource management framework in network layering point domain, using k- loads load decomposing to divide come design node and drawn with empty net
Point.
7. the empty net mapping method of mixing loaded according to claim 1 based on thresholding formula, it is characterised in that use thresholding formula
During the mixing void net mapping method of load, it is necessary first to the remaining cpu resource of Statistical Physics node, and set link load static
Abandon the static inverter threshold value η that threshold value γ and maximum integrated load preferentially map.
8. the empty net mapping method of mixing loaded according to claim 1 based on thresholding formula, it is characterised in that mapping income is base
Infrastructure provider maps the successfully obtainable profit of empty net, and calculation formula is：
B (e in formulav) it is that successfully empty guipure is wide for mapping, C (nv) it is mapping successfully empty net node cpu resource, λ and μ are to be used to adjust
The weight coefficient of bandwidth and CPU；
Infrastructure provider successfully maps the provided resource of empty net based on mapping cost, and calculation formula is：B(ls) it is the bandwidth that physical pathway is supplied to virtual link.
9. the empty net mapping method of mixing loaded according to claim 8 based on thresholding formula, it is characterised in that void net request
Drop probability is the empty net request in a time window, by the request of void net according to mapping income R (GV) sequence, select RMAX
(GV), calculation formula is：
10. the empty net mapping method of mixing loaded according to claim 9 based on thresholding formula, it is characterised in that abandon function
Formula be：
If the transition formula evaluation 1, then waiting list is delivered into request or refusal is asked；If 0, then allow mapping.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710651184.1A CN107276664B (en) | 2017-08-02 | 2017-08-02 | Mixing void net mapping method based on the load of thresholding formula |
| CN201711363252.0A CN108055070B (en) | 2017-08-02 | 2017-08-02 | Hybrid virtual network mapping method |
| CN201711362978.2A CN108092706B (en) | 2017-08-02 | 2017-08-02 | Mapping method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710651184.1A CN107276664B (en) | 2017-08-02 | 2017-08-02 | Mixing void net mapping method based on the load of thresholding formula |
Related Child Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711363252.0A Division CN108055070B (en) | 2017-08-02 | 2017-08-02 | Hybrid virtual network mapping method |
| CN201711362978.2A Division CN108092706B (en) | 2017-08-02 | 2017-08-02 | Mapping method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107276664A true CN107276664A (en) | 2017-10-20 |
| CN107276664B CN107276664B (en) | 2019-07-02 |
Family
ID=60074761
Family Applications (3)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711363252.0A Active CN108055070B (en) | 2017-08-02 | 2017-08-02 | Hybrid virtual network mapping method |
| CN201711362978.2A Active CN108092706B (en) | 2017-08-02 | 2017-08-02 | Mapping method |
| CN201710651184.1A Active CN107276664B (en) | 2017-08-02 | 2017-08-02 | Mixing void net mapping method based on the load of thresholding formula |
Family Applications Before (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711363252.0A Active CN108055070B (en) | 2017-08-02 | 2017-08-02 | Hybrid virtual network mapping method |
| CN201711362978.2A Active CN108092706B (en) | 2017-08-02 | 2017-08-02 | Mapping method |
Country Status (1)
| Country | Link |
|---|---|
| CN (3) | CN108055070B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110417897A (en) * | 2019-07-31 | 2019-11-05 | 中国联合网络通信集团有限公司 | A kind of block chain divides domain triggering method, block chain node device and terminal |
| CN112104408A (en) * | 2020-09-23 | 2020-12-18 | 北京邮电大学 | Mapping method and device of virtual network |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109981438B (en) * | 2019-03-22 | 2021-03-02 | 大连大学 | Satellite network load balancing method oriented to SDN and NFV collaborative deployment framework |
| CN111582319B (en) * | 2020-04-16 | 2021-01-15 | 军事科学院系统工程研究院网络信息研究所 | Gray clustering estimation method for satellite communication resource utilization rate based on hierarchy |
| CN113285837B (en) * | 2021-05-26 | 2022-05-06 | 广东电网有限责任公司 | Carrier network service fault diagnosis method and device based on topology sensing |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1511392A (en) * | 2001-05-22 | 2004-07-07 | ���ܿ���ϵͳ����˾ | Platform and method for providing wireless data services |
| CN102204187A (en) * | 2011-04-28 | 2011-09-28 | 华为技术有限公司 | Method, correlative device and system for virtual network migration |
| CN104901861A (en) * | 2015-06-04 | 2015-09-09 | 浙江工商大学 | Network topology pre-optimization-based virtual network mapping method capable of improving availability |
| CN104917659A (en) * | 2015-06-02 | 2015-09-16 | 浙江大学 | Virtual network connection property-based virtual network mapping method |
| CN104993941A (en) * | 2015-05-14 | 2015-10-21 | 西安电子科技大学 | Openflow-based network highly-fault-tolerant virtual network mapping algorithm |
| EP2965219A1 (en) * | 2014-05-30 | 2016-01-13 | Fastly Inc. | Communication continuation during content node failover |
| US20160330090A1 (en) * | 2013-04-30 | 2016-11-10 | Splunk Inc. | User interface that provides a proactive monitoring tree with severity state sorting |
| CN106454948A (en) * | 2016-10-11 | 2017-02-22 | 重庆邮电大学 | Node re-distribution method in wireless network virtualization |
Family Cites Families (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101583057B (en) * | 2009-06-11 | 2013-08-07 | 中兴通讯股份有限公司 | Network routing method and device |
| CN102215167B (en) * | 2011-06-03 | 2014-09-03 | 中国联合网络通信集团有限公司 | Data transmission method, device and system |
| CN102664784B (en) * | 2012-04-19 | 2016-07-06 | 北京邮电大学 | A kind of mapping method of virtual network of node link pressure weight adaptive equalization |
| US8972602B2 (en) * | 2012-06-15 | 2015-03-03 | Citrix Systems, Inc. | Systems and methods for using ECMP routes for traffic distribution |
| CN102868733A (en) * | 2012-08-29 | 2013-01-09 | 北京邮电大学 | Method for remapping virtual network resources |
| US9164809B2 (en) * | 2012-09-04 | 2015-10-20 | Red Hat Israel, Ltd. | Virtual processor provisioning in virtualized computer systems |
| CN102970225B (en) * | 2012-11-13 | 2015-04-15 | 同济大学 | Internet protocol (IP) over wavelength division multiplexing (WDM) network energy-aware routing method based on multipriority business |
| US9172655B1 (en) * | 2012-11-15 | 2015-10-27 | Qlogic, Corporation | Systems and methods for quality of service in networks |
| US9538439B2 (en) * | 2013-05-10 | 2017-01-03 | Qualcomm Incorporated | Method and apparatus for estimating an achievable link throughput based on assistance information |
| CN103888371B (en) * | 2014-04-17 | 2017-03-08 | 北京邮电大学 | A kind of method and apparatus of virtual network mapping |
| US10110446B2 (en) * | 2015-12-07 | 2018-10-23 | Bank Of America Corporation | Messaging queue spinning engine |
| CN105530312B (en) * | 2015-12-26 | 2018-08-14 | 中国人民解放军信息工程大学 | Network service path selects system and its selection method |
| CN105791118B (en) * | 2016-03-21 | 2019-04-02 | 南京邮电大学 | Method for routing towards LEO/GEO double layer minipellet |
-
2017
- 2017-08-02 CN CN201711363252.0A patent/CN108055070B/en active Active
- 2017-08-02 CN CN201711362978.2A patent/CN108092706B/en active Active
- 2017-08-02 CN CN201710651184.1A patent/CN107276664B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1511392A (en) * | 2001-05-22 | 2004-07-07 | ���ܿ���ϵͳ����˾ | Platform and method for providing wireless data services |
| CN102204187A (en) * | 2011-04-28 | 2011-09-28 | 华为技术有限公司 | Method, correlative device and system for virtual network migration |
| EP2693704A4 (en) * | 2011-04-28 | 2014-04-30 | Huawei Tech Co Ltd | Method, correlative device and system for virtual network migration |
| US20160330090A1 (en) * | 2013-04-30 | 2016-11-10 | Splunk Inc. | User interface that provides a proactive monitoring tree with severity state sorting |
| EP2965219A1 (en) * | 2014-05-30 | 2016-01-13 | Fastly Inc. | Communication continuation during content node failover |
| CN104993941A (en) * | 2015-05-14 | 2015-10-21 | 西安电子科技大学 | Openflow-based network highly-fault-tolerant virtual network mapping algorithm |
| CN104917659A (en) * | 2015-06-02 | 2015-09-16 | 浙江大学 | Virtual network connection property-based virtual network mapping method |
| CN104901861A (en) * | 2015-06-04 | 2015-09-09 | 浙江工商大学 | Network topology pre-optimization-based virtual network mapping method capable of improving availability |
| CN106454948A (en) * | 2016-10-11 | 2017-02-22 | 重庆邮电大学 | Node re-distribution method in wireless network virtualization |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110417897A (en) * | 2019-07-31 | 2019-11-05 | 中国联合网络通信集团有限公司 | A kind of block chain divides domain triggering method, block chain node device and terminal |
| CN112104408A (en) * | 2020-09-23 | 2020-12-18 | 北京邮电大学 | Mapping method and device of virtual network |
| CN112104408B (en) * | 2020-09-23 | 2021-06-22 | 北京邮电大学 | Mapping method and device of virtual network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107276664B (en) | 2019-07-02 |
| CN108055070B (en) | 2020-06-30 |
| CN108055070A (en) | 2018-05-18 |
| CN108092706A (en) | 2018-05-29 |
| CN108092706B (en) | 2020-11-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107276664A (en) | The empty net mapping method of mixing loaded based on thresholding formula | |
| CN106503836B (en) | Multi-objective optimized pure electric vehicle logistics distribution optimized scheduling method | |
| CN105515987B (en) | A kind of mapping method based on SDN framework Virtual optical-fiber networks | |
| CN107220731A (en) | A kind of logistics distribution paths planning method | |
| CN106227599B (en) | The method and system of scheduling of resource in a kind of cloud computing system | |
| CN111191918A (en) | Service route planning method and device for smart power grid communication network | |
| CN108322333A (en) | A kind of laying method of the virtual network function based on genetic algorithm | |
| CN111106999A (en) | IP-optical network communication service joint distribution method and device | |
| CN104954278A (en) | Bee colony optimization based network traffic scheduling method under multiple QoS (quality of service) constraints | |
| CN106961343A (en) | A kind of virtual map method and device | |
| CN101777990A (en) | Method for selecting multi-objective immune optimization multicast router path | |
| CN105282038A (en) | Distributed asterism networking optimization method based on stability analysis and used in mobile satellite network | |
| CN105323166A (en) | Cloud computing-oriented routing method based on network efficiency priority | |
| CN109120009A (en) | The active distribution network fault recovery method that meter and distributed generation resource power output change at random | |
| CN113395103B (en) | Navigation system inter-satellite route planning method and device considering capacity limitation | |
| CN108256969A (en) | A kind of public bicycles lease point dispatcher-controlled territory division methods | |
| CN107101645A (en) | A kind of paths planning method and path planning apparatus | |
| CN109919532A (en) | Logistics node determination method and device | |
| CN109995580A (en) | VN mapping method based on GA_PSO hybrid algorithm in 5G network slice | |
| CN107196806A (en) | The topology radiated based on subgraph closes on matching virtual network mapping method | |
| CN107612970A (en) | Big figure caching method, display methods and system based on power network topology analysis | |
| CN110380906B (en) | Large-scale multidimensional fusion virtual network mapping method | |
| CN107360031A (en) | It is a kind of based on optimization overhead gains than mapping method of virtual network | |
| CN111885493A (en) | Micro-cloud deployment method based on improved cuckoo search algorithm | |
| Tiwari et al. | Internet activity forecasting over 5g billing data using deep learning techniques |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| OL01 | Intention to license declared | ||
| OL01 | Intention to license declared |