CN104780125B - A kind of energy-efficient mapping method of virtual network based on feedback control - Google Patents
A kind of energy-efficient mapping method of virtual network based on feedback control Download PDFInfo
- Publication number
- CN104780125B CN104780125B CN201510161067.8A CN201510161067A CN104780125B CN 104780125 B CN104780125 B CN 104780125B CN 201510161067 A CN201510161067 A CN 201510161067A CN 104780125 B CN104780125 B CN 104780125B
- Authority
- CN
- China
- Prior art keywords
- virtual network
- link
- distribution
- node
- mapping
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention is suitable for the technical field of virtual network controls method, discloses a kind of energy-efficient mapping method of virtual network based on feedback control, the specific steps are：Virtual network distribution model, the initial value for setting virtual network distribution method are established, bottom layer node is selected, selects bottom link, virtual network distribution, update bottom-layer network state and complete virtual network distribution.A kind of energy-efficient mapping method of virtual network based on feedback control provided by the invention, enough dynamic mapping features according to virtual network, the range of distribution of virtual network is limited to the level of bottom layer node, and it can dynamically incrementally increase the range of distribution of virtual network, to realize that virtual network distribution energy consumption is optimal, substantially reduce node mapping energy penalty, it ensure that amount of CPU resource can discharge in time when virtual network is left, improve cpu busy percentage, to significantly improve the distribution rate of virtual network, it is especially suitable for large-scale virtual network mapping scene.
Description
【Technical field】
It is the present invention relates to a kind of virtual network controls method, more particularly to a kind of energy-efficient virtual based on feedback control
Network mapping method.
【Background technology】
As power cost rises steadily the raising with people's ecological awareness, network operator has appreciated that managing power consumption
Importance, reduce energy consumption have become urgent problem to be solved.Current network designs for peak load, and Internet resources excess supplies
To the normal operation for ensuring network, however also cause resource utilization low.According to statistics, the average chain of large-scale ISP backbone networks
The average utilization of road utilization rate about 30-40%, data center server are 11%~50%.Too low utilization rate causes
Huge waste of energy promotes the rise of GreenNet research, network energy consumption problem to become research hotspot.
Network virtualization is the important technology of Future Internet, cloud computing and software defined network.It passes through integration networks
Infrastructure resources can rationally and effectively use energy so that the deployment of Intelligent Energy sensing network is possibly realized.Virtual network
Mapping is the critical issue of Internet resources virtualization.Most current mapping algorithm is the virtual network mapping based on cost, i.e.,
To minimize underlying resource cost maps virtual network request, more bottom physical resources are obtained with this, and then improve virtual
Network acceptance rate and system benefit.However, since virtual network requests are a dynamic changing processes, and bottom physical network root
It is designed according to peak flow, the virtual network mapping based on cost necessarily brings unnecessary energy consumption.With energy saving for the virtual of target
Networking mapping should minimize energy consumption under the premise of meeting current virtual network request.Since current network device is negative to flow
The power consumption of lotus is insensitive, therefore closings as more as possible or dormant network node in the case where not influencing virtual network mapping performance
It is energy-efficient effective ways with link.
The virtual network for being currently based on Energy-aware is mapping through modification virtual network mapping algorithm so that virtual network is most
It may be mapped to movable node and link, to reach energy saving of system purpose.Such as：It is existing to pass through reduction physical network device quantity
Virtual network requests set is distributed, proposes the Energy-aware optimal model of mixed integer programming, but time complexity is in finger
Number increases, it is difficult to adapt to the virtual network mapping of large scale network infrastructure；It is existing to consider cabinet energy consumption than routing energy consumption
Low feature, the power-economizing method of proposition extension flow to Internet resources, but it is suitble to the equipment of responsive to load；Existing proposition is empty
The heuristic of the minimum energy consumption of quasi- Network reconfiguration；Su Sen of Beijing University of Post & Telecommunication etc. proposes that virtual network maps energy consumption
Model and Energy-aware two benches mapping algorithm；Chang Xiaolin, Wang Bing of Northern Transportation University etc. propose mixed integer programming energy
Model and Energy-aware two benches mapping algorithm are consumed, has and applies ant colony optimization algorithm solving virtual network in cloud data center
Energy saving mapping.It can be seen that presently relevant energy saving the map of perception algorithm is by changing virtual network mapping algorithm, passively finding has
The bottom-layer network node and link set of effect are vulnerable to the interference that virtual network behavioral characteristics are brought.
Virtual network distribution can model as follows：It establishes from GvTo GsThe mapping M of a certain subsetv, i.e.,Wherein,And PsFor all loop free paths in bottom-layer network
Set.
【Invention content】
It is an object of the invention to overcome above-mentioned the deficiencies in the prior art, provide a kind of based on the energy-efficient of feedback control
Mapping method of virtual network aims to solve the problem that virtual network distribution method can not ensure that mapping energy penalty is minimum in the prior art
The technical issues of.
To achieve the above object, the present invention proposes a kind of energy-efficient virtual network mapping side based on feedback control
Method is as follows：
A virtual network distribution model) is established：
Bottom-layer network：Establish non-directed graphWherein NsFor bottom layer node set, LsFor bottom
Link set,For bottom layer node attribute set,For bottom link attribute set, the bottom layer node attribute is each bottom
The cpu resource of node layer, the bottom link attribute are the bandwidth resources of each bottom layer node；
Virtual network：Establish non-directed graphWherein NvFor dummy node set, LvIt is virtual
Link set,For dummy node attribute set,For virtual link attribute set, the dummy node attribute is each void
The cpu resource of quasi- node, the virtual link attribute are the bandwidth resources of each dummy node；
Virtual network distribution label：If LNum is the number for the bottom link currently being connect with virtual network, i.e., current bottom
At the virtual network quantity of the distribution of work, initial value 0 in layer network；
B the initial value of virtual network distribution method) is set：The degree for recording each bottom layer node, by each bottom layer node and
The mapping status of every bottom link is set as to map, and waits for the request of virtual network；
C bottom layer node) is selected：After bottom-layer network receives the request of virtual network, judge current bottom link whether
Connection, that is, judge whether LNum is greater than or equal to the total quantity of bottom link, if there is not connected bottom link, that is, LNum<
The total quantity of bottom link then traverses all bottom layer nodes mapped, with the minimum bottom layer node of degree of searching, if it is successful,
Then go to step D)；It is if it is not found, then go to step E)；If there is no not connected bottom link, that is, LNum >=bottom
The total quantity of link, then go to step G)；
D bottom link) is selected：All bottom links where bottom layer node u are traversed, and judge to check that the bottom link is
The mapping status of the bottom link is set as to map, and go to step F by no stabilization if stablized)；If unstable,
The bottom link is then abandoned, and the mapping status of the bottom link is set as to map；If there is no stablize after traversal
Bottom link, then the mapping status of bottom layer node is set as to map, returns back to step C again)；
E) bottom layer node distribution failure：Return can not find suitable bottom layer node information, and go to step J)；
F) virtual network is distributed：Stable bottom link is connect with virtual network, and the node of virtual network is mapped
State and link maps state are changed to map, and return to virtual network and are allocated successfully, and LNum adds 1, and virtual network is waited for leave,
And handle next virtual network requests simultaneously, that is, return back to step C)；
G) bottom link distribution failure：The busy information of current bottom-layer network is returned, and goes to step J)；
H bottom-layer network state) is updated：The mapping situation of current virtual network is checked, if the node mapping of virtual network
State and link maps state are not map, then terminate the connection of bottom link and virtual network, and LNum subtracts 1, goes to step
I)；
I virtual network distribution) is completed：The cpu resource of virtual network is distributed in release, completes the company of current virtual network
It connects, and handles the request of next virtual network, until all bottom links disconnect and the connection of virtual network；
J) virtual network distribution failure：The information that current virtual network can not distribute is returned, virtual network distribution is terminated.
Preferably, the step D) further include following specific steps：
D1 a bottom link l where u) is searched outuv, by bottom link luvMapping status be changed to reflect
It penetrates, and calls another bottom endpoint v, the degree of bottom layer node u and v are respectively subtracted one, if the degree of u is less than or equal to 0 at this time,
Go to step D2)；If the degree of v is less than or equal to 0, step D3 is gone to)；If the degree of u and v is both greater than 0, l is judgeduvSurely
It is fixed, go to step F)；
D2) mapping status of u is changed to map, judges that bottom layer node u does not have stable bottom link, weight
Newly return back to step C)；
D3) mapping status of v is changed to map, judges bottom link luvIt is unstable, abandon luv, seek again
Bottom link is looked for, step D1 is returned back to).
Beneficial effects of the present invention：Compared with prior art, a kind of efficient section based on feedback control provided by the invention
Energy mapping method of virtual network, step is reasonable, can be according to the dynamic mapping feature of virtual network, by the distribution model of virtual network
The level for being limited to bottom layer node is enclosed, and can dynamically incrementally increase the range of distribution of virtual network, i.e., is expanded bottom layer node
Bottom link is opened up, to realize that virtual network distribution energy consumption is optimal, substantially reduces node mapping energy penalty, meanwhile, also protect
Having demonstrate,proved amount of CPU resource when virtual network is left can discharge in time, cpu busy percentage be improved, to significantly improve virtual network
Distribution rate, be especially suitable for large-scale virtual network mapping scene.
The feature and advantage of the present invention will be described in detail by embodiment combination attached drawing.
【Description of the drawings】
Fig. 1 is the operating status schematic diagram of the bottom layer node of the embodiment of the present invention.
Fig. 2 is the operating status schematic diagram of the bottom link of the embodiment of the present invention.
【Specific implementation mode】
In order to make the objectives, technical solutions and advantages of the present invention clearer, right below by attached drawing and embodiment
The present invention is further elaborated.However, it should be understood that specific embodiment described herein is only used to explain this hair
Range that is bright, being not intended to restrict the invention.In addition, in the following description, descriptions of well-known structures and technologies are omitted, with
Avoid unnecessarily obscuring idea of the invention.
Refering to fig. 1 and Fig. 2, the embodiment of the present invention provide a kind of energy-efficient virtual network mapping side based on feedback control
Method is as follows：
A virtual network distribution model) is established：
Bottom-layer network：Establish non-directed graphWherein NsFor bottom layer node set, LsFor bottom
Link set,For bottom layer node attribute set,For bottom link attribute set, the bottom layer node attribute is each bottom
The cpu resource of node layer, the bottom link attribute are the bandwidth resources of each bottom layer node.
Virtual network：Establish non-directed graphWherein NvFor dummy node set, LvIt is virtual
Link set,For dummy node attribute set,For virtual link attribute set, the dummy node attribute is each void
The cpu resource of quasi- node, the virtual link attribute are the bandwidth resources of each dummy node.
Virtual network distribution label：If LNum is the number for the bottom link currently being connect with virtual network, i.e., current bottom
At the virtual network quantity of the distribution of work, initial value 0 in layer network.
B the initial value of virtual network distribution method) is set：The degree for recording each bottom layer node, by each bottom layer node and
The mapping status of every bottom link is set as to map, and waits for the request of virtual network.
C bottom layer node) is selected：After bottom-layer network receives the request of virtual network, judge current bottom link whether
Connection, that is, judge whether LNum is greater than or equal to the total quantity of bottom link, if there is not connected bottom link, that is, LNum<
The total quantity of bottom link then traverses all bottom layer nodes mapped, with the minimum bottom layer node of degree of searching, if it is successful,
Then go to step D)；It is if it is not found, then go to step E)；If there is no not connected bottom link, that is, LNum >=bottom
The total quantity of link, then go to step G).
D bottom link) is selected：All bottom links where bottom layer node u are traversed, and judge to check that the bottom link is
The mapping status of the bottom link is set as to map, and go to step F by no stabilization if stablized)；If unstable,
The bottom link is then abandoned, and the mapping status of the bottom link is set as to map；If there is no stablize after traversal
Bottom link, then the mapping status of bottom layer node is set as to map, returns back to step C again).
E) bottom layer node distribution failure：Return can not find suitable bottom layer node information, and go to step J).
F) virtual network is distributed：Stable bottom link is connect with virtual network, and the node of virtual network is mapped
State and link maps state are changed to map, and return to virtual network and are allocated successfully, and LNum adds 1, and virtual network is waited for leave,
And handle next virtual network requests simultaneously, that is, return back to step C).
G) bottom link distribution failure：The busy information of current bottom-layer network is returned, and goes to step J).
H bottom-layer network state) is updated：The mapping situation of current virtual network is checked, if the node mapping of virtual network
State and link maps state are not map, then terminate the connection of bottom link and virtual network, and LNum subtracts 1, goes to step
I)。
I virtual network distribution) is completed：The cpu resource of virtual network is distributed in release, completes the company of current virtual network
It connects, and handles the request of next virtual network, until all bottom links disconnect and the connection of virtual network.
J) virtual network distribution failure：The information that current virtual network can not distribute is returned, virtual network distribution is terminated.
A kind of energy-efficient mapping method of virtual network based on feedback control proposed by the present invention, virtual network is distributed
Scope limitation and according to actual virtual network state, constantly expands, traverses to bottom in the range of individual bottom layer node
Link is finally expanded to entire bottom layer node network, i.e., distributes virtual network, pole for the dynamic energy consumption feature of virtual network
The earth reduces the energy of network distribution consumption, and can dynamically incrementally increase the range of distribution of virtual network, i.e., by bottom
Point spread substantially reduces node mapping energy penalty to bottom link to realize that virtual network distribution energy consumption is optimal.
Specifically, step D) further include following specific steps：
D1 a bottom link l where u) is searched outuv, by bottom link luvMapping status be changed to reflect
It penetrates, and calls another bottom endpoint v, the degree of bottom layer node u and v are respectively subtracted one, if the degree of u is less than or equal to 0 at this time,
Go to step D2)；If the degree of v is less than or equal to 0, step D3 is gone to)；If the degree of u and v is both greater than 0, l is judgeduvSurely
It is fixed, go to step F)；
D2) mapping status of u is changed to map, judges that bottom layer node u does not have stable bottom link, weight
Newly return back to step C)；
D3) mapping status of v is changed to map, judges bottom link luvIt is unstable, abandon luv, seek again
Bottom link is looked for, step D1 is returned back to).
When virtual network is left, bottom-layer network judges whether bottom layer node and bottom link are detached from virtual network, such as
Fruit meets release conditions, then discharges the amount of CPU resource of bottom-layer network in time, improve cpu busy percentage, to significantly improve void
The distribution rate of quasi- network, is especially suitable for large-scale virtual network mapping scene.
In order to preferably state the carrying out practically process of above-mentioned algorithm, the present invention provides the pseudocode form of above-mentioned algorithm,
It is specific as follows：
Algorithm 1
1：Set bottom layer node and bottom link can mapping status
Input：The bottom number of links nosleep that can be mappedl
Output：Distribute to the bottom layer node and bottom link of virtual network
2：Virtual network energy back control algolithm
Input：Virtual network requests
Output：Virtual network allocation result
Wherein, NodeEm (i) and LinkEm (i) are the mapping status of virtual network, i.e. corresponding node mapping status respectively
With link maps state, nosleeplFor the not available bottom number of links of current bottom-layer network, linkSum is in bottom-layer network
The total quantity of bottom link, sleeplIt is then the bottom number of links that can be mapped.
A kind of energy-efficient mapping method of virtual network based on feedback control provided in an embodiment of the present invention, step are closed
The range of distribution of virtual network, can be limited to the level of bottom layer node, pole by reason according to the dynamic mapping feature of virtual network
The earth reduces the energy of network distribution consumption, and can dynamically incrementally increase the range of distribution of virtual network, i.e., by bottom
Point spread substantially reduces node mapping energy penalty, together to bottom link to realize that virtual network distribution energy consumption is optimal
When, it is ensured that amount of CPU resource can discharge in time when virtual network is left, and improve cpu busy percentage, to significantly improve void
The distribution rate of quasi- network, is especially suitable for large-scale virtual network mapping scene.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
Any modification, equivalent replacement or improvement etc., should all be included in the protection scope of the present invention made by within refreshing and principle.
Claims (2)
1. a kind of energy-efficient mapping method of virtual network based on feedback control, it is characterised in that：It is as follows：
A virtual network distribution model) is established：
Bottom-layer network：Establish non-directed graphWherein NsFor bottom layer node set, LsFor bottom link
Set,For bottom layer node attribute set,For bottom link attribute set, the bottom layer node attribute is each bottom section
The cpu resource of point, the bottom link attribute are the bandwidth resources of each bottom layer node；
Virtual network：Establish non-directed graphWherein NvFor dummy node set, LvFor virtual link
Set,For dummy node attribute set,For virtual link attribute set, the dummy node attribute is each virtual section
The cpu resource of point, the virtual link attribute are the bandwidth resources of each dummy node；
Virtual network distribution label：If LNum is the number for the bottom link currently being connect with virtual network, i.e., current underlying network
At the virtual network quantity of the distribution of work, initial value 0 in network；
B the initial value of virtual network distribution method) is set：The degree for recording each bottom layer node, by each bottom layer node and every
The mapping status of bottom link is set as to map, and waits for the request of virtual network；
C bottom layer node) is selected：After bottom-layer network receives the request of virtual network, judge whether current bottom link has connected,
Whether LNum is judged >=total quantity of bottom link, if there is not connected bottom link, that is, LNum<Bottom link it is total
Quantity then traverses all bottom layer nodes mapped, with the minimum bottom layer node of degree of searching, if it succeeds, going to step D)；
It is if it is not found, then go to step
E)；If there is no the total quantity of not connected bottom link, that is, LNum >=bottom link, then step G is gone to)；
D bottom link) is selected：All bottom links where bottom layer node u are traversed, and judge to check whether the bottom link is steady
It is fixed, if stablized, the mapping status of the bottom link is set as to map, and go to step F)；If unstable, put
The bottom link is abandoned, and the mapping status of the bottom link is set as to map；If there is no the bottoms stablized after traversal
Layer link, then be set as the mapping status of bottom layer node to map, return back to step C again)；
E) bottom layer node distribution failure：Return can not find suitable bottom layer node information, and go to step J)；
F) virtual network is distributed：Stable bottom link is connect with virtual network, and by the node mapping status of virtual network
It is changed to map with link maps state, returns to virtual network and be allocated successfully, LNum adds 1, and virtual network is waited for leave, and same
When handle next virtual network requests, that is, return back to step C)；
G) bottom link distribution failure：The busy information of current bottom-layer network is returned, and goes to step J)；
H bottom-layer network state) is updated：The mapping situation for checking current virtual network, if the node mapping status of virtual network
It is not map with link maps state, then terminates the connection of bottom link and virtual network, LNum subtracts 1, goes to step I)；
I virtual network distribution) is completed：The cpu resource of virtual network is distributed in release, completes the connection of current virtual network, and
The request of next virtual network is handled, until all bottom links disconnect and the connection of virtual network；
J) virtual network distribution failure：The information that current virtual network can not distribute is returned, virtual network distribution is terminated.
2. a kind of energy-efficient mapping method of virtual network based on feedback control as described in claim 1, it is characterised in that：
The step D) further include following specific steps：
D1 a bottom link l where u) is searched outuv, by bottom link luvMapping status be changed to map, and
Another bottom endpoint v is called, the degree of bottom layer node u and v are respectively subtracted one, if the degree of u is less than or equal to 0 at this time, is gone to
Step D2)；If the degree of v is less than or equal to 0, step D3 is gone to)；If the degree of u and v is both greater than 0, l is judgeduvStablize,
Go to step F)；
D2) mapping status of u is changed to map, judges that bottom layer node u does not have stable bottom link, returns again
Go to step C)；
D3) mapping status of v is changed to map, judges bottom link luvIt is unstable, abandon luv, bottom is found again
Link returns back to step D1).
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 CN104780125A (en) | 2015-07-15 |
| CN104780125B true 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 (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101045301B1 (en) * | 2009-07-03 | 2011-06-29 | 서울대학교산학협력단 | Virtual Network embedding method in wireless test bed networks |
-
2015
- 2015-04-08 CN CN201510161067.8A patent/CN104780125B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
|---|
| 《主动休眠节点链路的高效节能虚拟网络映射》;陈晓华等;《软件学报》;20150731;第25卷(第7期);全文 * |
| 《虚拟网络映射最小费用流模型及算法》;陈晓华等;《电信科学》;20140630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104780125A (en) | 2015-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Toward vehicle-assisted cloud computing for smartphones | |
| Zhang et al. | Virtual network embedding based on the degree and clustering coefficient information | |
| CN103856355B (en) | The method that the virtual network that a kind of energy consumption is perceived maps shipping model | |
| CN104821906B (en) | A kind of energy-efficient virtual network node mapping model and algorithm | |
| CN111538587B (en) | Service function chain reconfiguration method based on load balancing | |
| CN103294521B (en) | A kind of method reducing data center's traffic load and energy consumption | |
| CN103559084B (en) | A kind of virtual machine migration method at Energy-saving Data center | |
| CN104901861A (en) | Network topology pre-optimization-based virtual network mapping method capable of improving availability | |
| CN106357796A (en) | Optimal service allocation algorithm for mobile applications under mobile cloud computing | |
| CN103645795A (en) | Cloud computing data center energy saving method based on ANN (artificial neural network) | |
| CN108196935A (en) | A kind of energy saving moving method of virtual machine towards cloud computing | |
| CN104754053A (en) | Distributed software-defined network and method of dynamically controlling controllers therein | |
| Li et al. | Deployment of edge servers in 5G cellular networks | |
| CN110061881A (en) | A kind of energy consumption perception virtual network mapping algorithm based on Internet of Things | |
| WO2014040554A1 (en) | Method and apparatus for determining energy-efficient routing | |
| CN106101010A (en) | VBRAS flow load balance method and device based on end office's cloud | |
| CN103916266B (en) | A kind of energy-efficient virtual network mapping algorithm of active dormancy node and link | |
| CN107835130A (en) | A kind of flow allocation method and device | |
| Lin et al. | Vehicle-to-cloudlet: Game-based computation demand response for mobile edge computing through vehicles | |
| Séguéla et al. | Comparing energy-aware vs. cost-aware data replication strategy | |
| CN104780125B (en) | A kind of energy-efficient mapping method of virtual network based on feedback control | |
| Yu et al. | An energy-aware algorithm for optimizing resource allocation in software defined network | |
| CN104158717B (en) | A kind of feedback of energy-efficient virtual network mapping | |
| Hossan et al. | Distance and energy aware extended LEACH using secondary cluster head for wireless sensor networks | |
| CN105337832A (en) | Resource distribution method for on-line multicast virtual network |
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 |