CN106549779A - A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service - Google Patents

A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service Download PDF

Info

Publication number
CN106549779A
CN106549779A CN201510599548.7A CN201510599548A CN106549779A CN 106549779 A CN106549779 A CN 106549779A CN 201510599548 A CN201510599548 A CN 201510599548A CN 106549779 A CN106549779 A CN 106549779A
Authority
CN
China
Prior art keywords
route
node
network
business
double
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510599548.7A
Other languages
Chinese (zh)
Other versions
CN106549779B (en
Inventor
丁慧霞
雷煜卿
杨琦
刘革
张颖
滕玲
高强
王智慧
谷良
曲思恒
稂龙亚
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
State Grid Sichuan Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
State Grid Sichuan Electric Power Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, China Electric Power Research Institute Co Ltd CEPRI, State Grid Sichuan Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN201510599548.7A priority Critical patent/CN106549779B/en
Publication of CN106549779A publication Critical patent/CN106549779A/en
Application granted granted Critical
Publication of CN106549779B publication Critical patent/CN106549779B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H02J13/0017—

Abstract

The present invention relates to a kind of maximum non-intersect double route collocation method of multiple constraint energy communication service, the method includes：Build network topology model；R right-safeguarding values are chosen, network G is set upr；Obtain network GrThe double route collection of services of middle request configuration, arranges business importance degree according to the actual requirements；According to business importance sorting, acquisition is currently configured business information；Double route is carried out by the maximum non-intersect algorithms of improved Bhandari to choose in advance；Multigroup maximum non-intersect double route set for meeting multi-constraint condition is obtained using improved KSP algorithms；The maximum non-intersect double route set is screened；Output configuration result.This method can meet the maximum non-intersect double route of multiple constraint in any power telecom network for traffic assignments, ensure the operation of business normal reliable ground to greatest extent.

Description

A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service
Technical field
The invention belongs to technical field of electric power communication, is related to a kind of maximum non-intersect double route of multiple constraint energy communication service Collocation method.
Background technology
Power telecom network is the communication private network for serving power system, its communication service have high level real-time, Reliability and security requirement.To ensure that service security reliably runs, in power telecom network, partial service is (such as relay The business such as protection, security and stability control) need to configure standby usage double route.When event occurs in the primary route in double route During barrier, business can be switched to into alternate routing rapidly, so can dramatically mitigate impact of the catastrophic failure to business, Ensure that energy communication service safely and reliably runs.At present the routing algorithm in power telecom network be primarily upon single channel by point With problem, correlative study mainly adopts improved dijkstra's algorithm, Floyd algorithms, genetic algorithm and particle cluster algorithm Sharing out the work for route is completed etc. method.But single routing algorithm cannot consider the correlation between two routes, it is impossible to be Business configuration double route.
In public telecommunication network, double route algorithm is broadly divided into node non-intersect double route algorithm (NDRA, Node-disjoint Routing algorithm), Link-disjoint paths double route algorithm (LDRA, Link-disjoint routing algorithm) with Maximum non-intersect double route algorithm (MDRA, Maximally disjoint routing algorithm).NDRA requires two Route is definitely separated, therefore which is also referred to as non-intersect double route algorithm；LDRA requires two routes not comprising public Link, compared with NDRA, the path constraints of LDRA more relax；MDRA can be one group of traffic assignments The minimum double route of common node, between algorithm in mutual relation, MDRA includes NDRA.
NDRA requires that two paths are definitely separated, in the configuration of specific transactions in some particular networks, NDRA without Method finds feasible solution.For example to network shown in Fig. 2, respectively A points to Z points and B points distribute double route to Z points, Then NDRA cannot realize the distribution of non-intersect double route.LDRA can there may be multiple intersecting for business configuration The double route of node, but this can cause double route that LDRA the obtains existing defects in reliability.For example to Fig. 2 institutes Show network, adopt LDRA from A points to Z points for traffic assignments double route, then the A-D-E-G-Z shown in Fig. 3 and A-C-D-F-H-I-Z with and Fig. 4 shown in A-D-E-G-Z and A-C-D-F-G-I-Z, be and meet Link-disjoint paths The double route of condition.But in practice we be more likely to select Fig. 3 shown in the less A-D-E-G-Z of common node and A-C-D-F-H-I-Z is route as business standby usage.Further, according to LDRA from B points to Z points be business Distribute double route, then LDRA cannot find feasible solution.A points are respectively according to MDRA to arrive to Z points with B points Two traffic assignments double routes of Z points, then can be directly have common node shown in two traffic assignments Fig. 3 and Fig. 4 Minimum double route.Therefore, be to greatest extent ensure power telecom network in business reliability, MDRA should be adopted Complete double route to share out the work.
MDRA only can ensure that two routes with minimum common node, and when existing in network, multigroup maximum is non-intersect During double route, also further should consider reliability, packet loss, when extend to the multiple constraints such as the risk balance of Network Condition, is maximum non-intersect double route that one group of traffic assignments meet multiple constraint condition.In actual communication network, Multiple constraint double route algorithm mostly is Link-disjoint paths double route algorithm, and But most of algorithms does not further consider double route Reliability is balanced with business risk, and this causes existing double route algorithm to be difficult to meet the demand of Practical Project.
The content of the invention
To make up drawbacks described above, the present invention provides a kind of multiple constraint energy communication service maximum non-intersect double route configuration side Method, the method can find multigroup maximum non-intersect double route under the conditions of multiple constraint, and be one networking of traffic assignments Network risk most maximum non-intersect double route in a balanced way.
The present invention is adopted the technical scheme that：
A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service, methods described comprise the steps：
(1) build network topology model；
(2) r right-safeguarding values are chosen, sets up network Gr；
(3) obtain network GrThe double route collection of services of middle request configuration, arranges business importance degree according to the actual requirements；
(4) according to business importance sorting, acquisition is currently configured business information；
(5) carry out double route by the maximum non-intersect algorithms of improved Bhandari to choose in advance；
(6) multigroup maximum non-intersect double route set for meeting multi-constraint condition is obtained using improved KSP algorithms；
(7) the maximum non-intersect double route set is screened；
(8) export configuration result.
Preferably, network model is built in the step (1) includes：According to real network framework, build and the reality The corresponding network topology model G=(V, E, W) of internet；
Wherein, V={ v1,v2,…,vnFor the node set of network topology model G, the node v in Vi, i ∈ [1, n] For i-th node in network topology model G；E={ e1,e2,…,emFor the link set of network topology model G, E In k-th node ek=(vi,vj), k ∈ [1, m] represent i-th node v in ViWith j-th node vjIt is unordered To for v in the network topologyiTo vjLink, j ∈ [1, n]；N is node total number, and m is link total number, and W is The multi-dimension Weight value set of network topology model G links and node；Kth bar chain in the network topology model G Road ekComprising a q dimension weight vector W (ek)={ w1(ek),w2(ek),…,wq(ek), and i-th node v in ViBag Containing a q dimension weight vector W (vi)={ w1(vi),w2(vi),…,wq(vi), q ＞ 1.
Preferably, r right-safeguarding values are chosen in the step (2), builds network GrIncluding setting q dimension weight vectors In each weight vector constraints, select according to actual needs r tie up weight vector constraints；Wherein, The constraints includes, reliability, packet loss and time delay；
The r ties up weight vector wrThe weights of corresponding link and node are respectively wr(ek) (1≤r≤q, k ∈ [1, m]) And wr(vi) (1≤r≤q, i ∈ [1, n]), network consisting Gr(V, E), is designated as Gr。
Preferably, the step (4) includes：Double route collection of services is arranged according to importance value descending；Choose Most important of which business obtains importance degree, the source point v of business s as business s is currently configuredsAnd destination node vtInformation and constrained vector C (s).
Further, the acquisition methods of constrained vector C (s) include：If kth kind business is Sk, k >=0；Then exist Constrained vector under q dimension constraintss is C (s)={ c1(s),c2(s),…,cq(s)}。
Preferably, double route pre-selection is carried out by the maximum non-intersect algorithms of improved Bhandari in the step (5) Take including calculating is currently configured the maximum non-intersect degree α of double route of business sst, i.e. network GrMiddle maximum is non-intersect double The quantity of route Route (A) and the common node of Route (B) and common link and.
Further, the maximum non-intersect algorithms of the improved Bhandari specifically include following step：
5-1 is in network GrIn, call the dijkstra's algorithm for considering node weights, acquisition to be currently configured business s most Short path Route (a), and as initial path；
The dijkstra's algorithm for considering node weights allows the maximum non-intersect algorithms of Bhandari to consider node weight Value；
5-2 is in network GrIn, the Route (a) is carried out into node split, the chain corresponding to the node after division is obtained Road, node annexation and weights, generate new network Grm；
5-3 is in the network GrmIn, the dijkstra's algorithm for calling node to recognize, search are currently configured the source of business s Point vsWith destination node vtBetween shortest path Route (b1)；
, there is mistake solution twice for eliminating the superposition of same node point weights in the dijkstra's algorithm of the node identification； When whether path arrives at a certain node；If arriving at, when again passing by, the weights of the node are changed into 0；
5-4 reduces Route (b1) in split vertexes obtain path Route (b), which includes：By Route (b1) in include Split vertexes be reduced to origin node, the two nodes are merged if being same node by adjacent node after the reduction；
5-5 is by Route (a) and Route (b) network consisting Grs, by GrsIt is double that middle Route (a) is overlapped with Route (b) A is respectively modified as to weights of the link with node0With b0, the dijkstra's algorithm for considering node weights is performed again, is searched Rope obtains shortest path, is designated as Route (A)；
The b0With a0Inequality b is met respectively0>∑w(vi)+∑w(ek) and a0≥n·b0；Wherein, b0More than in network The weights of node and link and, n is node total number.
5-6 is in network GrsThe middle two-way link by corresponding to Route (A) is respectively modified as a with the weights of node0With b0, The dijkstra's algorithm for considering node weights, search is called to obtain shortest path Route (B)；
The maximum non-intersect degree α of double route is calculated according to Route (A) and Route (B)st, its expression formula is： αst=card (Route (A) ∩ Route (B)), and obtain Route (A) and Route (B) common node weights.
Further, Route (a) is carried out node split in the step (5-2) includes：By source point in definition path vsTo destination node vtDirection for forward direction, rightabout is reverse；By its on Route (a) in addition to the start and the end points only He puts and is divided into two, and reverse link weights are 0 therebetween, and forward link weights are b0；
The reverse weights of all links in path are changed into into the opposite number of former link metric, forward link weights are a0；
The b0With a0Inequality b is met respectively0>∑w(vi)+∑w(ek), a0≥n·b0；Wherein, b0More than in network The weights of node and link and, n is node total number.
Preferably, the step (6) meets the maximum non-intersect of multiple constraint using the acquisition of improved KSP algorithms is multigroup Double route set is specifically included：
6-1 sets initial path quantity as K；
6-2 is using KSP algorithms in network GrIn search for source point v one by onesTo destination node vtPath；
If current path is L (1≤L≤K) paths, tieing up the weight vector under constraints in r is wr(Route(L))；
Work as wr(Route(L-1))<cr(s)≤wrWhen (Route (L)), terminate calculating, go to step 6-4；
Work as wr(Route (K)) ＜ crWhen (s), step 6-3 is gone to；Wherein, crS () is business s under r dimension constraintss Binding occurrence；
6-3 given thresholds increment is Δ K, Δ K ＞ 0；KN=KN-1+ Δ K, N ＞ 0；Circulation step (6-1) is to step (6-3), the K path of Δ to increasing newly is searched for one by one, until meeting wr(Route(L-1))<cr(s)≤wr(Route(L)) Into next step；Wherein, the number of times to increase threshold delta of N；
The path of any two meet the constraint is combined by 6-4, generates multigroup maximum non-intersect double route set；If In the set, each group of double route Route (x) is all met with Route (y)：Min (Route (x) ∩ Route (y) -2)=αst(1≤x ≤KN,1≤y≤KN, x ≠ y) reach maximum non-intersect degree αst；Next step is entered then；
Each group of double route Route (x) in multigroup maximum non-intersect double route set described in 6-5 is also full with Route (y) Foot：Min (card (Route (x) ∩ Route (y)))=min (card (Route (x1)∩Route(y1)))(1≤x≤KN,1≤y≤ KN,x≠y,1≤x1≤KN-1,1≤y1≤KN-1,x1≠y1), and wr(Route(KN))≥max(wr(Route (A)), wr(Route(B)))；Wherein, Route (A) and Route (B) is the maximum disjoint path that improved Bhandari algorithms are obtained Footpath.
Preferably, the step (7) carries out screening to maximum non-intersect double route set includes, calculates double route collection The Network risk balance degree of each group of double route in conjunction, obtains business risk most double route in a balanced way；And by risk The less primary route MR for being defined as current business s of jumping figure in most balanced double route, another is standby road By SR.
Further, the computational methods of the Network risk balance degree are：
Wherein, RGRepresent Network risk balance degree, RGIt is less that to represent network risks more balanced；M is lattice chain Way, n are number of network node；R(eij) and R (e)avrLink e is represented respectivelyijBusiness risk value and all links of network Business risk value average；R(vk) and R (v)avrNode v is represented respectivelykBusiness risk value and all nodes of network industry Business value-at-risk average；S(eij) and S (vk) link e is represented respectivelyijWith node vkCorresponding reliability；SW(sp) and SW (sq) Business s is represented respectivelypWith business sqBusiness importance degree；The business importance degree is set according to actual needs；Formula sp ∈eijExpression business spFor link eijOn the business that carried, formula sq∈vkExpression business sqFor node vkIt is upper to be held The business of load.
The step (8) includes that output is currently configured the double route result of business s, updates network distribution, if depositing In surplus lines then return to step (3).
Compared with immediate prior art, beneficial effects of the present invention：
The present invention can distribute double route for energy communication service in arbitrary network, and the double route of distribution has most very much not phase Characteristic is handed over, on business conode or link failure can be farthest reduced and be caused standby usage route while what is failed is general Rate；Allow to arrange various route restriction indexs, can be found according to the different requirements of invention user and meet different constraints Double route；In the case where every group of double route service quality is ensured, it is considered to network risks equilibrium factor, effectively can drop The situation for causing network risks too high because service distribution is unbalanced in low network, makes offered load more balanced, improves The utilization rate of Internet resources.
Description of the drawings
Fig. 1 is the energy communication service double route configuration flow figure that the present invention is provided；
The network topological diagram of certain network that Fig. 2 is provided for background technology；
Fig. 3 is in Fig. 2 networks, from A nodes to the Link-disjoint paths two-way that the Intersection distributed by Z nodes is 1 By schematic diagram；
Fig. 4 is in Fig. 2 networks, from A nodes to the Link-disjoint paths two-way that the Intersection distributed by Z nodes is 2 By schematic diagram；
Fig. 5 is the maximum non-intersect double route schematic diagram distributed to Z nodes from B node in Fig. 2 networks；
The energy communication service double route configuration detail flowchart that Fig. 6 is provided for the present invention；
The node split change schematic diagram that Fig. 7 is provided for the present invention；
The combinational network G that Fig. 8 is provided for the present inventionrsTopological schematic diagram；
The amended G that Fig. 9 is provided for the present inventionrsNetwork topology schematic diagram.
Specific embodiment
With reference to the accompanying drawings and detailed description technical scheme is described in more detail.
Shown in Fig. 1 and Fig. 6, a kind of maximum non-intersect double route collocation method of multiple constraint energy communication service, including：
(1) build network topology model；According to real network framework, build network corresponding with the real network and open up Flutter model G=(V, E, W)；
Wherein, V={ v1,v2,…,vnFor the node set of network topology model G, the node v in Vi, i ∈ [1, n] For i-th node in network topology model G；E={ e1,e2,…,emFor the link set of network topology model G, E In k-th node ek=(vi,vj), k ∈ [1, m] represent i-th node v in ViWith j-th node vjIt is unordered To for v in the network topologyiTo vjLink, j ∈ [1, n]；N is node total number, and m is link total number, and W is The multi-dimension Weight value set of network topology model G links and node；Kth bar chain in the network topology model G Road ekComprising a q dimension weight vector W (ek)={ w1(ek),w2(ek),…,wq(ek), and i-th node v in ViBag Containing a q dimension weight vector W (vi)={ w1(vi),w2(vi),…,wq(vi), q ＞ 1.
(2) r right-safeguarding values are chosen, sets up network Gr；R right-safeguarding values are chosen, network G is builtrIncluding setting q dimensions The constraints of each weight vector in weight vector, selects r to tie up the constraint article of weight vector according to actual needs Part；Wherein, the constraints includes, reliability, packet loss and time delay；
The r ties up weight vector wrThe weights of corresponding link and node are respectively wr(ek) (1≤r≤q, k ∈ [1, m]) And wr(vi) (1≤r≤q, i ∈ [1, n]), network consisting Gr(V, E), is designated as Gr。
(3) obtain network GrThe double route collection of services of middle request configuration, arranges business importance degree according to the actual requirements；
(4) according to business importance sorting, acquisition is currently configured business information；
Double route collection of services is arranged according to importance value descending；Most important of which business is chosen as being currently configured Business s, obtains importance degree, the source point v of business ssWith destination node vtInformation and constrained vector C (s).
The acquisition methods of constrained vector C (s) include：If kth kind business is Sk, k >=0；Then in q dimension constraint bars Constrained vector under part is C (s)={ c1(s),c2(s),…,cq(s)}。
(5) carry out double route by the maximum non-intersect algorithms of improved Bhandari to choose in advance；
Calculating is currently configured the maximum non-intersect degree α of double route of business sst, i.e. network GrMiddle maximum non-intersect double route The common node of Route (A) and Route (B) and the quantity of common link and.
The maximum non-intersect algorithms of the improved Bhandari specifically include following step：
5-1 is in network GrIn, call the dijkstra's algorithm for considering node weights, acquisition to be currently configured business s most Short path Route (a), and as initial path；
The dijkstra's algorithm for considering node weights allows the maximum non-intersect algorithms of Bhandari to consider node weight Value；
5-2 is in network GrIn, the Route (a) is carried out into node split, the chain corresponding to the node after division is obtained Road, node annexation and weights, generate new network Grm；As shown in fig. 7, being combined into A and two nodes of Z Distribute the maximum non-intersect algorithm flows of maximum non-intersect double route explanation Bhandari, in general networking, it is believed that link Positive weights it is identical with reverse weights.Shortest path Route (a) is obtained by improved dijkstra's algorithm： A-B-D-F-H-Z.Carry out node split and obtain network Grm, now according to Bhandari algorithms can exist unidirectional side with The different side of both forward and reverse directions weights, can now be related to forward link weights and reverse link weights.
Route (a) is carried out node split in step (5-2) includes：By source point v in definition pathsTo destination node vtDirection for forward direction, rightabout is reverse；Other points on Route (a) in addition to the start and the end points only are divided into two, Therebetween reverse link weights are 0, and forward link weights are b0；
The reverse weights of all links in path are changed into into the opposite number of former link metric, forward link weights are a0；
The b0With a0Inequality b is met respectively0>∑w(vi)+∑w(ek), a0≥n·b0；Wherein, b0More than in network The weights of node and link and, n is node total number.
5-3 is in the network GrmIn, the dijkstra's algorithm for calling node to recognize, search are currently configured the source of business s Point vsWith destination node vtBetween shortest path Route (b1)；
, there is mistake solution twice for eliminating the superposition of same node point weights in the dijkstra's algorithm of the node identification； When whether path arrives at a certain node；If arriving at, when again passing by, the weights of the node are changed into 0；
5-4 reduces Route (b1) in split vertexes obtain path Route (b), which includes：By Route (b1) in include Split vertexes be reduced to origin node, the two nodes are merged if being same node by adjacent node after the reduction；
5-5 is as shown in figure 8, by Route (a) and Route (b) network consisting Grs, by GrsMiddle Route (a) and Route (b) The two-way link for being overlapped is respectively modified as a with the weights of node0With b0, the Dijkstra for considering node weights is performed again Algorithm, search obtain shortest path, are designated as Route (A)；As shown in figure 9, network now and node split network GrmDifference, in GrsThe weights of middle forward and reverse link are the same and do not have a unidirectional side, thus will not relate to it is positive with it is anti- To problem, the weights of two-way link and node are directly changed.
It is A point Z points distribution route by improved dijkstra's algorithm, obtains Route (A)：A-B-C-E-H-Z, GrsRoute (A) respective links weights are revised as into a0, node weights are revised as b0, obtain the G of modification shown in Fig. 9rs Network.
The b0With a0Inequality b is met respectively0>∑w(vi)+∑w(ek) and a0≥n·b0；Wherein, b0More than in network The weights of node and link and, n is node total number.
5-6 is in network GrsThe middle two-way link by corresponding to Route (A) is respectively modified as a with the weights of node0With b0, The dijkstra's algorithm for considering node weights, search is called to obtain shortest path Route (B)；
The maximum non-intersect degree α of double route is calculated according to Route (A) and Route (B)st, its expression formula is： αst=card (Route (A) ∩ Route (B)), and obtain Route (A) and Route (B) common node weights.
6) multigroup maximum non-intersect double route set for meeting multi-constraint condition is obtained using improved KSP algorithms；
Specifically include following steps：
6-1 sets initial path quantity as K；
6-2 is using KSP algorithms in network GrIn search for source point v one by onesTo destination node vtPath；
If current path is L (1≤L≤K) paths, tieing up the weight vector under constraints in r is wr(Route(L))；
Work as wr(Route(L-1))<cr(s)≤wrWhen (Route (L)), now algorithm is exact algorithm, terminates calculating and goes to step Rapid 6-4；
Work as wr(Route (K)) ＜ crWhen (s), go to step 6-3 and perform approximate data；Wherein, crS () is business s Binding occurrence under r dimension constraintss；
6-3 given thresholds increment is Δ K, Δ K ＞ 0；KN=KN-1+ Δ K, N ＞ 0；Circulation step (6-1) is to step (6-3), the K path of Δ to increasing newly is searched for one by one, until meeting wr(Route(L-1))<cr(s)≤wr(Route(L)) Into next step；Wherein, the number of times to increase threshold delta of N；
The path of any two meet the constraint is combined by 6-4, generates multigroup maximum non-intersect double route set；If In the set, each group of double route Route (x) is all met with Route (y)：Min (Route (x) ∩ Route (y) -2)=αst(1≤x ≤KN,1≤y≤KN, x ≠ y) reach maximum non-intersect degree αst；Next step is entered then；
Each group of double route Route (x) in multigroup maximum non-intersect double route set described in 6-5 is also full with Route (y) Foot：Min (card (Route (x) ∩ Route (y)))=min (card (Route (x1)∩Route(y1)))(1≤x≤KN,1≤y≤ KN,x≠y,1≤x1≤KN-1,1≤y1≤KN-1,x1≠y1), and wr(Route(KN))≥max(wr(Route (A)), wr(Route(B)))；Wherein, Route (A) and Route (B) is the maximum disjoint path that improved Bhandari algorithms are obtained Footpath.
(7) the maximum non-intersect double route set is screened：
The Network risk balance degree of each group of double route in double route set is calculated, business risk is obtained most in a balanced way Double route；And by jumping figure in a risk most balanced double route less primary route MR for being defined as current business s (Main route), another is alternate routing SR (Spare route).
The computational methods of the Network risk balance degree are：
Wherein, RGRepresent Network risk balance degree, RGIt is less that to represent network risks more balanced；M is lattice chain Way, n are number of network node；R(eij) and R (e)avrLink e is represented respectivelyijBusiness risk value and all links of network Business risk value average；R(vk) and R (v)avrNode v is represented respectivelykBusiness risk value and all nodes of network industry Business value-at-risk average；S(eij) and S (vk) link e is represented respectivelyijWith node vkCorresponding reliability；SW(sp) and SW (sq) Business s is represented respectivelypWith business sqBusiness importance degree；The business importance degree is set according to actual needs；Formula sp ∈eijExpression business spFor link eijOn the business that carried, formula sq∈vkExpression business sqFor node vkIt is upper to be held The business of load.
(8) export configuration result.
Output is currently configured the double route result of business s, updates network distribution, the return to step if it there is surplus lines (3)。
Related symbol implication in the present invention is as shown in table 1：
1 related symbol explanation of table
Finally it should be noted that：Above example is only to illustrate the technical scheme of the application rather than to its protection domain Restriction, although being described in detail to the application with reference to above-described embodiment, those of ordinary skill in the art It should be understood that：Those skilled in the art still can carry out a variety of changes to the specific embodiment applied after reading the application More, modification or equivalent, these changes, modification or equivalent, which will in the pending right of its application Within the scope of asking.

Claims (12)

1. a kind of maximum non-intersect double route collocation method of multiple constraint energy communication service, it is characterised in that the side Method comprises the steps：
(1) build network topology model；
(2) r right-safeguarding values are chosen, sets up network Gr；
(3) obtain network GrThe double route collection of services of middle request configuration, arranges business importance degree according to the actual requirements；
(4) according to business importance sorting, acquisition is currently configured business information；
(5) carry out double route by the maximum non-intersect algorithms of improved Bhandari to choose in advance；
(6) multigroup maximum non-intersect double route set for meeting multi-constraint condition is obtained using improved KSP algorithms；
(7) the maximum non-intersect double route set is screened；
(8) export configuration result.
2. method according to claim 1, it is characterised in that network model bag is built in the step (1) Include：According to real network framework, network topology model G=(V, E, W) corresponding with the real network is built；
Wherein, V={ v1,v2,…,vnFor the node set of network topology model G, the node v in Vi, i ∈ [1, n] For i-th node in network topology model G；E={ e1,e2,…,emFor the link set of network topology model G, E In k-th node ek=(vi,vj), k ∈ [1, m] represent i-th node v in ViWith j-th node vjIt is unordered To for v in the network topologyiTo vjLink, j ∈ [1, n]；N is node total number, and m is link total number, and W is The multi-dimension Weight value set of network topology model G links and node；Kth bar chain in the network topology model G Road ekComprising a q dimension weight vector W (ek)={ w1(ek),w2(ek),…,wq(ek), and i-th node v in ViBag Containing a q dimension weight vector W (vi)={ w1(vi),w2(vi),…,wq(vi), q ＞ 1.
3. method according to claim 1 and 2, it is characterised in that r right-safeguarding is chosen in the step (2) Value, builds network GrIncluding：The constraints of each weight vector in q dimension weight vectors is set, according to reality Need the constraints for selecting r to tie up weight vector；Wherein, the constraints includes, reliability, packet loss and when Prolong；
The r ties up weight vector wrThe weights of corresponding link and node are respectively wr(ek) (1≤r≤q, k ∈ [1, m]) And wr(vi) (1≤r≤q, i ∈ [1, n]), network consisting Gr(V, E), is designated as Gr。
4. method according to claim 1, it is characterised in that the step (4) includes：By double route industry Business set is arranged according to importance value descending；Most important of which business is chosen as business s that is currently configured, obtaining should The importance degree of business s, source point vsWith destination node vtInformation and constrained vector C (s).
5. method according to claim 4, it is characterised in that the acquisition methods bag of constrained vector C (s) Include：If kth kind business is Sk, k >=0；The constrained vector then tieed up under constraints in q is C (s)={ c1(s),c2(s),…, cq(s)}。
6. method according to claim 1, it is characterised in that pass through improved Bhandari in the step (5) Maximum non-intersect algorithm carries out double route to be chosen in advance includes, calculating is currently configured the maximum non-intersect degree of double route of business s αst, i.e. network GrThe common node of middle maximum non-intersect double route Route (A) and Route (B) and the quantity of common link With.
7. method according to claim 6, it is characterised in that the improved Bhandari maximums are non-intersect Algorithm specifically includes following step：
5-1 is in network GrIn, call the dijkstra's algorithm for considering node weights, acquisition to be currently configured business s most Short path Route (a), and as initial path；
The dijkstra's algorithm for considering node weights allows the maximum non-intersect algorithms of Bhandari to consider node weight Value；
5-2 is in network GrIn, the Route (a) is carried out into node split, the chain corresponding to the node after division is obtained Road, node annexation and weights, generate new network Grm；
5-3 is in the network GrmIn, the dijkstra's algorithm for calling node to recognize, search are currently configured the source of business s Point vsWith destination node vtBetween shortest path Route (b1)；
, there is mistake solution twice for eliminating the superposition of same node point weights in the dijkstra's algorithm of the node identification； When whether path arrives at a certain node；If arriving at, when again passing by, the weights of the node are changed into 0；
5-4 reduces Route (b1) in split vertexes obtain path Route (b), which includes：By Route (b1) in include Split vertexes be reduced to origin node, the two nodes are merged if being same node by adjacent node after the reduction；
5-5 is by Route (a) and Route (b) network consisting Grs, by GrsIt is double that middle Route (a) is overlapped with Route (b) A is respectively modified as to weights of the link with node0With b0, the dijkstra's algorithm for considering node weights is performed again, is searched Rope obtains shortest path, is designated as Route (A)；
The b0With a0Inequality b is met respectively0>∑w(vi)+∑w(ek) and a0≥n·b0；Wherein, b0More than in network The weights of node and link and, n is node total number；
5-6 is in network GrsThe middle two-way link by corresponding to Route (A) is respectively modified as a with the weights of node0With b0, The dijkstra's algorithm for considering node weights, search is called to obtain shortest path Route (B)；
The maximum non-intersect degree α of double route is calculated according to Route (A) and Route (B)st, its expression formula is： αst=card (Route (A) ∩ Route (B)), and obtain Route (A) and Route (B) common node weights.
8. method according to claim 7, it is characterised in that Route (a) is entered in the step (5-2) Row node split includes：By source point v in definition pathsTo destination node vtDirection for forward direction, rightabout is reverse； Other points on Route (a) in addition to the start and the end points only are divided into two, reverse link weights are 0 therebetween, positive Link metric is b0；
The reverse weights of all links in path are changed into into the opposite number of former link metric, forward link weights are a0；
The b0With a0Inequality b is met respectively0>∑w(vi)+∑w(ek), a0≥n·b0；Wherein, b0More than in network The weights of node and link and, n is node total number.
9. method according to claim 1, it is characterised in that the step (6) is using improved KSP Algorithm obtains multigroup maximum non-intersect double route set for meeting multiple constraint and specifically includes：
6-1 sets initial path quantity as K；
6-2 is using KSP algorithms in network GrIn search for source point v one by onesTo destination node vtPath；
If current path is L (1≤L≤K) paths, tieing up the weight vector under constraints in r is wr(Route(L))；
Work as wr(Route(L-1))<cr(s)≤wrWhen (Route (L)), terminate calculating, go to step 6-4；
Work as wr(Route (K)) ＜ crWhen (s), step 6-3 is gone to；Wherein, crS () is business s under r dimension constraintss Binding occurrence；
6-3 given thresholds increment is Δ K, Δ K ＞ 0；KN=KN-1+ Δ K, N ＞ 0；Circulation step (6-1) is to step (6-3), the K path of Δ to increasing newly is searched for one by one, until meeting wr(Route(L-1))<cr(s)≤wr(Route(L)) Into next step；Wherein, the number of times to increase threshold delta of N；
The path of any two meet the constraint is combined by 6-4, generates multigroup maximum non-intersect double route set；If In the set, each group of double route Route (x) is all met with Route (y)：Min (Route (x) ∩ Route (y) -2)=αst(1≤x ≤KN,1≤y≤KN, x ≠ y) reach maximum non-intersect degree αst；Next step is entered then；
Each group of double route Route (x) in multigroup maximum non-intersect double route set described in 6-5 is also full with Route (y) Foot：Min (card (Route (x) ∩ Route (y)))=min (card (Route (x1)∩Route(y1)))(1≤x≤KN,1≤y≤ KN,x≠y,1≤x1≤KN-1,1≤y1≤KN-1,x1≠y1), and wr(Route(KN))≥max(wr(Route (A)), wr(Route(B)))；Wherein, Route (A) and Route (B) is the maximum disjoint path that improved Bhandari algorithms are obtained Footpath.
10. method according to claim 1, it is characterised in that the step (7) is non-intersect to maximum double Route set carries out screening to be included, calculates the Network risk balance degree of each group of double route in double route set, obtains Business risk most double route in a balanced way；And less one of jumping figure in risk most balanced double route is defined as into current industry The primary route MR of business s, another is alternate routing SR.
11. methods according to claim 10, it is characterised in that the meter of the Network risk balance degree Calculation method is：
R G = &Sigma; e i j &Element; G &lsqb; R ( e i j ) - R ( e ) a v g &rsqb; / m + &Sigma; v i &Element; G &lsqb; R ( v i ) - R ( v ) a v g &rsqb; / n R ( e i j ) = &lsqb; 1 - S ( e i j ) &rsqb; &Sigma; s p &Element; e i j S W ( s p ) R ( v k ) = &lsqb; 1 - S ( v k ) &rsqb; &Sigma; s q &Element; v k S W ( s q )
Wherein, RGRepresent Network risk balance degree, RGIt is less that to represent network risks more balanced；M is lattice chain Way, n are number of network node；R(eij) and R (e)avrLink e is represented respectivelyijBusiness risk value and all links of network Business risk value average；R(vk) and R (v)avrNode v is represented respectivelykBusiness risk value and all nodes of network industry Business value-at-risk average；S(eij) and S (vk) link e is represented respectivelyijWith node vkCorresponding reliability；SW(sp) and SW (sq) Business s is represented respectivelypWith business sqBusiness importance degree；The business importance degree is set according to actual needs；Formula sp ∈eijExpression business spFor link eijOn the business that carried, formula sq∈vkExpression business sqFor node vkIt is upper to be held The business of load.
12. methods according to claim 1, it is characterised in that the step (8) includes that output is current The double route result of configuration service s, updates network distribution, return to step (3) if it there is surplus lines.
CN201510599548.7A 2015-09-18 2015-09-18 Multi-constraint power communication service maximum disjoint double-route configuration method Active CN106549779B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510599548.7A CN106549779B (en) 2015-09-18 2015-09-18 Multi-constraint power communication service maximum disjoint double-route configuration method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510599548.7A CN106549779B (en) 2015-09-18 2015-09-18 Multi-constraint power communication service maximum disjoint double-route configuration method

Publications (2)

Publication Number Publication Date
CN106549779A true CN106549779A (en) 2017-03-29
CN106549779B CN106549779B (en) 2020-01-24

Family

ID=58362539

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510599548.7A Active CN106549779B (en) 2015-09-18 2015-09-18 Multi-constraint power communication service maximum disjoint double-route configuration method

Country Status (1)

Country Link
CN (1) CN106549779B (en)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107612762A (en) * 2017-11-06 2018-01-19 贵州电网有限责任公司 Energy communication service alternate routing collocation method based on multiple constraint
CN108011817A (en) * 2017-11-09 2018-05-08 中国电力科学研究院有限公司 A kind of method and system disposed again to power communication private network business route
CN108111411A (en) * 2017-12-06 2018-06-01 上海神添实业有限公司 Backbone network and its active path planning system and planing method
CN109038794A (en) * 2018-07-11 2018-12-18 中国电力科学研究院有限公司 A kind of extra-high voltage grid system protection service path planing method towards QoS control
CN110289996A (en) * 2019-06-14 2019-09-27 浪潮思科网络科技有限公司 A kind of business route computing method based on SR
CN110768899A (en) * 2019-11-05 2020-02-07 厦门亿联网络技术股份有限公司 Shortest path determination method and device, storage medium and electronic device
CN110971525A (en) * 2019-11-26 2020-04-07 武汉大学 Service routing and addressing method for service operation of power communication network
CN111083578A (en) * 2019-12-03 2020-04-28 国家电网有限公司 Multi-objective optimization method for service classification light path roundabout route
CN111210361A (en) * 2019-12-30 2020-05-29 国网江苏省电力有限公司信息通信分公司 Power communication network routing planning method based on reliability prediction and particle swarm optimization
CN112653623A (en) * 2020-12-21 2021-04-13 国家电网有限公司信息通信分公司 Relay protection service-oriented route distribution method and device
CN113225259A (en) * 2021-04-13 2021-08-06 国家电网公司华北分部 Communication network route planning method
WO2022042571A1 (en) * 2020-08-25 2022-03-03 中兴通讯股份有限公司 Flow optimisation method, electronic device, and computer readable storage medium
CN114615184A (en) * 2022-03-18 2022-06-10 广东电网有限责任公司 Double-route planning method, device and system for power service

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6804199B1 (en) * 1998-12-10 2004-10-12 Sprint Communications Company, L.P. Communications network system and method for routing based on disjoint pairs of paths
CN101420379A (en) * 2008-11-14 2009-04-29 北京航空航天大学 Low consumption multi-path routing method for mobile ad hoc network
CN102201993A (en) * 2011-05-25 2011-09-28 电子科技大学 Computing method for cross-domain working path and protection path thereof
CN103873363A (en) * 2014-03-24 2014-06-18 华北电力大学（保定） Double route configuration method for electric power optical fiber communication net services

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6804199B1 (en) * 1998-12-10 2004-10-12 Sprint Communications Company, L.P. Communications network system and method for routing based on disjoint pairs of paths
CN101420379A (en) * 2008-11-14 2009-04-29 北京航空航天大学 Low consumption multi-path routing method for mobile ad hoc network
CN102201993A (en) * 2011-05-25 2011-09-28 电子科技大学 Computing method for cross-domain working path and protection path thereof
CN103873363A (en) * 2014-03-24 2014-06-18 华北电力大学（保定） Double route configuration method for electric power optical fiber communication net services

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
R. BHANDARI: ""Optimal diverse routing in telecommunication fiber networks"", 《IEEE XPLORE DIGITAL LIBRARY》 *
R. BHANDARI: ""Optimal physical diversity algorithms and survivable networks"", 《IEEE XPLORE DIGITAL LIBRARY》 *
孙晨 等: ""一种基于SRLG分离的双路由选择策略"", 《计算机技术与发展》 *
曾庆涛 等: ""电力通信业务路由分配算法"", 《北京邮电大学学报》 *

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107612762B (en) * 2017-11-06 2020-10-30 贵州电网有限责任公司 Power communication service standby route configuration method based on multiple constraints
CN107612762A (en) * 2017-11-06 2018-01-19 贵州电网有限责任公司 Energy communication service alternate routing collocation method based on multiple constraint
CN108011817A (en) * 2017-11-09 2018-05-08 中国电力科学研究院有限公司 A kind of method and system disposed again to power communication private network business route
CN108111411A (en) * 2017-12-06 2018-06-01 上海神添实业有限公司 Backbone network and its active path planning system and planing method
CN108111411B (en) * 2017-12-06 2020-12-22 上海神添实业有限公司 Backbone network and dynamic path planning system and planning method thereof
CN109038794A (en) * 2018-07-11 2018-12-18 中国电力科学研究院有限公司 A kind of extra-high voltage grid system protection service path planing method towards QoS control
CN109038794B (en) * 2018-07-11 2021-09-17 中国电力科学研究院有限公司 QoS control-oriented extra-high voltage power grid system protection service path planning method
CN110289996A (en) * 2019-06-14 2019-09-27 浪潮思科网络科技有限公司 A kind of business route computing method based on SR
CN110768899A (en) * 2019-11-05 2020-02-07 厦门亿联网络技术股份有限公司 Shortest path determination method and device, storage medium and electronic device
CN110971525B (en) * 2019-11-26 2021-02-19 武汉大学 Service routing and addressing method for service operation of power communication network
CN110971525A (en) * 2019-11-26 2020-04-07 武汉大学 Service routing and addressing method for service operation of power communication network
CN111083578A (en) * 2019-12-03 2020-04-28 国家电网有限公司 Multi-objective optimization method for service classification light path roundabout route
CN111083578B (en) * 2019-12-03 2021-11-16 国家电网有限公司 Multi-objective optimization method for service classification light path roundabout route
CN111210361A (en) * 2019-12-30 2020-05-29 国网江苏省电力有限公司信息通信分公司 Power communication network routing planning method based on reliability prediction and particle swarm optimization
WO2022042571A1 (en) * 2020-08-25 2022-03-03 中兴通讯股份有限公司 Flow optimisation method, electronic device, and computer readable storage medium
CN112653623A (en) * 2020-12-21 2021-04-13 国家电网有限公司信息通信分公司 Relay protection service-oriented route distribution method and device
CN113225259A (en) * 2021-04-13 2021-08-06 国家电网公司华北分部 Communication network route planning method
CN113225259B (en) * 2021-04-13 2022-11-29 国家电网公司华北分部 Communication network route planning method
CN114615184A (en) * 2022-03-18 2022-06-10 广东电网有限责任公司 Double-route planning method, device and system for power service
CN114615184B (en) * 2022-03-18 2024-04-02 广东电网有限责任公司 Dual route planning method, device and system for power service

Also Published As

Publication number Publication date
CN106549779B (en) 2020-01-24

Similar Documents

Publication Publication Date Title
CN106549779A (en) A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service
CN101313528B (en) Multi-domain route computation method and system
US8027260B2 (en) Mixed integer programming model for minimizing leased access network costs
CN103873363B (en) A kind of double route collocation method of power optical fiber communication network service
Dasgupta et al. Path-computation-element-based architecture for interdomain MPLS/GMPLS traffic engineering: overview and performance
CN106209621A (en) The link failure recovery method of qos constraint
CN106453085A (en) Business importance-based risk-balancing routing assignment method and system
CN101610433A (en) The multi-constraint condition routing selection method that a kind of support policy is resolved
CN106817306B (en) Method and device for determining target route
CN103348639A (en) Path selection method and control server
CN101753462A (en) Method and device for realizing multi-next-hop routes
CN105472484A (en) Wave channel balancing route wavelength allocation method of power backbone optical transport network
CN101909004B (en) Multi-domain optical network routing method based on edge ROADM (Reconfigurable Optical Add-Drop Multiplexer) ring structure
CN107800624A (en) A kind of optimal circuitous path selection new method of regional protection key message
CN108966053A (en) A kind of cross-domain route computing method of multiple-domain network dynamic domain sequence and device
CN105227461B (en) Method for acquiring cross-domain separation path and path calculation unit
Chellappan et al. A centrality entropy maximization problem in shortest path routing networks
Paganini Congestion control with adaptive multipath routing based on optimization
CN109067646A (en) It is a kind of flow table capacity by limited time SDN network flow optimization scheme
CN109861910B (en) Power communication network link importance calculation method based on link availability
JP2009260705A (en) Link and link capacitance extension method, and program therefor
CN105357080B (en) A kind of traffic engineering method applied to software defined network
JP4662286B2 (en) Point-to-multipoint path route calculation apparatus and program
CN107809393A (en) A kind of iink load balancing algorithm and device based on SDN
CN101383759A (en) Protection method dividing management region in optical network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant