CN105207859A - OTN network planning setting method in power communication network - Google Patents

Abstract

The present invention relates to an OTN network planning setting method in a power communication network. The method comprises the steps of (1) updating the state information of a current network and releasing completed connection resource, waiting a new connection request, and going to step (2) if the new connection request arrives, (2) using a shortest path algorithm to find two shortest paths which do not intersect to be the working channel WP and the standby channel PP of the connection request, (3) distributing wavelength resource for the working channel and the standby channel and applying the idea of SBPP to share the standby wavelength resource, (4) if both routing and wavelength assignment are successful, the connection request is connected successfully, otherwise the connection request is declined, and going back to the step (1). According to the method, the OTN network planning setting timeliness and level can be improved, and the standardization and rationalization of OTN network design are realized. The method can be widely applied to the field of power communication network planning.

Description

OTN network planning method to set up in a kind of powerline network

Technical field

The present invention relates to a kind of powerline network programme setting method, particularly about the programme setting method of OTN network in a kind of powerline network.

Background technology

For promoting powerline network transmission capacity, comprehensive optimized network structure, need the research of backbone transport networks technological evolvement and the networking model of carrying out based on OTN (optical transfer network) technology.In the face of a large amount of network settings work, need the network configuration according to zones of different and capacity requirement, carry out the research of OTN network radio frequency channel computational methods, transmission performance calculation method of parameters and equipment method to set up in a deep going way, and carry out OTN network design on this basis.

During the OTN network planning in conventional electric power communication network is arranged, generally still follow original engineer's pattern, cause information-based supplementary means relatively weak.In addition, because OTN transport network is still in the primary stage of development in electric power backbone communications, non-large-scale application, therefore shaping design planning information system is also in each equipment manufacturer's internal applications stage.But along with the development of OTN transport network, multi-vendor equipment runs on consolidated network, the scale of network is increasing, the structure of network becomes increasingly complex, if still follow original pattern in network planning method to set up, then repetitive operation is many especially, and cannot rationally, economical, obtain planning network scheme quickly and accurately, therefore can increase because planning arranges the investment risk caused, extend the cycle that planning is arranged.

Summary of the invention

For the problems referred to above, the object of the invention is in conjunction with power communication practical business demand and power communication feature, proposition one can improve the OTN network planning and arrange timeliness and level, realizes OTN network planning method to set up in the powerline network of the standardization of OTN network design, standardization, rationalization.

For achieving the above object, the present invention takes following technical scheme: OTN network planning method to set up in a kind of powerline network, and it comprises the following steps: step 1: the state information upgrading current network, and discharges completed connection resource; Wait for new connection request, if new connection request, go to step 2; Step 2: utilize shortest path first to search two mutually disjoint shortest paths, as active channel WP and the stand-by channel PP of connection request; Step 3: for active channel and stand-by channel distribute wavelength resource, the ideological trends spare wavelength resource of application SBPP; Step 4: if route symmetry is all successful, this connection request successful connection, otherwise refuse this connection request, return step 1.

Stand-by channel in described step 2 adopts the stand-by channel configuration based on P circle.

The described stand-by channel configuration based on P circle is as follows: (1) network model: assuming that the link of electric power optical transfer network is two-way, and link capacity is fixed; Adopt directed graph G=(V, E) to represent network model, configuration directed cycle for the protection of, wherein V is network node collection, and E is link set, | V| and | E| represents the node total number of network and link sum respectively; (2) P circle configuration: the configuration adopting the P circle of overall optimum method, overall optimum method is that in first Enumerate network topology, all circles are as alternative P circle collection, and recycling integral linear programming obtains optimized solution; Wherein, integral linear programming is referred to as ILP; (3) routing and wavelength assignment algorithms: the first kind is that each node of network is all configured with wavelength shifter; Equations of The Second Kind is that each node of network does not configure wavelength shifter; (4) after internet off-line configures P circle, each of circle uplink of enclosing for each P backs up wavelength accordingly to optical fiber is reserved, and finally, the wavelength of residue of network organization is all as the operation wavelength of network, and these wavelength all receive protection.

In described step (1), owing to dynamically building circle protection dynamic service, there is larger time complexity, the method taked is the P circle collection of an off-line arrangement all link of energy protecting network, find route for each connection request in real time during the network operation and distribute wavelength, concrete need to consider following some: the P circle collection 1. configured will ensure that there is oneself protection radio frequency channel on every bar limit, and namely each of every bar link at least belongs to circle uplink or the gap-bridging link that a circle concentrated by P circle to limit; 2. suitable routing policy; 3. suitable Wavelength Assignment strategy.

In described step (2), select the configuration of ILP model, adopt following ILP model realization to configure: input set: S: network edge collection; If network has | E| bar link, consider the amphicheirality of link, network edge collection dimension is then 2 × | E|; P: alternative P circle collection, single P circle represents with p; Input variable: ci: the cost of limit i unit capacity, setting ci=1; $x_i^p:x_i^p\∈\left\{\mathrm{0,1}\right\},$ During circle p energy edge protection i $x_i^p=1,$ Otherwise $x_i^p=0;{\mathrm{\ϵ}}_i^p:{\mathrm{\ϵ}}_i^p\∈\left\{\mathrm{0,1}\right\},$ Circle p is through limit i otherwise output variable: np: representing that circle p needs the quantity of configuration, is nonnegative integer type variable;

in described step (3), when described each node of first kind network is all configured with wavelength shifter, concrete route Wavelength Assignment strategy is as follows: total Q circle concentrated by the P circle establishing off-line arrangement good, and the Protection capacity of circle p is Dp, and initial value is set to 0; Assuming that every bar link respectively all has M unit capacity to limit, the idle capacity number Fi of limit i represents, Fi=M time initial, the capacity requirement of connection request r is designated as demandr, then: 1. when connection request r arrives network, the weights on the adjustment whole limit of network, the weights on limit can be expressed as:

${\cos t}_i=\left\{\begin{array}{cc}\&infin;,& \mathrm{if}{F}_i<{\mathrm{demand}}_r\\ \frac{M+1-F_i}{M},& \mathrm{if}{F}_i\&GreaterEqual;{\mathrm{demand}}_r\end{array}\right.,\&ForAll;i\&Element;S,$

2. shortest path first Dijkstra ' s is used to calculate the operating path Pathr of connection request r; If can Pathr be found, and there are enough working capacitys, continue the and 3. walk, otherwise refuse this connection request; 3. be every bar limit distribution Protection capacity of operating path Pathr: if the limit j of Pathr can by the potential protection of Ij (Ij≤Q) individual circle, this Ij circle composition set Ctemp, upgrade the Protection capacity of respectively circle in Ctemp, more new formula is,

$D_p=\max (D_p^{\&prime;},W_j^p+\frac{{\mathrm{demand}}_r}{I_j}),p\&Element;C_{\mathrm{temp}},$

Wherein D' _pthat circle p arrives the Protection capacity before network at connection request r, the working capacity of front j by circle p protection arriving network at connection request r; If D _p>D' _p, then the Protection capacity increasing circle p is needed; If 4. this Ij circle energy edge protection j, upgrades the conservation status of each circle opposite side j in set Ctemp, wherein,

$W_j^p=W_j^p+\frac{{\mathrm{demand}}_r}{I_j},p\&Element;C_{\mathrm{temp}},$

Upgrade C _tempin the Protection capacity of certain circle time, if the idle capacity of residue of network organization can not meet the Protection capacity of circle needed for p, then this circle can not edge protection j, will it from gathering C _tempmiddle deletion, upgrades I _j=I _j-1; If I _j>0, each link capacity of network is got back to network and is upgraded C _tempin state before each circle Protection capacity, and return the and 3. walk; If I _j=0, this connection request can not be protected, refuses this connection request, and each link capacity of network gets back to the state before connection request r arrival network; 5. and if only if Path _revery bar limit all protected, accept this connection request, otherwise refuse this connection request, and each link capacity of network is got back to connection request r and is arrived state before network.

In described step (3), described each node of Equations of The Second Kind network does not configure wavelength shifter: when network node does not have wavelength conversion capability, and the foundation of active and standby radio frequency channel then needs to meet Wavelength continuity constraint; Active channel and stand-by channel want one_to_one corresponding.

The present invention is owing to taking above technical scheme, it has the following advantages: 1, the present invention is due to electric power feature and the power business demand of combining closely, according to the know-why of OTN optical transfer network, by technology such as information model modeling, network analog, compunications, provide a set of application process be combined with the peculiar demand of electric power, therefore, it is possible to effectively solve the problem not being suitable for the OTN network planning method to set up of power communication feature in prior art.2, due to the distinctive application process of the inventive method, by the calculating, network evaluation, nargin verification etc. of the parameters to OTN network design, achieve the reasonable, economic of design and arrange, greatly saved construction investment.3, the inventive method can realize and the network planning of representative network or the basic equivalent environment of real network and deduction, by representative network or real network situation, for designer provides one, analysis and assessment are accurate, authenticity good, lifelike image, convenient, flexible interactive mode assist method to set up, can realize network and intuitively arrange fast.The present invention can extensively apply in powerline network planning field.

Accompanying drawing explanation

Fig. 1 is directional P-cycle protection philosophy schematic diagram of the present invention;

Fig. 2 is the present invention is that the P meeting Wavelength continuity constraint encloses protection philosophy schematic diagram;

Fig. 3 is network topology decomposing schematic representation of the present invention;

Fig. 4 is FR route subproblem schematic diagram of the present invention;

Fig. 5 is FAR route subproblem schematic diagram of the present invention;

Fig. 6 is ASCPR route subproblem schematic diagram of the present invention;

Fig. 7 is SBPP protection philosophy schematic diagram of the present invention.

Embodiment

Below in conjunction with drawings and Examples, the present invention is described in detail.

In powerline network of the present invention, OTN network planning method to set up specifically comprises the following steps:

Step 1: the state information upgrading current network, and discharge completed connection resource.Wait for new connection request, if new connection request, go to step 2;

Step 2: utilize shortest path first to search two mutually disjoint shortest paths, as active channel WP and the stand-by channel PP of connection request.

Step 3: for active channel and stand-by channel distribute wavelength resource, the ideological trends spare wavelength resource of application SBPP.

Step 4: if route symmetry is all successful, this connection request successful connection, otherwise refuse this connection request.Return step 1.

Stand-by channel in above-mentioned steps 2 adopts the stand-by channel configuration based on P circle: P encloses (preconfigurationcycle; p-cycle) be a kind of very outstanding mesh network protection mechanism; it not only has the fast quick-recovery advantage of looped network, also has the high resource utilization advantage of mesh network.The protection of P circle utilizes the circular passage that in mesh network, idle link circuit resource pre-sets, and it can realize the quick protection of mesh network, allows operating path to select the shortest direct route on Internet resources figure simultaneously.Concrete configuration is as follows:

(1) network model

Assuming that the link of electric power optical transfer network is two-way, and link capacity is fixed.Adopt directed graph G=(V, E) to represent network model, configuration directed cycle for the protection of, wherein V is network node collection, and E is link set, | V| and | E| represents the node total number of network and link sum respectively.A directional P-cycle can provide a protection channel for the reverse edge enclosing uplink, can respectively provide a protection channel for the two-way limit of gap-bridging link.As shown in Figure 1, directional P-cycle (1 → 2 → 3 → 4 → 1) provides a protection channel for enclosing the reverse edge 2 → 1,3 → 2,4 → 3 and 1 → 4 of uplink, and the protection channel as limit 2 → 1 is 2 → 3 → 4 → 1; During this circle protection gap-bridging link 2-4, for limit 2 → 4 provides protection channel 2 → 3 → 4, for limit 4 → 2 provides protection channel 4 → 1 → 2.

In dynamic environment, business arrives network successively at random, thus the connectivity request message of unpredictable business.Consider that dynamically building circle protection dynamic service has larger time complexity; the method that can take is the P circle collection of an off-line arrangement all link of energy protecting network; be each connection request searching route in real time during the network operation and distribute wavelength, specifically what time needing below consideration:

1. the P circle collection configured will ensure that there is oneself protection radio frequency channel on every bar limit, and namely each of every bar link at least belongs to circle uplink or the gap-bridging link that a circle concentrated by P circle to limit;

2. suitable routing policy;

3. suitable Wavelength Assignment strategy.

(2) P circle configuration: the configuration of P circle roughly can be divided into two large classes: overall optimum method and heuristic.Overall optimum method is that in first Enumerate network topology, all circles are as alternative P circle collection, and recycling integral linear programming (ILP) obtains optimized solution.Heuristic first calculates the good alternative circle of a part of Performance Ratio, then in conjunction with actual disposition demand, preferentially configured by alternative circle larger for real protection ability.During off-line arrangement P circle collection, target seeks allocation optimum, and do not need to consider setup time, and therefore the present invention selects ILP model to configure.Following ILP model realization is adopted to configure.

Input set:

S: network edge collection.If network has | E| bar link, consider the amphicheirality of link, network edge collection dimension is then 2 × | E|;

P: alternative P circle collection, single P circle represents with p.

Input variable:

Ci: the cost of limit i unit capacity, the present invention sets ci=1;

$x_i^p:x_i^p\&Element;\left\{\mathrm{0,1}\right\},$ During circle p energy edge protection i $x_i^p=1,$ Otherwise $x_i^p=0;$

${\mathrm{\&epsiv;}}_i^p:{\mathrm{\&epsiv;}}_i^p=\left\{\mathrm{0,1}\right\},$ Circle p is through limit i ${\mathrm{\&epsiv;}}_i^p=1,$ Otherwise ${\mathrm{\&epsiv;}}_i^p=0.$

Output variable:

Np: representing that circle p needs the quantity of configuration, is nonnegative integer type variable.

Target function:

$\mathrm{Minimize}\underset{p\&Element;P}{\mathrm{\&Sigma;}}\underset{i\&Element;S}{\mathrm{\&Sigma;}}{n}^p\&CenterDot;{\mathrm{\&epsiv;}}_i^p\&CenterDot;c_i---\left(1\right)$

Restrictive condition:

$\underset{p\&Element;P}{\mathrm{\&Sigma;}}{n}^p\&CenterDot;x_i^p\&GreaterEqual;1,i\&Element;S---\left(2\right)$

The target of this ILP Optimized model minimizes deployment cost, and deployment cost is the jumping figure sum of the concentrated all circles of P circle of configuration, and the restrictive condition of model ensures that the two-way limit of every bar link is all protected.

(3) routing and wavelength assignment algorithms

The first kind: each node of network is all configured with wavelength shifter.

If the whole node of network has wavelength conversion capability, then do not need the distribution considering wavelength during the network operation, as long as link exists the foundation that idle capacity can realize connection request.For improving resource utilization, the Protection capacity that each P of dynamic assignment encloses.Concrete route Wavelength Assignment strategy is as follows:

If total Q circle concentrated by the P circle that off-line arrangement is good, the Protection capacity of circle p is Dp, and initial value is set to 0.Assuming that every bar link respectively all has M unit capacity to limit, the idle capacity number Fi of limit i represents, Fi=M time initial, the capacity requirement of connection request r is designated as demandr.

1. when connection request r arrives network, the weights on the adjustment whole limit of network, the weights on limit can be expressed as:

${\cos t}_i=\left\{\begin{array}{cc}\&infin;,& \mathrm{if}{F}_i<{\mathrm{demand}}_r\\ \frac{M+1-F_i}{M},& \mathrm{if}{F}_i\&GreaterEqual;{\mathrm{demand}}_r\end{array}\right.,\&ForAll;i\&Element;S---\left(3\right)$

2. shortest path first Dijkstra ' s is used to calculate the operating path Pathr of connection request r.If can Pathr be found, and there are enough working capacitys, continue the and 3. walk, otherwise refuse this connection request.

3. be every bar limit distribution Protection capacity of operating path Pathr.If the limit j of Pathr can by the potential protection of Ij (Ij≤Q) individual circle, this Ij circle composition set Ctemp, upgrade the Protection capacity of each circle in Ctemp, more new formula is,

$D_p=\max (D_p^{\&prime;},W_j^p+\frac{{\mathrm{demand}}_r}{I_j}),p\&Element;C_{\mathrm{temp}}---\left(4\right)$

Wherein D' _pthat circle p arrives the Protection capacity before network at connection request r, the working capacity of front j by circle p protection arriving network at connection request r.If D _p>D' _p, then the Protection capacity increasing circle p is needed.

If 4. this Ij circle energy edge protection j, upgrades the conservation status of each circle opposite side j in set Ctemp, wherein,

$W_j^p=W_j^p+\frac{{\mathrm{demand}}_r}{I_j},p\&Element;C_{\mathrm{temp}}---\left(5\right)$

Upgrade C _tempin the Protection capacity of certain circle time, if the idle capacity of residue of network organization can not meet the Protection capacity of circle needed for p, then this circle can not edge protection j, will it from gathering C _tempmiddle deletion, upgrades I _j=I _j-1.If I _j>0, each link capacity of network is got back to network and is upgraded C _tempin state before each circle Protection capacity, and return the and 3. walk; If I _j=0, this connection request can not be protected, refuses this connection request, and each link capacity of network gets back to the state before connection request r arrival network.

5. and if only if Path _revery bar limit all protected, accept this connection request, otherwise refuse this connection request, and each link capacity of network is got back to connection request r and is arrived state before network.

Equations of The Second Kind: each node of network does not configure wavelength shifter.

When network node does not have wavelength conversion capability, the foundation of active and standby radio frequency channel then needs to meet Wavelength continuity constraint.Active channel and stand-by channel want one_to_one corresponding.For the protection of P circle, as shown in Figure 2,1-2-3-4-5-1 is a P circle.Specific practice is that the upper every bar link of circle uses the λ 1 of outer fibre and interior fine λ 2 as operation wavelength respectively; meanwhile; the λ 2 of outer fibre and interior fine λ 1 is used as the protection wavelength of the operation wavelength λ 2 of interior fibre and the operation wavelength λ 1 of outer fibre respectively, and gap-bridging link does not need reserved protection wavelength.

(4) after internet off-line configures P circle, each of circle uplink of enclosing for each P backs up wavelength accordingly to optical fiber is reserved, and finally, the wavelength of residue of network organization is all as the operation wavelength of network, and these wavelength all receive protection.As shown in Figure 3, the protection of (a) former topological arrangement P circle is schemed; Figure (b) is reserved on P circle backs up wavelength accordingly, forms a protection topological diagram; In figure (c), the backup wavelength of removing network reservation, remaining wavelength forms a work topological diagram.For single link failure, the protection philosophy analyzed from Fig. 3, protects the recovery of the upper any single link failure of topological realization work topology.After business arrives network at random, only need run routing algorithm job search path in the work topology of network.

Known in sum, the present invention is the diversified OTN network planning algorithm based on design rule engine, by the In-put design regulation engine such as polymorphic type equipment template, basic network model, representative network cases of design of calculating parameter, many producers, by the algorithm for design that solidifies in engine and design rule, the design scheme of output network topological sum network node configures inventory, as adopted different configuration lists during devices from different manufacturers in same website, and different configuration list relatively.By determining the final planning and design scheme of network after option screening, and the scheme after determining can be used as typical case is increased in case library Sum fanction storehouse, thus realizes the self study of system engine rule.

Dynamic service flow refer to node between connection request be not given in advance, but dynamically to arrive along with time variations, to be removed again after connection establishment is got well and kept a period of time.The requirement of real-time of this kind of business is higher, and target is for connection request carries out resource distribution fast, and reduces network blocking probability by rational routing policy as far as possible.For dynamic service flow, because new connection is constantly accepted, and effective connection at present is constantly released, and the state of network is also dynamic change in time.Thus, the optimization of the overall situation cannot be carried out the route wavelength configuration in whole observing time, consider that real-time limits simultaneously, usually require that algorithm is simply efficient.

Can the quality of Dynamic RWA algorithm and set up service connection fast and have close relationship, due to the finiteness of wavelength resource, and the business of not all can meet with a response timely, sometimes also there will be the problem of network congestion.Good RWA algorithm can make full use of existing Internet resources, UNICOM's business as quickly as possible, meets the demand of business.Therefore the optimization aim of Dynamic RWA is exactly realize maximum connected ratio when resource-constrained, reduces average blocking rate.In powerline network of the present invention, the mathematical description of OTN network planning method to set up is as follows:

(1) known conditions: network physical topological structure, business load, service connection duration.

(2) function realized is required: find and select route symmetry comparatively reasonably scheme.

(3) constraints: the restriction of number of fibers, the restriction of wavelength number, Wavelength continuity constraint.

(4) target function: the average blocking rate of network is minimum.

In catenet, inside the regular hour, solve RWA problem be difficult to realize.Great majority research is at present all that RWA problem is divided into two kinds of settling modes:

A) scale finite element network, can take RWA problem parallel algorithm;

PROBLEM DECOMPOSITION can be route subproblem and Wavelength Assignment subproblem by b) larger network.

