CN104780125A - Efficient and energy-saving virtual network mapping method based on feedback control - Google Patents

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

A kind of energy-efficient mapping method of virtual network based on FEEDBACK CONTROL

[technical field]

The present invention relates to a kind of virtual network controls method, particularly a kind of energy-efficient mapping method of virtual network based on FEEDBACK CONTROL.

[background technology]

Along with power cost rises steadily and the raising of people's ecological awareness, Virtual network operator has recognized the importance of managing power consumption, reduces energy consumption and becomes problem demanding prompt solution.Current network is that peak load designs, and the supply of Internet resources excess ensure that the normal operation of network, but also causes resource utilization low.According to statistics, the about 30-40% of average link utilization of large-scale ISP backbone network, the average utilization of data center server is 11% ~ 50%.Too low utilance causes huge waste of energy, impels the rise of GreenNet research, and network energy consumption problem becomes study hotspot.

Network virtualization is the important technology of Future Internet, cloud computing and software defined network.It, by integration networks infrastructure resources, can use energy rationally and effectively, and Intelligent Energy sensing network is disposed becomes possibility.It is the virtualized key issues of Internet resources that virtual network maps.Most current mapping algorithm maps based on the virtual network of cost, namely to minimize underlying resource cost maps virtual network request, obtains more bottom physical resource with this, and then improve virtual network acceptance rate and system benefit.But because virtual network requests is a dynamic changing process, and bottom physical network designs according to peak flow, the virtual network based on cost maps must bring unnecessary energy consumption.With energy-conservation be target virtual networkization map should under the prerequisite meeting current virtual network request minimum energy losses.Because the power consumption of current network device to traffic load is insensitive, therefore as far as possible when not affecting virtual network mapping performance to close or dormant network node and link are energy-conservation effective ways more.

The current virtual network based on Energy-aware is mapping through amendment virtual network mapping algorithm, makes virtual network be mapped to movable node and link as far as possible, to reach energy saving of system object.As: existing by reducing the set of physical network device quantity distribution virtual network requests, propose the Energy-aware optimal model of mixed integer programming, but time complexity exponentially increases, the virtual network being difficult to adapt to large scale network infrastructure maps; Have and consider the feature that cabinet observable index route energy consumption is low, propose the power-economizing method of expansion flow to Internet resources, but be applicable to the equipment of responsive to load; The existing heuristic proposing the minimum energy losses that virtual network is reshuffled; The Su Sen of Beijing University of Post & Telecommunication etc. propose virtual network and map energy consumption model and Energy-aware two benches mapping algorithm; Chang Xiaolin, Wang Bing of Northern Transportation University etc. propose mixed integer programming energy consumption model and Energy-aware two benches mapping algorithm, have and apply the mapping of ant colony optimization algorithm solving virtual network energy-saving in cloud data center.Visible relevant energy-conservation the map of perception algorithm is at present by amendment virtual network mapping algorithm, finds effective bottom-layer network node and link set passively, is vulnerable to the interference that virtual network behavioral characteristics brings.

Virtual network is distributed can modelling as follows: set up from G ^vto G ^sthe mapping M of a certain subset ^v, namely $M^v:(N^v,L^v)\→(N_{\′}^s,N_{\′}^s),$ Wherein, $N_{\′}^s\⋐N^s,P_{\′}^s\⋐P^s,$ And P ^sfor the set of loop free path all in bottom-layer network.

[summary of the invention]

The object of the invention is to overcome above-mentioned the deficiencies in the prior art, provide a kind of energy-efficient mapping method of virtual network based on FEEDBACK CONTROL, it is intended to solve virtual network distribution method in prior art and cannot ensures to map the minimum technical problem of energy penalty.

For achieving the above object, the present invention proposes a kind of energy-efficient mapping method of virtual network based on FEEDBACK CONTROL, its concrete steps are as follows:

A) virtual network apportion model is set up:

Bottom-layer network: set up non-directed graph wherein N ^sfor bottom layer node set, L ^sfor bottom link set, for bottom layer node community set, for the set of bottom link attribute, described bottom layer node attribute is the cpu resource of each bottom layer node, and described bottom link attribute is the bandwidth resources of each bottom layer node;

Virtual network: set up non-directed graph wherein N ^vfor dummy node set, L ^vfor virtual link set, for dummy node community set, for virtual link community set, described dummy node attribute is the cpu resource of each dummy node, and described virtual link attribute is the bandwidth resources of each dummy node;

Virtual network distribute labels: set LNum as the number of the current bottom link be connected with virtual network, namely become the virtual network quantity of the distribution of work in current bottom-layer network, its initial value is 0;

B) set the initial value of virtual network distribution method: the degree recording each bottom layer node, is all set as mapping by the mapping status of each bottom layer node and every bar bottom link, wait 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 connects all, namely LNum is more than or equal to the total quantity of bottom link, if there is the bottom link do not connected, then travel through all bottom layer node mapped, with the bottom layer node u that searching degree is minimum, if success, then go to step D); If do not found, then go to step E); If there is no the bottom link do not connected, then go to step G);

D) select bottom link: all bottom links at traversal bottom layer node u place, and judge to check whether this bottom link is stablized, if stable, then the mapping status of this bottom link be set to and can not map, and go to step F); If unstable, then abandon this bottom link, and the mapping status of this bottom link is set to and can not maps; If bottom link unstable after traversal, be then set to can not map the mapping status of bottom layer node, again return back to step C);

E) bottom layer node is distributed unsuccessfully: return and cannot find applicable bottom layer node information, and go to step J);

F) virtual network is distributed: be connected with virtual network by stable bottom link, and the node mapping state of virtual network and link maps state are changed to map, return virtual network to be allocated successfully, LNum adds 1, wait virtual network is left, and process next virtual network requests simultaneously, namely return back to step C);

G) bottom link assignment failure: return the information that current bottom-layer network is busy, and go to step J);

H) upgrade bottom-layer network state: the mapping situation checking current virtual network, if the node mapping state of virtual network and link maps state are do not map, then terminate the connection of bottom link and virtual network, LNum subtracts 1, goes to step I);

I) complete virtual network to distribute: the cpu resource of virtual network is distributed in release, completes the connection of current virtual network, and processes the request of next virtual network, until all bottom links all disconnect the connection with virtual network;

J) virtual network is distributed unsuccessfully: return the information that current virtual network cannot distribute, and terminates virtual network and distributes.

As preferably, described step D) also comprise following concrete steps:

D1) a bottom link l at u place is searched out _uv, by this bottom link l _uvmapping status change to and can not map, and call another bottom end points v, the degree of bottom layer node u and v respectively subtracted one, if now the degree of u is less than or equal to 0, then goes to step D2); If the degree of v is less than or equal to 0, then go to step D3); If the degree of u and v is all greater than 0, then judge l _uvstable, go to step F);

D2) mapping status of u is changed to and can not map, judge that this bottom layer node u does not have stable bottom link, again return back to step C);

D3) mapping status of v is changed to and can not map, judge this bottom link l _uvinstability, abandons l _uv, again find bottom link, return back to step D1).

Beneficial effect of the present invention: compared with prior art, a kind of energy-efficient mapping method of virtual network based on FEEDBACK CONTROL provided by the invention, step is reasonable, can according to the dynamic mapping feature of virtual network, the range of distribution of virtual network is limited to the level of bottom layer node, and dynamically progressively can increase the range of distribution of virtual network, bottom link is expanded to by bottom layer node, thus it is optimum to realize virtual network distribution energy consumption, greatly reduce node mapping energy penalty, simultaneously, when also assures that virtual network is left, cpu resource amount can discharge in time, improve cpu busy percentage, thus significantly improve the distribution speed of virtual network, especially large-scale virtual network mapping scene is applicable to.

Feature of the present invention and advantage will be described in detail by reference to the accompanying drawings by embodiment.

[accompanying drawing explanation]

Fig. 1 is the running status schematic diagram of the bottom layer node of the embodiment of the present invention.

Fig. 2 is the running status schematic diagram of the bottom link of the embodiment of the present invention.

[embodiment]

For making the object, technical solutions and advantages of the present invention clearly understand, below by accompanying drawing and embodiment, the present invention is further elaborated.But should be appreciated that, specific embodiment described herein, only in order to explain the present invention, is not limited to scope of the present invention.In addition, in the following description, the description to known features and technology is eliminated, to avoid unnecessarily obscuring concept of the present invention.

Consult Fig. 1 and Fig. 2, the embodiment of the present invention provides a kind of energy-efficient mapping method of virtual network based on FEEDBACK CONTROL, and its concrete steps are as follows:

A) virtual network apportion model is set up:

Bottom-layer network: set up non-directed graph wherein N ^sfor bottom layer node set, L ^sfor bottom link set, for bottom layer node community set, for the set of bottom link attribute, described bottom layer node attribute is the cpu resource of each bottom layer node, and described bottom link attribute is the bandwidth resources of each bottom layer node.

Virtual network: set up non-directed graph wherein N ^vfor dummy node set, L ^vfor virtual link set, for dummy node community set, for virtual link community set, described dummy node attribute is the cpu resource of each dummy node, and described virtual link attribute is the bandwidth resources of each dummy node.

Virtual network distribute labels: set LNum as the number of the current bottom link be connected with virtual network, namely become the virtual network quantity of the distribution of work in current bottom-layer network, its initial value is 0.

B) set the initial value of virtual network distribution method: the degree recording each bottom layer node, is all set as mapping by the mapping status of each bottom layer node and every bar bottom link, wait 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 connects all, namely LNum is more than or equal to the total quantity of bottom link, if there is the bottom link do not connected, then travel through all bottom layer node mapped, with the bottom layer node u that searching degree is minimum, if success, then go to step D); If do not found, then go to step E); If there is no the bottom link do not connected, then go to step G).

D) select bottom link: all bottom links at traversal bottom layer node u place, and judge to check whether this bottom link is stablized, if stable, then the mapping status of this bottom link be set to and can not map, and go to step F); If unstable, then abandon this bottom link, and the mapping status of this bottom link is set to and can not maps; If bottom link unstable after traversal, be then set to can not map the mapping status of bottom layer node, again return back to step C).

E) bottom layer node is distributed unsuccessfully: return and cannot find applicable bottom layer node information, and go to step J).

F) virtual network is distributed: be connected with virtual network by stable bottom link, and the node mapping state of virtual network and link maps state are changed to map, return virtual network to be allocated successfully, LNum adds 1, wait virtual network is left, and process next virtual network requests simultaneously, namely return back to step C).

G) bottom link assignment failure: return the information that current bottom-layer network is busy, and go to step J).

H) upgrade bottom-layer network state: the mapping situation checking current virtual network, if the node mapping state of virtual network and link maps state are do not map, then terminate the connection of bottom link and virtual network, LNum subtracts 1, goes to step I).

I) complete virtual network to distribute: the cpu resource of virtual network is distributed in release, completes the connection of current virtual network, and processes the request of next virtual network, until all bottom links all disconnect the connection with virtual network.

J) virtual network is distributed unsuccessfully: return the information that current virtual network cannot distribute, and terminates virtual network and distributes.

A kind of energy-efficient mapping method of virtual network based on FEEDBACK CONTROL that the present invention proposes, virtual network range of distribution is limited in the scope of independent bottom layer node, and according to the virtual network state of reality, constantly expand, traversal is to bottom link, finally expand whole bottom layer node network to, namely the dynamic energy consumption feature for virtual network distributes virtual network, considerably reduce the energy that network allocation consumes, and dynamically progressively can increase the range of distribution of virtual network, bottom link is expanded to by bottom layer node, thus it is optimum to realize virtual network distribution energy consumption, greatly reduce node mapping energy penalty.

Particularly, step D) also comprise following concrete steps:

D1) a bottom link l at u place is searched out _uv, by this bottom link l _uvmapping status change to and can not map, and call another bottom end points v, the degree of bottom layer node u and v respectively subtracted one, if now the degree of u is less than or equal to 0, then goes to step D2); If the degree of v is less than or equal to 0, then go to step D3); If the degree of u and v is all greater than 0, then judge l _uvstable, go to step F);

D2) mapping status of u is changed to and can not map, judge that this bottom layer node u does not have stable bottom link, again return back to step C);

D3) mapping status of v is changed to and can not map, judge this bottom link l _uvinstability, abandons l _uv, again find bottom link, return back to step D1).

When virtual network is left, bottom-layer network judges whether bottom layer node and bottom link depart from virtual network, if meet release conditions, then the cpu resource amount of bottom-layer network is discharged in time, improve cpu busy percentage, thus significantly improve the distribution speed of virtual network, be especially applicable to large-scale virtual network mapping scene.

In order to state the carrying out practically process of above-mentioned algorithm better, the invention provides the false code form of above-mentioned algorithm, specific as follows:

Algorithm 1

1: setting bottom layer node and bottom link can mapping status

Input: the bottom number of links nosleep that can map ^l

Export: bottom layer node and the bottom link of distributing to virtual network

1.1：sln＝0；sleep ^l＝linkSum-nosleep ^l；

1.2:foreach (each bottom layer node k)

1.3: degree d (k) calculating bottom layer node;

1.4: be can mapping status by each bottom layer node and bottom link setting;

1.5：while(sln＜sleep ^l){

1.6:if (have found the bottom layer node u that d (k) is minimum)

1.7:foreach (the bottom link l at each u place _uv)

1.8: by l _uvmapping status be set to and can not map; Sln++;

1.9： d(u)--；d(v)--；

The mapping status of u is set to and can not maps by 1.10:if (d (u)==0);

The mapping status of v is set to and can not maps by 1.11:if (d (v)==0);

1.12： if(sln≥sleep ^l)break；

1.13： }

1.14： }else{break；}

1.15：}

1.16:return distributes to bottom layer node and the bottom link of virtual network

2: virtual network energy back control algolithm

Input: virtual network requests

Export: virtual network allocation result

2.1: call the LNum in a virtual network allocation result;

2.2：while(1){

2.3: take LNum as the bottom number of links nosleep that can map ^l, executing arithmetic 1;

2.4： if(t＝NodeEm(i)＝＝true){

2.5: virtual network state is set to node mapping success;

Break；

2.6：}

2.7：LNum++；

The failure of 2.8:if (LNum > linkSum) return peer distribution;

2.9：}

2.10：while(1){

2.11： if(t＝LinkEm(i)＝＝true){

2.12: virtual network state is set to link maps success;

Return virtual network allocation result;

2.13：}

2.14：LNum++；

The failure of 2.15:if (LNum > linkSum) return link assignment;

2.16: the resource discharging bottom layer node and the bottom link distributed;

2.17：Goto 3；

2.18：}

Wherein, the mapping status that NodeEm (i) and LinkEm (i) is virtual network, namely distinguishes corresponding node mapping status and link maps state, nosleep ^lfor the disabled bottom number of links of current bottom-layer network, linkSum is the total quantity of bottom link in bottom-layer network, sleep ^lbottom number of links then for mapping.

A kind of energy-efficient mapping method of virtual network based on FEEDBACK CONTROL that the embodiment of the present invention provides, step is reasonable, can according to the dynamic mapping feature of virtual network, the range of distribution of virtual network is limited to the level of bottom layer node, considerably reduce the energy that network allocation consumes, and dynamically progressively can increase the range of distribution of virtual network, bottom link is expanded to by bottom layer node, thus it is optimum to realize virtual network distribution energy consumption, greatly reduce node mapping energy penalty, simultaneously, when also assures that virtual network is left, cpu resource amount can discharge in time, improve cpu busy percentage, thus significantly improve the distribution speed of virtual network, especially large-scale virtual network mapping scene is applicable to.

The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement or improvement etc., all should be included within protection scope of the present invention.

Claims (2)

1. based on an energy-efficient mapping method of virtual network for FEEDBACK CONTROL, it is characterized in that: its concrete steps are as follows:

A) virtual network apportion model is set up:

Bottom-layer network: set up non-directed graph wherein N ^sfor bottom layer node set, L ^sfor bottom link set, for bottom layer node community set, for the set of bottom link attribute, described bottom layer node attribute is the cpu resource of each bottom layer node, and described bottom link attribute is the bandwidth resources of each bottom layer node;

Virtual network: set up non-directed graph wherein N ^vfor dummy node set, L ^vfor virtual link set, for dummy node community set, for virtual link community set, described dummy node attribute is the cpu resource of each dummy node, and described virtual link attribute is the bandwidth resources of each dummy node;

Virtual network distribute labels: set LNum as the number of the current bottom link be connected with virtual network, namely become the virtual network quantity of the distribution of work in current bottom-layer network, its initial value is 0;

B) set the initial value of virtual network distribution method: the degree recording each bottom layer node, is all set as mapping by the mapping status of each bottom layer node and every bar bottom link, wait 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 connects all, namely LNum is more than or equal to the total quantity of bottom link, if there is the bottom link do not connected, then travel through all bottom layer node mapped, with the bottom layer node u that searching degree is minimum, if success, then go to step D); If do not found, then go to step E); If there is no the bottom link do not connected, then go to step G);

D) select bottom link: all bottom links at traversal bottom layer node u place, and judge to check whether this bottom link is stablized, if stable, then the mapping status of this bottom link be set to and can not map, and go to step F); If unstable, then abandon this bottom link, and the mapping status of this bottom link is set to and can not maps; If bottom link unstable after traversal, be then set to can not map the mapping status of bottom layer node, again return back to step C);

E) bottom layer node is distributed unsuccessfully: return and cannot find applicable bottom layer node information, and go to step J);

F) virtual network is distributed: be connected with virtual network by stable bottom link, and the node mapping state of virtual network and link maps state are changed to map, return virtual network to be allocated successfully, LNum adds 1, wait virtual network is left, and process next virtual network requests simultaneously, namely return back to step C);

G) bottom link assignment failure: return the information that current bottom-layer network is busy, and go to step J);

H) upgrade bottom-layer network state: the mapping situation checking current virtual network, if the node mapping state of virtual network and link maps state are do not map, then terminate the connection of bottom link and virtual network, LNum subtracts 1, goes to step I);

I) complete virtual network to distribute: the cpu resource of virtual network is distributed in release, completes the connection of current virtual network, and processes the request of next virtual network, until all bottom links all disconnect the connection with virtual network;

J) virtual network is distributed unsuccessfully: return the information that current virtual network cannot distribute, and terminates virtual network and distributes.

2. a kind of energy-efficient mapping method of virtual network based on FEEDBACK CONTROL as claimed in claim 1, is characterized in that: described step D) also comprise following concrete steps:

D1) a bottom link l at u place is searched out _uv, by this bottom link l _uvmapping status change to and can not map, and call another bottom end points v, the degree of bottom layer node u and v respectively subtracted one, if now the degree of u is less than or equal to 0, then goes to step D2); If the degree of v is less than or equal to 0, then go to step D3); If the degree of u and v is all greater than 0, then judge l _uvstable, go to step F);

D2) mapping status of u is changed to and can not map, judge that this bottom layer node u does not have stable bottom link, again return back to step C);

D3) mapping status of v is changed to and can not map, judge this bottom link l _uvinstability, abandons l _uv, again find bottom link, return back to step D1).