CN102904811B - Towards route selection method and the system of power business - Google Patents

Abstract

The invention discloses the route selection method towards power business and system.The method comprises: for power system service does corresponding mark, joins the classification control field of network control message; Read described classification control field, from the weighted list that local routing is preset, obtain the weighted value corresponding with described classification control field; Described weighted value is substituted into the fitness function preset, calculate according to multiple constrained routing selection algorithm, obtain final Route Selection.Adopt the present invention, shortest path and the constraints for power business feature can be considered, seek out the optimal path meeting power business characteristic, serve the effect of Optimizing Network Resources, balance network load.

Description

Towards route selection method and the system of power business

Technical field

The present invention relates to field of power communication, particularly relate to the route selection method towards power business and system.

Background technology

The in-depth of power market reform and the raising of electric power trade information degree make the kind of power business and quantity increase sharply, and the demand of power communication to bandwidth is increasing, to reliability and delay requirement more and more higher.When the computer of two indirect connection needs to communicate through network, usually need router.Router provides a kind of method to open up one by the path of netted connection.Because Internet resources are limited, traditional routing method can not meet the communicating requirement of power business, in order to better optimized network performance, needs to consider the route selection method towards power business.

The effective transmission of Route Selection to packet has very important meaning, so, there is a large amount of routing protocols in the agreement of network layer, such as RIP, OSPF, BGP etc.; Meanwhile, in network technology research, route selection algorithm is a focus and emphasis of research always.Famous, as dijkstra's algorithm and Ford & FulKerson algorithm, calculate the shortest path leading to each node, and result of calculation is recorded as routing table, as the foundation of Path selection.The core of route selection algorithm finds an optimal path between source node and destination node, makes the shortest time required for transfer of data, spend minimum.But all only based on shortest path first, still to there is deviation between " the shortest " path and " optimum " path in existing route selection algorithm.

For power business, traditional routing method only considers this constraints of shortest path.Based on shortest path Routing Protocol for power business select transmission path time, do not consider the dynamic characteristic of concrete business demand and network, thus shortest path is not often optimal path.

Summary of the invention

Based on this, be necessary for the problems referred to above, a kind of route selection method towards power business and system are provided, the communication needs of power business can be met, obtain more excellent communication path.

Towards a route selection method for power business, comprising:

For power system service makes corresponding mark, join the classification control field of network control message;

Read described classification control field, from the weighted list that local routing is preset, obtain the weighted value corresponding with described classification control field;

Described weighted value is substituted into the fitness function preset, calculate according to multiple constrained routing selection algorithm, obtain final Route Selection;

Wherein, described default fitness function is w _inrepresent weighted value, x is path, F _inx () represents the singal reporting code function of the i-th class power business, Index is the number of singal reporting code.

Correspondingly, a kind of path selection system towards power business, comprising:

Control field identify unit, for doing corresponding mark for power system service, joins the classification control field of network control message;

Weighted value reading unit, for reading described classification control field, obtains the weighted value corresponding with described classification control field from the weighted list that local routing is preset;

Wherein, described default applicable function is w _inrepresent weighted value, x is path, F _inx () represents the singal reporting code function of the i-th class power business, Index is the number of singal reporting code;

Unit is calculated in the operation be connected with described weighted value reading unit, for described weighted value being substituted into the fitness function preset, calculating, obtain final Route Selection according to multiple constrained routing selection algorithm.

Implement the present invention, there is following beneficial effect:

One aspect of the present invention considers the impact of the singal reporting code in the middle of conventional art on routing link, constructs fitness function on the other hand, considers the miscellaneous service of electric power system according to its weighted value.Consider shortest path and the constraints for power business feature, seek out the optimal path meeting power business characteristic like this.Each route start node calls corresponding fitness function according to current network state and power business classification, utilizes multiple constraint routing algorithm to carry out Route Selection, serves the effect of Optimizing Network Resources, balance network load.

Accompanying drawing explanation

Fig. 1 is the flow chart of the present invention towards the route selection method of power business;

Fig. 2 is the format structure schematic diagram of expansion TLV in Link State Advertisement (LSA);

Fig. 3 is the flow chart of the present invention towards the quantum genetic algorithm of the route selection method of power business;

Fig. 4 is the embodiment flow chart of the present invention towards the route selection method of power business.

Embodiment

For making the object, technical solutions and advantages of the present invention clearly, below in conjunction with accompanying drawing, the present invention is described in further detail.

Fig. 1 is the flow chart of the present invention towards the route selection method of power business, comprising:

S101: for power system service does corresponding mark, joins the classification control field of network control message;

S102: read described classification control field, obtains the weighted value corresponding with described classification control field from the weighted list that local routing is preset;

S103: described weighted value is substituted into the fitness function preset, calculate according to multiple constrained routing selection algorithm, obtain final Route Selection;

Wherein, described default fitness function is w _inrepresent weighted value, x is path, F _inx () represents the singal reporting code function of the i-th class power business, Index is the number of singal reporting code.

First, according to the different requirements to singal reporting code, electric power system existing business is divided into five kinds;

Five kinds are specially: highly reliable broadband real time business, comprise Marketing of Power Market, conservative management information, electric energy quality monitoring system and lighting location monitoring system; Highly reliable arrowband real time business, comprises relaying protection and stable system; Reliable broadband real time business, comprises video conference; Reliable arrowband real time business, comprises dispatching automation and electric energy metrical; Low reliable arrowband non-real-time service, comprises office automation, management information business and scheduling management information system.The present invention is that power system service does corresponding mark, and described power system service can comprise a class in the middle of above-mentioned five kinds or multiclass, but the weight sum of all kinds of business should normalizing, i.e. w _i1+ w _i2+ ... + w _iN=1.

Preferably, described singal reporting code comprises time delay, bandwidth sum reliability three kinds; Described power system service comprises highly reliable broadband real time business, highly reliable arrowband real time business, reliable broadband real time business, reliable arrowband real time business and low reliable arrowband non-real-time service five class; The fitness function of the i-th class power business is, F _i(x)=w _i1f _iD(x)+w _i2f _iB(x)+w _i3f _iL(x), wherein,

F _iDx () is the time delay function of the i-th class power business, its computing formula is,

$F_{iD}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Delay}}_{max}-Delay\left(x\right)}{{\mathrm{Delay}}_{max}}& Delay\left(x\right)<{\mathrm{Delay}}_{max}\\ 0& Delay\left(x\right)\&GreaterEqual;{\mathrm{Delay}}_{\max }\end{array}\right.,$ Delay _maxit is the tolerable time delay maximum of the i-th class power business; for the propagation delay time of path x, wherein e represents the link on the x of path, and j represents the node on the x of path;

F _iBx () is the bandwidth function of the i-th class power business, its computing formula is,

$F_{iB}\left(x\right)=\frac{Bandwidth\left(x\right)-{\mathrm{Bandwidth}}_{\min }}{{\mathrm{Bandwidth}}_{max}-{\mathrm{Bandwidth}}_{\min }},$ Bandwidth (x) is the available bandwidth of path x;

Bandwidth _maxfor the available bandwidth maximum in P (t); Bandwidth _minfor the available bandwidth minimum value in P (t);

F _iLx () is the reliability function of the i-th class power business, its computing formula is,

$F_{iL}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Loss}}_{max}-Loss\left(x\right)}{{\mathrm{Loss}}_{\max }}& Loss\left(x\right)<{\mathrm{Loss}}_{max}\\ 0& Loss\left(x\right)\&GreaterEqual;{\mathrm{Loss}}_{max}\end{array}\right.,$ The packet loss value that Loss (x) is path x; Loss _maxit is the tolerable packet loss maximum of the i-th class power business.

Fig. 2 is the format structure schematic diagram of expansion TLV in Link State Advertisement (LSA).Power business classification control field is added in network control message; As shown in Figure 2, in generalized multiprotocol label switching (GMPLS) protocol (GMPLS), add the control field with power business type, be specially the service identification that to increase electric power in the TLV field of opaque Link State Advertisement (OpaqueLSA).Fig. 2 is the network control message form schematic configuration diagram that the present invention can preferably use.Wherein, Type represents the field type of this part messages; Length represents the length of Value field; Value is the variable length data byte of this part messages.In the present invention, add power business classification field in the TLV in LSA, be specially: according to RFC2370, Type is taken as 2, represent link TLV information; Length value is 3, and the length representing Value field is 3 bits; Value value is 0 ~ 4, represents 5 kinds of power business.

Route start node reads power business classification control field, according to the local weighted value list of reading result index, obtains weighted value needed for fitness function.

Wherein, weighted value depends on the different requirements of every class power business to time delay, bandwidth sum reliability, and concrete numerical value is calculated by analytic hierarchy process (AHP).

Analytic hierarchy process (AHP) calculates the concrete steps of weighted value:

A) according to every class power business to time delay, bandwidth, the different requirement of reliability, provide initial weight;

B) by the evaluation of expert to evaluation index, compare between two, form judgment matrix A.Wherein, h _drepresent the importance of time delay, h _brepresent the importance of bandwidth, h _lrepresent the importance of packet loss;

$A=\left[\begin{array}{ccc}{a}_{11}& a_{12}& a_{13}\\ a_{21}& a_{22}& a_{23}\\ a_{31}& a_{32}& a_{33}\end{array}\right]=\left[\begin{array}{ccc}{h}_D/h_D& h_D/h_B& h_D/h_L\\ h_B/h_D& h_B/h_B& h_B/h_L\\ h_L/h_D& h_L/h_B& h_L/h_L\end{array}\right]$

C) calculate the geometric mean of each calibration data of every a line in judgment matrix A, be designated as

D) formula is utilized (s=1,2,3) are normalized calculating to each row geometric mean, obtain weighted value.

Set up fitness function and carry out Route Selection according to multiple constrained routing selection algorithm.Along with the development of artificial intelligence subject, solving of multiple constraint routing issue has many algorithms.Wherein, the heuritic approach such as genetic algorithm, quantum genetic algorithm, neural network algorithm, simulated annealing, particle swarm optimization algorithm, ant group algorithm is widely used.

Preferably, the present invention selects quantum genetic algorithm to solve the multiple constraint routing issue towards power business.Quantum genetic algorithm is a kind of new genetic algorithm genetic algorithm being combined with quantum calculation theory and grow up.This algorithm has following characteristics: with quantum bit coded representation chromosome, make item chromosome can represent the superposition of multiple state, reduce population scale, add population diversity; The direction of search and scope is determined with fitness function; Consumption cervical orifice of uterus upgrades and carries out evolutionary search; In whole population, carry out information interchange with quantum variation, make population be easy to discovery advantage individual, and guide population to evolve to defect mode with large probability.In addition, quantum genetic algorithm have also been constructed a kind of new interlace operation and whole interference crossover, avoids population to sink into locally optimal solution, prevents precocity, adopts dynamic rotary door to implement mutation operation to quantum chromosomes simultaneously, accelerates convergence of algorithm speed.

Fig. 3 is the flow chart of the present invention towards the quantum genetic algorithm of the route selection method of power business.The concrete steps of described calculation comprise:

S201: initialization genetic algebra t=0, population Q (t)=Q (0), population scale is N;

S202: one-shot measurement is implemented to all individualities of Q (t) and obtains P (t), containing N number of individuality determined namely $P\left(t\right)=\{p_1^t,p_2^t,\mathrm{...},p_N^t\};$

S203: carry out Fitness analysis to P (t), selects optimum individual as next step desired value of evolving of this population at individual;

S204: verify whether the optimum individual obtained meets the condition of Optimization route, if so, then terminates and exports optimum individual; Otherwise, preserve optimum individual and fitness value thereof, and carry out quantum mutation operation, adopt Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q (t+1) of future generation, go back to step S202.

Fig. 4 is the embodiment flow chart of the present invention towards the route selection method of power business.Below in conjunction with Fig. 4, specific embodiments of the invention are further described in detail.

First, initialization: genetic algebra t=0, population Q (t)=Q (0), population scale is N, and carries out quantum bit coding to population.

The present invention adopts the Variable Length Code mode of two quantum states.Get the path of source node to destination node as chromosome, often pair of quantum bit bit representation nodal information, due to these paths the interstitial content of process may not wait, therefore adopt the chromosome coding of variable length.Adopt the form of two-dimensional array to carry out storing information, the value of first group of storage quantum bit alpha, the value of second group of storage quantum bit β, the next quantum bit of pointed is set simultaneously.

The chromosome be made up of n quantum bit, through quantum bit coded representation is:

$\&lsqb;\left.\begin{array}{c}{\mathrm{\&alpha;}}_1\\ {\mathrm{\&beta;}}_1\end{array}\right|\left.\begin{array}{c}{\mathrm{\&alpha;}}_2\\ {\mathrm{\&beta;}}_2\end{array}\right|\left.\begin{array}{c}{\mathrm{\&alpha;}}_3\\ {\mathrm{\&beta;}}_3\end{array}\right|\left.\begin{array}{c}\mathrm{...}\\ \mathrm{...}\end{array}\right|\left.\begin{array}{c}{\mathrm{\&alpha;}}_r\\ {\mathrm{\&beta;}}_r\end{array}\right|\left.\begin{array}{c}\mathrm{...}\\ \mathrm{...}\end{array}\right|\left.\begin{array}{c}{\mathrm{\&alpha;}}_n\\ {\mathrm{\&beta;}}_n\end{array}\right|\&rsqb;$

Wherein, | α _r| ²+ | β _r| ²=1 (r=1,2 ..., n), | α _r| ²represent that r quantum bit is in " 0 " probability of state, and | β _r| ²represent that r quantum bit is in the probability of one state.This chromosome can express 2 simultaneously ⁿthe information of individual state.

After quantum bit coding, obtain the probability amplitude of whole chromosomal all genes of Q (0) is initialized to

Then, one-shot measurement is implemented to all individualities of Q (t) and obtains P (t), containing N number of individuality determined namely $P\left(t\right)=\{p_1^t,p_2^t,\mathrm{...},p_N^t\}.$

Measuring process of the present invention is, random generation one belongs to the number of [0,1], if it is greater than the corresponding position of P (t) is taken as 1, otherwise is 0.

Next, decoding is carried out to P (t) and obtains concrete path, routing information (comprising propagation delay time, available bandwidth and packet loss) is substituted into fitness function F _i(x)=w _i1f _iD(x)+w _i2f _iB(x)+w _i3f _iLx (), selects optimum individual as next step desired value of evolving of this population at individual according to fitness function value.

The fitness function that the present invention constructs has following features: one, function can meet the different requirements of power business to singal reporting code; Two, functional form meets the feature of quantum calculation; Three, function convergence is more satisfactory, and quantum genetic algorithm can be made to converge to optimal solution in the short period of time.

In the present invention, the fitness function of the i-th class power business is:

F _i(x)＝w _i1F _iD(x)+w _i2F _iB(x)+w _i3F _iL(x)。

Finally, verify whether the optimum individual obtained meets the condition of Optimization route, if, then terminate and export optimum individual, otherwise, preserve optimum individual and fitness value thereof, and carry out quantum mutation operation, adopt Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q (t+1) of future generation.

Wherein, adopt dynamic quantum rotation gate revolving door to be the matrix of 2 × 2, be specifically expressed as $\left[\begin{array}{cc}cos\mathrm{\&theta;}& -sin\mathrm{\&theta;}\\ sin\mathrm{\&theta;}& \cos \mathrm{\&theta;}\end{array}\right].$ Wherein, θ is the anglec of rotation of quantum door, is worth for K and f (x _m, b _m) product.F (x _m, b _m) be the direction of revolving door, value is 1 ,-1 or 0.X _mrepresent the m position of current chromosome, b _mrepresent the m position of current best chromosome.K is the variable with genetic algebra t correlation of indices.Obviously, Quantum rotating gate can also adopt the matrix of 3 × 3 or 2 × 2 matrixes of other form, and the present invention does not get rid of other Mutation Strategy of employing yet and upgrades Q (t).But, employing 2 × 2 $\left[\begin{array}{cc}cos\mathrm{\&theta;}& -sin\mathrm{\&theta;}\\ \sin \mathrm{\&theta;}& \cos \mathrm{\&theta;}\end{array}\right]$ Dynamic quantum rotation gate revolving door matrix upgrades Q (t), has and upgrades the fast advantage of efficiency.

In sum, the beneficial effect of the present embodiment is: electric power system existing business is divided into five kinds, specify that the requirement of business to singal reporting code; Route start node calls corresponding fitness function according to current network state and power business classification, utilizes quantum genetic algorithm to carry out Route Selection, serves the effect of Optimizing Network Resources, balance network load.

Correspondingly, the invention provides a kind of path selection system towards power business, comprising:

Control field identify unit, for doing corresponding mark for power system service, joins the classification control field of network control message;

Weighted value reading unit, for reading described classification control field, obtains the weighted value corresponding with described classification control field from the weighted list that local routing is preset;

Wherein, described default applicable function is w _inrepresent weighted value, x is path, F _inx () represents the singal reporting code function of the i-th class power business, Index is the number of singal reporting code;

Unit is calculated in the operation be connected with described weighted value reading unit, for described weighted value being substituted into the fitness function preset, calculating, obtain final Route Selection according to multiple constrained routing selection algorithm.

Wherein in the middle of an embodiment, comprising:

Be connected to the function that described weighted value reading unit and described operation calculate between unit and set up unit, for setting up default fitness function; Described singal reporting code comprises time delay, bandwidth sum reliability three kinds; Described power system service comprises highly reliable broadband real time business, highly reliable arrowband real time business, reliable broadband real time business, reliable arrowband real time business and low reliable arrowband non-real-time service five class; The fitness function of the i-th class power business is, F _i(x)=w _i1f _iD(x)+w _i2f _iB(x)+w _i3f _iL(x), wherein,

F _iDx () is the time delay function of the i-th class power business, its computing formula is,

$F_{iD}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Delay}}_{max}-Delay\left(x\right)}{{\mathrm{Delay}}_{max}}& Delay\left(x\right)<{\mathrm{Delay}}_{max}\\ 0& Delay\left(x\right)\&GreaterEqual;{\mathrm{Delay}}_{\max }\end{array}\right.,$ Delay _maxit is the tolerable time delay maximum of the i-th class power business; for the propagation delay time of path x, wherein e represents the link on the x of path, and j represents the node on the x of path;

F _iBx () is the bandwidth function of the i-th class power business, its computing formula is,

$F_{\mathrm{iB}}\left(x\right)=\frac{\mathrm{Bandwidth}\left(x\right)-\mathrm{Bandwidt}{h}_{\min }}{{\mathrm{Bandwidth}}_{\max }-{\mathrm{Bandwidth}}_{\min }},$ Bandwidth (x) is the available bandwidth of path x; Bandwidth _maxfor the available bandwidth maximum in P (t); Bandwidth _minfor the available bandwidth minimum value in P (t);

F _iLx () is the reliability function of the i-th class power business, its computing formula is,

$F_{iL}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Loss}}_{max}-Loss\left(x\right)}{{\mathrm{Loss}}_{\max }}& Loss\left(x\right)<{\mathrm{Loss}}_{max}\\ 0& Loss\left(x\right)\&GreaterEqual;{\mathrm{Loss}}_{max}\end{array}\right.,$ The packet loss value that Loss (x) is path x; Loss _maxit is the tolerable packet loss maximum of the i-th class power business.

Preferably, described operation calculation unit, comprising:

Quantum genetic algorithm unit, for calculating according to quantum genetic algorithm, concrete steps comprise,

Arrange genetic algebra t=0, population Q (t)=Q (0), population scale is N;

One-shot measurement is implemented to all individualities of Q (t) and obtains P (t), obtain N number of individuality determined namely $P\left(t\right)=\{p_1^t,p_2^t,\mathrm{...},p_N^t\};$

Fitness analysis is carried out to P (t), selects optimum individual as next step desired value of evolving of this population at individual;

Verify whether the optimum individual obtained meets the condition of Optimization route, if so, then terminates and exports optimum individual; Otherwise, preserve optimum individual and fitness value thereof, and carry out quantum mutation operation, adopt Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q (t+1) of future generation, again one-shot measurement is implemented to all individualities of Q (t+1).

Preferably, described quantum genetic algorithm unit, comprising:

Mutation Strategy unit, for adopting 2 × 2 $\left[\begin{array}{cc}cos\mathrm{\&theta;}& -sin\mathrm{\&theta;}\\ sin\mathrm{\&theta;}& \cos \mathrm{\&theta;}\end{array}\right]$ Dynamic quantum rotation gate revolving door matrix upgrades Q (t), and wherein, θ is the anglec of rotation of quantum door, is worth for K and f (x _m, b _m) product, described f (x _m, b _m) be the direction of revolving door, value is 1 ,-1 or 0; x _mrepresent the m position of current chromosome, b _mrepresent the m position of current best chromosome.K is the variable with genetic algebra t correlation of indices.

The above embodiment only have expressed several execution mode of the present invention, and it describes comparatively concrete and detailed, but therefore can not be interpreted as the restriction to the scope of the claims of the present invention.It should be pointed out that for the person of ordinary skill of the art, without departing from the inventive concept of the premise, can also make some distortion and improvement, these all belong to protection scope of the present invention.Therefore, the protection range of patent of the present invention should be as the criterion with claims.

Claims (6)

1. towards a route selection method for power business, it is characterized in that, comprising:

For power system service does corresponding mark, join the classification control field of network control message;

Read described classification control field, from the weighted list that local routing is preset, obtain the weighted value corresponding with described classification control field;

Described weighted value is substituted into the fitness function preset, calculate according to multiple constrained routing selection algorithm, obtain final Route Selection;

Wherein, described default fitness function is w _inrepresent weighted value, x is path, F _inx () represents the singal reporting code function of the i-th class power business, Index is the number of singal reporting code.

2. the route selection method towards power business according to claim 1, is characterized in that: described singal reporting code comprises time delay, bandwidth sum reliability three kinds;

Described multiple constrained routing selection algorithm is quantum genetic algorithm, and the concrete steps of described calculation comprise:

Initialization genetic algebra t=0, population Q (t)=Q (0), population scale is N;

One-shot measurement is implemented to all individualities of Q (t) and obtains P (t), containing N number of individuality determined namely $P\left(t\right)=\left\{p_1^t,p_2^t,...,p_N^t\right\};$

Fitness analysis is carried out to P (t), selects optimum individual as next step desired value of evolving of this population at individual;

Verify whether the optimum individual obtained meets the condition of Optimization route, if so, then terminates and exports optimum individual; Otherwise, preserve optimum individual and fitness value thereof, and carry out quantum mutation operation, adopt Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q (t+1) of future generation, again one-shot measurement is implemented to all individualities of Q (t+1);

Described power system service comprises highly reliable broadband real time business, highly reliable arrowband real time business, reliable broadband real time business, reliable arrowband real time business and low reliable arrowband non-real-time service five class; The fitness function of the i-th class power business is, F _i(x)=w _i1f _iD(x)+w _i2f _iB(x)+w _i3f _iL(x), wherein,

F _iDx () is the time delay function of the i-th class power business, its computing formula is,

$F_{iD}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Delay}}_{\max }-Delay\left(x\right)}{{\mathrm{Delay}}_{\max }}& Delay\left(x\right)<{\mathrm{Delay}}_{\max }\\ 0& Delay\left(x\right)\&GreaterEqual;{\mathrm{Delay}}_{\max }\end{array}\right.,$ Delay _maxit is the tolerable time delay maximum of the i-th class power business; for the propagation delay time of path x, wherein e represents the link on the x of path, and j represents the node on the x of path;

F _iBx () is the bandwidth function of the i-th class power business, its computing formula is,

$F_{iB}\left(x\right)=\frac{Bandwidth\left(x\right)-{\mathrm{Bandwidth}}_{\min }}{{\mathrm{Bandwidth}}_{\max }-{\mathrm{Bandwidth}}_{\min }},$ Bandwidth (x) is the available bandwidth of path x;

Bandwidth _maxfor the available bandwidth maximum in P (t); Bandwidth _minfor the available bandwidth minimum value in P (t);

F _iLx () is the reliability function of the i-th class power business, its computing formula is,

$F_{iL}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Loss}}_{\max }-Loss\left(x\right)}{{\mathrm{Loss}}_{\max }}& Loss\left(x\right)<{\mathrm{Loss}}_{\max }\\ 0& Loss\left(x\right)\&GreaterEqual;{\mathrm{Loss}}_{\max }\end{array}\right.,$ The packet loss value that Loss (x) is path x;

Loss _maxit is the tolerable packet loss maximum of the i-th class power business.

3. the route selection method towards power business according to claim 2, is characterized in that, described employing Quantum rotating gate Mutation Strategy upgrades the step of Q (t), comprising:

Employing 2 × 2 $\left[\begin{array}{cc}cos\mathrm{\&theta;}& -sin\mathrm{\&theta;}\\ sin\mathrm{\&theta;}& \cos \mathrm{\&theta;}\end{array}\right]$ Dynamic quantum rotation gate revolving door matrix upgrades Q (t), and wherein, θ is the anglec of rotation of quantum door, is worth for K and f (x _m, b _m) product, described f (x _m, b _m) be the direction of revolving door, value is 1 ,-1 or 0; x _mrepresent the m position of current chromosome, b _mrepresent the m position of current best chromosome, K is the variable with genetic algebra t correlation of indices.

4. towards a path selection system for power business, it is characterized in that, comprising:

Control field identify unit, for doing corresponding mark for power system service, joins the classification control field of network control message;

Weighted value reading unit, for reading described classification control field, obtains the weighted value corresponding with described classification control field from the weighted list that local routing is preset;

Wherein, described default fitness function is w _inrepresent weighted value, x is path, F _inx () represents the singal reporting code function of the i-th class power business, Index is the number of singal reporting code;

Unit is calculated in the operation be connected with described weighted value reading unit, for described weighted value being substituted into the fitness function preset, calculating, obtain final Route Selection according to multiple constrained routing selection algorithm.

5. the path selection system towards power business according to claim 4, is characterized in that,

Described operation calculation unit, comprising:

Quantum genetic algorithm unit, for calculating according to quantum genetic algorithm, concrete steps comprise,

Initialization genetic algebra t=0, population Q (t)=Q (0), population scale is N;

One-shot measurement is implemented to all individualities of Q (t) and obtains P (t), containing N number of individuality determined namely $P\left(t\right)=\left\{p_1^t,p_2^t,...,p_N^t\right\};$

Fitness analysis is carried out to P (t), selects optimum individual as next step desired value of evolving of this population at individual;

Verify whether the optimum individual obtained meets the condition of Optimization route, if so, then terminates and exports optimum individual; Otherwise, preserve optimum individual and fitness value thereof, and carry out quantum mutation operation, adopt Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q (t+1) of future generation, again one-shot measurement is implemented to all individualities of Q (t+1);

Also comprise:

Be connected to the function that described weighted value reading unit and described operation calculate between unit and set up unit, for setting up default fitness function; Described singal reporting code comprises time delay, bandwidth sum reliability three kinds; Described power system service comprises highly reliable broadband real time business, highly reliable arrowband real time business, reliable broadband real time business, reliable arrowband real time business and low reliable arrowband non-real-time service five class; The fitness function of the i-th class power business is, F _i(x)=w _i1f _iD(x)+w _i2f _iB(x)+w _i3f _iL(x), wherein,

F _iDx () is the time delay function of the i-th class power business, its computing formula is,

$F_{iD}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Delay}}_{\max }-Delay\left(x\right)}{{\mathrm{Delay}}_{\max }}& Delay\left(x\right)<{\mathrm{Delay}}_{\max }\\ 0& Delay\left(x\right)\&GreaterEqual;{\mathrm{Delay}}_{\max }\end{array}\right.,$ Delay _maxit is the tolerable time delay maximum of the i-th class power business; for the propagation delay time of path x, wherein e represents the link on the x of path, and j represents the node on the x of path;

F _iBx () is the bandwidth function of the i-th class power business, its computing formula is,

$F_{iB}\left(x\right)=\frac{Bandwidth\left(x\right)-{\mathrm{Bandwidth}}_{\min }}{{\mathrm{Bandwidth}}_{\max }-{\mathrm{Bandwidth}}_{\min }},$ Bandwidth (x) is the available bandwidth of path x;

Bandwidth _maxfor the available bandwidth maximum in P (t); Bandwidth _minfor the available bandwidth minimum value in P (t);

F _iLx () is the reliability function of the i-th class power business, its computing formula is,

$F_{iL}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Loss}}_{\max }-Loss\left(x\right)}{{\mathrm{Loss}}_{\max }}& Loss\left(x\right)<{\mathrm{Loss}}_{\max }\\ 0& Loss\left(x\right)\&GreaterEqual;{\mathrm{Loss}}_{\max }\end{array}\right.,$ The packet loss value that Loss (x) is path x;

Loss _maxit is the tolerable packet loss maximum of the i-th class power business.

6. the path selection system towards power business according to claim 5, is characterized in that, described quantum genetic algorithm unit, comprising:

Mutation Strategy unit, for adopting 2 × 2 $\left[\begin{array}{cc}cos\mathrm{\&theta;}& -sin\mathrm{\&theta;}\\ sin\mathrm{\&theta;}& \cos \mathrm{\&theta;}\end{array}\right]$ Dynamic quantum rotation gate revolving door matrix upgrades Q (t), and wherein, θ is the anglec of rotation of quantum door, is worth for K and f (x _m, b _m) product, described f (x _m, b _m) be the direction of revolving door, value is 1 ,-1 or 0; x _mrepresent the m position of current chromosome, b _mrepresent the m position of current best chromosome, K is the variable with genetic algebra t correlation of indices.