CN103580922A - Overload control method for electric power communication network application server based on hybrid optimization - Google Patents

Overload control method for electric power communication network application server based on hybrid optimization Download PDF

Info

Publication number
CN103580922A
CN103580922A CN201310552728.0A CN201310552728A CN103580922A CN 103580922 A CN103580922 A CN 103580922A CN 201310552728 A CN201310552728 A CN 201310552728A CN 103580922 A CN103580922 A CN 103580922A
Authority
CN
China
Prior art keywords
business
overload
speed control
efficiency
priority
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
Application number
CN201310552728.0A
Other languages
Chinese (zh)
Other versions
CN103580922B (en
Inventor
孟凡博
金鑫
赵宏昊
李跃华
魏本宏
王芝茗
葛维春
赵庆杞
庞东辰
苏宗昱
姜日敏
林志超
齐智刚
刘杨
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
LIAONING MEDICAL DEVICE TESTING
Liaoning Planning And Designing Institute Of Posts And Telecommunication Co Ltd
State Grid Corp of China SGCC
State Grid Liaoning Electric Power Co Ltd
Original Assignee
LIAONING MEDICAL DEVICE TESTING
Liaoning Planning and Designing Institute of Post and Telecommunication Co Ltd
State Grid Corp of China SGCC
State Grid Liaoning Electric Power Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by LIAONING MEDICAL DEVICE TESTING, Liaoning Planning and Designing Institute of Post and Telecommunication Co Ltd, State Grid Corp of China SGCC, State Grid Liaoning Electric Power Co Ltd filed Critical LIAONING MEDICAL DEVICE TESTING
Priority to CN201310552728.0A priority Critical patent/CN103580922B/en
Publication of CN103580922A publication Critical patent/CN103580922A/en
Application granted granted Critical
Publication of CN103580922B publication Critical patent/CN103580922B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention provides an overload control method for an electric power communication network application server based on hybrid optimization, and belongs to the technical field of electric power communication networks. According to the overload control method, an energy efficient optimal overload control model is built by setting a relation function between a control rate and energy efficiency and using overload control as a constraint condition and through the consideration of the problems of overload control and energy efficiency of the application server. The overload control is carried out by using hybrid particle swarm optimization and a genetic algorithm, the search efficiency of the hybrid particle swarm optimization is high, so the overload control can be limited to a range near to an extremal solution through less algebra evolution. Update limitation is carried out on particles by using a simulated annealing strategy so that the particles can jump out of the local optimum, enable a searching scope to be broadened and get rid of a prematurity phenomenon. Finally, individual assessment is carried out by using an applicable degree function, and genetic manipulation is carried out on this basis to obtain an accurate optimal solution. The overload control method can effectively carry out overload control on the application server in the electric power communication network.

Description

A kind of powerline network application server overload controlling method based on hybrid optimization
Technical field
The present invention belongs to powerline network technical field, is specifically related to a kind of powerline network application server overload controlling method based on hybrid optimization.
Background technology
Powerline network is the important leverage of the normal operation of electric power system, and the powerline network of high energy efficiency is the main flow trend of following power system telecommunications technology development.In powerline network architecture, provide the application server of service operation environment to there is very consequence, application server is the core system of operation layer, it utilizes bottom-layer network ability by open interface (as application programming interface) or agreement (as Session initiation Protocol) downwards, upwards for service logic, has shielded the complexity of bottom-layer network.As the telecom carrier-class device of powerline network of future generation, application server is similar to the service control point (Service Control Point, SCP) in intelligent network in function.As telecom carrier-class device, it is an important component part of application server that overload is controlled, and the load state of its regular detection system, while finding that traffic carrying capacity surpasses the scope (i.e. overload) allowing, take adequate measures to reduce the traffic carrying capacity of the system that enters, guarantee stablizing and safety of system.And compare with SCP, the class of business that application server need to move is more, and overload control problem is more complicated.A large amount of service request and processing are easy to form bottleneck.Class of business is various, difference is large, sudden height, service strategy different, its traffic overload is controlled and be more complex than traditional intelligent network far away.Therefore, how by effective technological means, to arriving the miscellaneous service of application server in powerline network, carry out statistical analysis and classification, and then carry out effectively overload and control, become one of main challenge facing in powerline network development and operation.
Power telecom network, as national private wire network, is served State Grid's transport network, and in power telecom network, the overload of application server is controlled has direct impact to the safe and stable operation of communication network.Therefore, the overload of application server in powerline network is controlled and launched broad research.The behavior of application server when the people such as Hit are transshipped by analysis, has proposed a kind of distributed SIP overload controlling mechanism.The people such as Rosario have designed a Long-distance Control mechanism, propose a new dynamic load evaluation method, and use Predicting Technique to control remote loop.The people such as Homayouni, for the overload problem in sip server, utilize distributed self-adaption window, and the traffic carrying capacity that is sent to downstream SIP by restriction is controlled overload, and have proposed a kind of adaptive overload control algolithm.The people such as Noel show that by simulation current SIP controls not enough result, and have proposed some new algorithms and control SIP network over loading, under ever-increasing load level, improve throughput.Although above method can suppress the traffic overload of application service, its performance is desirable not enough, and does not consider network high energy consumption, poor efficiency, i.e. low-energy-efficiency problem.
At present, overload detection index mainly contains business number, average response time, queue message is overtime and cpu busy percentage.Because the multiservice environment of application server is different to the different response times in the system unit time, also unreasonable as overload detection index with average response time; Which kind of traffic overload is the detection method overtime based on queue message cannot detect, and in the system based on priority, if overload is service request by high priority, cause, overtime generation for the previous period low priority cannot be served at all.In essence, it is that the resource of application server cannot be processed the business of all arrival because the arrival rate of some business is excessive that overload is controlled, and causes application server overload.Therefore, should solve in conjunction with the arrival rate of business the efficiency overload control problem of application server.
Summary of the invention
For the deficiencies in the prior art, the present invention proposes a kind of powerline network application server overload controlling method based on hybrid optimization, to reach, realizes the object that overload is controlled, reduced energy consumption and raise the efficiency.
A powerline network application server overload controlling method for hybrid optimization, comprises the following steps:
Step 1, be set the sampling interval, according to sampling interval and random coefficient, determine actual samples spacing, and in this actual samples spacing arrival rate and the processing speed of number of services, different business in sense cycle, obtain the utilance of CPU, and according to the free space of service spatial cache, obtain service spatial cache utilance;
Step 2, judge whether application server transships, whether the utilance that judges CPU is greater than the threshold value setting according to demand, whether the spatial cache of judgement service simultaneously utilance is greater than the threshold value setting according to demand, if above-mentioned, both are greater than threshold value simultaneously, application server transships, stop receiving the business in next cycle and perform step 3, otherwise, will add in the sampling interval and return in the lump execution step 1;
Step 3, all business are sorted according to the priority of setting, and the cpu busy percentage of each business after acquisition sequence, in all business, select cpu busy percentage and be greater than the business of cpu busy percentage threshold value separately, as controlled different priorities overload business;
Step 4, the total energy consumption consuming according to the whole business of application server processes, in conjunction with the restrictive condition of different business speed control, set up efficiency Optimized model, is specially:
Step 4-1, according to the maximum traffic processing speed of server and the shared ratio of server basal energy expenditure, set up the relation between energy consumption and speed control;
Step 4-2, the total energy consumption consuming according to the total speed control of overload business and the whole business of application server processes, set up the relation between efficiency and service with different priority levels speed control;
Step 4-3, be set in the qualifications of overload in control procedure, the speed control that the cpu busy percentage that comprises service with different priority levels is less than its cpu busy percentage threshold value, service with different priority levels is all greater than two service with different priority levels speed control ratios of zero-sum in scope is set;
Qualifications in step 4-4, combination overload control procedure is set up the relation between efficiency and service with different priority levels speed control;
Different priorities overload Service control speed when step 5, employing Hybrid Particle Swarm obtain efficiency maximum;
The speed control optimal solution of different priorities overload business when step 6, employing genetic algorithm for solving efficiency maximum, by the final speed control of selection, intersection, mutation operation acquisition different priorities overload business;
Step 7, according to the final speed control of the different priorities overload business obtaining, counter is set, set the quantity of reception business in next cycle, realize the control of application server overload;
Step 8, judge in this sampling interval whether all business all finish dealing with, and if so, will the sampling interval subtract one, wait for and receive new business, and return to execution step 1; Otherwise continue surplus lines to process.
Described in step 1 according to sampling interval and random coefficient, determine actual samples spacing, be specially: sampling interval and random coefficient are multiplied each other and obtain actual samples spacing, and described random coefficient span is 0~1.
Described in step 1 according to the arrival rate of number of services, different business and processing speed, obtain the utilance of CPU;
Cpu busy percentage r 1formula is as follows:
Figure BDA0000410629040000031
Wherein, w represents number of services, v ethe arrival rate of expression business e,
Figure BDA0000410629040000032
the processing speed of expression to business e;
Described according to the free space of service spatial cache, obtain service spatial cache utilance r 2, formula is as follows:
r 2=(P o-P c)/P o (2)
Wherein, P ofor service buffer queue total length; P cthe free space that represents service spatial cache.
Qualifications in combination overload control procedure described in step 4-4 is set up the relation between efficiency and service with different priority levels speed control, is specially and sets up efficiency Optimized model, and formula is as follows:
S i = arg max E ( S i ) s . t . S i &phi; i &le; u i , i &Element; O ( 1 - &gamma; ) n i n j < S i S j < ( 1 + &gamma; ) n i n j , &gamma; &Element; ( 0,1 ) S i > 0 - - - ( 3 )
Wherein, S ithe speed control that represents the overload business that when efficiency is maximum, priority is i; E(S i) represent the efficiency of the overload business that priority is i, φ ithe processing speed that represents the overload business that application server is i to priority, u ithe threshold value that represents the cpu busy percentage of the business that priority is i, O represents the set of the business of transshipping, S ithe speed control that represents the business that priority is i, S jthe speed control that represents the business that priority is j, n ithe business that expression priority is i accounts for the percentage of overload business sum, n jthe business that expression priority is j accounts for the percentage of overload business sum;
Two service with different priority levels speed control ratios described in step 4-3 are in arranging scope, ( 1 - &gamma; ) n i n j < S i S j < ( 1 + &gamma; ) n i n j , &gamma; &Element; ( 0,1 ) .
Difference overload Service control speed when step 5 adopts Hybrid Particle Swarm to obtain efficiency maximum, specifically comprises the following steps:
Step 5-1, according to Hybrid Particle Swarm, the speed control of different priorities overload business is carried out to initialization, comprise the speed control that M group different priorities overload business is set, the speed control that M group different priorities overload business is set changes size, generates at random initialization speed control matrix S mNand rate variation rate matrix V mN:
S MN = s 11 s 12 . . . s 1 N s 21 s 22 . . . s 2 N . . . . . . . . . . . . s M 1 s M 2 . . . s MN - - - ( 4 )
V MN = v 11 v 12 . . . v 1 N v 21 v 22 . . . v 2 N . . . . . . . . . . . . v M 1 v M 2 . . . v MN - - - ( 5 )
Wherein, s iii the business initializtion speed control that represents the business that priority is i, I=1,2 ..., M, i=1,2 ..., N, v iispeed control corresponding to I business that represents the business that priority is i changes size, and N represents the priority of the business of transshipping;
Step 5-2, according to the speed control of the overload business of M group different priorities, calculate respectively the efficiency value of each business, from calculate the efficiency value obtaining, select the efficiency maximum of every group of business, and above-mentioned efficiency maximum is positioned in the vector of corresponding Service control speed, obtain M group vector, be specially:
By the maximum efficiency value E of Group I different priorities overload business iand speed control is deposited in vectorial p iin, i.e. vectorial p i=[s i1, s i2..., s iN, E i];
According to efficiency value size, from vectorial p iin choose initial optimal vector p g, i.e. efficiency value maximum vector, p g=[s g1, s g2..., s gN, E max], 1≤g≤M, E maxfor M optimum efficiency value E imiddle efficiency value maximum;
Step 5-3, determine initial temperature;
Formula is as follows:
T 0=E max/ln5 (6)
Wherein, T 0represent initial temperature;
Step 5-4, determine each vectorial p under Current Temperatures iadaptation value TF (p i):
TF ( p I ) = e - ( E I - E max ) / T t &Sigma; I = 1 M e - ( E I - E max ) / T t
Wherein, e represents natural logrithm, T ttemperature while representing current iteration, during t=1, T t=T 0;
And according to vectorial p iadaptation value, adopt roulette method to select one group of vector to upgrade initial optimal vector p from M group vector g;
Step 5-5, to vectorial p iwith optimal vector p gupgrade, specific as follows:
More new formula is as follows:
Figure BDA0000410629040000052
Wherein, v ii(t) represent the speed control variation size corresponding to I business of the business that the priority in this iteration is i; v ii(t+1) represent the speed control variation size corresponding to I business of the business that the priority in next iteration is i; p iirepresent vectorial p ithe speed control of middle efficiency maximum; p githe speed control that represents overall efficiency maximum, s ii(t) represent I the speed control that business is corresponding of the business that the priority in this iteration is i; s ii(t+1) represent I the speed control that business is corresponding of the business that the priority in next iteration is i; represent the speed compression factor, ω 1, ω 2for the study factor, be set to 2, r 1, r 2for the random number between [0,1], t represents iterations;
The speed control and the speed control changing value that upgrade the new different priorities overload business obtaining are replaced to matrix S mNand matrix V mNin, and then to vectorial p iupgrade, and from upgrading all groups vector p iin select efficiency value maximum vector, by efficiency value and the vectorial p of the efficiency value maximum vector obtaining after upgrading gefficiency value compare, if the efficiency value of efficiency value maximum vector is greater than vectorial p after upgrading gefficiency value, to vectorial p greplace renewal; Otherwise do not upgrade;
Step 5-6, move back temperature operation, upgrade temperature value;
T t+1=λT t
T t+1temperature while representing next iteration; λ represents to move back warm coefficient, and span is 0~1;
Step 5-7, judge whether to reach iterations threshold value, if so, obtain final optimal vector, obtain middle the speed control of different priorities overload business, otherwise return, perform step 5-4;
Sampling interval described in step 2 adds one, when the sampling interval, is greater than the sampling interval during higher limit, and the sampling interval is set to higher limit; Sampling interval described in step 8 subtracts one, when the sampling interval is less than 1, says that the sampling interval is set to 1.
Advantage of the present invention:
A kind of powerline network application server overload controlling method based on hybrid optimization of the present invention, by setting up the relation function between speed control and efficiency, it is constraints that the overload of take is controlled, consider the overload control and efficiency problem of application server simultaneously, build the optimization Overload Control Model of efficiency.Utilize Hybrid Particle Swarm and genetic algorithm to transship control, particle cluster algorithm search efficiency is high, through less algebraically, evolve and just can converge near minimax solution, and use simulated annealing strategy to do the position of particle, upgrade restriction, make particle jump out local optimum, increase hunting zone, break away from precocious phenomenon, finally with relevance grade function, carry out individuality assessment, carry out on this basis genetic manipulation, obtain accurate optimal solution, utilize the present invention can be effectively application server in powerline network to be transshipped to control.
Accompanying drawing explanation
Fig. 1 is the powerline network application server overload controlling method flow chart based on hybrid optimization of an embodiment of the present invention;
Fig. 2 is the network diagram of an embodiment of the present invention;
Fig. 3 is the arrival rate schematic diagram that measures all kinds of business of an embodiment of the present invention;
Fig. 4 is the cpu busy percentage schematic diagram of all kinds of business of an embodiment of the present invention;
Fig. 5 is the cpu busy percentage schematic diagram of the service with different priority levels of an embodiment of the present invention;
Fig. 6 is the speed control schematic diagram of business after the overload of an embodiment of the present invention is controlled;
Fig. 7 is the cpu busy percentage schematic diagram of different business after the overload of an embodiment of the present invention is controlled;
Fig. 8 is the cpu busy percentage schematic diagram of different priorities after the overload of an embodiment of the present invention is controlled;
Fig. 9 is the efficiency contrast schematic diagram of an embodiment of the present invention;
Figure 10 is the affect schematic diagrames of the different threshold values of an embodiment of the present invention on efficiency.
Embodiment
Below in conjunction with accompanying drawing, an embodiment of the present invention is described further.
A powerline network application server overload controlling method for hybrid optimization, method flow diagram as shown in Figure 1, comprises the following steps:
Step 1, be set the sampling interval, according to sampling interval and random coefficient, determine actual samples spacing, and in this actual samples spacing arrival rate and the processing speed of number of services, different business in sense cycle, obtain the utilance of CPU, and according to the free space of service spatial cache, obtain service spatial cache utilance;
In the embodiment of the present invention, network diagram as shown in Figure 2, structure sampling interval λ=15, produce random number α ∈ (0,1], with step-length (actual samples spacing) α λ, carry out unequal-interval and measure the service rate that arrives application server, measure service buffer queue size, the input parameter whether transshipping as Analysis server; As shown in Figure 3,6 kinds of business arrival rates that collect, under normal circumstances, the service rate that arrives server is more stably, when some service rate value of constantly locating increases suddenly, service rate departs from normal value, can tentatively judge this place's application server overload.
Cpu busy percentage r 1formula is as follows:
Figure BDA0000410629040000071
Wherein, w represents number of services, v ethe arrival rate of expression business e,
Figure BDA0000410629040000072
the processing speed of expression to business e;
Service spatial cache utilance r 2, formula is as follows:
r 2=(P o-P c)/P o (2)
Wherein, P ofor service buffer queue total length; P cthe free space that represents service spatial cache.
Step 2, judge whether application server transships, whether the utilance that judges CPU is greater than the threshold value setting according to demand, whether the spatial cache of judgement service simultaneously utilance is greater than the threshold value setting according to demand, if above-mentioned, both are greater than threshold value simultaneously, application server transships, stop receiving the business in next cycle and perform step 3, otherwise, will add in the sampling interval and return in the lump execution step 1;
In the embodiment of the present invention, in conjunction with cpu busy percentage r 1compare r with the buffer queue free time 2judge whether application server transships, if r 1> η 1and r 2> η 2(η wherein 1and η 2for decision threshold, η 1=0.9, η 2=0.9), traffic overload, otherwise nonoverload.When business nonoverload, if λ is >m, allow λ=m, m is maximum step-length, in the embodiment of the present invention, λ=30, otherwise adjust λ=λ+1, return to step 1; When traffic overload, if λ≤1 allows λ=1, otherwise adjust λ=λ-1, perform step 3.
Step 3, all business are sorted according to the priority of setting, and the cpu busy percentage of each business after acquisition sequence, in all business, select cpu busy percentage and be greater than the business of cpu busy percentage threshold value separately, as controlled different priorities overload business;
In the embodiment of the present invention, all types of service are set up to priority list s={s from low to high 1, s 2, s 3, and setting up corresponding cpu resource occupancy thresholding list u={0.4,0.3,0.2}, sets up and each business CPU utilance list of initialization upgrade if
Figure BDA0000410629040000083
priority s qcorresponding traffic overload, q=1 wherein, 2 ..., 3;
In the embodiment of the present invention, business 1 and business 2 are 2 kinds of the highest business of priority, and the quantitative proportion of the quantity of business 1 and business 2 is 1:2; Business 3 and business 4 are the business of 2 kinds high priorities, and the quantitative proportion of the quantity of business 3 and business 4 is 1:2, and business 5 and business 6 are 2 kinds of business that priority is minimum, and the quantitative proportion of the quantity of business 5 and business 6 is 1:2.Application server is respectively 40,80,50,100,60,120 to the processing speed of business 1,2,3,4,5,6.As shown in Figure 4, as shown in Figure 5, as can be seen from Figure 4 and Figure 5, there is overload second at 51-200 in application server to the utilance of the CPU of the business of different priorities to the cpu busy percentage of all kinds of business.
Step 4, the total energy consumption consuming according to the whole business of application server processes, in conjunction with the restrictive condition of different business speed control, set up efficiency Optimized model, is specially:
Step 4-1, according to the maximum traffic processing speed of server and the shared ratio of server basal energy expenditure, set up the relation between energy consumption f (S) and speed control S;
f ( S ) = 0 S = 0 &delta;c + ( 1 - &delta; ) S 0 < S < c - - - ( 12 )
Wherein, c represents server capacity, and S represents service control speed, and δ is used for describing the shared ratio of basal energy expenditure of server, in embodiment, and c=200, δ=0.2.
Step 4-2, the total energy consumption consuming according to the total speed control of overload business and the whole business of application server processes, set up the relation between efficiency and service with different priority levels speed control;
E ( S ) = S f ( S ) - - - ( 13 )
From (12)~(13),
Figure BDA0000410629040000086
o represents the set of the business of transshipping, and C represents total arrival rate of the business of transshipping.
Step 4-3, be set in the qualifications of overload in control procedure, the speed control that the cpu busy percentage that comprises service with different priority levels is less than its cpu busy percentage threshold value, service with different priority levels is all greater than two service with different priority levels speed control ratios of zero-sum in scope is set;
S i &phi; i &le; u i , i &Element; O ( 1 - &gamma; ) n i n j < S i S j < ( 1 + &gamma; ) n i n j , &gamma; &Element; ( 0,1 ) S i > 0 - - - ( 14 )
Qualifications in step 4-4, combination overload control procedure and the relation between efficiency and service with different priority levels speed control, set up efficiency Optimized model;
Formula is as follows:
S i = arg max E ( S i ) s . t . S i &phi; i &le; u i , i &Element; O ( 1 - &gamma; ) n i n j < S i S j < ( 1 + &gamma; ) n i n j , &gamma; &Element; ( 0,1 ) S i > 0 - - - ( 3 )
Different priorities overload Service control speed when step 5, employing Hybrid Particle Swarm obtain efficiency maximum;
Specifically comprise the following steps:
Step 5-1, according to Hybrid Particle Swarm, the speed control of different priorities overload business is carried out to initialization, comprise M(M=50 be set) speed control of group different priorities overload business, the speed control that M group different priorities overload business is set changes size, generates at random initialization speed control matrix S mNand rate variation rate matrix V mN:
S MN = s 11 s 12 . . . s 1 N s 21 s 22 . . . s 2 N . . . . . . . . . . . . s M 1 s M 2 . . . s MN - - - ( 4 )
V MN = v 11 v 12 . . . v 1 N v 21 v 22 . . . v 2 N . . . . . . . . . . . . v M 1 v M 2 . . . v MN - - - ( 5 )
Wherein, s iii the business initializtion speed control that represents the business that priority is i, I=1,2 ..., M, i=1,2 ..., N, v iispeed control corresponding to I business that represents the business that priority is i changes size, and N represents the priority of the business of transshipping, N=6;
Step 5-2, according to the speed control of the overload business of M group different priorities, calculate respectively the efficiency value of each business, from calculate the efficiency value obtaining, select the efficiency maximum of every group of business, and above-mentioned efficiency maximum is positioned in the vector of corresponding Service control speed, obtain M group vector, be specially:
By the maximum efficiency value E of Group I different priorities overload business iand speed control is deposited in vectorial p iin, i.e. vectorial p i=[s i1, s i2..., s iN, E i];
According to efficiency value size, from vectorial p iin choose initial optimal vector p g, i.e. efficiency value maximum vector, p g=[s g1, s g2..., s gN, E max], 1≤g≤M, E maxfor M optimum efficiency value E imiddle efficiency value maximum;
Step 5-3, determine initial temperature;
Formula is as follows:
T 0=E max/ln5 (6)
Wherein, T 0represent initial temperature; For the first time in iteration, T 0=100
Step 5-4, determine each vectorial p under Current Temperatures iadaptation value TF (p i):
TF ( p I ) = e - ( E I - E max ) / T t &Sigma; I = 1 M e - ( E I - E max ) / T t
Wherein, e represents natural logrithm, T ttemperature while representing current iteration, during t=1, T t=T 0;
And according to vectorial p iadaptation value, adopt roulette method to select one group of vector to upgrade initial optimal vector p from M group vector g;
Step 5-5, to vectorial p iwith optimal vector p gupgrade, specific as follows:
More new formula is as follows:
Figure BDA0000410629040000102
Wherein, v ii(t) represent the speed control variation size corresponding to I business of the business that the priority in this iteration is i; v ii(t+1) represent the speed control variation size corresponding to I business of the business that the priority in next iteration is i; p iirepresent vectorial p ithe speed control of middle efficiency maximum; p githe speed control that represents overall efficiency maximum, s ii(t) represent I the speed control that business is corresponding of the business that the priority in this iteration is i; s ii(t+1) represent I the speed control that business is corresponding of the business that the priority in next iteration is i;
Figure BDA0000410629040000103
represent the speed compression factor, ω 1, ω 2for the study factor, be set to 2, r 1, r 2for the random number between [0,1], t represents iterations;
The speed control and the speed control changing value that upgrade the new different priorities overload business obtaining are replaced to matrix S mNand matrix V mNin, and then to vectorial p iupgrade, and from upgrading all groups vector p iin select efficiency value maximum vector, by efficiency value and the vectorial p of the efficiency value maximum vector obtaining after upgrading gefficiency value compare, if the efficiency value of efficiency value maximum vector is greater than vectorial p after upgrading gefficiency value, to vectorial p greplace renewal; Otherwise do not upgrade;
Step 5-6, move back temperature operation, upgrade temperature value;
T t+1=λT t
T t+1temperature while representing next iteration; λ represents to move back warm coefficient, and span is λ=0.99 in 0~1, embodiment;
Step 5-7, judge whether to reach iterations threshold value 500, if so, obtain final optimal vector, obtain middle the speed control of different priorities overload business, otherwise return, perform step 5-4;
The speed control optimal solution of different priorities overload business when step 6, employing genetic algorithm for solving efficiency maximum, the final speed control of acquisition different priorities overload business;
When efficiency is maximum, the speed control of different priorities overload business, as the initial population of genetic algorithm, obtains the exact solution of model by selection, intersection, the mutation operation of genetic algorithm the final speed control that represents i business.
Step 7, according to the final speed control of the different priorities overload business obtaining, counter is set, set the quantity of reception business in next cycle, realize the control of application server overload;
Counter is arranged, with this, transship control;
Within each sampling interval, according to class of service, upgrade different business priority, upgrade each business stand-by period in buffer queue simultaneously.Service request of every arrival is just taken out a token and is presented to this business from token bucket, and counter values subtracts one; CPU handles a service request and its token is turned back in token bucket, and counter values adds one.When in token bucket, token number is 0, be that counter values is 0, if existed in existing buffer memory than the new low business of service priority that arrives, by buffer memory medium priority minimum and the shortest business of stand-by period from buffer queue, delete, and give new arrival business by its token, newly arrival business is put into buffer queue simultaneously.Otherwise, abandon this business.
Step 8, judge in this sampling interval whether all business all finish dealing with, and if so, will the sampling interval subtract one, wait for and receive new business, and return to execution step 1; Otherwise continue surplus lines to process.
As shown in Figure 6, application server transships at 51~200s, and the present invention has successfully been controlled at the arrival rate of business in a rational scope, and speed control maintenance is stable, meets certain validity and fairness simultaneously.
Fig. 7 and Fig. 8 are the cpu busy percentage of 3 kinds of priority services under the present invention controls and the cpu busy percentage of 6 kinds of business, as seen from the figure, the embodiment of the present invention is limited in the cpu busy percentage of business near threshold value, the cpu busy percentage of service with different priority levels remains near threshold value, total cpu utilization remains on 0.9 left and right, and the cpu busy percentage of high and low priority meets respectively default requirement, the cpu busy percentage separately of 6 kinds of business remains in rational scope.
Fig. 9 is efficiency of the present invention and the comparison of the efficiency of controlling without overload, can find, efficiency of the present invention is more superior, has successfully reduced the demand of application server to resource, make application server more energy-conservation, further show robustness of the present invention and superiority.
When Figure 10 is cpu busy percentage thresholding difference, the relation of network energy efficiency and iterations, can find out that network energy efficiency is more superior along with the increase of CPU threshold value.

Claims (6)

1. the powerline network application server overload controlling method based on hybrid optimization, is characterized in that, comprises the following steps:
Step 1, be set the sampling interval, according to sampling interval and random coefficient, determine actual samples spacing, and in this actual samples spacing arrival rate and the processing speed of number of services, different business in sense cycle, obtain the utilance of CPU, and according to the free space of service spatial cache, obtain service spatial cache utilance;
Step 2, judge whether application server transships, whether the utilance that judges CPU is greater than the threshold value setting according to demand, whether the spatial cache of judgement service simultaneously utilance is greater than the threshold value setting according to demand, if above-mentioned, both are greater than threshold value simultaneously, application server transships, stop receiving the business in next cycle and perform step 3, otherwise, will add in the sampling interval and return in the lump execution step 1;
Step 3, all business are sorted according to the priority of setting, and the cpu busy percentage of each business after acquisition sequence, in all business, select cpu busy percentage and be greater than the business of cpu busy percentage threshold value separately, as controlled different priorities overload business;
Step 4, the total energy consumption consuming according to the whole business of application server processes, in conjunction with the restrictive condition of different business speed control, set up efficiency Optimized model, is specially:
Step 4-1, according to the maximum traffic processing speed of server and the shared ratio of server basal energy expenditure, set up the relation between energy consumption and speed control;
Step 4-2, the total energy consumption consuming according to the total speed control of overload business and the whole business of application server processes, set up the relation between efficiency and service with different priority levels speed control;
Step 4-3, be set in the qualifications of overload in control procedure, the speed control that the cpu busy percentage that comprises service with different priority levels is less than its cpu busy percentage threshold value, service with different priority levels is all greater than two service with different priority levels speed control ratios of zero-sum in scope is set;
Qualifications in step 4-4, combination overload control procedure is set up the relation between efficiency and service with different priority levels speed control;
Different priorities overload Service control speed when step 5, employing Hybrid Particle Swarm obtain efficiency maximum;
The speed control optimal solution of different priorities overload business when step 6, employing genetic algorithm for solving efficiency maximum, by the final speed control of selection, intersection, mutation operation acquisition different priorities overload business;
Step 7, according to the final speed control of the different priorities overload business obtaining, counter is set, set the quantity of reception business in next cycle, realize the control of application server overload;
Step 8, judge in this sampling interval whether all business all finish dealing with, and if so, will the sampling interval subtract one, wait for and receive new business, and return to execution step 1; Otherwise continue surplus lines to process.
2. the overload controlling method of the powerline network application server based on hybrid optimization according to claim 1, it is characterized in that, described in step 1 according to sampling interval and random coefficient, determine actual samples spacing, be specially: sampling interval and random coefficient are multiplied each other and obtain actual samples spacing, and described random coefficient span is 0~1.
3. the overload controlling method of the powerline network application server based on hybrid optimization according to claim 1, is characterized in that, described in step 1 according to the arrival rate of number of services, different business and processing speed, obtain the utilance of CPU;
Cpu busy percentage r 1formula is as follows:
Figure FDA0000410629030000021
Wherein, w represents number of services, v ethe arrival rate of expression business e,
Figure FDA0000410629030000022
the processing speed of expression to business e;
Described according to the free space of service spatial cache, obtain service spatial cache utilance r 2, formula is as follows:
r 2=(P o-P c)/P o (2)
Wherein, P ofor service buffer queue total length; P cthe free space that represents service spatial cache.
4. the overload controlling method of the powerline network application server based on hybrid optimization according to claim 1, it is characterized in that, qualifications in combination overload control procedure described in step 4-4 is set up the relation between efficiency and service with different priority levels speed control, be specially and set up efficiency Optimized model, formula is as follows:
S i = arg max E ( S i ) s . t . S i &phi; i &le; u i , i &Element; O ( 1 - &gamma; ) n i n j < S i S j < ( 1 + &gamma; ) n i n j , &gamma; &Element; ( 0,1 ) S i > 0 - - - ( 3 )
Wherein, S ithe speed control that represents the overload business that when efficiency is maximum, priority is i; E(S i) represent the efficiency of the overload business that priority is i, φ ithe processing speed that represents the overload business that application server is i to priority, u ithe threshold value that represents the cpu busy percentage of the business that priority is i, O represents the set of the business of transshipping, S jthe speed control that represents the business that priority is j, n ithe business that expression priority is i accounts for the percentage of overload business sum, n jthe business that expression priority is j accounts for the percentage of overload business sum;
Two service with different priority levels speed control ratios described in step 4-3 are in arranging scope, ( 1 - &gamma; ) n i n j < S i S j < ( 1 + &gamma; ) n i n j , &gamma; &Element; ( 0,1 ) .
5. the overload controlling method of the powerline network application server based on hybrid optimization according to claim 1, it is characterized in that, difference overload Service control speed when step 5 adopts Hybrid Particle Swarm to obtain efficiency maximum, specifically comprises the following steps:
Step 5-1, according to Hybrid Particle Swarm, the speed control of different priorities overload business is carried out to initialization, comprise the speed control that M group different priorities overload business is set, the speed control that M group different priorities overload business is set changes size, generates at random initialization speed control matrix S mNand rate variation rate matrix V mN:
S MN = s 11 s 12 . . . s 1 N s 21 s 22 . . . s 2 N . . . . . . . . . . . . s M 1 s M 2 . . . s MN - - - ( 4 )
V MN = v 11 v 12 . . . v 1 N v 21 v 22 . . . v 2 N . . . . . . . . . . . . v M 1 v M 2 . . . v MN - - - ( 5 )
Wherein, s iii the business initializtion speed control that represents the business that priority is i, I=1,2 ..., M, i=1,2 ..., N, v iispeed control corresponding to I business that represents the business that priority is i changes size, and N represents the priority of the business of transshipping;
Step 5-2, according to the speed control of the overload business of M group different priorities, calculate respectively the efficiency value of each business, from calculate the efficiency value obtaining, select the efficiency maximum of every group of business, and above-mentioned efficiency maximum is positioned in the vector of corresponding Service control speed, obtain M group vector, be specially:
By the maximum efficiency value E of Group I different priorities overload business iand speed control is deposited in vectorial p iin, i.e. vectorial p i=[s i1, s i2..., s iN, E i];
According to efficiency value size, from vectorial p iin choose initial optimal vector p g, i.e. efficiency value maximum vector, p g=[s g1, s g2..., s gN, E max], 1≤g≤M, E maxfor M optimum efficiency value E imiddle efficiency value maximum;
Step 5-3, determine initial temperature;
Formula is as follows:
T 0=E max/ln5 (6)
Wherein, T 0represent initial temperature;
Step 5-4, determine each vectorial p under Current Temperatures iadaptation value TF (p i):
TF ( p I ) = e - ( E I - E max ) / T t &Sigma; I = 1 M e - ( E I - E max ) / T t
Wherein, e represents natural logrithm, T ttemperature while representing current iteration, during t=1, T t=T 0;
And according to vectorial p iadaptation value, adopt roulette method to select one group of vector to upgrade initial optimal vector p from M group vector g;
Step 5-5, to vectorial p iwith optimal vector p gupgrade, specific as follows:
More new formula is as follows:
Figure FDA0000410629030000042
Wherein, v ii(t) represent the speed control variation size corresponding to I business of the business that the priority in this iteration is i; v ii(t+1) represent the speed control variation size corresponding to I business of the business that the priority in next iteration is i; p iirepresent vectorial p ithe speed control of middle efficiency maximum; p githe speed control that represents overall efficiency maximum, s ii(t) represent I the speed control that business is corresponding of the business that the priority in this iteration is i; s ii(t+1) represent I the speed control that business is corresponding of the business that the priority in next iteration is i;
Figure FDA0000410629030000043
represent the speed compression factor, ω 1, ω 2for the study factor, be set to 2, r 1, r 2for the random number between [0,1], t represents iterations;
The speed control and the speed control changing value that upgrade the new different priorities overload business obtaining are replaced to matrix S mNand matrix V mNin, and then to vectorial p iupgrade, and from upgrading all groups vector p iin select efficiency value maximum vector, by efficiency value and the vectorial p of the efficiency value maximum vector obtaining after upgrading gefficiency value compare, if the efficiency value of efficiency value maximum vector is greater than vectorial p after upgrading gefficiency value, to vectorial p greplace renewal; Otherwise do not upgrade;
Step 5-6, move back temperature operation, upgrade temperature value;
T t+1=λT t
T t+1temperature while representing next iteration; λ represents to move back warm coefficient, and span is 0~1;
Step 5-7, judge whether to reach iterations threshold value, if so, obtain final optimal vector, obtain middle the speed control of different priorities overload business, otherwise return, perform step 5-4.
6. the powerline network application server overload controlling method based on hybrid optimization according to claim 1, it is characterized in that, sampling interval described in step 2 adds one, when the sampling interval, is greater than the sampling interval during higher limit, and the sampling interval is set to higher limit; Sampling interval described in step 8 subtracts one, when the sampling interval is less than 1, says that the sampling interval is set to 1.
CN201310552728.0A 2013-11-08 2013-11-08 A kind of powerline network application server overload controlling method based on hybrid optimization Active CN103580922B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310552728.0A CN103580922B (en) 2013-11-08 2013-11-08 A kind of powerline network application server overload controlling method based on hybrid optimization

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310552728.0A CN103580922B (en) 2013-11-08 2013-11-08 A kind of powerline network application server overload controlling method based on hybrid optimization

Publications (2)

Publication Number Publication Date
CN103580922A true CN103580922A (en) 2014-02-12
CN103580922B CN103580922B (en) 2016-08-17

Family

ID=50051903

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310552728.0A Active CN103580922B (en) 2013-11-08 2013-11-08 A kind of powerline network application server overload controlling method based on hybrid optimization

Country Status (1)

Country Link
CN (1) CN103580922B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104022964A (en) * 2014-06-25 2014-09-03 辽宁邮电规划设计院有限公司 Method for controlling data packet sending rate of energy efficiency router of internet
CN105471614A (en) * 2014-09-11 2016-04-06 腾讯科技(深圳)有限公司 Overload protection method and device and server
CN105933247A (en) * 2016-04-20 2016-09-07 中国联合网络通信集团有限公司 Decomposition method and system of service network
WO2018036168A1 (en) * 2016-08-22 2018-03-01 平安科技(深圳)有限公司 Method and device for executing data processing task, execution server, and storage medium
CN112350880A (en) * 2019-08-07 2021-02-09 深信服科技股份有限公司 Overload detection method, system, computer readable storage medium and electronic device

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101232182A (en) * 2008-01-18 2008-07-30 清华大学 Three-dimensional coordinated electric network energy managing system and method for controlling and evaluating electric network
CN101715003A (en) * 2009-11-12 2010-05-26 北京交通大学 Load control optimization method of interoperable platform
CN101909078A (en) * 2010-07-19 2010-12-08 东南大学 New service set construction-based dynamic service selection method
US20110231320A1 (en) * 2009-12-22 2011-09-22 Irving Gary W Energy management systems and methods
CN103377084A (en) * 2012-04-11 2013-10-30 李涛 Renewable energy based green data center load scheduling method and device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101232182A (en) * 2008-01-18 2008-07-30 清华大学 Three-dimensional coordinated electric network energy managing system and method for controlling and evaluating electric network
CN101715003A (en) * 2009-11-12 2010-05-26 北京交通大学 Load control optimization method of interoperable platform
US20110231320A1 (en) * 2009-12-22 2011-09-22 Irving Gary W Energy management systems and methods
CN101909078A (en) * 2010-07-19 2010-12-08 东南大学 New service set construction-based dynamic service selection method
CN103377084A (en) * 2012-04-11 2013-10-30 李涛 Renewable energy based green data center load scheduling method and device

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
卢志刚,杨国良等: "改进二进制粒子群优化算法在配电网络重构中的应用", 《电力系统保护与控制》 *
杨建军,站红: "基于图论的改进遗传算法在配网重构中的应用", 《电力系统保护与控制》 *
程临燕,郝治国,张保会等: "基于内点法消除输电断面过载的实时控制算法", 《电力系统自动化》 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104022964A (en) * 2014-06-25 2014-09-03 辽宁邮电规划设计院有限公司 Method for controlling data packet sending rate of energy efficiency router of internet
CN104022964B (en) * 2014-06-25 2017-03-29 辽宁邮电规划设计院有限公司 A kind of efficiency router data packet sending speed control method of internet
CN105471614A (en) * 2014-09-11 2016-04-06 腾讯科技(深圳)有限公司 Overload protection method and device and server
CN105933247A (en) * 2016-04-20 2016-09-07 中国联合网络通信集团有限公司 Decomposition method and system of service network
CN105933247B (en) * 2016-04-20 2019-01-08 中国联合网络通信集团有限公司 The decomposition method and system of business network
WO2018036168A1 (en) * 2016-08-22 2018-03-01 平安科技(深圳)有限公司 Method and device for executing data processing task, execution server, and storage medium
CN112350880A (en) * 2019-08-07 2021-02-09 深信服科技股份有限公司 Overload detection method, system, computer readable storage medium and electronic device
CN112350880B (en) * 2019-08-07 2022-04-29 深信服科技股份有限公司 Overload detection method, system, computer readable storage medium and electronic device

Also Published As

Publication number Publication date
CN103580922B (en) 2016-08-17

Similar Documents

Publication Publication Date Title
CN103580922A (en) Overload control method for electric power communication network application server based on hybrid optimization
CN110351754B (en) Industrial Internet machine equipment user data calculation unloading decision method based on Q-learning
CN113610303B (en) Load prediction method and system
CN109167671A (en) A kind of adapted communication system equally loaded dispatching algorithm towards quantum key distribution business
CN112118312B (en) Network burst load evacuation method facing edge server
CN105550033A (en) Genetic-tabu hybrid algorithm based resource scheduling policy method in private cloud environment
CN104317646B (en) Based on cloud data center dispatching method of virtual machine under OpenFlow frameworks
CN110429649A (en) Consider the high permeability renewable energy assemblage classification method of flexibility
CN108711007A (en) A kind of multitask real-time scheduling method of energy integration collection system
CN104219319A (en) Method for distributed network flow self-organizing scheduling
CN109639498A (en) A kind of resource flexibility configuration method of the service-oriented quality based on SDN and NFV
CN108737268A (en) Software definition industry Internet of Things resource regulating method
Xing et al. Task classification unloading algorithm for mobile edge computing in smart grid
CN108712305A (en) A kind of Coflow dispatching methods based on subflow flow value method of estimation
Zhu et al. Dynamic task offloading in power grid internet of things: A fast-convergent federated learning approach
CN105205536A (en) 1553B bus message transmission optimization method based on hybrid genetic algorithm
CN107609690B (en) Method for optimizing load active management decision
CN107911763B (en) Intelligent power distribution and utilization communication network EPON network planning method based on QoS
CN103581048B (en) A kind of distributed resource overload controlling method of powerline network
CN110969283A (en) Cascade hydropower station optimal scheduling method and system based on real-time water abandoning risk assessment
CN110611305A (en) Photovoltaic access planning method considering out-of-limit risk of distribution network voltage
CN104852860A (en) Queue-based multi-target scheduling strategy for heterogeneous resources
CN113627807A (en) Network source load interaction risk control method
Cao et al. Uncertainty-aware resource provisioning for workflow scheduling in edge computing environment
Gao et al. Deep reinforcement learning based node pairing scheme in edge-chain for IoT applications

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CI01 Publication of corrected invention patent application

Correction item: Applicant

Correct: Liaoning Planning and Designing Institute of Posts and Telecommunication Co., Ltd.

False: LIAONING PLANNING AND DESIGNING INSTITUTE OF POST AND TELECOMMUNICATION CO., LTD.

Number: 07

Volume: 30

CI02 Correction of invention patent application

Correction item: Applicant

Correct: Liaoning Planning and Designing Institute of Posts and Telecommunication Co., Ltd.

False: LIAONING PLANNING AND DESIGNING INSTITUTE OF POST AND TELECOMMUNICATION CO., LTD.

Number: 07

Page: The title page

Volume: 30

ERR Gazette correction

Free format text: CORRECT: APPLICANT; FROM: LIAONING PROVINCE PLANNING AND DESIGNING INSTITUTE OF POSTS AND TELECOMMUNICATION CO., LTD. TO: LIAONING PLANNING AND DESIGNING INSTITUTE OF POSTS AND TELECOMMUNICATION CO., LTD.

RECT Rectification
ASS Succession or assignment of patent right

Owner name: STATE GRID LIAONING ELECTRIC POWER CO., LTD. STATE

Free format text: FORMER OWNER: STATE GRID LIAONING ELECTRIC POWER CO., LTD. BENXI POWER SUPPLY COMPANY LIAONING PLANNING AND DESIGNING INSTITUTE OF POSTS AND TELECOMMUNICATION CO., LTD. LIAONING MEDICAL DEVICE TESTING

Effective date: 20141121

C41 Transfer of patent application or patent right or utility model
TA01 Transfer of patent application right

Effective date of registration: 20141121

Address after: 100761 West Chang'an Avenue, Beijing, No. 86, No.

Applicant after: State Grid Corporation of China

Applicant after: State Grid Liaoning Electric Power Co., Ltd.

Applicant after: Benxi Power Supply Company of State Grid Liaoning Electric Power Co., Ltd.

Applicant after: Liaoning Planning and Designing Institute of Posts and Telecommunication Co., Ltd.

Applicant after: LIAONING MEDICAL DEVICE TESTING

Address before: 100761 West Chang'an Avenue, Beijing, No. 86, No.

Applicant before: State Grid Corporation of China

Applicant before: Benxi Power Supply Company of State Grid Liaoning Electric Power Co., Ltd.

Applicant before: Liaoning Planning and Designing Institute of Posts and Telecommunication Co., Ltd.

Applicant before: LIAONING MEDICAL DEVICE TESTING

C14 Grant of patent or utility model
GR01 Patent grant