CN105207859B - OTN network planning setting method in a kind of powerline network - Google Patents
OTN network planning setting method in a kind of powerline network Download PDFInfo
- Publication number
- CN105207859B CN105207859B CN201410268400.0A CN201410268400A CN105207859B CN 105207859 B CN105207859 B CN 105207859B CN 201410268400 A CN201410268400 A CN 201410268400A CN 105207859 B CN105207859 B CN 105207859B
- Authority
- CN
- China
- Prior art keywords
- network
- wavelength
- circle
- connection request
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000013439 planning Methods 0.000 title claims abstract description 21
- 238000004422 calculation algorithm Methods 0.000 claims description 73
- 230000003287 optical effect Effects 0.000 claims description 33
- 239000013307 optical fiber Substances 0.000 claims description 21
- 238000006243 chemical reaction Methods 0.000 claims description 6
- 238000006073 displacement reaction Methods 0.000 claims description 6
- 230000008520 organization Effects 0.000 claims description 6
- 238000012546 transfer Methods 0.000 claims description 6
- 239000012141 concentrate Substances 0.000 claims description 5
- 238000012217 deletion Methods 0.000 claims description 3
- 230000037430 deletion Effects 0.000 claims description 3
- 238000004064 recycling Methods 0.000 claims description 2
- 238000013461 design Methods 0.000 abstract description 12
- 239000011159 matrix material Substances 0.000 description 58
- 238000009826 distribution Methods 0.000 description 14
- 238000010586 diagram Methods 0.000 description 12
- 239000000835 fiber Substances 0.000 description 11
- 238000005457 optimization Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 8
- 238000011084 recovery Methods 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 230000000903 blocking effect Effects 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 5
- 230000002829 reductive effect Effects 0.000 description 5
- 230000003044 adaptive effect Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 238000000354 decomposition reaction Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 239000000203 mixture Substances 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000000926 separation method Methods 0.000 description 2
- 230000002457 bidirectional effect Effects 0.000 description 1
- 238000004040 coloring Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013440 design planning Methods 0.000 description 1
- 230000006866 deterioration Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000000465 moulding Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000036961 partial effect Effects 0.000 description 1
- 230000007420 reactivation Effects 0.000 description 1
- 230000008263 repair mechanism Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Optical Communication System (AREA)
Abstract
The present invention relates to OTN network planning setting methods in a kind of powerline network comprising following steps: step 1: updating the status information of current network, and discharge completed connection resource；New connection request is waited, if new connection request, goes to step 2；Step 2: searching two mutually disjoint shortest paths, active channel WP and stand-by channel PP as connection request using shortest path first；Step 3: wavelength resource is distributed for active channel and stand-by channel, using the ideological trends spare wavelength resource of SBPP；Step 4: if route symmetry is all successful, otherwise which refuses the connection request, return step 1.The present invention can be improved OTN network planning setting timeliness and level, realizes the standardization of OTN network design, standardization, rationalizes.The present invention can apply in powerline network planning field extensively.
Description
Technical field
The present invention relates to a kind of powerline network programme setting methods, especially with regard in a kind of powerline network
The programme setting method of OTN network.
Background technique
To promote powerline network transmission capacity, fully optimized network structure needs to carry out based on OTN (optical transfer network)
The backbone transport networks technological evolvement of technology and the research of networking model.It works, is needed according to not same district in face of a large amount of network settings
The network structure and capacity requirement in domain carry out OTN network radio frequency channel calculation method, transmission performance calculation method of parameters and equipment in a deep going way
The research of setting method, and OTN network design is carried out on this basis.
In the OTN network planning setting in conventional electric power communication network, generally still follow original engineer's mode,
Cause information-based supplementary means relatively weak.In addition, since OTN transmission net is still in the first of development in electric power backbone communications
The grade stage, non-large-scale application, therefore molding design planning information system is also at each equipment manufacturer's internal applications stage.So
And with the development of OTN transmission net, multi-vendor equipment is run on consolidated network, and the scale of network is increasing, the knot of network
Structure becomes increasingly complex, if still following original mode in network planning setting method, repetitive operation is especially more, Er Qiewu
Method is reasonable, economy, quickly and accurately obtains planning network scheme, therefore will increase because of investment risk caused by planning setting, prolongs
Calipers delineates the period set.
Summary of the invention
In view of the above-mentioned problems, being mentioned the purpose of the present invention is combining power communication practical business demand and power communication feature
One kind can be improved OTN network planning setting timeliness and level out, realize what OTN network design standardized, and standardized, rationalizing
OTN network planning setting method in powerline network.
To achieve the above object, the present invention takes following technical scheme: the OTN network planning is set in a kind of powerline network
Set method comprising following steps: step 1: updating the status information of current network, and discharge completed connection resource；Deng
To new connection request, if new connection request, goes to step 2；Step 2: searching two mutually not using shortest path first
The shortest path of intersection, active channel WP and stand-by channel PP as connection request；Step 3: for active channel and spare wave
Road distributes wavelength resource, using the ideological trends spare wavelength resource of SBPP；Step 4: if route symmetry is all successful,
Otherwise the connection request, return step 1 are refused in the connection request successful connection.
Stand-by channel in the step 2 uses the stand-by channel configuration enclosed based on P.
The stand-by channel configuration based on P circle is as follows: (1) network model: it is assumed that the link of electric power optical transfer network is double
To, and link capacity is fixed；Network model is indicated using digraph G=(V, E), configuration directed cycle is for protecting, and wherein V is
Network node collection, E are link sets, | V | and | E | respectively indicate the node total number and link sum of network；(2) it P circle configuration: uses
The configuration of the P circle of overall optimum method, overall optimum method are that alternately P is enclosed all circles in first Enumerate network topology
Collection, the solution for recycling integral linear programming to be optimized；Wherein, integral linear programming is referred to as ILP；(3) routing wavelength point
With algorithm: the first kind is that each node of network is all configured with wavelength shifter；Second class is that wavelength is not configured in each node of network
Converter；(4) after internet off-line has configured P circle, corresponding backup wave is reserved to optical fiber for each of circle uplink of each P circle
Long, finally, the wavelength of residue of network organization is all used as the operation wavelength of network, and these wavelength are all protected.
In the step (1), there is biggish time complexity, the method taken due to dynamically building circle protection dynamic service
It is that off-line arrangement one P that can protect all links of network encloses collection, when network operation is that each connection request finds routing in real time
And wavelength is distributed, specifically need to consider the following: the P circle collection 1. configured will guarantee that each edge has the protection radio frequency channel of oneself,
That is each circle uplink or gap-bridging link at least belonging to P circle to side and concentrating a circle of each of the links；2. suitable routing policy；
3. suitable Wavelength Assignment strategy.
In the step (2), select the configuration of ILP model, configured using following ILP model realization: input is gathered: S: network edge
Collection；If network has | E | link, it is contemplated that the amphicheirality of link, network edge collection dimension is then 2 × | E |；P: alternative P encloses collection, single
A P circle is indicated with p；Input variable: ci: the cost of side i unit capacity sets ci=1；Circle p can protect side
When iOtherwiseP is enclosed by otherwise output variable when the i of side: np: table
Show the quantity that circle p is needed to configure, is nonnegative integer type variable；Objective function: limitation
Condition:
It is specific to route wavelength point when each node of first kind network is all configured with wavelength shifter in the step (3)
As follows with strategy: setting off-line arrangement, good P circle concentrates shared Q circle, and the Protection capacity for enclosing p is Dp, and initial value is set as 0；It is assumed that
Each Xiang Bianjun of each of the links has M unit capacity, and the idle capacity number of side i is indicated with Fi, Fi=M when initial, connection request r's
Capacity requirement is denoted as demandr, then: 1. when connection request r reaches network, adjusting the weight on network whole side, the weight on side
It can indicate are as follows:
2. calculating the operating path Pathr of connection request r with shortest path first Dijkstra ' s；If can find
Pathr, and have enough displacement volumes continues the and 3. walks, otherwise refuses the connection request；3. for the every of operating path Pathr
Distributing Protection capacity: if Pathr while j can by the potential protection of a circle of Ij (Ij≤Q), this Ij circle composition set Ctemp,
The Protection capacity that respectively encloses in Ctemp is updated, more new formula is,
Wherein D'pIt is the Protection capacity for enclosing p before connection request r reaches network,It is to reach net in connection request r
The displacement volume that the front j of network is protected by circle p；If Dp>D'p, then need to increase the Protection capacity of circle p；4. if this Ij circle energy
Side j is protected, the conservation status for respectively enclosing opposite side j in set Ctemp is updated, wherein
Update CtempIn some circle Protection capacity when, if the idle capacity of residue of network organization be not able to satisfy circle p needed for guarantor
Capacity is protected, then the circle cannot protect side j, by it from set CtempMiddle deletion updates Ij=Ij-1；If Ij> 0, each chain appearance of a street of network
Amount returns to network and updates CtempIn respectively enclose the state before Protection capacity, and return to the and 3. walk；If Ij=0, which cannot
It is protected, refuses the connection request, each link capacity of network returns to the state before connection request r arrival network；5. when and only
Work as PathrEach edge all protected, receive the connection request, otherwise refuse the connection request, and each link capacity of network returns
State before reaching network to connection request r.
In the step (3), wavelength shifter is not configured in each node of the second class network: when network node does not have
When 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 will be one by one
It is corresponding.
The invention adopts the above technical scheme, which has the following advantages: 1, the present invention is due to the electric power spy that combines closely
Color and power business demand, it is logical by information model modeling, network analog, computer according to the technical principle of OTN optical transfer network
The technologies such as letter, provide a set of application method in conjunction with the peculiar demand of electric power, therefore can efficiently solve in the prior art
Not the problem of not being suitable for the OTN network planning setting method of power communication feature.2, due to the distinctive application of the method for the present invention
Method, verified by the calculating, network evaluation, nargin of the parameters to OTN network design etc., realize the conjunction of design scheme
Reason, economic setting, have greatly saved construction investment.3, the method for the present invention can be realized basic with representative network or real network
The network planning and deduction of identical environment provide an assessment by representative network or real network situation for designer
Analysis is accurate, authenticity is good, lifelike image, convenient, flexible interactive auxiliary setting method, and it is intuitively quick that network may be implemented
Setting.The present invention can apply in powerline network planning field extensively.
Detailed description of the invention
Fig. 1 is directional P-cycle protection philosophy schematic diagram of the invention；
Fig. 2 is that the present invention is the P circle protection philosophy schematic diagram for meeting Wavelength continuity constraint；
Fig. 3 is network topology decomposition diagram of the invention；
Fig. 4 is FR routing subproblem schematic diagram of the invention；
Fig. 5 is FAR routing subproblem schematic diagram of the invention；
Fig. 6 is ASCPR routing subproblem schematic diagram of the invention；
Fig. 7 is SBPP protection philosophy schematic diagram of the invention.
Specific embodiment
The present invention is described in detail below with reference to the accompanying drawings and embodiments.
OTN network planning setting method in powerline network of the invention specifically includes the following steps:
Step 1: updating the status information of current network, and discharge completed connection resource.New connection request is waited,
If new connection request, goes to step 2；
Step 2: searching two mutually disjoint shortest paths, the operating wave as connection request using shortest path first
Road WP and stand-by channel PP.
Step 3: distributing wavelength resource for active channel and stand-by channel, provided using the ideological trends spare wavelength of SBPP
Source.
Step 4: if route symmetry is all successful, otherwise which refuses the connection request.
Return step 1.
Stand-by channel in above-mentioned steps 2 uses the stand-by channel configuration enclosed based on P: P encloses (preconfiguration
Cycle, p-cycle) it is a kind of very outstanding mesh network protection mechanism, it not only has the fast quick-recovery advantage of looped network,
Also with the high resource utilization advantage of mesh network.P circle protection is preset using link circuit resource idle in mesh network
Circular passage, the quick protection of mesh network may be implemented in it, while it is most short to allow operating path to select on Internet resources figure
Direct route.Concrete configuration is as follows:
(1) network model
It is assumed that the link of electric power optical transfer network is two-way, and link capacity is fixed.It is indicated using digraph G=(V, E)
Network model, configuration directed cycle is for protecting, and wherein V is network node collection, and E is link set, | V | and | E | respectively indicate network
Node total number and link sum.One directional P-cycle can provide a protection channel to enclose the reverse edge of uplink, can be bridging
Link bidirectional side respectively provides a protection channel.As shown in Figure 1, directional P-cycle (1 → 2 → 3 → 4 → 1) is the reversed of circle uplink
Side 2 → 1,3 → 2,4 → 3 and 1 → 4 provides a protection channel, if the protection channel on side 2 → 1 is 2 → 3 → 4 → 1；The circle is protected
When protecting gap-bridging link 2-4, protection channel 2 → 3 → 4 is provided for side 2 → 4, provides protection channel 4 → 1 → 2 for side 4 → 2.
In dynamic environment, business successively reaches network at random, thus the connectivity request message of unpredictable business.Consider
There is biggish time complexity to circle protection dynamic service is dynamically built, the method that can be taken is that off-line arrangement one can catch net
The P of all links of network encloses collection, and when network operation is that each connection request is found and routes and distribute wavelength in real time, specifically needs to consider
The following:
1. the P circle collection configured will guarantee that each edge has the protection radio frequency channel of oneself, i.e. each of each of the links at least belongs to side
The circle uplink or gap-bridging link of a circle are concentrated in P circle；
2. suitable routing policy；
3. suitable Wavelength Assignment strategy.
(2) P circle configuration: the configuration of P circle can substantially be divided into two major classes: overall optimum method and heuristic.It is complete
Full optimal method is that alternately P circle collects all circles in first Enumerate network topology, and integral linear programming (ILP) is recycled to obtain
The solution of optimization.Heuristic is first to calculate the relatively good alternative circle of a part of performance, then in conjunction with actual disposition demand,
By the biggish alternative preferential configuration of circle of real protection ability.When off-line arrangement P circle collection, target is to seek allocation optimum, without
Consider setup time, therefore the present invention selects the configuration of ILP model.It is configured using following ILP model realization.
Input set:
S: network edge collection.If network has | E | link, it is contemplated that the amphicheirality of link, network edge collection dimension is then 2 ×
|E|；
P: alternative P encloses collection, and single P circle is indicated with p.
Input variable:
Ci: the cost of side i unit capacity, the present invention set ci=1；
When circle p can protect side iOtherwise
When enclosing p by side iOtherwise
Output variable:
Np: indicating the quantity that circle p is needed to configure, and is nonnegative integer type variable.
Objective function:
Restrictive condition:
The target of the ILP Optimized model is to minimize deployment cost, and deployment cost is that the P circle of configuration concentrates the jump of all circles
The sum of number, the restrictive condition of model are to guarantee that the two-way side of each of the links is all protected.
(3) routing and wavelength assignment algorithms
The first kind: each node of network is all configured with wavelength shifter.
If network whole node has wavelength conversion capability, when network operation, is not required to consider the distribution of wavelength, as long as chain
There are the foundation that connection request can be realized in idle capacity for road.To improve resource utilization, the guarantor of each P circle is dynamically distributed
Protect capacity.Specific routing Wavelength Assignment strategy is as follows:
If the good P circle of off-line arrangement concentrates shared Q circle, the Protection capacity for enclosing p is Dp, and initial value is set as 0.It is assumed that every
Each Xiang Bianjun of link has M unit capacity, and the idle capacity number of side i is indicated with Fi, Fi=M when initial, the capacity of connection request r
Demand is denoted as demandr.
1. adjusting the weight on network whole side when connection request r reaches network, the weight on side can be indicated are as follows:
2. calculating the operating path Pathr of connection request r with shortest path first Dijkstra ' s.If can find
Pathr, and have enough displacement volumes continues the and 3. walks, otherwise refuses the connection request.
3. each edge for operating path Pathr distributes Protection capacity.If the side j of Pathr can be latent by a circle of Ij (Ij≤Q)
It is protecting, this Ij circle forms set Ctemp, the Protection capacity respectively enclosed in update Ctemp, and more new formula is,
Wherein D'pIt is the Protection capacity for enclosing p before connection request r reaches network,It is to reach net in connection request r
The displacement volume that the front j of network is protected by circle p.If Dp>D'p, then need to increase the Protection capacity of circle p.
4. updating the conservation status for respectively enclosing opposite side j in set Ctemp if this Ij circle can protect side j, wherein
Update CtempIn some circle Protection capacity when, if the idle capacity of residue of network organization be not able to satisfy circle p needed for guarantor
Capacity is protected, then the circle cannot protect side j, by it from set CtempMiddle deletion updates Ij=Ij-1.If Ij> 0, each chain appearance of a street of network
Amount returns to network and updates CtempIn respectively enclose the state before Protection capacity, and return to the and 3. walk；If Ij=0, which cannot
It is protected, refuses the connection request, each link capacity of network returns to the state before connection request r arrival network.
5. and if only if PathrEach edge all protected, receive the connection request, otherwise refuse the connection request, and
Each link capacity of network returns to the state before connection request r arrival network.
Second class: wavelength shifter is not configured in each node of network.
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 will correspond.P is enclosed and is protected, as shown in Fig. 2, 1-2-3-4-5-1 is a P circle.Specifically
Way is to enclose upper each of the links to use the λ 1 and interior fibre λ 2 of outer fibre as operation wavelength respectively, at the same time, the λ 2 of outer fibre and interior
Fine λ 1 is, respectively, used as the protection wavelength of the operation wavelength λ 2 of interior fibre and the operation wavelength λ 1 of outer fibre, and gap-bridging link is not required to reserved guarantor
Protect wavelength.
(4) after internet off-line has configured P circle, corresponding backup is reserved to optical fiber for each of circle uplink of each P circle
Wavelength, finally, the wavelength of residue of network organization is all used as the operation wavelength of network, and these wavelength are all protected.Such as Fig. 3 institute
Show, figure (a) original topological arrangement P circle protection；Scheme (b) and reserve corresponding backup wavelength on P circle, constitutes a protection topological diagram；
Scheme in (c), remove the backup wavelength of network reservation, remaining wavelength constitutes a work topological diagram.For single link failure, by
The protection philosophy of Fig. 3 analysis is it is found that protect the recovery of the upper any single link failure of topological realization work topology.Business arrives at random
Up to after network, routing algorithm job search path need to be only run in the work topology of network.
In summary it is found that the present invention is the diversified OTN network planning algorithm based on design rule engine, join calculating
The input design rule engine such as the polymorphic type equipment templates of several, more producers, basic network model, representative network cases of design, leads to
Cured algorithm for design and design rule in engine are crossed, the design side of network topology and network node configuration list is exported
Case, different configuration lists when as in same website using devices from different manufacturers, and different configuration lists are relatively.It is logical
It can determine the final planning and design scheme of network after crossing option screening, and the scheme after determining is appeared in court but also as typical case increase
In example library and rule base, to realize the self study of system engine rule.
It is previously given that dynamic service flow, which refers to the connection request between node pair not, but as time change is dynamic
What state arrived, it can be removed again after connection establishes and is kept for a period of time.The requirement of real-time of this kind of business is higher, target
It is quick resource distribution to be carried out for connection request, and network blocking probability is reduced by reasonable routing policy as far as possible.To dynamic
For Business Stream, since new connection is constantly accepted, and effective connection at present is constantly released, and the state of network is in the time
Upper is also dynamic change.Thus, global optimization can not be carried out to the routing wavelength configuration in entire observing time, examined simultaneously
Consider real-time limitation, usually requires that algorithm is simple and efficient.
The quality of Dynamic RWA algorithm and it can quickly establish service connection and have close relationship, due to wavelength resource
Finiteness, and not all business can be responded timely, the problem of sometimes also will appear network congestion.Good RWA
Algorithm can make full use of existing Internet resources, as quickly as possible connection business, meet the needs of business.Therefore Dynamic RWA
Optimization aim be exactly to realize maximum connected ratio in the limited situation of resource, reduce average blocking rate.Electric power of the invention
The mathematical description of OTN network planning setting method is as follows in communication network:
(1) known conditions: network physical topological structure, business load, service connection duration.
(2) it requires the function of realizing: finding the relatively reasonable scheme of selection route symmetry.
(3) constraint condition: the limitation of number of fibers, the limitation of wavelength number, Wavelength continuity constraint.
(4) objective function: network be averaged blocking rate minimum.
In catenet, solve the problems, such as that RWA is difficult to realize inside the regular hour.It is most of at present to study all
It is 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 routing subproblem and Wavelength Assignment subproblem by b) larger network.
When solving serial RWA algorithm, Route Selection subproblem is divided into two stages: search phase and choice phase.Search for rank
Section first establishes request to all connections and presses certain rule compositor, then calculates alternative path collection in order for each connection request
It closes；Choice phase is to select a suitable path from the optional path set that the search phase establishes to establish connection.Generally,
Searching algorithm mainly has: 1) according to link metric be each optical path request calculate shortest path, routine weight value be it is fixed or
It is as the optical path number that oneself establishes in network changes；2) alternative road of the k shortest path as optical path is calculated for each request
Diameter set, then selection algorithm is executed, greedy algorithm, the i.e. optional path set to the request of each optical path can be used in the choice phase
According to certain rule compositor (such as Random, First-fit, Longest path-first, Shortest-path-first etc.
Sequentially), and in order Wavelength assignment algorithm is executed to every alternative path, the apportioning cost returned according to Wavelength assignment algorithm is therefrom
Select optimal that path.
Wavelength Assignment subproblem is then the Wavelength Assignment scheme that a local optimum is found on given path, so that wave
Long utilization rate reaches highest.Common allocation algorithm has: 1) is arranged according to certain rule using greedy algorithm wavelength available set
Sequence (such as Random, First-fit, Most-used, Least-used etc.), and scanning wavelength set in sequence are every one by one
Paths distribute wavelength until successfully distributing；2) using heuristic algorithm, (such as vertex coloring algorithm, genetic algorithm, taboo are searched
Rope algorithm etc.) consider influencing each other for Wavelength Assignment between different paths, modifying Wavelength Assignment scheme repeatedly improves total wavelength
Utilization rate, until being unable to improve.
If the scale of network be not it is very big, can be complete by routing and one step of Wavelength Assignment based on certain mathematical model
At such RWA algorithm is known as route symmetry parallel algorithm.Solves the problems, such as parallel RWA problem be it is current most by
The algorithm of approval has document it is proposed that disposably solving the problems, such as RWA problem using hierarchical diagram.Layered graph model is
Network physical topology is replicated W layers, one wavelength plane of each layer of correspondence.Any one light connects is from source node, every
The routing for reaching destination node is found in a wavelength plane, and each of the links only allow a light-path to pass through.If in some wave
Routing is found in long plane, just assigns corresponding routing corresponding wavelength.Wavelength continuity requirement was thus not only met, but also full
Foot different channels distribution limitation.Layered graph model can simplify RWA problem, and different plane levels corresponds to different wavelength,
As long as being found in hierarchical diagram with the original allocated disjoint light-path in side, so that it may distribute an idle wave for it
It is long.
Although the parallel algorithm using layered graph model can be solved preferably, with the increase of network size,
The algorithm complexity exponentially of layered graph model increases, and is highly difficult, institute in this way for the RWA for solving large scale network
It is all RWA problem to be splitted into two routing subproblems respectively and Wavelength Assignment subproblem solves respectively with the algorithm more proposed.
Subproblem is routed, routing policies refer to selects an optimization for newly arrived business between Service Access point
Physics routing.For routing subproblem, it is normally based on shortest route (Shortest Path) and is chosen.Document mentions at present
Routing subproblem strategy out usually may include 3 kinds of strategies: (1) fixed route routing policy (Fixed Routing).To appoint
A fixed available routing is determined between meaning node pair, this process is completed before network service reaches.When business reaches,
Service selection on routing thus by Different Optimization target optimizes wavelength, when no wavelength available, business obstruction.The routing is logical
It is often to be determined by Dijksta or Forld algorithm.(2) adaptive alternate routing routing policy (Adaptive Alternated
Routing).To a plurality of alternate routing of pre-determining between arbitrary node pair.It, will be in a plurality of optional alternate routing when business reaches
An optimal routing is adaptively chosen, and distributes wavelength.(3) fixed alternate routing routing policy (Fixed Alternated
Routing).A plurality of spare available routing is determined to business between arbitrary node pair.It, will be preferential suitable by routing when business reaches
Sequence (shortest route) distributes to business, when business obstruction when, select time short circuit by distribution method.
In above-mentioned three kinds of route selecting methods, tactful (1) fixed route routing method selection route time is most short, because it is being distributed
When routing, resource occupying state is not considered, and fixed route can precalculate offline, so the algorithm the time it takes
Cost is minimum.But the routing between node pair can not be adaptively adjusted with the dynamic mapping of network service, and carry out traffic engineering
Control, therefore will lead to the deterioration of network performance, increase network blocking probability.So the routing policy of fixed route is suitable for net
Network service distribution is uniform, the uniform situation of the business of arrival.Tactful (2) adaptive alternate routing routing policy best performance,
Because it is when distributing routing, the occupied state of the Internet resources of consideration.Before network service arrival, Dijksta is pressed between node
Algorithm calculates shortest route, and Dijksta algorithm is reused after erasing shortest route resource, a plurality of between calculate node pair
Alternate routing.When business reaches, according to the current resource occupation state of network, the wavelength in sufficiently more a plurality of alternate routing divides
With strategy, the optimal distributing scheme of the business is obtained.So improving network performance, the blocking probability of network is reduced.Therefore, it
Time longest best in three kinds of allocation plan kind effects, but calculating.Tactful (3) fixed alternate routing routing policy (Fixed
Alternated Routing) it is between first two strategy, it partially considers the state of network, and performance is between the above two
Between.
Due to separating routing issue and assignment of wavelength, the time complexity of RWA algorithm is reduced.Meter is routed simultaneously
Calculating usually can be with off-line calculation, i.e., router-level topology is completed before network service arrival, and calculating is directly utilized when business reaches
Route results save router-level topology information so usually this needs network to establish relevant Routing information database.Alternate routing
Number it is related with the Connected degree of network.
When fixed routing, when shortest route there are it is a plurality of when, establish the shortest route algorithm of optimization.The algorithm is to solve
When how there are choose optimal shortest path when a plurality of shortest path between network node pair.The algorithm description is as follows:
Shortest route set between enabling P represent all nodes pair.L represents the two-way link set of network, | L | represent the number of set.l
Represent a link.Enable indicator function: Xpl=1 indicates the shortest path p that link l belongs to, otherwise Xpl=0.Define link l's
Load ρ (l)=Σp∈PxplThe average load of each of the linksFor all links, sample variance
Are as follows:
Sample variance embodies the balanced degree of link load.Variance ν shows that more greatly the load gap between link is bigger.This
Sample when main controlled node to each pair of node calculate a plurality of shortest route when, to each pair of node to randomly select choose a shortest path
By then successively attempting other shortest routes between each pair of node pair, obtaining new as initial shortest route collection P
Shortest route collection P '.The sample variance for working as P ' is less than the sample variance of original P, and P ' retains.Until all routings are attempted, obtain
The smallest sample variance of the shortest route of whole network.
Fixed Routing (fixed route).This is a kind of Routing Algorithm the simplest in Route Selection.It is so-called solid
Fixed, the selection path as between nodes fixes in advance, when there is connection requirement, directly uses and has connected
Good path.After network topology structure is known, so that it may according to standard shortest path algorithm (such as dijkstra's algorithm and
Bellman-ford algorithm) it is the fixed optical channel of each node distribution.Communication during the network operation, between two nodes
What connection was always established.
As shown in figure 4, node 1 arrives node 5, to first pass through node 3 and arrive node 5 again.Described fixed route selection algorithm compared with
To be simple, but need more wavelength resource.And when flow is dynamic, if having Wavelength conflict, due to not substituting
Routing, so serious blocked-flow can be generated.It can thus be seen that fixed route selection algorithm does not have repairing for link failure
Reactivation power.
FAR (FixedAlternate Routing, fixed alternate routing).Each node stores Yi Zhanglu in network
By table, this table thus node to other nodes Path selection, wherein having as the shortest route of work optical channel and as standby
With the routing of optical channel.Alternate routing is generally not across the link section of Work route, i.e., they are physically separation, so
This mechanism, which is called, does link disjoint or side separation mechanism.
As shown in figure 5, the alternate routing of node 1 to 5 successively passes through 1,2,4,5 nodes.
The advantage of this routing method is relatively simple and has link failure repair mechanism, compared with fixed routing method, stream
The probability being blocked is measured to be substantially reduced.
ASCPR (AdaptiveShorestCostPathRouting, adaptive Shortest path routing) is according to network-like
State and dynamic routing method.The cost of unappropriated link is labeled as l, and the cost of occupied link is labeled as ∞, such as
Shown in Fig. 6.
When node receives connection request, the selection the smallest routing of cost first.If it is such routing have it is a plurality of, at random
Selection wherein one.It can be seen that this route selecting method is suitable for the network with wavelength convert function, when Wavelength conflict occurs
When, wavelength available is converted to solve, and optical channel need not meet the limitation of wavelength consistency.
Wavelength Assignment subproblem, under dynamic network Business Stream, corresponding optimization aim is the blocking probability of selection connection.
Because of the uncertainty of the light-path in network, other than the lesser network of scale, all wavelengths route optical network is required
Some control functions can be completed in the node of network.When establishing a light connects, it is necessary to consider RWA problem.Route assignment
Process is light connects request one light-path of distribution of specified source node and destination node and passes through in setting network node first
Photoswitch establish this access.And Wavelength Assignment includes an available wavelength being distributed to a connection and transmitting station
With receiving station be tuned on given wavelength.
Wavelength Assignment has to comply with following two limitation:
1, Wavelength continuity constraint (Wavelength Continuity): if not can be carried out wavelength convert, one
Optical channel must distribute identical wavelength on all chain roads that it is routed.
2, different wave length distribution limitation (Distinct Channel Assignment): on a given chain road, two
A optical channel cannot distribute identical wavelength.
There are many kinds of existing Wavelength assignment algorithms, such as random distribution method (R, Random), first-fit algorithm
First.Fit (FF), least recently used algorithm (LU, Least-Used), recently most-often used algorithm (MU, Most-Used),
Minimum product method (M P, Min-Product), global maximum and algorithm (MS, Max-Sum), relative capacity loss method (RCL,
Relative Capacity Loss), minimum influence (LI, Least Influence) algorithm, it is relatively minimal influence (RLI,
Relative Least Influence) algorithm, Wavelength reservation (RSV, Reservation) method and protection thresholding (TH R,
Threshold) algorithm.
(1) wavelength available, then random selection first random distribution method (R, Random): are found from all network links
One of those distributes to optical channel.This algorithm is simple, insensitive to the real-time status of whole network.
(2) adjustment procedure (FF, First-Fit) for the first time: all wavelengths in network are numbered, and search for idler further according to number
It is long, find first free wavelength is given into optical channel.Adjustment procedure need not also understand the real time information of whole network for the first time, and
The all wavelengths in network are needed not search for, thus calculation amount is also just smaller, dispensing rate is also very fast.
(3) least recently used algorithm (LU, Least-Used): preferential to select according to the occupied situation of network medium wavelength
It takes in wavelength set by the least wavelength of access times.LU makes the utilization rate of each wavelength be averaged, i.e., network flow
It is evenly distributed on each wavelength.But needing to record the dynamic use information of network, the storage resource that algorithm needs is more, together
When, computation complexity is also higher.
(4) nearest most-often used algorithm (MU, Most-Used): MU preferentially selects the highest wavelength of nearest frequency of use, therefore
Network flow can be concentrated on the wavelength of fraction, wavelength number needed for making network is reduced.
(5) minimum product method (MP, Min-Product): MP algorithm is suitable for multi fiber net, first to wave all in network
Long number, sequence by number calculateWherein, Dc(l, ω) indicates the channel that wavelength w is occupied on link l
Number.Preferential selection first can make DcThat the smallest wavelength of (l, ω) value.
(6) it global maximum and algorithm (MS, Max-Sum): first calculates and occupies w in total number of fibers and l on link l
The difference between the two is defined as idle capacity of the wavelength w on l, remembered Lc (l, w) by the number of fibers of wavelength.This formula calculates network
In each chain road idle capacity value, preferential selection can wherein make that maximum wavelength of idle capacity.
(7) relative capacity loss method (RCL, Relative Capacity Loss): compared to MS algorithm, RCL algorithm will
It distributes influence of some wavelength for other accesses and is defined as relative value and not absolute terms, thus the performance of RC algorithm is better than MS
Algorithm.
(8) minimum influence (LI, least Influence) algorithm: LI algorithm is when distributing wavelength, always selection pair
The foundation of other relevant light paths of the whole network causes that the smallest wavelength of the total number of bottleneck link.Thus by sub-distribution wavelength to the whole network
Caused by influence reduce.
(9) relatively minimal influence (RLI, Relative Least Influence) algorithm: relative to LI algorithm, RLI is micro-
When the optical path request distribution wavelength of letter, on the whole network, other links influence relatively minimal wavelength for selection.
(10) algorithm and protection thresholding (THR, Threshold) algorithm: RSV and THR algorithm is by protecting longer optical channel
Foundation so that the fairness of network is improved.Wavelength reservation algorithm is that a plurality of optical path has reserved one in some links
Partial wave is long, improves the connected ratio of optical path.Protect threshold algorithm really only when the wavelength available number of chain road is greater than preset
When threshold value, wavelength just is distributed to single-hop optical path, otherwise refuses the connection of single-hop optical path, so that multi-hop optical path obtains
Protection.
Rouing and wavelength assignment matrix model, in wavelength division multiplexed optical network, can use matrix can be very easily
Optical network model is described, inverse matrices will be established to dynamic service below, it is selected that the business of being calculated as establishes optical channel
Routing and wavelength.If network G (E, L), E are vertex set, use | E | indicate the number of set interior element, the i.e. number on vertex.
By node to number, N is enabled to indicate that node gathers number.Node is to number | N | it is greater than 1, little Yu | and E | * (| E | -1)/2.L is indicated
Link set, it is assumed that each of the links have F root optical fiber, and every optical fiber supports W wavelength.P is alternate routing set.Considering optical fiber is
It is made of two contrary one-way optical fibers, so network regards non-directed graph as, if it is there is phasor, optical fiber can be seen
At being contrary two optical fiber composition.Network is wavelength selection optical-fiber network, does not consider the situation of wavelength conversion.It is described below
Be defined as follows several matrixes:
(1) adjacency matrix
Adjacency matrix E in the topological diagram of optical-fiber networkijIt indicates:
In adjacency matrix, if node EiWith node EjHaving weight not is that infinite link is connected directly, then: Eij=Eji=
1, EijSyntople of the expression node i to node k.Adjacency matrix is symmetrical 0-1 binary prime matrix, describes optical-fiber network
Physical connection situation between node.It is | E | × | E | dimension matrix.
(2) the p- path matrix of node
Set P={ P1,P2,…PPThe path matrix between all nodes pair of network, in order to describe node between access
Relationship, the p- path matrix N-P matrix of definition node, is abbreviated as NPijMatrix, NPijNode is defined as to NiBetween access whether
Including access Pj, if so, Pij=1, it is otherwise 0.NP is indicated are as follows:
It can be seen that NP matrix remains as 0-1 binary prime matrix, indicate node to and access correlation.It is by network
Node to and the relationship abstractdesription of access come out.The row of the p- path matrix of node indicates each node to different channels
Correlation, which indicates the correlation between the access and different node pair.By the p- path matrix of node,
Service node is closely combined with routing.By adjusting way set P, different routing policies can be completed, it is real
Existing different optimization aim.For example, a shortest path can be chosen between each node pair when using fixed routing algorithm
By every row of the p- path matrix of node and only one element of each column are 1 at this time.When using alternate routing routing policy,
In every row element, it may include multiple nonzero elements.PL matrix is | P | × | L | dimension.
(3) link-path matrix
In order to describe the physical topology situation of optical-fiber network, the link-path matrix for defining optical-fiber network writes a Chinese character in simplified form LP matrix.LP
Matrix are as follows:
LPijMatrix is similarly 0-1 binary prime matrix.Indicate the relationship of the access and link in network in alternate routing.
LPij=1 shows link Li and access Pj has correlation, and access Pj includes link Li.Access-link metric will be in optical-fiber network
Access and link are closely connected.The matrix is organically combined link unrelated in network with access.Access-link square
Battle array be | L | × | P | dimension matrix
(4) wavelength-link metric
Wavelength-link metric writes a Chinese character in simplified form WL matrix.WL matrix are as follows:
Wavelength-link metric describes remaining wavelength resource in optical-fiber network each of the links, and both the wavelength in each of the links was surplus
Remaining situation.The wavelength of network initial stage, number of fibers and support that each chain road includes may be identical, it is also possible to and it is different,
The each element of wavelength-link metric may be identical, it is also possible to different.When the number of fibers that link includes is all mutually F, WLij
=F.With the arrival of business in network, the wavelength resource of chain road is constantly consumed, and wavelength-link metric value will constantly reduce,
WLij indicates the remaining number of channel of the i-th wavelength on link j.Wavelength-link metric is organic by remaining wavelength resource and link
Combine, it describes the wavelength resource occupied state of dynamic optical network chain road.WL matrix is | W | × | L | dimension matrix.
The optical-fiber network of WL matrix description has very strong flexibility to optical fiber and wavelength description, for uneven link resource (different chains
Road includes different number of optical fiber number of wavelengths different with supports) network can be easily simple to describe, it is convenient for analyzing.
By several matrixes above, the resource situation of network can analyze.By wavelength-link metric WL matrix and chain
Road-path matrix LP matrix is multiplied, and can obtain new matrix: wavelength-path matrix is abbreviated as WP matrix.
Wherein, Θ operator is defined:
Wherein:
Wavelength-path matrix WP matrix is | W | × | P | dimension matrix, its physical significance are that residue is available the Pj of channel on
The number of wavelength channel.It reflects the relationship on access and access between network node pair between remaining wavelength available.It should
The corresponding λ i and Pj of item of MaxWPij distributes to business and establishes optical channel between selection node pair.Because all between node pair
In access, the routing and wavelength layer face have maximum available channel number.WL matrix and LP matrix in network can be very easily
It obtains, wherein LP matrix can use existing computational algorithm, off-line calculation.
Below with the wavelength and routing problem of the dynamic service of optical transport network below matrix theory model analysis,
Introduce its calculation method and step.
The existing business of network is randomly generated, so that network wavelength-link metric are as follows:
With the occupancy situation for the business that WL matrix has built up come analog network.Assuming that the connection requirement that dynamic service is established
Are as follows: A- > C, i.e., node is between 3.
Steps are as follows for calculating:
(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) all alternate routings for meeting condition between network node pair can be calculated, calculates and numbers in order as follows:
1 node of table is to access table
The node for needing to establish business is found between accesses all A-C: P4, P5, P6, P7.List access-link metric
(PL) and random network resource occupation matrix is generated:
(3) wavelength-path matrix WP is calculated:
WP=WL Θ LP is obtained:
Under the current network of matrix W P expression, wavelength resource residue situation of the node between 2 on all accesses.WP61=0 table
Show the remaining channel of remaining wavelength available wavelength X 5 on access P5 between 0, WP52=4 expression node pair in the wavelength X 6 of access P4
It is 4.In WP matrix, it should select: it is logical to can choose P5 between optical channel is established A-C by MaxWPij=WP52, as node
Road, using wavelength X 5.
It (4) is service call distribution circuit P5And λ5, and refresh wavelength-link metric.
1~3 step calculated above that can be seen that all is just to have completed to calculate before business reaches, when business reaches only
It needs to calculate (4) (5), substantially increases and calculate the time.
Due to using matrix model, which has the characteristics that:
(1) using matrix method be RWA algorithm establish model, have it is simple and practical, existing matrix operation can be borrowed
Algorithm improves computational efficiency.
(2) to uneven resource network, i.e. the different links of network have different optical fiber and support different number of wavelength
As long as the case where be worth accordingly in WL matrix modifications.
(3) fixed route strategy, alternate routing strategy can may be implemented by adjusting the p- access table of node, and its
Its limited strategy of relevant routing.The limitation strategy of such as routing weights.
(4) when calculating WP=WL Θ LP matrix, different optimization aims can be realized with self-defining Θ.
The purpose of stand-by channel calculates, and is network reservation stand-by channel is the survivability for enhancing network.Network survivability definition
Service disconnection or the ability of interference caused by failure are resisted for network, that is, network can will occur after any failure occurs
The business carried in the resource of failure is switched on other idling-resources, and network is made to maintain an acceptable professional skill
Ability.The Survivability technology of network includes network protection technique and recovery technology.Protection is empty by means of preset network
Not busy resource (such as backup optical fiber and node device), when failure, only need to simply switch the business to Protection path up.Protection is fallen
Change technically reliable, rapidly, but waste Internet resources；Recovery is just dynamically to find idle money from network when failure occurs
Failure business is transmitted in source.Recovery technology can make full use of Internet resources, and flexibility is better than protection mechanism, but recovery time is more
It is long, and cannot ensure 100% recovery failure business.In powerline network, network is generally enhanced using protection technique
Three kinds of stand-by channel configuration methods that can be used for electric power optical transfer network are described below in survivability.
ILP model, it is assumed that network node does not have wavelength conversion capability, gives the wavelength capacities of network link, to be network
Any two node is each route assignment wavelength to active and standby two static routing of configuration.Using following ILP model realization.
Input variable:
Nsd: connection request number.
L: the number of links of network.
W: the wavelength number of each of the links.
M={ mi }, i=1 ..., Nsd:mi indicate the number of active lanes that connection request i is at least established.
N={ ni }, i=1 ..., Nsd:ni indicate the number of active lanes that connection request i is at most established.
P: alternate routing set, number of routes are used | P | it indicates.For the configuration for realizing stand-by channel, asked for each connection
It asks, at least there are two mutually disjoint routings in set P.
A={ aij }: for | P | × Nsd ties up matrix, and aij=1 indicates that routing i can route for connection request j, otherwise aij=
0。
B={ bij }: for | P | × L ties up matrix, and bij=1 indicates that routing i passes through link j, otherwise bij=0.
Decision variable:
C={ cij }: for | P | × W ties up matrix, and cij=1 indicates that wavelength j distributes to routing i, otherwise cij=0.
The target of the ILP model is to maximize the routing sum that can be established, and objective function is as follows:
Restrictive condition:
CTB≤1W×L (6)
m≤11×WCTA≤n (7)
cij∈ { 0,1 }, i=1... | P |, j=1...W (9)
Wherein formula (6) guarantees that each wavelength can only be used once chain on the road, and the wavelength of every each link of routing meets unanimously
Property limitation；Formula (7) guarantees the number of routes established for each connection request in [m, n] range；Formula (8) guarantees to be each connection
Active and standby two routings of mutually disjointing are established in request；Formula (9) illustrates that cij is 1 or 0 variable.
1:1 shares backup radio frequency channel protection mechanism
To reach the connection request dynamic searching routing of network at random and distributing wavelength, it is desirable that active and standby two routings of distribution,
1:1 can be used and share the thought of backup radio frequency channel protection (Shared Backup Path Protection:SBPP) to realize.
The basic conception of SBPP is that stand-by channel must separate (node and link will separate) with corresponding active channel,
But network idle capacity can be shared between stand-by channel, it is intended to save network wavelength resource.No matter which is occurred on active channel
Kind failure, network can pass through the recovery that the backup radio frequency channel predefined realizes business on demand.It conceptually sees, SBPP and 1:
1 automatic protection switching (APS) is similar, unlike, if multiple active channels of SBPP are separated from each other, these not phases
Network extra spare resource can be shared by handing over the stand-by channel of active channel.As shown in fig. 7, mutually disjoint active channel 1-9-4 and 2-
Spare capacity on stand-by channel (dashed double indicates in figure) shared link 2-3 and 3-4 of 9-8-5.
The various embodiments described above are merely to illustrate the present invention, wherein the structure of each component, connection type etc. are all can be
Variation, all equivalents and improvement carried out based on the technical solution of the present invention should not be excluded of the invention
Except protection scope.
Claims (2)
1. OTN network planning setting method in a kind of powerline network comprising following steps:
Step 1: updating the status information of current network, and discharge completed connection resource；New connection request is waited, if
New connection request, goes to step 2；
Step 2: searching two mutually disjoint shortest paths, the active channel WP as connection request using shortest path first
With stand-by channel PP；
Step 3: wavelength resource is distributed for active channel and stand-by channel, using the ideological trends spare wavelength resource of SBPP；
Step 4: if route symmetry is all successful, otherwise which refuses the connection request, returns
Step 1；
Stand-by channel in the step 2 uses the stand-by channel configuration enclosed based on P；
The stand-by channel configuration based on P circle is as follows:
(1) network model: it is assumed that the link of electric power optical transfer network is two-way, and link capacity is fixed；Using digraph G=
(V, E) indicates network model, and configuration directed cycle is for protecting, and wherein V is network node collection, and E is link set, | V | and | E | respectively
Indicate the node total number and link sum of network；
(2) P circle configuration: the configuration enclosed using the P of overall optimum method, overall optimum method are in first Enumerate network topology
Alternately P circle collects all circles, the solution for recycling integral linear programming to be optimized；Wherein, integral linear programming is referred to as
ILP；
(3) routing and wavelength assignment algorithms: each node of network is all configured with wavelength shifter or wave is not configured in each node of network
Long converter；
(4) after internet off-line has configured P circle, corresponding backup wavelength is reserved to optical fiber for each of circle uplink of each P circle,
Finally, the wavelength of residue of network organization is all used as the operation wavelength of network, and these wavelength are all protected；
In the step (1), due to dynamically build circle protection dynamic service have biggish time complexity, the method taken be from
Line configures the P that one can protect all links of network and encloses collection, when network operation be in real time each connection request find route and point
With wavelength, specifically need to consider the following:
1. the P circle collection configured will guarantee that each edge has the protection radio frequency channel of oneself, i.e. each of each of the links at least belongs to P circle to side
Concentrate the circle uplink or gap-bridging link of a circle；
2. suitable routing policy；
3. suitable Wavelength Assignment strategy；
In the step (2), the configuration of ILP model is selected, is configured using following ILP model realization:
Input set:
S: network edge collection；If network has | E | link, it is contemplated that the amphicheirality of link, network edge collection dimension is then 2 × | E |；
P: alternative P encloses collection, and single P circle is indicated with p；
Input variable:
ci: the cost of side i unit capacity sets ci=1；
When circle p can protect side iOtherwise
When enclosing p by side iOtherwise
Output variable:
np: it indicates the quantity that circle p is needed to configure, is nonnegative integer type variable；
Objective function:
Restrictive condition:
It is specific to route Wavelength Assignment strategy such as when each node of network is all configured with wavelength shifter in the step (3)
Under:
If the good P circle of off-line arrangement concentrates shared Q circle, the Protection capacity for enclosing p is Dp, initial value is set as 0；It is assumed that each of the links
Each Xiang Bianjun has M unit capacity, the idle capacity number F of side iiIt indicates, Fi=M when initial, the capacity requirement of connection request r
It is denoted as demandr, then:
1. adjusting the weight on network whole side when connection request r reaches network, the weight on side can be indicated are as follows:
2. calculating the operating path Path of connection request r with shortest path first Dijkstra ' sr；If Path can be foundr, and
There are enough displacement volumes, continues the and 3. walk, otherwise refuse the connection request；
3. being operating path PathrEach edge distribute Protection capacity: if PathrSide j can be by Ij(Ij≤ Q) the potential guarantor of a circle
Shield, the IjA circle forms set Ctemp, update CtempIn the Protection capacity that respectively encloses, more new formula is,
Wherein D'pIt is the Protection capacity for enclosing p before connection request r reaches network,It is before connection request r reaches network
The displacement volume that side j is protected by circle p；If Dp>D'p, then need to increase the Protection capacity of circle p；
4. if this IjA circle can protect side j, update set CtempIn respectively enclose the conservation status of opposite side j, wherein
Update CtempIn some circle Protection capacity when, if the idle capacity of residue of network organization be not able to satisfy circle p needed for protection hold
Amount, then the circle cannot protect side j, by it from set CtempMiddle deletion updates Ij=Ij-1；If Ij> 0, each link capacity of network returns
C is updated to networktempIn respectively enclose the state before Protection capacity, and return to the and 3. walk；If Ij=0, which cannot be protected
Shield, refuses the connection request, and each link capacity of network returns to the state before connection request r arrival network；
5. and if only if operating path PathrEach edge all protected, receive the connection request, otherwise refuse the connection request,
And each link capacity of network returns to the state before connection request r arrival network.
2. OTN network planning setting method in a kind of powerline network as described in claim 1, it is characterised in that: described
In step (3), wavelength shifter is not configured in each node of network: when network node does not have wavelength conversion capability, active and standby wave
The foundation in road then needs to meet Wavelength continuity constraint；Active channel and stand-by channel will correspond.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410268400.0A CN105207859B (en) | 2014-06-16 | 2014-06-16 | OTN network planning setting method in a kind of powerline network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410268400.0A CN105207859B (en) | 2014-06-16 | 2014-06-16 | OTN network planning setting method in a kind of powerline network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105207859A CN105207859A (en) | 2015-12-30 |
| CN105207859B true CN105207859B (en) | 2019-02-26 |
Family
ID=54955309
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410268400.0A Active CN105207859B (en) | 2014-06-16 | 2014-06-16 | OTN network planning setting method in a kind of powerline network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105207859B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106027389A (en) * | 2016-05-09 | 2016-10-12 | 国网辽宁省电力有限公司丹东供电公司 | P-cycle protection method based on novel topology |
| CN108199955B (en) * | 2016-12-08 | 2021-11-12 | 中兴通讯股份有限公司 | Route establishing method and device |
| CN106656787A (en) * | 2017-01-05 | 2017-05-10 | 华北电力大学 | Resource channel joint optimization P-cycle configuration method |
| CN106656633B (en) * | 2017-02-10 | 2019-10-08 | 国网甘肃省电力公司信息通信公司 | A kind of assessment system and method for electric power backbone OTN transmission performance |
| CN110832928B (en) * | 2017-05-03 | 2023-09-08 | 交互数字专利控股公司 | Transmission adaptation and unlicensed access |
| CN107566210B (en) * | 2017-08-22 | 2020-07-10 | 国网辽宁省电力有限公司辽阳供电公司 | Intelligent estimation method for service flow in OTN (optical transport network) |
| CN109743112B (en) * | 2018-12-27 | 2020-12-18 | 深圳前海微众银行股份有限公司 | OTN networking method, device, equipment and computer readable storage medium |
| CN110061913A (en) * | 2019-03-26 | 2019-07-26 | 华北电力大学 | A kind of electric power protection communication network planing method based on node resource degree |
| CN110247845B (en) * | 2019-06-26 | 2021-10-29 | 深圳市中航比特通讯技术股份有限公司 | Method for generating protection route in communication network |
| CN111064505B (en) * | 2019-12-23 | 2020-10-27 | 广州索识信息科技有限公司 | Point distribution method of optical fiber testing equipment, storage medium and optical fiber testing system |
| CN114125592A (en) * | 2020-08-27 | 2022-03-01 | 中兴通讯股份有限公司 | Route calculation method, route calculation device and storage medium for optical transport network |
| CN114900461B (en) * | 2022-05-10 | 2024-04-26 | 国网浙江省电力有限公司信息通信分公司 | Power communication network route optimization method and device considering information physical fusion characteristics |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1901503A (en) * | 2005-07-22 | 2007-01-24 | 中兴通讯股份有限公司 | Method for obtaining intelligent light network restraining route |
| CN101990138A (en) * | 2009-07-31 | 2011-03-23 | 华为技术有限公司 | Wavelength scheduling method and device |
| CN103051533A (en) * | 2011-10-11 | 2013-04-17 | 中兴通讯股份有限公司 | Method and device for calculating route with protection service |
| CN103200468A (en) * | 2013-03-15 | 2013-07-10 | 广东电网公司电力调度控制中心 | Method and device of route wavelength allocation of electric power optical fiber communication network |
-
2014
- 2014-06-16 CN CN201410268400.0A patent/CN105207859B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1901503A (en) * | 2005-07-22 | 2007-01-24 | 中兴通讯股份有限公司 | Method for obtaining intelligent light network restraining route |
| CN101990138A (en) * | 2009-07-31 | 2011-03-23 | 华为技术有限公司 | Wavelength scheduling method and device |
| CN103051533A (en) * | 2011-10-11 | 2013-04-17 | 中兴通讯股份有限公司 | Method and device for calculating route with protection service |
| CN103200468A (en) * | 2013-03-15 | 2013-07-10 | 广东电网公司电力调度控制中心 | Method and device of route wavelength allocation of electric power optical fiber communication network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105207859A (en) | 2015-12-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105207859B (en) | OTN network planning setting method in a kind of powerline network | |
| CN100459534C (en) | Layer network node and network constituted throuth said nodes, the node and layer network thereof | |
| CN101052235B (en) | Business combing method and device for ASON special protection | |
| CN108156041B (en) | Differentiated virtual optical network mapping method based on security perception | |
| Chen et al. | Clustering methods for hierarchical traffic grooming in large-scale mesh WDM networks | |
| Chen et al. | On hierarchical traffic grooming in WDM networks | |
| CN101808254B (en) | Static routing and wavelength allocation method based on layered graph | |
| Jaumard et al. | Efficient spectrum utilization in large scale RWA problems | |
| CN101699803B (en) | Inter-domain routing method based on distribution type multi-layer multi-domain optical network | |
| CN111162865A (en) | Virtual optical network mapping method for sensing fragments in space division multiplexing elastic optical network | |
| CN101478705B (en) | Survivable service flow conducting method based on interlayer message routing | |
| KR101541534B1 (en) | Apparatus and method for design of optical router in optical networks-on-chip | |
| CN103595634A (en) | Dynamic traffic grooming method in IP/WDM network | |
| CN103179035A (en) | Optical transmission network and method and device for selecting fixed routes thereof | |
| CN105007223A (en) | Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure | |
| CN100440867C (en) | Method of real time soft seizing wave length route photo network | |
| CN103795641B (en) | The optical network resource management method mapped based on multidimensional frame | |
| Chen et al. | A framework for hierarchical traffic grooming in WDM networks of general topology | |
| CN110062301A (en) | Route selection method, device, equipment and storage medium | |
| CN103415025B (en) | Passive optical network optimization method based on ONU-WG | |
| Lin et al. | A new network availability algorithm for WDM optical networks | |
| Gao et al. | Virtual optical network embedding considering mixed transparent and translucent virtual links | |
| CN105897882A (en) | Data stream migration method in data center network updating | |
| Ho et al. | An approach for enhancing fixed alternate routing in dynamic wavelength-routed WDM networks | |
| Wang et al. | Collision-aware spectrum assignment scheme for flexible bandwidth optical networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |