CN102904811A - Method and system for routing selection orienting to power business - Google Patents

Abstract

The invention discloses a method and a system for routing selection orienting to a power business. The method comprises the steps of: making corresponding marks on businesses of a power system, and adding the marks into a type control field of network control information; reading the type control field, and acquiring weighted values corresponding to the type control field from a weight list preset by a local router; and substituting the weighted values into a preset fitness function, and carrying out calculation according to a multi-constraint routing selection algorithm to acquire the final routing selection. With adoption of the method and the system disclosed by the invention, shortest routes and constraint conditions specific to the characteristics of the power business can be taken into comprehensive consideration so as to find out an optimal route meeting requirements of the characteristics of the power business, and the effects of optimizing network resources and balancing network load are achieved.

Description

Route selection method and system towards power business

Technical field

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

Background technology

The raising of the in-depth of power market reform and the power industry level of informatization increases sharply the kind of power business and quantity, and power communication is increasing to the demand of bandwidth, and is more and more higher to reliability and delay requirement.When two non-direct-connected computers need 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 method for routing can not satisfy the communicating requirement of power business, for better optimized network performance, needs consideration towards the route selection method of power business.

Route Selection has very important meaning to effective transmission of data grouping, so, a large amount of routing protocols is arranged, such as RIP, OSPF, BGP etc. in the agreement of network layer; Simultaneously, in network technology research, route selection algorithm is a focus and emphasis of research always.Famous, such as dijkstra's algorithm and Ford﹠amp; The FulKerson algorithm calculates the shortest path that leads to each node, and result of calculation is recorded as routing table, as the foundation of Path selection.The core of route selection algorithm is to seek an optimal path between source node and destination node, so that the needed shortest time of transfer of data spends minimum.But existing route selection algorithm all only is based on shortest path first, still has deviation between " the shortest " path and " optimum " path.

For power business, traditional method for routing is only considered this constraints of shortest path.When selecting transmission path for power business, do not consider the dynamic characteristic of concrete business demand and network, thereby shortest path often not optimal path based on the Routing Protocol of shortest 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, can satisfy the communication needs of power business, obtain more excellent communication path.

A kind of route selection method towards power business comprises:

Make corresponding sign for electric power system is professional, join the classification control field of network control message;

Read described classification control field, from the default weighted list of local routing, obtain the weighted value corresponding with described classification control field;

The fitness function that described weighted value substitution is default performs calculations according to the multiple constraint route selection algorithm, obtains final Route Selection;

Wherein, described default relevance grade function is

w _InThe expression weighted value, x is the path, F _In(x) the singal reporting code function of expression i class power business.

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

The control field identify unit is used to the electric power system business to do corresponding sign, joins the classification control field of network control message;

The weighted value reading unit is used for reading described classification control field, obtains the weighted value corresponding with described classification control field from the default weighted list of local routing;

Wherein, described default applicable function is

w _InThe expression weighted value, x is the path, F _In(x) the singal reporting code function of expression i class power business;

The operation calculation unit that links to each other with described weighted value reading unit is used for the fitness function that described weighted value substitution is default, performs calculations according to the multiple constraint route selection algorithm, obtains final Route Selection.

Implement the present invention, have following beneficial effect:

One aspect of the present invention has considered that the central singal reporting code of conventional art on the impact of route link, has made up fitness function on the other hand, and the miscellaneous service of electric power system is considered according to its weighted value.Consider shortest path and for the constraints of power business characteristics, seek out like this optimal path that satisfies the power business characteristic.Each route start node calls corresponding fitness function according to current network state and power business classification, utilize the multiple constraint routing algorithm to carry out Route Selection, has played the effect of Optimizing Network Resources, balance network load.

Description of drawings

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

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

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

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

Embodiment

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

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

S101: do corresponding sign for the electric power system business, join the classification control field of network control message;

S102: read described classification control field, from the default weighted list of local routing, obtain the weighted value corresponding with described classification control field;

S103: the fitness function that described weighted value substitution is default, perform calculations according to the multiple constraint route selection algorithm, obtain final Route Selection;

Wherein, described default relevance grade function is

w _InThe expression weighted value, x is the path, F _In(x) the singal reporting code function of expression i class power business.

At first, the different requirements according to singal reporting code are divided into five kinds with the electric power system existing business;

Five kinds are specially: highly reliable broadband real time business comprises Marketing of Power Market, protection management information, electric energy quality monitoring system and thunder and lightning positioning 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 the electric power system business is done corresponding sign, and described electric power system business can comprise a class or the multiclass in the middle of above-mentioned five kinds, 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 three kinds of time delay, bandwidth and reliabilities; Described electric power system business 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 classes; The fitness function of i class power business is F _i(x)=w _I1F _ID(x)+w _I2F _IB(x)+w _I3F _IL(x), wherein,

F _ID(x) be the time delay function of i class power business, its computing formula is,

$F_{\mathrm{iD}}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Delay}}_{\max }-\mathrm{Delay}\left(x\right)}{{\mathrm{Delay}}_{\max }}& \mathrm{Delay}\left(x\right)<{\mathrm{Delay}}_{\max }\\ 0& \mathrm{Delay}\left(x\right)\&GreaterEqual;{\mathrm{Delay}}_{\max }\end{array}\right.,$ Delay _MaxIt is the tolerable time delay maximum of i class power business; $\mathrm{Delay}\left(x\right)=\underset{e\&Element;x}{\mathrm{\&Sigma;}}\mathrm{Delay}\left(e\right)+\underset{j\&Element;x}{\mathrm{\&Sigma;}}\mathrm{Delay}\left(j\right)$ Be 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 _IB(x) be the bandwidth function of i class power business, its computing formula is,

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

F _IL(x) be the reliability function of i class power business, its computing formula is,

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

Fig. 2 is the format structure schematic diagram of expansion TLV in the Link State Advertisement (LSA).In network control message, add power business classification control field; As shown in Figure 2, in generalized multiprotocol label switching (GMPLS) protocol (GMPLS), add the control field with the power business type, be specially the service identification that in the TLV field of opaque Link State Advertisement (Opaque LSA), increases electric power.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 message; Length represents the length of Value field; Value is the variable length data byte of this part message.Among the present invention, increased the power business classification field among the TLV in LSA, be specially: according to RFC2370 Type has been taken as 2, represents link TLV information; The Length value is 3, and the length that represents the Value field is 3 bits; The Value value is 0～4, represents 5 kinds of power business.

The route start node reads power business classification control field, according to the local weighted value tabulation of reading result index, obtains the required weighted value of fitness function.

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

The concrete steps of analytic hierarchy process (AHP) Determining Weights value:

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

B) by the evaluation of expert to evaluation index, compare in twos, form judgment matrix A.Wherein, h _DThe importance of expression time delay, h _BThe importance of expression bandwidth, h _LThe importance of expression 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) geometric mean of each calibration data of every delegation among the calculating judgment matrix A is designated as

D) utilize formula

Each row geometric mean is carried out normalization calculate, obtain weighted value.

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

Preferably, the present invention selects quantum genetic algorithm to find the solution multiple constraint routing issue towards power business.Quantum genetic algorithm is genetic algorithm to be combined with the quantum calculation theory and a kind of new genetic algorithm that grows up.This algorithm has following characteristics: with quantum bit coded representation chromosome, make item chromosome can represent a plurality of states' superpositions, dwindled population scale, increased population diversity; Determine the direction of search and scope with fitness function; The consumption cervical orifice of uterus upgrades and carries out evolutionary search; In whole population, carry out information interchange with the quantum variation, make population be easy to the discovery advantage individual, and the guiding population is evolved to defect mode with large probability.In addition, it is the absolutely dry intersection of disturbing that quantum genetic algorithm has also been constructed a kind of new interlace operation, avoids population to sink into locally optimal solution, prevents precocity, adopts simultaneously the dynamic rotary door that quantum chromosomes is implemented mutation operation, has accelerated convergence of algorithm speed.

Fig. 3 is that the present invention is towards the flow chart of 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: all the individual one-shot measurements of implementing to Q (t) obtain P (t), contain N the individuality of determining namely $P\left(t\right)=\{p_1^t,p_2^t,...,p_N^t\};$

S203: P (t) is carried out the fitness assessment, select optimum individual as the desired value of this next step evolution of population at individual;

S204: whether the optimum individual that obtains of checking satisfies the condition of best route, if then finish and export optimum individual; Otherwise, preserve optimum individual and fitness value thereof, and carry out the quantum mutation operation, adopt the Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q of future generation (t+1), go back to step S202.

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

At first, initialization: genetic algebra t=0, population Q (t)=Q (0), population scale is N, and population is carried out the quantum bit coding.

The present invention adopts the Variable Length Code mode of two quantum states.Get source node to the path of destination node as chromosome, nodal information of every pair of quantum bit bit representation and since 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 come storing information, first group of value that stores the quantum bit alpha, second group of value that stores quantum bit β arranges the next quantum bit of pointed simultaneously.

A chromosome that is consisted of by n quantum bit, coded representation is through quantum bit:

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

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 attitude.

Behind the quantum bit coding, obtain

The probability amplitude of whole chromosomal all genes of Q (0) is initialized to

Then, all individualities of Q (t) are implemented one-shot measurements obtain P (t), contain N the individuality of determining namely $P\left(t\right)=\{p_1^t,p_2^t,...,p_N^t\}.$

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

Next, P (t) deciphered obtaining concrete path, with routing information (comprising propagation delay time, available bandwidth and packet loss) substitution fitness function F _i(x)=w _I1F _ID(x)+w _I2F _IB(x)+w _I3F _IL(x), select optimum individual as the desired value of this next step evolution of population at individual according to the fitness function value.

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

The fitness function of i class power business is among the present invention:

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

At last, whether the optimum individual that checking obtains satisfies the condition of best route, if, then finish and export optimum individual, otherwise, preserve optimum individual and fitness value thereof, and carry out the quantum mutation operation, adopt the Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q of future generation (t+1).

Wherein, employing dynamic quantum rotation gate revolving door is 2 * 2 matrix, specifically is 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 to be 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 current chromosomal m position, b _mRepresent the chromosomal m of current optimum position.K is the variable with genetic algebra t correlation of indices.Obviously, Quantum rotating gate can also adopt 3 * 3 matrix or 2 * 2 matrixes of other form, and the present invention does not get rid of yet and adopts other Mutation Strategy to upgrade 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 the fast advantage of update efficiency.

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

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

The control field identify unit is used to the electric power system business to do corresponding sign, joins the classification control field of network control message;

The weighted value reading unit is used for reading described classification control field, obtains the weighted value corresponding with described classification control field from the default weighted list of local routing;

Wherein, described default applicable function is

w _InThe expression weighted value, x is the path, F _In(x) the singal reporting code function of expression i class power business;

The operation calculation unit that links to each other with described weighted value reading unit is used for the fitness function that described weighted value substitution is default, performs calculations according to the multiple constraint route selection algorithm, obtains final Route Selection.

In the middle of embodiment, comprising therein:

The function that is connected between described weighted value reading unit and the described operation calculation unit is set up the unit, is used for setting up default fitness function; Described singal reporting code comprises three kinds of time delay, bandwidth and reliabilities; Described electric power system business 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 classes; The fitness function of i class power business is F _i(x)=w _I1F _ID(x)+w _I2F _IB(x)+w _I3F _IL(x), wherein,

F _ID(x) be the time delay function of i class power business, its computing formula is,

$F_{\mathrm{iD}}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Delay}}_{\max }-\mathrm{Delay}\left(x\right)}{{\mathrm{Delay}}_{\max }}& \mathrm{Delay}\left(x\right)<{\mathrm{Delay}}_{\mathrm{<figure-callout\; id="0"\; label="max"\; filenames="HDA00002324526500012.png"\; state="\{\{state\}\}">max</figure-callout>}}\\ 0& \mathrm{Delay}\left(x\right)\&GreaterEqual;{\mathrm{Delay}}_{\max }\end{array}\right.,$ Delay _MaxIt is the tolerable time delay maximum of i class power business; $\mathrm{Delay}\left(x\right)=\underset{e\&Element;x}{\mathrm{\&Sigma;}}\mathrm{Delay}\left(e\right)+\underset{j\&Element;x}{\mathrm{\&Sigma;}}\mathrm{Delay}\left(j\right)$ Be 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 _IB(x) be the bandwidth function of i class power business, its computing formula is,

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

F _IL(x) be the reliability function of i class power business, its computing formula is,

$F_{\mathrm{iL}}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Loss}}_{\max }-\mathrm{Loss}\left(x\right)}{{\mathrm{Loss}}_{\max }}& \mathrm{Loss}\left(x\right)<{\mathrm{<figure-callout\; id="0"\; label="Loss\; max"\; filenames="HDA00002324526500012.png"\; state="\{\{state\}\}">Loss</figure-callout>}}_{\max }\\ 0& \mathrm{Loss}\left(x\right)\&GreaterEqual;{\mathrm{Loss}}_{\max }\end{array}\right.,$ Loss (x) is the packet loss value of path x; Loss _MaxIt is the tolerable packet loss maximum of i class power business.

Preferably, described operation calculation unit comprises:

The quantum genetic algorithm unit is used for performing calculations according to quantum genetic algorithm, and concrete steps comprise,

Genetic algebra t=0 is set, population Q (t)=Q (0), population scale is N;

All individual one-shot measurements of implementing to Q (t) obtain P (t), obtain N the individuality of determining namely $P\left(t\right)=\{p_1^t,p_2^t,...,p_N^t\};$

P (t) is carried out the fitness assessment, select optimum individual as the desired value of this next step evolution of population at individual;

Whether the optimum individual that obtains of checking satisfies the condition of best route, if then finish and export optimum individual; Otherwise, preserve optimum individual and fitness value thereof, and carry out the quantum mutation operation, adopt the Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q of future generation (t+1), again all individualities of Q (t+1) are implemented one-shot measurements.

Preferably, described quantum genetic algorithm unit comprises:

The Mutation Strategy unit be used for to adopt 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 to be 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 current chromosomal m position, b _mRepresent the chromosomal m of current optimum position.K is the variable with genetic algebra t correlation of indices.

The above embodiment has only expressed several execution mode of the present invention, and it describes comparatively concrete and detailed, but can not therefore be interpreted as the restriction to claim of the present invention.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 (8)

1. the route selection method towards power business is characterized in that, comprising:

Do corresponding sign for the electric power system business, join the classification control field of network control message;

Read described classification control field, from the default weighted list of local routing, obtain the weighted value corresponding with described classification control field;

The fitness function that described weighted value substitution is default performs calculations according to the multiple constraint route selection algorithm, obtains final Route Selection;

Wherein, described default relevance grade function is

w _InThe expression weighted value, x is the path, F _In(x) the singal reporting code function of expression i class power business.

2. the route selection method towards power business according to claim 1 is characterized in that: described singal reporting code comprises three kinds of time delay, bandwidth and reliabilities; Described electric power system business 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 classes; The fitness function of i class power business is,

F _i(x)=w _I1F _ID(x)+w _I2F _IB(x)+w _I3F _IL(x), wherein,

F _ID(x) be the time delay function of i class power business, its computing formula is,

$F_{\mathrm{iD}}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Delay}}_{\max }-\mathrm{Delay}\left(x\right)}{{\mathrm{Delay}}_{\max }}& \mathrm{Delay}\left(x\right)<{\mathrm{Delay}}_{\max }\\ 0& \mathrm{Delay}\left(x\right)\&GreaterEqual;{\mathrm{Delay}}_{\max }\end{array}\right.,$ Delay _MaxIt is the tolerable time delay maximum of i class power business; $\mathrm{Delay}\left(x\right)=\underset{e\&Element;x}{\mathrm{\&Sigma;}}\mathrm{Delay}\left(e\right)+\underset{j\&Element;x}{\mathrm{\&Sigma;}}\mathrm{Delay}\left(j\right)$ Be 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 _IB(x) be the bandwidth function of i class power business, its computing formula is,

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

F _IL(x) be the reliability function of i class power business, its computing formula is,

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

3. the route selection method towards power business according to claim 1 and 2, it is characterized in that: described multiple constraint route 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;

All individual one-shot measurements of implementing to Q (t) obtain P (t), contain N the individuality of determining namely $P\left(t\right)=\{p_1^t,p_2^t,...,p_N^t\};$

P (t) is carried out the fitness assessment, select optimum individual as the desired value of this next step evolution of population at individual;

Whether the optimum individual that obtains of checking satisfies the condition of best route, if then finish and export optimum individual; Otherwise, preserve optimum individual and fitness value thereof, and carry out the quantum mutation operation, adopt the Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q of future generation (t+1), again all individualities of Q (t+1) are implemented one-shot measurements.

4. the route selection method towards power business according to claim 3 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 to be 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 current chromosomal m position, b _mRepresent the chromosomal m of current optimum position.K is the variable with genetic algebra t correlation of indices.

5. the path selection system towards power business is characterized in that, comprising:

The control field identify unit is used to the electric power system business to do corresponding sign, joins the classification control field of network control message;

The weighted value reading unit is used for reading described classification control field, obtains the weighted value corresponding with described classification control field from the default weighted list of local routing;

Wherein, described default relevance grade function is $F_i\left(x\right)=\underset{n=1}{\overset{N}{\mathrm{\&Sigma;}}}{w}_{\mathrm{in}}{F}_{\mathrm{in}}\left(x\right),$ w _InThe expression weighted value, x is the path, F _In(x) the singal reporting code function of expression i class power business;

The operation calculation unit that links to each other with described weighted value reading unit is used for the fitness function that described weighted value substitution is default, performs calculations according to the multiple constraint route selection algorithm, obtains final Route Selection.

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

The function that is connected between described weighted value reading unit and the described operation calculation unit is set up the unit, is used for setting up default fitness function; Described singal reporting code comprises three kinds of time delay, bandwidth and reliabilities; Described electric power system business 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 classes; The fitness function of i class power business is F _i(x)=w _I1F _ID(x)+w _I2F _IB(x)+w _I3F _IL(x), wherein,

F _ID(x) be the time delay function of i class power business, its computing formula is,

$F_{\mathrm{iD}}\left(x\right)=\left\{\begin{array}{cc}\frac{{\mathrm{Delay}}_{\max }-\mathrm{Delay}\left(x\right)}{{\mathrm{Delay}}_{\max }}& \mathrm{Delay}\left(x\right)<{\mathrm{Delay}}_{\max }\\ 0& \mathrm{Delay}\left(x\right)\&GreaterEqual;{\mathrm{Delay}}_{\max }\end{array}\right.,$ Delay _MaxIt is the tolerable time delay maximum of i class power business; $\mathrm{Delay}\left(x\right)=\underset{e\&Element;x}{\mathrm{\&Sigma;}}\mathrm{Delay}\left(e\right)+\underset{j\&Element;x}{\mathrm{\&Sigma;}}\mathrm{Delay}\left(j\right)$ Be 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 _IB(x) be the bandwidth function of i class power business, its computing formula is,

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

F _IL(x) be the reliability function of i class power business, its computing formula is,

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

7. according to claim 5 or 6 described path selection systems towards power business, it is characterized in that, described operation calculation unit comprises:

The quantum genetic algorithm unit is used for performing calculations according to quantum genetic algorithm, and concrete steps comprise,

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

All individual one-shot measurements of implementing to Q (t) obtain P (t), contain N the individuality of determining namely $P\left(t\right)=\{p_1^t,p_2^t,...,p_N^t\};$

P (t) is carried out the fitness assessment, select optimum individual as the desired value of this next step evolution of population at individual;

Whether the optimum individual that obtains of checking satisfies the condition of best route, if then finish and export optimum individual; Otherwise, preserve optimum individual and fitness value thereof, and carry out the quantum mutation operation, adopt the Quantum rotating gate Mutation Strategy to upgrade Q (t), obtain population Q of future generation (t+1), again all individualities of Q (t+1) are implemented one-shot measurements.

8. the path selection system towards power business according to claim 7 is characterized in that, described quantum genetic algorithm unit comprises:

The Mutation Strategy unit be used for to adopt 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 to be 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 current chromosomal m position, b _mRepresent the chromosomal m of current optimum position.K is the variable with genetic algebra t correlation of indices.

Images