When solving serial RWA algorithm, Route Selection subproblem is divided into two benches: search phase and choice phase.Search phase first presses certain rule compositor to all connection establishment requests, then is that each connection request calculates optional path set in order; Choice phase selects a suitable path the optional path set set up from the search phase to connect.Generally, searching algorithm mainly contains: 1) according to link metric be each light path request calculate shortest path, routine weight value be fixing or along with in network oneself set up light path number change; 2) for each request calculates the optional path set of k bar shortest path as light path, perform selection algorithm again, choice phase can use greedy algorithm, namely to the optional path set of each light path request according to certain rule compositor (as Random, First-fit, Longestpath-first, the order such as Shortest-path-first), and in order Wavelength assignment algorithm being performed to every bar alternative path, that optimum paths therefrom selected by the apportioning cost returned according to Wavelength assignment algorithm.

Wavelength Assignment subproblem is then the Wavelength Assignment scheme finding a local optimum on given path, makes wavelength utilance reach the highest.Common allocation algorithm has: 1) use greedy algorithm to wavelength available set according to certain rule compositor (as Random, First-fit, Most-used, Least-used etc.), and scanning wavelength set in order, be that every paths distributes wavelength until successfully distribute one by one; 2) use heuristic algorithm (as vertex coloring algorithm, genetic algorithm, tabu search algorithm etc.) to consider influencing each other of Wavelength Assignment between different path, repeatedly revise Wavelength Assignment scheme and improve total wavelength utilance, until cannot improve.

If the scale of network is not very large, can based on certain Mathematical Modeling, routing and Wavelength Assignment one step are completed, this type of RWA algorithm is called route symmetry parallel algorithm.The parallel RWA problem problem that solves is the algorithm approved most at present, and existing document once proposed to utilize hierarchical diagram disposable solution RWA problem problem.Layered graph model is that network physical topology is copied W layer, the corresponding wavelength plane of every one deck.Any one light connects from source node, finds the route arriving destination node in each wavelength plane, and every bar link only allows a light path to pass through.If find route in certain wavelength plane, just give corresponding route corresponding wavelength.So just both meet wavelength continuity requirement, meet again different channels assignment constraint.Layered graph model can simplify RWA problem, the wavelength that different plane level is corresponding different, as long as the disjoint light path in limit finding with originally having distributed in hierarchical diagram, can be just the idle wavelength of its distribution.

Although use the parallel algorithm of layered graph model preferably to be separated, but along with the increase of network size, the algorithm complex exponentially of layered graph model increases, very difficult for the RWA solving large scale network like this, so the algorithm of more propositions is all RWA problem is splitted into two route subproblems respectively and Wavelength Assignment subproblem solves respectively.

Route subproblem, routing policies refers to as newly arrived business selects a physics route optimized between Service Access point.For route subproblem, normally choose based on shortest route (ShortestPath).The route subproblem strategy that current document proposes can comprise 3 kinds of strategies usually: (1) fixed route routing policy (FixedRouting).To determining a fixing available route between arbitrary node pair, this process completes before Network arrives.When business arrives, optimize wavelength by the service selection in Different Optimization target for this reason route, when without wavelength available, this business is blocked.This route is normally determined by Dijksta or Forld algorithm.(2) self adaptation alternate routing routing policy (AdaptiveAlternatedRouting).To pre-determining many alternate routings between arbitrary node pair.When business arrives, in many optional alternate routings, self adaptation will choose an optimum route, and distribute wavelength.(3) fixing alternate routing routing policy (FixedAlternatedRouting).Many available routes for subsequent use are determined to business between arbitrary node pair.When business arrives, business will be distributed to by route priority (shortest route), when business is blocked, select time short circuit by distribution method.

In above-mentioned three kinds of route selecting methods, it is the shortest that strategy (1) fixed route routing method chooses route time, because it is when distributing route, do not consider resource occupying state, fixed route can precalculate by off-line, so the time cost that this algorithm spends is minimum.But with the route between the dynamic mapping self-adaptative adjustment node of Network pair, and traffic engineering control cannot be carried out, therefore can cause the deterioration of network performance, add network blocking probability.Be evenly distributed so the routing policy of fixed route is applicable to Network, the uniform situation of business of arrival.Strategy (2) adaptive alternate routing routing policy best performance, because it is when distributing route, the seizure condition of the Internet resources of consideration.Before Network arrives, calculate shortest route by Dijksta algorithm between node, after erasing shortest route resource, reuse Dijksta algorithm, many alternate routings between computing node pair.When business arrives, according to the current resource occupation state of network, the Wavelength Assignment strategy in fully many bar alternate routings, obtains the optimal distributing scheme of this business.So raising network performance, reduce the blocking probability of network.Therefore, it is best three kinds of allocative decision kind effects, but the time calculated is the longest.The alternate routing routing policy (FixedAlternatedRouting) that strategy (3) is fixed is between first two strategy, and its part considers the state of network, and performance is between the above two.

Owing to routing issue and assignment of wavelength being separated, reduce the time complexity of RWA algorithm.Simultaneously router-level topology usually can calculated off-line, and namely before Network arrives, router-level topology completes, and directly utilizes the route results of calculating when business arrives, so this needs network to set up the Routing information database of being correlated with usually, and preservation router-level topology information.The number of alternate routing is relevant with the Connected degree of network.

During fixed routing, when shortest route exists many, establish the shortest route algorithm of optimization.This algorithm solves when there is many shortest paths when between network node pair, how to choose the problem of the shortest path of optimum.This arthmetic statement is as follows: make P represent shortest route set between all nodes pair.L represents the two-way link set of network, | the number of L| representative set.L represents a link.Make indicator function: Xpl=1 represents the shortest path p that link l belongs to, otherwise Xpl=0.Load ρ (the l)=Σ of definition link l _{p ∈ P}x _plthe average load of every bar link for all links, its sample variance is:

Sample variance embodies the balanced degree of link load.Variance ν shows that more greatly the load gap between link is larger.Like this when main controlled node is to often pair of node calculate many shortest routes, to random selecting, a shortest route is chosen to often pair of node, as initial shortest route collection P, then successively other shortest routes between often pair of node pair are attempted, obtain new shortest route collection P '.The sample variance working as P ' is less than the sample variance of original P, and P ' retains.Until all routes are all attempted, obtain the smallest sample variance of the shortest route of whole network.

FixedRouting (fixed route).This is the simplest a kind of Routing Algorithm in Route Selection.So-called fixing, the selecting paths be between nodes fixes in advance, when there being connection requirement, and the path that direct use has connected.Once network topology structure known after, can be just the fixing optical channel of each peer distribution according to standard shortest path algorithm (such as dijkstra's algorithm and bellman-ford algorithm).In network operation process, the communication connection between two nodes is always set up.

As shown in Figure 4, node 1, to node 5, first will arrive node 5 through node 3 again.Said fixed route selection algorithm is comparatively simple, but needs more wavelength resource.And when flow is dynamic, if when having Wavelength conflict, owing to not substituting route, so serious blocked-flow can be produced.This shows, fixed route selection algorithm does not possess the repair ability of link failure.

FAR (FixedAlternateRouting, fixed alternate routing).In network, each node stores a routing table, and this shows node for this reason, to the Path selection of other nodes, wherein has as the work shortest route of optical channel and the route as spare optical channel.The link section of the general not spanning operation route of alternate routing, namely they are be separated, so this mechanism is called again link disjoint or limit separation mechanism physically.

As shown in Figure 5, the alternate routing of node 1 to 5 is successively through 1,2,4,5 nodes.

The advantage of this routing method is comparatively simple and has link failure repair mechanism, and compared with fixed routing method, the probability that flow gets clogged obviously reduces.

ASCPR (AdaptiveShorestCostPathRouting, self adaptation Shortest path routing) is dynamic routing method according to network state.The cost of unappropriated link is labeled as l, and the cost of occupied link is labeled as ∞, as shown in Figure 6.

When node receives connection request, first select the route that cost is minimum.If such route has many, then Stochastic choice wherein.As can be seen here, this route selecting method is applicable to the network with wavelength convert function, and when Wavelength conflict occurs, wavelength available conversion solves, and optical channel need not meet consistent wavelength restriction.

Wavelength Assignment subproblem, under dynamic network Business Stream, corresponding optimization aim is the blocking probability selecting to connect.Because the uncertainty of the light path in network, except the network that scale is less, all wavelengths route optical network, all needs can complete some controlling functions in a node in the network.When setting up a light and connecting, RWA problem must be considered.Route assignment process is first for the light connection request of assigned source node and destination node distributes a light path and sets up this path by the optical switch arranged in network node.And Wavelength Assignment comprise connect distribution available wavelength to one and cell site and receiving station be tuned on given wavelength.

Wavelength Assignment must observe following two restrictions:

1, Wavelength continuity constraint (WavelengthContinuity): if can not carry out wavelength convert, so an optical channel must distribute identical wavelength on all links of its institute's route.

2, different wave length assignment constraint (DistinctChannelAssignment): on a given link, two optical channels cannot distribute identical wavelength.

Existing Wavelength assignment algorithm has a variety of, such as random distribution method (R, Random), first-fit algorithm First.Fit (FF), least recently used algorithm (LU, Least-Used), the most often use algorithm (MU recently, Most-Used), minimum product method (MP, Min-Product), overall maximum and algorithm (MS, Max-Sum), relative capacity loss method (RCL, RelativeCapacityLoss), minimum influence (LI, LeastInfluence) algorithm, relative minimum influence (RLI, RelativeLeastInfluence) algorithm, Wavelength reservation (RSV, Reservation) method and protection thresholding (THR, Threshold) algorithm.

(1) random distribution method (R, Random): first find wavelength available from all network links, more random selection one of them distribute to optical channel.This algorithm is simple, insensitive to the real-time status of whole network.

(2) adjustment procedure (FF, First-Fit) first: by all wavelengths numbering in network, then according to numbering search free wavelength, find first free wavelength is given optical channel.Adjustment procedure also need not understand the real time information of whole network first, and does not need all wavelengths in search network, and thus amount of calculation is also just smaller, and dispensing rate is also very fast.

(3) least recently used algorithm (LU, Least-Used): according to the occupied situation of network medium wavelength, preferentially choose wavelength minimum by access times in wavelength set.LU makes the utilization rate of each wavelength obtain on average, namely network traffics is evenly distributed on each wavelength.But need the dynamic use information recording network, the storage resources that algorithm needs is more, and meanwhile, computation complexity is also higher.

(4) the most often use algorithm (MU, Most-Used) recently: the wavelength that the nearest frequency of utilization of MU prioritizing selection is the highest, therefore can network traffics be concentrated on the wavelength of fraction, the wavelength number needed for network is reduced.

(5) minimum product method (MP, Min-Product): MP algorithm is applicable to many optical networkings, first gives wavelength numberings all in network, order computation by number wherein, D _c(l, ω) represents number of channel link l taking wavelength w.Prioritizing selection first can make D _cthat wavelength that (l, ω) value is minimum.

(6) the maximum and algorithm (MS, Max – Sum) of the overall situation: first calculate the number of fibers total number of fibers on link l and l taking w wavelength, the difference of the two is defined as the idle capacity of wavelength w on l, note Lc (l, w).This formula calculates the idle capacity value in network on each bar link, that wavelength that prioritizing selection wherein can make idle capacity maximum.

(7) relative capacity loss method (RCL, RelativeCapacityLoss): compared to MS algorithm, RCL algorithm is defined as relative value and not absolute terms by distributing certain wavelength for the impact of other paths, and thus the performance of RC algorithm is better than MS algorithm.

(8) minimum influence (LI, leastInfluence) algorithm: LI algorithm, when distribution wavelength, is always selected to set up to other relevant light paths of the whole network that wavelength causing the total number of bottleneck link minimum.Thus sub-distribution wavelength is reduced the impact that the whole network causes.

(9) relative minimum influence (RLI, RelativeLeastInfluence) algorithm: relative to LI algorithm, during the light path request dispatching wavelength of the micro-letter of RLI, selects the relatively minimum wavelength of other links of the whole network impact.

(10) algorithm and protection thresholding (THR, Threshold) algorithm: RSV and THR algorithm, by the foundation of the longer optical channel of protection, makes the fairness of network be improved.Wavelength reservation algorithm is that many light paths have reserved a part of wavelength at some links, improves the connected ratio of light path.Protection threshold algorithm is tangible only when the wavelength available number on link is greater than default threshold value time, distributes wavelength just to single-hop light path, otherwise refusal single-hop light path connects, thus makes multi-hop light path obtain protection.

Rouing and wavelength assignment matrix model, in wavelength division multiplexed optical network, can utilize matrix can describe optical network model very easily, will set up inverse matrices below to dynamic service, and the business of being calculated as sets up route selected by optical channel and wavelength.If network diagram G (E, L), E are vertex set, with | E| represents the number of set interior element, i.e. the number on summit.By node to numbering, node is to numbering set to make N represent.Node is to number | and N| is greater than 1, little Yu | E|* (| E|-1)/2.L represents link set, supposes that every bar link has F root optical fiber, and W wavelength supported by every root optical fiber.P is alternate routing set.Consider that optical fiber is made up of the one-way optical fiber that two directions are contrary, so network diagram regards non-directed graph as, if there is phasor, optical fiber can be regarded as two optical fiber compositions that direction is contrary.Network is wavelength chooses optical-fiber network, does not consider the situation of wavelength conversion.Introduce below and be defined as follows several matrix:

(1) adjacency matrix

Adjacency matrix E in the topological diagram of optical-fiber network _ijrepresent:

$\begin{array}{cc}& \begin{array}{cccc}{E}_1& E_2& ...& E_n\end{array}\\ \begin{array}{c}{E}_1\\ E_2\\ ...\\ E_n\end{array}& \left(\begin{array}{cccc}1& 1& ...& 0\\ 0& 1& ...& 0\\ ...& ...& ...& ...\\ 0& 0& ...& 1\end{array}\right)\end{array}.$

In adjacency matrix, if node E _iwith node E _jweight is had directly not to be connected for infinite link, then: E _ij=E _ji=1, E _ijrepresent the syntople of node i to node k.Adjacency matrix is symmetrical 0-1 Was Used matrix, describes the internodal physical connection situation of optical-fiber network.It is | E| × | E| ties up matrix.

(2) the p-path matrix of node

Set P={P ₁, P ₂... P _pbe path matrix between all nodes of network pair, in order to description node to and path between relation, defined node p-path matrix N-P matrix, is abbreviated as NP _ijmatrix, NP _ijbe defined as node to N _ibetween path whether comprise path P _j, if so, P _ij=1, otherwise be 0.NP is expressed as:

$\begin{array}{cc}& \begin{array}{cccc}{P}_1& P_2& ...& P_p\end{array}\\ \begin{array}{c}{N}_1\\ N_2\\ ...\\ N_n\end{array}& \left(\begin{array}{cccc}1& 1& ...& 0\\ 0& 1& ...& 0\\ ...& ...& ...& ...\\ 0& 0& ...& 1\end{array}\right)\end{array}.$

Can find out that NP matrix is still 0-1 Was Used matrix, represent that node is to the correlation with path.It by the node of network to the relation abstractdesription with path out.The each node of line display of the p-path matrix of node to the correlation with different passage, the correlation between this this path of matrix column vector representation and different node pair.By the p-path matrix of node, service node is combined closely to route.By adjustment way set P, different routing policies can be completed, realize different optimization aim.Such as, when adopting fixed routing algorithm, a shortest route can be chosen between each node pair, now the p-path matrix of node often row and often row only have an element to be 1.When adopting alternate routing routing policy, in every row element, multiple nonzero element can be comprised.PL matrix is | P| × | L| ties up.

(3) link-path matrix

In order to describe the physical topology situation of optical-fiber network, the link-path matrix of definition optical-fiber network writes a Chinese character in simplified form LP matrix.LP matrix is:

$\begin{array}{cc}& \begin{array}{cccc}{P}_1& P_2& ...& P_p\end{array}\\ \begin{array}{c}{L}_1\\ L_2\\ ...\\ L_L\end{array}& \left(\begin{array}{cccc}1& 1& ...& 0\\ 1& 1& ...& 0\\ ...& ...& ...& ...\\ 0& 0& ...& 1\end{array}\right)\end{array}.$

LP _ijmatrix is similarly 0-1 Was Used matrix.Path in expression alternate routing and the relation of link in network.LPij=1 shows that link Li and path Pj has correlation, and path Pj comprises link Li.Path in optical-fiber network and link are closely connected by path-link metric.The link had nothing to do in network organically combines with path by this matrix.Path-link metric is | L| × | P| ties up matrix

(4) wavelength-link metric

Wavelength-link metric writes a Chinese character in simplified form WL matrix.WL matrix is:

$\begin{array}{cc}& \begin{array}{cccc}{L}_1& L_2& ...& L_L\end{array}\\ \begin{array}{c}{\mathrm{\&lambda;}}_1\\ {\mathrm{\&lambda;}}_2\\ ...\\ {\mathrm{\&lambda;}}_w\end{array}& \left(\begin{array}{cccc}3& 2& ...& 5\\ 2& 4& ...& 4\\ ...& ...& ...& ...\\ 3& 1& ...& 2\end{array}\right)\end{array}.$

Wavelength-link metric describes remaining wavelength resource in optical-fiber network every bar link, the wavelength residue situation both on every bar link.The network starting stage, the number of fibers that each link comprises may be identical with the wavelength of support, also may be different, and each element of wavelength-link metric may be identical, also may be different.When the number of fibers that link comprises is all F mutually, WLij=F.Along with the arrival of business in network, the wavelength resource on link constantly consumes, and wavelength-link metric value will constantly reduce, and WLij represents the remaining number of channel of the i-th wavelength on link j.Residue wavelength resource and link organically combine by wavelength-link metric, it is described that the wavelength resource seizure condition on dynamic optical network link.WL matrix is | W| × | L| ties up matrix.The optical-fiber network of WL matrix description describes optical fiber and wavelength has very strong flexibility, easily, simply can describe for uneven link resource (different link comprises the optical fiber of different number and the different number of wavelengths of support) network, is convenient to analyze.

By several matrix above, the resource situation of network can be analyzed.Wavelength-link metric WL matrix is multiplied with link-path matrix LP matrix, new matrix can be obtained: wavelength-path matrix, be abbreviated as WP matrix.

$\begin{array}{cc}& \begin{array}{cccc}{L}_1& L_2& ...& L_L\end{array}\\ \begin{array}{c}{\mathrm{\&lambda;}}_1\\ {\mathrm{\&lambda;}}_2\\ ...\\ {\mathrm{\&lambda;}}_w\end{array}& \left(\begin{array}{cccc}3& 2& ...& 5\\ 2& 4& ...& 4\\ ...& ...& ...& ...\\ 3& 1& ...& 2\end{array}\right)\end{array}\mathrm{\&Theta;}\begin{array}{cc}& \begin{array}{cccc}{P}_1& P_2& ...& P_p\end{array}\\ \begin{array}{c}{L}_1\\ L_2\\ ...\\ L_L\end{array}& \left(\begin{array}{cccc}1& 1& ...& 0\\ 1& 1& ...& 0\\ ...& ...& ...& ...\\ 0& 0& ...& 1\end{array}\right)\end{array}=\begin{array}{cc}& \begin{array}{cccc}{P}_1& P_2& ...& P_p\end{array}\\ \begin{array}{c}{\mathrm{\&lambda;}}_1\\ {\mathrm{\&lambda;}}_2\\ ...\\ {\mathrm{\&lambda;}}_L\end{array}& \left(\begin{array}{cccc}1& 2& ...& 2\\ 2& 4& ...& 4\\ ...& ...& ...& ...\\ 3& 1& ...& 2\end{array}\right)\end{array}.$

Wherein, Θ operator is defined:

$\mathrm{WL\&Theta;LP}=\mathrm{WP}=\mathrm{\&Theta;}\underset{k=1}{\overset{L}{\mathrm{\&Sigma;}}}{\mathrm{WL}}_{\mathrm{ik}}\&CenterDot;{\mathrm{LP}}_{\mathrm{kj}},$ Wherein:

${\mathrm{WP}}_{\mathrm{ij}}=\mathrm{\&Theta;}(\underset{k=1}{\overset{L}{\mathrm{\&Sigma;}}}{\mathrm{WL}}_{\mathrm{ik}}\&CenterDot;{\mathrm{LP}}_{\mathrm{kj}})=\mathrm{\&Theta;}\{({\mathrm{WL}}_{i1}\&CenterDot;{\mathrm{LP}}_{1j}),...,({\mathrm{WL}}_{\mathrm{iL}}\&CenterDot;{\mathrm{LP}}_{\mathrm{Lj}})\}=\left\{\begin{array}{cc}0& \mathrm{if}\&ForAll;{\mathrm{WL}}_{\mathrm{ik}}=0\&cap;{\mathrm{LP}}_{\mathrm{ik}}\&NotEqual;0\\ \min ({\mathrm{WL}}_{\mathrm{ik}}\&CenterDot;{\mathrm{LP}}_{\mathrm{kj}})& \mathrm{else}\end{array}\right.$

Wavelength-path matrix WP matrix is | W| × | P| ties up matrix, and its physical significance is the number of the wavelength channel that on passage Pj, residue is available.It reflects relation path between network node pair and path remained between wavelength available.λ i and Pj of the item correspondence of MaxWPij between node pair should be selected to distribute to business and to set up optical channel.Because in paths all between node pair, this route and wavelength layer mask have maximum available channel number.WL matrix in network and LP matrix can obtain very easily, and wherein LP matrix can utilize existing computational algorithm, calculated off-line.

Utilize wavelength and the routing problem of the dynamic service of optical transport network below matrix theory model analysis below, introduce its computational methods and step.

The existing business of random generation network, makes network wavelength-link metric to be:

$\mathrm{WL}=\begin{array}{cc}& \begin{array}{cccccc}{L}_1& L_2& & ...& & L_6\end{array}\\ \begin{array}{c}{\mathrm{\&lambda;}}_1\\ {\mathrm{\&lambda;}}_2\\ {\mathrm{\&lambda;}}_3\\ {\mathrm{\&lambda;}}_4\\ {\mathrm{\&lambda;}}_5\\ {\mathrm{\&lambda;}}_6\end{array}& \left(\begin{array}{cccccc}2& 3& 4& 6& 2& 0\\ 1& 2& 5& 2& 3& 3\\ 2& 5& 3& 2& 5& 3\\ 4& 2& 6& 2& 1& 3\\ 5& 2& 6& 2& 5& 4\\ 2& 0& 1& 5& 2& 3\end{array}\right)\end{array},$

That carrys out with WL matrix the business that analog network set up takies situation.Suppose that the connection requirement that dynamic service is set up is: A->C, namely node is between 3.

Calculation procedure is as follows:

(1) as follows to being numbered to the node of network:

1－{A,B}；2－{A,C}；3－{A,D}；4－{A,E}；5－{B,C}；

6－{B,D}；7－{B,E}；8－{C,D}；9－{C,E}；10－{D,E}；

(2) can all alternate routings satisfied condition between computing network node pair, calculate and number in order as follows:

Table 1 node is to contimuity meter

Find the node needing to set up business to paths all between A-C: P4, P5, P6, P7.List path-link metric (PL) and produce random network resource occupation matrix:

$\mathrm{LP}=\begin{array}{cc}& \begin{array}{cccc}{P}_4& P_5& P_6& P_7\end{array}\\ \begin{array}{c}{L}_1\\ L_2\\ L_3\\ L_4\\ L_5\\ L_6\end{array}& \left(\begin{array}{cccc}1& 1& 0& 0\\ 1& 0& 0& 1\\ 0& 1& 1& 0\\ 0& 0& 1& 1\\ 0& 0& 1& 1\\ 0& 1& 0& 1\end{array}\right)\end{array};\mathrm{WL}=\begin{array}{cc}& \begin{array}{cccccc}{L}_1& L_2& & ...& & L_6\end{array}\\ \begin{array}{c}{\mathrm{\&lambda;}}_1\\ {\mathrm{\&lambda;}}_2\\ {\mathrm{\&lambda;}}_3\\ {\mathrm{\&lambda;}}_4\\ {\mathrm{\&lambda;}}_5\\ {\mathrm{\&lambda;}}_6\end{array}& \left(\begin{array}{cccccc}2& 3& 4& 6& 2& 0\\ 1& 2& 5& 2& 3& 3\\ 2& 5& 3& 2& 5& 3\\ 4& 2& 6& 2& 1& 3\\ 5& 2& 6& 2& 5& 4\\ 2& 0& 1& 5& 2& 3\end{array}\right)\end{array}$

(3) wavelength-path matrix WP is calculated:

WP=WL Θ LP obtains:

$\mathrm{WP}=\begin{array}{cc}& \begin{array}{cccc}{P}_4& P_5& P_6& P_7\end{array}\\ \begin{array}{c}{\mathrm{\&lambda;}}_1\\ {\mathrm{\&lambda;}}_2\\ {\mathrm{\&lambda;}}_3\\ {\mathrm{\&lambda;}}_4\\ {\mathrm{\&lambda;}}_5\\ {\mathrm{\&lambda;}}_6\end{array}& \left(\begin{array}{cccc}2& 0& 2& 0\\ 1& 1& 2& 2\\ 2& 2& 2& 2\\ 2& 3& 1& 1\\ 2& 4& 2& 2\\ 0& 1& 1& 0\end{array}\right)\end{array}$

Under matrix W P represents current network, node is to the wavelength resource residue situation on all paths between 2.The wavelength X 6 that WP61=0 represents path P4 remaining wavelength available is that 0, WP52=4 represents that the residue channel of wavelength X 5 on path P5 between node pair is 4.In WP matrix, should select: MaxWPij=WP52, be node and set up optical channel between A-C, P5 path can be selected, adopt wavelength X 5.

(4) be service call distribution circuit P ₅and λ ₅, and refresh wavelength-link metric.

Calculate above and can find out, 1 ~ 3 step is all just complete calculating before business arrives, and only needs to calculate (4) (5), substantially increase computing time when business arrives.

Owing to have employed matrix model, this algorithm has feature:

(1) utilize matrix method for RWA algorithm Modling model, have simple and practical, existing matrix operation algorithm can be used and improve computational efficiency.

(2) to uneven resource network, as long as namely the different links of network have different optical fiber and support that the situation of the wavelength of different number is worth accordingly in WL matrix modifications.

(3) can the p-contimuity meter of knot modification be passed through, fixed route strategy, alternate routing strategy can be realized, and other relevant determinate strategy of routing.As the strategy such as restriction of routing weights.

(4), when calculating WP=WL Θ LP matrix, different optimization aim can be realized by self-defining Θ.

Stand-by channel calculates, for network reservation stand-by channel object is the survivability strengthening network.The ability of the service disconnection that the network resistance fault that is defined as network survivability causes or interference, namely the business carried in the resource broken down can be switched on other idling-resource by network after any fault of generation, makes network maintain the ability of an acceptable professional skill.The Survivability technology of network comprises network protection technique and recovery technology.Protection is by means of the network extra spare resource preset (as backup optical fiber and node device), only need switch the business to Protection path simply and get on during fault.Pretection switch technically reliable, rapidly, but waste Internet resources; Recovery from network, just dynamically finds idling-resource when fault occurs to transmit fault business.Recovery technology can make full use of Internet resources, and flexibility is better than protection mechanism, but recovery time is longer, and can not guarantee 100% recovery fault business.In powerline network, the general survivability adopting resist technology to strengthen network, introduces the stand-by channel collocation method that three kinds can be used for electric power optical transfer network below.

ILP model, network node does not have wavelength conversion capability, the wavelength capacities of given network link, be any two nodes of network to active and standby two static routing of configuration, and be each route assignment wavelength.Adopt following ILP model realization.

Input variable:

Nsd: connection request number.

L: the number of links of network.

W: the wavelength number of every bar link.

M={mi}, i=1 ..., Nsd:mi represents the number of active lanes that connection request i at least sets up.

N={ni}, i=1 ..., Nsd:ni represents the number of active lanes that connection request i sets up at most.

P: alternate routing set, number of routes with | P| represents.For realizing the configuration of stand-by channel, for each connection request, in set P, at least there are two mutually disjoint routes.

A={aij}: for | P| × Nsd ties up matrix, and aij=1 represents that route i can be connection request j route, otherwise aij=0.

B={bij}: for | P| × L ties up matrix, and bij=1 represents that route i is through link j, otherwise bij=0.

Decision variable:

C={cij}: for | P| × W ties up matrix, and cij=1 represents that wavelength j distributes to route i, otherwise cij=0.

The target of this ILP model maximizes the route sum that can set up, and target function is as follows:

$\mathrm{Maximize}:\underset{i}{\overset{\left|P\right|}{\mathrm{\&Sigma;}}}\underset{j=1}{\overset{W}{\mathrm{\&Sigma;}}}{c}_{\mathrm{ij}}$

Restrictive condition:

C ^TB≤1 _W×L(6)

m≤1 _1×WC ^TA≤n(7)

$\underset{j=1}{\overset{W}{\mathrm{\&Sigma;}}}{c}_{\mathrm{ij}},i=1...\left|P\right|---\left(8\right)$

c _ij∈{0,1},i＝1...|P|,j＝1...W(9)

Its Chinese style (6) ensures that on link, each wavelength can only be used once, and the wavelength of every each link of bar route meets consistency restriction; Formula (7) ensures as the number of routes of each connection request foundation is in [m, n] scope; Formula (8) ensures as each connection request sets up active and standby two routes of mutually disjointing; Formula (9) illustrates that cij is 1 or 0 variable.

1:1 shares backup radio frequency channel protection mechanism

For the connection request arriving network at random is dynamically found route and distributes wavelength, require to distribute active and standby two routes, the thought that 1:1 can be adopted to share backup radio frequency channel protection (SharedBackupPathProtection:SBPP) realizes.

The basic conception of SBPP is that stand-by channel must be separated with corresponding active channel (node and link all will be separated), but can shared network idle capacity between stand-by channel, is intended to save network wavelength resource.No matter which kind of fault appears in active channel, network can realize the recovery of business as required by the backup radio frequency channel pre-determined.Conceptually see, SBPP and 1:1 automatic protection switching (APS) is similar, unlike, if multiple active channels of SBPP are separated from each other, then the stand-by channel of these non-intersect active channels can shared network idling-resource.As shown in Figure 7, the reserve capacity of mutually disjointing on stand-by channel (in figure, dashed double represents) shared link 2-3 and 3-4 of active channel 1-9-4 and 2-9-8-5.

The various embodiments described above are only for illustration of the present invention, and wherein the structure, connected mode etc. of each parts all can change to some extent, and every equivalents of carrying out on the basis of technical solution of the present invention and improvement, all should not get rid of outside protection scope of the present invention.

Claims (8)

1. an OTN network planning method to set up in powerline network, it comprises the following steps:

Step 1: the state information upgrading current network, and discharge completed connection resource; Wait for new connection request, if new connection request, go to step 2;

Step 2: utilize shortest path first to search two mutually disjoint shortest paths, as active channel WP and the stand-by channel PP of connection request;

Step 3: for active channel and stand-by channel distribute wavelength resource, the ideological trends spare wavelength resource of application SBPP;

Step 4: if route symmetry is all successful, this connection request successful connection, otherwise refuse this connection request, return step 1.

2. OTN network planning method to set up in a kind of powerline network as claimed in claim 1, is characterized in that: the stand-by channel in described step 2 adopts the stand-by channel configuration based on P circle.

3. OTN network planning method to set up in a kind of powerline network as claimed in claim 2, is characterized in that: the described stand-by channel configuration based on P circle is as follows:

(1) network model: assuming that the link of electric power optical transfer network is two-way, and link capacity is fixed; Adopt directed graph G=(V, E) to represent network model, configuration directed cycle for the protection of, wherein V is network node collection, and E is link set, | V| and | E| represents the node total number of network and link sum respectively;

(2) P circle configuration: the configuration adopting the P circle of overall optimum method, overall optimum method is that in first Enumerate network topology, all circles are as alternative P circle collection, and recycling integral linear programming obtains optimized solution; Wherein, integral linear programming is referred to as ILP;

(3) routing and wavelength assignment algorithms: the first kind is that each node of network is all configured with wavelength shifter; Equations of The Second Kind is that each node of network does not configure wavelength shifter;

(4) after internet off-line configures P circle, each of circle uplink of enclosing for each P backs up wavelength accordingly to optical fiber is reserved, and finally, the wavelength of residue of network organization is all as the operation wavelength of network, and these wavelength all receive protection.

4. OTN network planning method to set up in a kind of powerline network as claimed in claim 3; it is characterized in that: in described step (1); owing to dynamically building circle protection dynamic service, there is larger time complexity; the method taked is the P circle collection of an off-line arrangement all link of energy protecting network; be each connection request searching route in real time during the network operation and distribute wavelength, specifically what time needing below consideration:

1. the P circle collection configured will ensure that there is oneself protection radio frequency channel on every bar limit, and namely each of every bar link at least belongs to circle uplink or the gap-bridging link that a circle concentrated by P circle to limit;

2. suitable routing policy;

3. suitable Wavelength Assignment strategy.

5. OTN network planning method to set up in a kind of powerline network as claimed in claim 3, is characterized in that: in described step (2), selects the configuration of ILP model, adopts following ILP model realization to configure:

Input set:

S: network edge collection; If network has | E| bar link, consider the amphicheirality of link, network edge collection dimension is then 2 × | E|;

P: alternative P circle collection, single P circle represents with p;

Input variable:

Ci: the cost of limit i unit capacity, setting ci=1;

during circle p energy edge protection i otherwise

circle p is through limit i otherwise

Output variable:

Np: representing that circle p needs the quantity of configuration, is nonnegative integer type variable;

Target function:

。

6. OTN network planning method to set up in a kind of powerline network as claimed in claim 4, is characterized in that: in described step (2), selects the configuration of ILP model, adopts following ILP model realization to configure:

Input set:

S: network edge collection; If network has | E| bar link, consider the amphicheirality of link, network edge collection dimension is then 2 × | E|;

P: alternative P circle collection, single P circle represents with p;

Input variable:

Ci: the cost of limit i unit capacity, setting ci=1;

during circle p energy edge protection i otherwise

circle p is through limit i otherwise

Output variable:

Np: representing that circle p needs the quantity of configuration, is nonnegative integer type variable;

Target function:

。

7. OTN network planning method to set up in a kind of powerline network as described in claim 3 or 4 or 5 or 6, it is characterized in that: in described step (3), when described each node of first kind network is all configured with wavelength shifter, concrete route Wavelength Assignment strategy is as follows:

If total Q circle concentrated by the P circle that off-line arrangement is good, the Protection capacity of circle p is Dp, and initial value is set to 0; Assuming that every bar link respectively all has M unit capacity to limit, the idle capacity number Fi of limit i represents, Fi=M time initial, and the capacity requirement of connection request r is designated as demandr, then:

1. when connection request r arrives network, the weights on the adjustment whole limit of network, the weights on limit can be expressed as:

2. shortest path first Dijkstra ' s is used to calculate the operating path Pathr of connection request r; If can Pathr be found, and there are enough working capacitys, continue the and 3. walk, otherwise refuse this connection request;

3. be every bar limit distribution Protection capacity of operating path Pathr: if the limit j of Pathr can by the potential protection of Ij (Ij≤Q) individual circle, this Ij circle composition set Ctemp, upgrade the Protection capacity of respectively circle in Ctemp, more new formula is,

Wherein D' _pthat circle p arrives the Protection capacity before network at connection request r, the working capacity of front j by circle p protection arriving network at connection request r; If D _p>D' _p, then the Protection capacity increasing circle p is needed;

If 4. this Ij circle energy edge protection j, upgrades the conservation status of each circle opposite side j in set Ctemp, wherein,

Upgrade C _tempin the Protection capacity of certain circle time, if the idle capacity of residue of network organization can not meet the Protection capacity of circle needed for p, then this circle can not edge protection j, will it from gathering C _tempmiddle deletion, upgrades I _j=I _j-1; If I _j>0, each link capacity of network is got back to network and is upgraded C _tempin state before each circle Protection capacity, and return the and 3. walk; If I _j=0, this connection request can not be protected, refuses this connection request, and each link capacity of network gets back to the state before connection request r arrival network;

5. and if only if Path _revery bar limit all protected, accept this connection request, otherwise refuse this connection request, and each link capacity of network is got back to connection request r and is arrived state before network.

8. OTN network planning method to set up in a kind of powerline network as described in claim 3 or 4 or 5 or 6, it is characterized in that: in described step (3), described each node of Equations of The Second Kind network does not configure wavelength shifter: when network node does not have wavelength conversion capability, and the foundation of active and standby radio frequency channel then needs to meet Wavelength continuity constraint; Active channel and stand-by channel want one_to_one corresponding.