CN104780125A - Efficient and energy-saving virtual network mapping method based on feedback control - Google Patents
Efficient and energy-saving virtual network mapping method based on feedback control Download PDFInfo
- Publication number
- CN104780125A CN104780125A CN201510161067.8A CN201510161067A CN104780125A CN 104780125 A CN104780125 A CN 104780125A CN 201510161067 A CN201510161067 A CN 201510161067A CN 104780125 A CN104780125 A CN 104780125A
- Authority
- CN
- China
- Prior art keywords
- virtual network
- bottom layer
- link
- virtual
- node
- 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 86
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000012545 processing Methods 0.000 claims abstract description 7
- 238000009826 distribution Methods 0.000 claims description 24
- 238000005265 energy consumption Methods 0.000 abstract description 19
- 230000008447 perception Effects 0.000 description 5
- 230000008901 benefit Effects 0.000 description 3
- 230000006872 improvement Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention applies to the technical field of virtual network control methods and discloses an efficient and energy-saving virtual network mapping method based on feedback control. The method comprises specific steps as follows: a virtual network allocation model is established, an initial value of a virtual network allocation method is set, bottom layer nodes are selected, bottom layer links are selected, virtual networks are allocated, bottom layer network states are updated, and virtual network allocation is completed. According to the efficient and energy-saving virtual network mapping method based on feedback control, the allocation range of the virtual networks is limited to the level of the bottom layer nodes according to the dynamic mapping characteristics of the virtual networks, and the allocation range of the virtual networks can be dynamically and gradually enlarged, so that the energy consumption for allocation of the virtual networks is minimized, the node mapping energy consumption cost is greatly reduced, the quantity of CPU (central processing unit) resources can be released in time when the virtual networks are disconnected, the CPU utilization rate is increased, accordingly, the allocation speed of the virtual network is remarkably increased, and the method is particularly applicable to a large-scale virtual network mapping scene.
Description
[ technical field ] A method for producing a semiconductor device
The invention relates to a virtual network control method, in particular to an efficient energy-saving virtual network mapping method based on feedback control.
[ background of the invention ]
With the rising of electric power cost and the improvement of ecological consciousness of people, network operators have realized the importance of energy consumption management, and the reduction of energy consumption becomes a problem to be solved urgently. Current networks are designed for peak load and network resource over-provisioning ensures proper operation of the network, but also results in low resource utilization. According to statistics, the average link utilization rate of the large ISP backbone network is about 30-40%, and the average utilization rate of the data center server is 11% -50%. The excessively low utilization rate causes huge electric energy waste, promotes the development of green network research, and the problem of network energy consumption becomes a research hotspot.
Network virtualization is an important technology for future internet, cloud computing and software defined networking. By integrating network infrastructure resources, the energy can be reasonably and effectively used, and the intelligent energy-aware network deployment becomes possible. Virtual network mapping is a key issue for network resource virtualization. Most of the current mapping algorithms are cost-based virtual network mapping, that is, mapping virtual network requests with minimized bottom layer resource cost, so as to obtain more bottom layer physical resources, thereby improving the virtual network receiving rate and the system benefit. However, since the virtual network request is a dynamic process, and the underlying physical network is designed according to the traffic peak, the cost-based virtual network mapping inevitably causes unnecessary energy consumption. Virtual networking mapping, which aims at energy saving, should minimize energy consumption on the premise of satisfying current virtual network requests. Since current network devices are not sensitive to the power consumption of traffic loads, shutting down or sleeping as many network nodes and links as possible without affecting the virtual network mapping performance is an effective way to save energy.
The current virtual network mapping based on energy perception enables the virtual network to be mapped to active nodes and links as much as possible by modifying a virtual network mapping algorithm so as to achieve the aim of saving energy of a system. Such as: an energy perception optimization model of mixed integer programming is provided by reducing the number of physical network equipment to distribute a virtual network request set, but the time complexity is exponentially increased, so that the method is difficult to adapt to virtual network mapping of large-scale network infrastructure; in consideration of the characteristic that the energy consumption of a case is lower than that of a route, an energy-saving method for expanding flow to network resources is provided, but the method is suitable for equipment sensitive to loads; heuristic methods for minimizing energy consumption for virtual network reconfiguration have been proposed; the Susen of Beijing post and telecommunications university and the like propose a virtual network mapping energy consumption model and an energy perception two-stage mapping algorithm; a mixed integer programming energy consumption model and an energy perception two-stage mapping algorithm are proposed by dawn forest, Wangbing and the like of northern traffic university, and the ant colony optimization algorithm is applied to solve the virtual network energy-saving mapping in a cloud data center. It can be seen that the related energy-saving perception mapping algorithm at present passively searches for effective underlying network nodes and link sets by modifying the virtual network mapping algorithm, and is easily interfered by the dynamic characteristics of the virtual network.
Virtual network allocation can be modeled as follows: establishment of slave GvTo GsMapping M of a subsetvI.e. by <math>
<mrow>
<msup>
<mi>M</mi>
<mi>v</mi>
</msup>
<mo>:</mo>
<mrow>
<mo>(</mo>
<msup>
<mi>N</mi>
<mi>v</mi>
</msup>
<mo>,</mo>
<msup>
<mi>L</mi>
<mi>v</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>→</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>N</mi>
<mo>′</mo>
<mi>s</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>N</mi>
<mo>′</mo>
<mi>s</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>,</mo>
</mrow>
</math> Wherein, <math>
<mrow>
<msubsup>
<mi>N</mi>
<mo>′</mo>
<mi>s</mi>
</msubsup>
<mo>⋐</mo>
<msup>
<mi>N</mi>
<mi>s</mi>
</msup>
<mo>,</mo>
<msubsup>
<mi>P</mi>
<mo>′</mo>
<mi>s</mi>
</msubsup>
<mo>⋐</mo>
<msup>
<mi>P</mi>
<mi>s</mi>
</msup>
<mo>,</mo>
</mrow>
</math> and P issIs the set of all loop-free paths in the underlay network.
[ summary of the invention ]
The invention aims to overcome the defects of the prior art, provides an efficient and energy-saving virtual network mapping method based on feedback control, and aims to solve the technical problem that the virtual network allocation method in the prior art cannot ensure the minimum mapping energy consumption cost.
In order to achieve the above purpose, the invention provides a high-efficiency energy-saving virtual network mapping method based on feedback control, which comprises the following specific steps:
A) establishing a virtual network distribution model:
bottom layer network: building undirected graphWherein N issIs a set of bottom nodes, LsIs a set of links of the bottom layer,is a set of attributes of the underlying nodes,the method comprises the steps that a bottom layer link attribute set is obtained, the bottom layer node attribute is CPU resources of all bottom layer nodes, and the bottom layer link attribute is bandwidth resources of all bottom layer nodes;
virtual network: building undirected graphWherein N isvIs a set of virtual nodes, LvIn order to be a set of virtual links,in the form of a set of virtual node attributes,the method comprises the steps that a virtual link attribute set is obtained, the virtual node attribute is CPU resources of each virtual node, and the virtual link attribute is bandwidth resources of each virtual node;
virtual network allocation marking: setting LNum as the number of bottom layer links connected with the virtual network at present, namely the number of virtual networks successfully distributed in the current bottom layer network, and setting the initial value of the number to be 0;
B) setting an initial value of a virtual network distribution method: recording the degree of each bottom layer node, setting the mapping state of each bottom layer node and each bottom layer link to be mappable, and waiting for the request of the virtual network;
C) selecting bottom-layer nodes: after receiving the request of the virtual network, the bottom layer network judges whether the current bottom layer links are connected, namely LNum is larger than or equal to the total number of the bottom layer links, if the unconnected bottom layer links exist, all bottom layer nodes which can be mapped are traversed to search for the bottom layer node u with the minimum degree, and if the unconnected bottom layer links exist, the step D is carried out; if not, go to step E); if no unconnected bottom link exists, go to step G);
D) selecting a bottom-layer link: traversing all bottom layer links where the bottom layer node u is located, judging and checking whether the bottom layer links are stable, if so, setting the mapping state of the bottom layer links as un-mappable, and turning to the step F); if the mapping state of the bottom link is not stable, the bottom link is abandoned, and the mapping state of the bottom link is set to be unmapped; if no stable bottom link exists after traversal, setting the mapping state of the bottom node as unmapped, and returning to the step C);
E) failure of bottom node allocation: returning the information that the proper bottom layer node cannot be found, and turning to the step J);
F) virtual network allocation: connecting the stable bottom link with the virtual network, changing the node mapping state and the link mapping state of the virtual network into mapped state, returning to the successful virtual network allocation, adding 1 to the LNum, waiting for the virtual network to leave, and processing the next virtual network request at the same time, namely turning to the step C);
G) failure of bottom link allocation: returning the information that the current underlying network is busy, and turning to the step J);
H) and updating the underlying network state: checking the mapping condition of the current virtual network, if the node mapping state and the link mapping state of the virtual network are not mapped, ending the connection between the bottom link and the virtual network, reducing the LNum by 1, and turning to the step I);
I) and completing virtual network allocation: releasing CPU resources allocated to the virtual network, completing the connection of the current virtual network, and processing the request of the next virtual network until all the bottom links are disconnected from the virtual network;
J) virtual network allocation failure: and returning the information that the current virtual network cannot be distributed, and finishing the virtual network distribution.
Preferably, the step D) further comprises the following specific steps:
D1) finding a bottom link l where u is locateduvThe underlying link luvAnd calling another bottom-layer endpoint v, and reducing the degrees of the bottom-layer nodes u and v by one respectively, and if the degree of u is less than or equal to 0 at the moment, turning to the step D2); if the degree of v is less than or equal to 0, go to step D3); if the degree of u and v is greater than 0, then l is determineduvStabilizing, and turning to step F);
D2) changing the mapping state of u into unmapped state, judging that the bottom node u does not have a stable bottom link, and returning to the step C);
D3) changing the mapping state of v into un-mappable, and determining the bottom link luvUnstable, give upuvAnd the bottom link is searched again, and the step D1 is returned to).
The invention has the beneficial effects that: compared with the prior art, the high-efficiency energy-saving virtual network mapping method based on feedback control provided by the invention has reasonable steps, can limit the distribution range of the virtual network to the level of the bottom layer node according to the dynamic mapping characteristics of the virtual network, and can dynamically and gradually increase the distribution range of the virtual network, namely, the bottom layer node is expanded to the bottom layer link, so that the optimal virtual network distribution energy consumption is realized, the node mapping energy consumption cost is greatly reduced, meanwhile, the CPU resource quantity can be timely released when the virtual network leaves, the CPU utilization rate is improved, the distribution rate of the virtual network is obviously improved, and the method is particularly suitable for large-scale virtual network mapping scenes.
The features and advantages of the present invention will be described in detail by embodiments in conjunction with the accompanying drawings.
[ description of the drawings ]
Fig. 1 is a schematic view of an operation state of a bottom node according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of the operation state of the underlying link according to the embodiment of the present invention.
[ detailed description ] embodiments
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail with reference to the accompanying drawings and examples. It should be understood, however, that the description herein of specific embodiments is only intended to illustrate the invention and not to limit the scope of the invention. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present invention.
Referring to fig. 1 and fig. 2, an embodiment of the present invention provides a feedback control-based high-efficiency energy-saving virtual network mapping method, which includes the following specific steps:
A) establishing a virtual network distribution model:
bottom layer network: building undirected graphWherein N issIs a set of bottom nodes, LsIs a set of links of the bottom layer,is a set of attributes of the underlying nodes,is a bottom link attribute set, the bottom node attribute is the CPU resource of each bottom node, and the bottom link attribute is each bottomBandwidth resources of the layer nodes.
Virtual network: building undirected graphWherein N isvIs a set of virtual nodes, LvIn order to be a set of virtual links,in the form of a set of virtual node attributes,the link attribute is a virtual link attribute set, the virtual node attribute is CPU resource of each virtual node, and the virtual link attribute is bandwidth resource of each virtual node.
Virtual network allocation marking: let LNum be the number of the bottom layer links currently connected to the virtual network, i.e. the number of the virtual networks successfully allocated in the current bottom layer network, and its initial value is 0.
B) Setting an initial value of a virtual network distribution method: recording the degree of each bottom layer node, setting the mapping state of each bottom layer node and each bottom layer link to be mappable, and waiting for the request of the virtual network.
C) Selecting bottom-layer nodes: after receiving the request of the virtual network, the bottom layer network judges whether the current bottom layer links are connected, namely LNum is larger than or equal to the total number of the bottom layer links, if the unconnected bottom layer links exist, all bottom layer nodes which can be mapped are traversed to search for the bottom layer node u with the minimum degree, and if the unconnected bottom layer links exist, the step D is carried out; if not, go to step E); if there is no unconnected underlying link, go to step G).
D) Selecting a bottom-layer link: traversing all bottom layer links where the bottom layer node u is located, judging and checking whether the bottom layer links are stable, if so, setting the mapping state of the bottom layer links as un-mappable, and turning to the step F); if the mapping state of the bottom link is not stable, the bottom link is abandoned, and the mapping state of the bottom link is set to be unmapped; and if the stable bottom link does not exist after the traversal, setting the mapping state of the bottom node as un-mappable, and returning to the step C).
E) Failure of bottom node allocation: and returning the information that the proper bottom-layer node cannot be found, and turning to the step J).
F) Virtual network allocation: and connecting the stable bottom link with the virtual network, changing the node mapping state and the link mapping state of the virtual network into mapped state, returning to the successful virtual network allocation, adding 1 to the LNum, waiting for the virtual network to leave, and processing the next virtual network request at the same time, namely turning to the step C).
G) Failure of bottom link allocation: and returning the information that the current underlying network is busy, and turning to the step J).
H) And updating the underlying network state: checking the mapping condition of the current virtual network, if the node mapping state and the link mapping state of the virtual network are not mapped, ending the connection between the bottom link and the virtual network, subtracting 1 from LNum, and turning to the step I).
I) And completing virtual network allocation: and releasing the CPU resources distributed to the virtual network, completing the connection of the current virtual network, and processing the request of the next virtual network until all the bottom links are disconnected from the virtual network.
J) Virtual network allocation failure: and returning the information that the current virtual network cannot be distributed, and finishing the virtual network distribution.
The invention provides a high-efficiency energy-saving virtual network mapping method based on feedback control, which limits the virtual network distribution range to the range of an individual bottom layer node, continuously enlarges and traverses to the bottom layer link according to the actual virtual network state, and finally enlarges to the whole bottom layer node network, namely, the virtual network is distributed according to the dynamic energy consumption characteristics of the virtual network, thereby greatly reducing the energy consumed by network distribution, and being capable of dynamically and gradually enlarging the distribution range of the virtual network, namely expanding the bottom layer node to the bottom layer link, thereby realizing the optimal energy consumption of virtual network distribution and greatly reducing the energy consumption cost of node mapping.
Specifically, the step D) further comprises the following specific steps:
D1) finding a bottom link l where u is locateduvThe underlying link luvAnd calling another bottom-layer endpoint v, and reducing the degrees of the bottom-layer nodes u and v by one respectively, and if the degree of u is less than or equal to 0 at the moment, turning to the step D2); if the degree of v is less than or equal to 0, go to step D3); if the degree of u and v is greater than 0, then l is determineduvStabilizing, and turning to step F);
D2) changing the mapping state of u into unmapped state, judging that the bottom node u does not have a stable bottom link, and returning to the step C);
D3) changing the mapping state of v into un-mappable, and determining the bottom link luvUnstable, give upuvAnd the bottom link is searched again, and the step D1 is returned to).
When the virtual network leaves, the underlying network judges whether the underlying node and the underlying link are separated from the virtual network, if the releasing condition is met, the CPU resource quantity of the underlying network is released in time, the CPU utilization rate is improved, the distribution rate of the virtual network is obviously improved, and the method is particularly suitable for large-scale virtual network mapping scenes.
In order to better describe the specific operation process of the algorithm, the invention provides a pseudo code form of the algorithm, which is as follows:
algorithm 1
1: setting mappable states of underlying nodes and underlying links
Inputting: mappable bottom link quantity nonsleepl
And (3) outputting: underlying nodes and underlying links allocated to a virtual network
1.1：sln＝0；sleepl＝linkSum-nosleepl；
1.2: foreach (each bottom node k)
1.3: calculating the degree d (k) of the bottom layer node;
1.4: setting each bottom node and bottom link to a mappable state;
1.5：while(sln＜sleepl){
1.6: if (finding the lowest node u of d (k)) smallest
1.7: foreach (underlying link l where each u is locateduv){
1.8: will luvThe mapping state of (a) is set as not-mappable; sln + +;
1.9： d(u)--；d(v)--；
1.10: if (d (u) ═ 0) sets the mapping state of u as unmapped;
1.11: if (d (v) ═ 0) sets the mapping state of v as unmapped;
1.12： if(sln≥sleepl)break；
1.13： }
1.14： }else{break；}
1.15：}
1.16: return to underlying nodes and underlying links of a virtual network
2: virtual network energy feedback control algorithm
Inputting: virtual network request
And (3) outputting: virtual network allocation results
2.1: calling the LNum in the last virtual network distribution result;
2.2：while(1){
2.3: use LNum as bottom layer link quantity nonsleep that can maplRunning algorithm 1;
2.4： if(t＝NodeEm(i)＝＝true){
2.5: setting the virtual network state as the node mapping success;
Break；
2.6：}
2.7：LNum++；
2.8: if (LNum > linkSum) return node fails to allocate;
2.9：}
2.10：while(1){
2.11： if(t＝LinkEm(i)＝＝true){
2.12: setting the virtual network state as the link mapping success;
return virtual network allocation results;
2.13：}
2.14：LNum++；
2.15: if (LNum > linkSum) return link assignment fails;
2.16: releasing the resources of the distributed bottom layer nodes and bottom layer links;
2.17：Goto 3；
2.18：}
wherein NodeEm (i) and LinkEm (i) are mapping states of the virtual network, i.e. respectively corresponding to a node mapping state and a link mapping state, and nonsleepllinkSum is the total number of bottom links in the bottom network for the number of bottom links unavailable in the current bottom networkAmount, sleeplThen is the number of underlying links that can be mapped.
The high-efficiency energy-saving virtual network mapping method based on feedback control provided by the embodiment of the invention has reasonable steps, can limit the distribution range of a virtual network to the level of a bottom node according to the dynamic mapping characteristics of the virtual network, greatly reduces the energy consumed by network distribution, and can dynamically and gradually increase the distribution range of the virtual network, namely, the bottom node is expanded to a bottom link, so that the optimal virtual network distribution energy consumption is realized, the node mapping energy consumption cost is greatly reduced, and simultaneously, the CPU resource quantity can be timely released when the virtual network leaves, the CPU utilization rate is improved, the distribution rate of the virtual network is obviously improved, and the method is particularly suitable for large-scale virtual network mapping scenes.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents or improvements made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (2)
1. A high-efficiency energy-saving virtual network mapping method based on feedback control is characterized in that: the method comprises the following specific steps:
A) establishing a virtual network distribution model:
bottom layer network: building undirected graphWherein N issIs a set of bottom nodes, LsIs a set of links of the bottom layer,is a set of attributes of the underlying nodes,the method comprises the steps that a bottom layer link attribute set is obtained, the bottom layer node attribute is CPU resources of all bottom layer nodes, and the bottom layer link attribute is bandwidth resources of all bottom layer nodes;
virtual network: building undirected graphWherein N isvIs a set of virtual nodes, LvIn order to be a set of virtual links,in the form of a set of virtual node attributes,the method comprises the steps that a virtual link attribute set is obtained, the virtual node attribute is CPU resources of each virtual node, and the virtual link attribute is bandwidth resources of each virtual node;
virtual network allocation marking: setting LNum as the number of bottom layer links connected with the virtual network at present, namely the number of virtual networks successfully distributed in the current bottom layer network, and setting the initial value of the number to be 0;
B) setting an initial value of a virtual network distribution method: recording the degree of each bottom layer node, setting the mapping state of each bottom layer node and each bottom layer link to be mappable, and waiting for the request of the virtual network;
C) selecting bottom-layer nodes: after receiving the request of the virtual network, the bottom layer network judges whether the current bottom layer links are connected, namely LNum is larger than or equal to the total number of the bottom layer links, if the unconnected bottom layer links exist, all bottom layer nodes which can be mapped are traversed to search for the bottom layer node u with the minimum degree, and if the unconnected bottom layer links exist, the step D is carried out; if not, go to step E); if no unconnected bottom link exists, go to step G);
D) selecting a bottom-layer link: traversing all bottom layer links where the bottom layer node u is located, judging and checking whether the bottom layer links are stable, if so, setting the mapping state of the bottom layer links as un-mappable, and turning to the step F); if the mapping state of the bottom link is not stable, the bottom link is abandoned, and the mapping state of the bottom link is set to be unmapped; if no stable bottom link exists after traversal, setting the mapping state of the bottom node as unmapped, and returning to the step C);
E) failure of bottom node allocation: returning the information that the proper bottom layer node cannot be found, and turning to the step J);
F) virtual network allocation: connecting the stable bottom link with the virtual network, changing the node mapping state and the link mapping state of the virtual network into mapped state, returning to the successful virtual network allocation, adding 1 to the LNum, waiting for the virtual network to leave, and processing the next virtual network request at the same time, namely turning to the step C);
G) failure of bottom link allocation: returning the information that the current underlying network is busy, and turning to the step J);
H) and updating the underlying network state: checking the mapping condition of the current virtual network, if the node mapping state and the link mapping state of the virtual network are not mapped, ending the connection between the bottom link and the virtual network, reducing the LNum by 1, and turning to the step I);
I) and completing virtual network allocation: releasing CPU resources allocated to the virtual network, completing the connection of the current virtual network, and processing the request of the next virtual network until all the bottom links are disconnected from the virtual network;
J) virtual network allocation failure: and returning the information that the current virtual network cannot be distributed, and finishing the virtual network distribution.
2. The method according to claim 1, wherein the feedback control-based virtual network mapping method comprises: the step D) also comprises the following specific steps:
D1) finding a bottom link l where u is locateduvThe underlying link luvAnd calling another bottom-layer endpoint v, and reducing the degrees of the bottom-layer nodes u and v by one respectively, and if the degree of u is less than or equal to 0 at the moment, turning to the step D2); if the degree of v is less than or equal to 0, go to step D3); if the degree of u and v is greater than 0, then l is determineduvStabilizing, and turning to step F);
D2) changing the mapping state of u into unmapped state, judging that the bottom node u does not have a stable bottom link, and returning to the step C);
D3) changing the mapping state of v into un-mappable, and determining the bottom link luvUnstable, give upuvAnd the bottom link is searched again, and the step D1 is returned to).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510161067.8A CN104780125B (en) | 2015-04-08 | 2015-04-08 | A kind of energy-efficient mapping method of virtual network based on feedback control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510161067.8A CN104780125B (en) | 2015-04-08 | 2015-04-08 | A kind of energy-efficient mapping method of virtual network based on feedback control |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104780125A true CN104780125A (en) | 2015-07-15 |
| CN104780125B CN104780125B (en) | 2018-11-06 |
Family
ID=53621376
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510161067.8A Active CN104780125B (en) | 2015-04-08 | 2015-04-08 | A kind of energy-efficient mapping method of virtual network based on feedback control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104780125B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110004456A1 (en) * | 2009-07-03 | 2011-01-06 | Snu R&Db Foundation | Virtual network embedding method in wireless test-bed network |
| CN103841000A (en) * | 2014-03-12 | 2014-06-04 | 湖州师范学院 | Virtual link mapping algorithm based on minimum cost flow model |
| CN103856355A (en) * | 2014-03-12 | 2014-06-11 | 湖州师范学院 | Energy consumption perceptive virtual network mapping transportation model and algorithm |
| CN104158717A (en) * | 2014-07-08 | 2014-11-19 | 湖州师范学院 | Energy-efficient virtual network mapping feedback control method |
-
2015
- 2015-04-08 CN CN201510161067.8A patent/CN104780125B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110004456A1 (en) * | 2009-07-03 | 2011-01-06 | Snu R&Db Foundation | Virtual network embedding method in wireless test-bed network |
| CN103841000A (en) * | 2014-03-12 | 2014-06-04 | 湖州师范学院 | Virtual link mapping algorithm based on minimum cost flow model |
| CN103856355A (en) * | 2014-03-12 | 2014-06-11 | 湖州师范学院 | Energy consumption perceptive virtual network mapping transportation model and algorithm |
| CN104158717A (en) * | 2014-07-08 | 2014-11-19 | 湖州师范学院 | Energy-efficient virtual network mapping feedback control method |
Non-Patent Citations (2)
| Title |
|---|
| 陈晓华等: "《主动休眠节点链路的高效节能虚拟网络映射》", 《软件学报》 * |
| 陈晓华等: "《虚拟网络映射最小费用流模型及算法》", 《电信科学》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104780125B (en) | 2018-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103856355B (en) | The method that the virtual network that a kind of energy consumption is perceived maps shipping model | |
| CN107819662B (en) | A kind of service function chain real-time migration method calculating network applied to cloud and mist | |
| CN103077082B (en) | A kind of data center loads distribution and virtual machine (vm) migration power-economizing method and system | |
| CN111538587B (en) | Service function chain reconfiguration method based on load balancing | |
| CN111124531B (en) | Method for dynamically unloading calculation tasks based on energy consumption and delay balance in vehicle fog calculation | |
| CN108243245A (en) | The Radio Access Network and its resource allocation method calculated based on mixing fog | |
| CN107317707B (en) | SDN network topology management method based on point coverage set | |
| CN104821906B (en) | A kind of energy-efficient virtual network node mapping model and algorithm | |
| CN103428805B (en) | The virtual mapping method of a kind of wireless network based on link anti-interference | |
| CN106131106A (en) | A kind of thin cloud based on assembly, the network-building method of thin cloud and device | |
| CN105050095B (en) | A kind of topological construction method of the heterogeneous wireless sensor net based on energy predicting | |
| WO2015051685A1 (en) | Task scheduling method, device and system | |
| CN115297171B (en) | Edge computing and unloading method and system for hierarchical decision of cellular Internet of vehicles | |
| CN108923979A (en) | Software defined network mapping method of virtual network | |
| CN113645076B (en) | Virtual network resource allocation method based on hypergraph matching algorithm | |
| Fan et al. | Dynamic virtual network embedding of mobile cloud system based on global resources in internet of vehicles | |
| Chen et al. | An edge server placement algorithm in edge computing environment | |
| Li et al. | New sdn-based architecture for integrated vehicular cloud computing networking | |
| CN104994508A (en) | Cognitive radio mesh network resource distribution and routing method | |
| CN109327340A (en) | A kind of mobile wireless network virtual net mapping method based on dynamic migration | |
| CN107040466B (en) | Multi-domain cooperative data transmission path selection method based on layered architecture of Internet of things | |
| CN104780125B (en) | A kind of energy-efficient mapping method of virtual network based on feedback control | |
| CN105337832A (en) | Resource distribution method for on-line multicast virtual network | |
| CN103916266A (en) | Efficient energy-saving virtual network mapping algorithm for node and link active dormancy | |
| CN104468379B (en) | Virtual Hadoop clustered nodes system of selection and device based on most short logical reach |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |