CN108809828A - A kind of power communication network route method of load flow and business risk joint equalization - Google Patents
A kind of power communication network route method of load flow and business risk joint equalization Download PDFInfo
- Publication number
- CN108809828A CN108809828A CN201810499836.9A CN201810499836A CN108809828A CN 108809828 A CN108809828 A CN 108809828A CN 201810499836 A CN201810499836 A CN 201810499836A CN 108809828 A CN108809828 A CN 108809828A
- Authority
- CN
- China
- Prior art keywords
- link
- risk
- node
- load
- business
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/127—Shortest path evaluation based on intermediate node capabilities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention belongs to technical field of power system communication, and in particular to a kind of power communication network route method of load flow and business risk joint equalization.In terms of load flow equilibrium, the present invention considers link channel occupancy situation and node flow receives situation, and then devises the load weight function of link；In terms of business risk equilibrium, the availability of power telecom network optical fiber link is modeled, and then devises the balance policy for considering service priority and link bearer service risk；Finally, it introduces balance factor and constructs the link cost function for considering load and risk, to realize the joint equalization of current-carrying capacity and business risk.The present invention can adjust balance factor according to the significance level of business, can reduce the blocking rate and business risk of network, balanced link load flow and value-at-risk simultaneously, finally network be made to reach optimum performance.
Description
Technical field
The invention belongs to technical field of power system communication, and in particular to a kind of load flow and business risk joint equalization
Power communication network route method.
Background technology
Accelerate therewith with the gradually deployment and propulsion, the mutual dynamic frequency of source net lotus of energy internet, power telecom network is held
The production of load and management business will be increasing, and the new applications such as HD video distribution and cloud service are in the ascendant.Electric network information
Change business increases, and the demand to bandwidth is caused to increase, and available powerline network resource is limited, part backbone optical cable
Fibre core use has been approached saturation, there is the Bottle Neck Road of local optical cable fibre core in network, cannot be satisfied the demand of newly-built telecommunication circuit.
Business demand is gradually enriched with the increasingly complicated load imbalance problem made in powerline network of network topology increasingly
Prominent, part core node or important link carry a large amount of business datum, not only increase network vulnerability, also will produce
Bottleneck link leads to lower resource utilization.
On the other hand, electric caused by the human factors such as the natural calamities such as lightning stroke, icing, forest fire and excavation, construction
Power cable breakout fails, and case is commonplace, and Cable's Fault number accounting has occupied first of power telecom network defective proportion at present.According to fortune
According to statistics, Cable's Fault number accounts for the 87% of communication various kinds of equipment total failare to line number, and wherein ordinary optical cable is more susceptible to external force destruction,
Failure rate is up to 55%.Since the operation, scheduling and control of power grid need the support of information communication system, electrical network business to have typical case
Industry particularity, once in power telecom network fibercuts failure, by the safety in production and stable operation to electric system
Generate significant impact.
Therefore, it is necessary to which the routing to energy communication service optimizes, avoids a variety of important services while carrying Mr. Yu
On a little bottleneck links, while considering load balancing, to reduce the operation risk of power telecom network, improves its reliability
And handling capacity.
Invention content
Solving the problems, such as that power telecom network load flow and risk are unbalanced the object of the present invention is to provide a kind of, to improve electricity
Power Reliability of Communication Networks, reduce operation risk load flow and business risk joint equalization power communication network route method.
In order to achieve the above objectives, the technical solution adopted by the present invention is：
A kind of power communication network route method of load flow and business risk joint equalization, for realizing power telecom network
Equilibrium operating, the power communication network route method of the load flow and business risk joint equalization includes the following steps：
Step 1：The corresponding network topology G=(V, E, D, W) of the power telecom network is inputted, wherein V indicates the electric power
Node set in communication network, E indicate that the link set in the power telecom network, D indicate the link of the power telecom network
Distance matrix, W indicate the link capacity matrix of the power telecom network；Then every is initialized in the network topology G respectively
The load weights and risk weight of link are 1, and calculate the initial routing metric of each link accordingly；
Step 2：Wait for communication request Rq={ s, d, B, r }, wherein s indicate the communication request RqSource node, d indicate
The communication request RqDestination node, B indicates the communication request RqBandwidth on demand, r indicates the communication request RqWeight
It spends；
Step 3：The communication request RqAfter arrival, the routing metric in the network topology G based on each link is with most
Short-circuit shot is the communication request RqSearch work path P (s, d) executes step if the operating path P (s, d) exists
4；Otherwise block the communication request Rq, turn to step 2；
Step 4：Judge whether the idle capacity of all links on the operating path P (s, d) is all higher than bandwidth on demand B,
If then the operating path P (s, d) is available, it is operating path P (s, the d) partition capacity, updates in the network topology G
The idle capacity of each link executes step 5, otherwise blocks the communication request Rq, turn to step 2；
Step 5：Judge the communication request RqImportance r whether be greater than or equal to r0, r0To need configuration backup path industry
Otherwise the minimum value of the importance of business receives the communication request R if so, executing step 6q, turn to step 8；
Step 6：From the link deleted in the network topology G on the operating path P (s, d), the road based on each link
It is the communication request R by weights critical path method (CPM)qBackup path BP (s, d) is searched for, if backup path BP (s, d) exists,
Step 7 is executed, the communication request R is otherwise blockedq, turn to step 2；
Step 7：Judge whether the idle capacity of all links on the backup path BP (s, d) is all higher than bandwidth on demand B,
If then the backup path BP (s, d) is available, it is backup path BP (s, the d) partition capacity, receives the communication request
Rq, the idle capacity of each link in the network topology G is updated, step 8 is executed, is otherwise the working ways in release steps 4
The capacity of diameter P (s, d) distribution, blocks the communication request Rq, turn to step 2；
Step 8：Calculate and update the load weights of each link in the network topology G；
Step 9：Calculate and update the risk weight of each link in the network topology G；
Step 10：The routing metric of each link in the network topology G is calculated and updated, step 2 is turned to.
In the step 8, for the link x-y of connecting node x and node y in the network topology G, pass through following steps
It calculates it and loads weights：
Step 801：Read the remaining idle capacity f (x, y) on the link x-y；
Step 802：It utilizes
With
Calculate separately the flow receiving value λ (y) of the flow receiving value λ (x) and the node y of the node x；Wherein, v generations
Arbitrary node in network topology G described in table in addition to node y described in the node x/, W (x, v)/W (y, v) are the path
The initial capacity of the paths x-v/ y-v, f (x, v)/f (y, v) be path x-v/ path y-v idle capacity, sgn (x, v)/
Sgn (y, v) is respectively 0 or 1 variable, and when the node x/ nodes y and node v is abutted, sgn (x, v)/sgn (y, v) takes 1,
Otherwise 0 is taken；
Step 803：It utilizes
Calculate the load weights C of the link x-yLoad(x,y)；Wherein, C0(x, y) is the initial power of the link x-y
Value, W (x, y) are the initial capacity of the link x-y.
The transmission capacity that the initial capacity W (x, y) of the link x-y is multiplied by every core optical cable by the fibre core number of optical cable obtains.
The initial weight C of the link x-y0(x, y) is by cable length or routing cost determination.
In the step 9, for the link x-y of connecting node x and node y in the network topology G, pass through following steps
Calculate its risk weight：
Step 901：It utilizes
P (x, y)=AD(x,y)
Calculate the normal working probability p (x, y) of the link x-y；Wherein, D (x, y) indicates the physical length of link x-y,
A indicates the availability of every kilometer of optical fiber,In formula, MTTF refers to the average operation time before optical fiber failure,
MTTR refers to the average value of fiber failure repair time, and the unit of MTTF and MTTR are hour；
Step 902：It utilizes
Calculate the business risk R (x, y) of the link x-y；Wherein, N indicates that the business carried on the link x-y is total
Number, riIndicate the importance of i-th of business；
Step 903：It utilizes
Calculate the maximum traffic value-at-risk R that the link x-y can be carriedM(x,y)；Wherein, BminIndicate all service requests
The minimum value of bandwidth, rmaxIndicate the maximum value of all service request importances；
Step 904：It utilizes
Calculate the risk weight C of the link x-yRisk(x,y)。
In the step 10, for the link x-y of connecting node x and node y in the network topology G, pass through following step
Suddenly its routing metric is calculated：
Step 1001：It utilizes
To the load weights C of the link x-yLoad(x, y) carries out homogenization processing, maps that on section [0,1]
Obtain value of the load weights of the link x-y after homogenizationWhereinFor the load weights of all links
Maximum value,For the minimum value of the load weights of all links；
Step 1002：It utilizes
To the risk weight C of the link x-yRisk(x, y) carries out homogenization processing, maps that on section [0,1]
Obtain value of the risk weight of the link x-y after homogenizationWhereinFor the risk weight of all links
Maximum value,For the minimum value of the risk weight of all links；
Step 1003：Introduce values of the balance factor α to the load weights of the link x-y after homogenization
With value of the risk weight after homogenizationIt is adjusted, utilizes
Calculate the routing metric C (x, y) of the link x-y；Wherein, 0≤α≤1.
In the step 1, the initial road of each link is calculated using routing metric=α load weights+(1- α) * risk weights
By weights.
Since above-mentioned technical proposal is used, the present invention has following advantages compared with prior art：The present invention is for current
Power telecom network loads the deficiency with risk balance routing algorithm, namely algorithm is distinguished for load balancing and risk balance mostly
It is designed, seldom the two is carried out at the same time and is considered the problems of, it is proposed that a kind of load flow and business risk joint equalization
Method for routing.In terms of load flow equilibrium, the present invention considers link channel occupancy situation and node flow receives situation, into
And devise the load weight computing function of link；In terms of business risk equilibrium, power telecom network optical fiber link can be used
Property modeled, and then devise the balance policy for considering service priority and link bearer service risk；Finally, it introduces equal
The weighing apparatus factor constructs the link cost function for considering load and risk, and the joint to realize current-carrying capacity and business risk is equal
Weighing apparatus.The present invention can adjust balance factor according to the significance level of business, can reduce the blocking rate and business risk of network simultaneously,
Balanced link load flow and value-at-risk, finally make network reach optimum performance.
Description of the drawings
Attached drawing 1 is the flow of the load flow of the present invention and the power communication network route method of business risk joint equalization
Figure.
Attached drawing 2 is the schematic diagram of calculate node flow receiving value；
Attached drawing 3 is verifies the test network of institute's extracting method validity of the present invention；
Attached drawing 4 is the comparing result of blocking rate of the different method for routing under different business number of request.
Attached drawing 5 is the comparing result of each algorithm link risk standard difference under different business number of request.
Specific implementation mode
The invention will be further described for embodiment shown in below in conjunction with the accompanying drawings.
Embodiment one：As shown in Fig. 1,
A kind of load flow of equilibrium operating for realizing power telecom network is logical with the electric power of business risk joint equalization
Believe network route method, includes the following steps：
Step 1：In the control system of power telecom network the corresponding network topology G=of input electric power communication network (V, E, D,
W), wherein V indicates that the node set in power telecom network, E indicate that the link set in power telecom network, D indicate power communication
The link range matrix of net, W indicate the link capacity matrix of power telecom network, | V | and | E | it indicates in power telecom network respectively
Node total number and link sum.Then the load weights and risk weight of each of the links are in initialization network topology G respectively
1, and the initial routing metric of each link is calculated accordingly.Each of the links in network topology G are corresponded to and introduce balance factor α, are utilized
Routing metric=α load weights+(1- α) * risk weights calculate the initial routing metric of each link, the load weights used here
That is its initial value 1, risk weight i.e. its initial value 1, balance factor α belong in [0,1] section.
Step 2：Wait for communication request Rq={ s, d, B, r }, wherein s indicate communication request RqSource node, d indicate communication
Ask RqDestination node, B indicates communication request RqBandwidth on demand, r indicates communication request RqImportance.
Step 3：Communication request RqAfter arrival, the routing metric critical path method (CPM) based on each link in network topology G
For communication request RqSearch work path P (s, d) executes step 4 if operating path P (s, d) exists；Otherwise blocking communication is asked
Seek Rq, turn to step 2.As communication request RqFor first communication request when, the routing power for the link that when search work path is utilized
The initial routing metric being calculated in value, that is, step 1.If communication request RqNot when first communication request, search work road
The routing metric of the link utilized when diameter i.e. a preceding communication request when routing metric that is calculated.
Step 4：Judge whether the idle capacity of all links on operating path P (s, d) is all higher than bandwidth on demand B, if
Then operating path P (s, d) is available, is operating path P (s, d) partition capacity, updates the idle of each link in network topology G and holds
Amount executes step 5, and otherwise blocking communication asks Rq, turn to step 2.
Step 5：Judge communication request RqImportance r whether be greater than or equal to r0, r0To need configuration backup path service
Otherwise the minimum value of importance receives communication request R if so, executing step 6q, turn to step 8.
Step 6：From the link deleted in network topology G on operating path P (s, d), the routing metric based on each link is used
Critical path method (CPM) is communication request RqBackup path BP (s, d) is searched for, if backup path BP (s, d) exists, executes step 7, it is no
Then blocking communication asks Rq, turn to step 2.As communication request RqFor first communication request when, utilized when searching for backup path
The initial routing metric being calculated in routing metric, that is, step 1 of link.If communication request RqNot first communication request
When, search for the routing metric of link utilized when backup path i.e. a preceding communication request when routing metric that is calculated.
Step 7：Judge whether the idle capacity of all links on backup path BP (s, d) is all higher than bandwidth on demand B, if
Then backup path BP (s, d) is available, is backup path BP (s, d) partition capacity, receives communication request Rq, update network topology G
In each link idle capacity, execute step 8, be otherwise the capacity of operating path P (s, d) distribution in release steps 4, obstruction is logical
Letter request Rq, turn to step 2.
Step 8：Calculate and update the load weights of each link in network topology G.
For the link x-y of connecting node x in network topology G and node y, calculates it by following steps and load weights：
Step 801：Read the remaining idle capacity f (x, y) on link x-y；
Step 802：For a node, (such as node x or node y), flow receiving value are defined as being connected with the node
All links on the ratio of the sum of idle capacity with the sum of the initial capacity of these chain roads.Therefore, it utilizes
With
Calculate separately the flow receiving value λ (y) of the flow receiving value λ (x) and node y of node x；Wherein, v represents network and opens up
The arbitrary node in addition to node x/ nodes y in G is flutterred, W (x, v)/W (y, v) is the initial capacity of the path paths x-v/ y-v, f
(x, v)/f (y, v) is the idle capacity of the path paths x-v/ y-v, and sgn (x, v)/sgn (y, v) is respectively 0 or 1 variable, when
Node x/ nodes y is abutted with node v, i.e. when the paths path x-v/ y-v constitutes link x-v/ link y-v, sgn (x, v)/sgn (y,
V) 1 is taken, otherwise takes 0；
Step 803：It utilizes
Calculate the load weights C of link x-yLoad(x,y)；Wherein, C0(x, y) is the initial weight of link x-y, by optical cable
Length or routing cost determination, cable length is longer, the initial weight C of link x-y0(x, y) is bigger, and routing cost is higher, chain
The initial weight C of road x-y0(x, y) is bigger；W (x, y) is the initial capacity of link x-y, and every core light is multiplied by by the fibre core number of optical cable
The transmission capacity of cable obtains.
Step 9：Calculate and update the risk weight of each link in network topology G.
For the link x-y of connecting node x in network topology G and node y, its risk weight is calculated by following steps：
Step 901：It utilizes
P (x, y)=AD(x,y)
Calculate the normal working probability p (x, y) of link x-y；Wherein, D (x, y) indicates the physical length of link x-y, unit
The availability of every kilometer of optical fiber is indicated for km, A,In formula, MTTF refers to average operation before optical fiber failure
Time, MTTR refer to the average value of fiber failure repair time, and the unit of MTTF and MTTR are hour；
Step 902：For link x-y, business risk be defined as the importances of all business carried on link x-y with
The sum of the product of link x-y failure probabilities, that is, utilize
Calculate the business risk R (x, y) of link x-y；Wherein, N indicates the business carried on link x-y sum, riIt indicates
The importance of i-th of business；
Step 903：It utilizes
Calculate the maximum traffic value-at-risk R that link x-y can be carriedM(x,y)；Wherein, BminIndicate all service request bandwidth
Minimum value, rmaxIndicate the maximum value of all service request importances；
Step 904：It utilizes
Calculate the risk weight C of link x-yRisk(x, y), wherein lnA are using e as the logarithm of bottom A.
Step 10：The routing metric of each link in network topology G is calculated and updated, step 2 is turned to.
For the link x-y of connecting node x in network topology G and node y, its routing metric is calculated by following steps：
Step 1001：It utilizes
To the load weights C of link x-yLoad(x, y) carries out homogenization processing, maps that on section [0,1] and obtains
Value of the load weights of link x-y after homogenizationWhereinFor the maximum of the load weights of all links
Value,For the minimum value of the load weights of all links；
Step 1002：It utilizes
To the risk weight C of link x-yRisk(x, y) carries out homogenization processing, maps that on section [0,1] and obtains
Value of the risk weight of link x-y after homogenizationWhereinFor the maximum value of the risk weight of all links,For the minimum value of the risk weight of all links；
Step 1003：Introduce values of the balance factor α to the load weights of link x-y after homogenizationAnd wind
Value of the dangerous weights after homogenizationIt is adjusted, utilizes
Calculate the routing metric C (x, y) of link x-y；Wherein it is possible to according to business significance level adjustment balance factor α, 0
≤ α≤1 should make balance factor α smaller if the significance level of business is higher.
Routing metric of the routing metric of calculated each link as each link when routeing next time, can be sent to electricity
It is updated storage in the routing module of power communication network, waits for next communication request after turning to step 2, and in next communication request
When arrival, the search of operating path and backup path is carried out using preceding primary calculated routing metric.
Fig. 2 is the schematic diagram of calculate node flow receiving value in the present invention.
The underlying dielectric of transmission network is Optical Cable network, it is assumed that at a certain moment in power telecom network a few links appearance
It is as shown in Figure 2 to measure occupancy situation.Label on figure link, the former available free capacity, the latter indicate that link can carry
The total capacity of confession.Such as the total capacity of link a-b is 96, available idle capacity is 34, that is, W (a, b)=
96, f (a, b)=34.According in step 802 about definition, herein So flow receiving value λ (a)=157/316=of node a can be obtained
0.50, it can similarly obtain λ (b)=0.35.In the network starting stage, i.e., when being transmitted without business, the flow receiving value of all nodes is equal
It is 1, with the increase of business intensity transmission, node starts transmission business, flow receiving value is gradually reduced.
Fig. 3 is the emulation net of the present invention carried load flow and the power communication network route method of business risk joint equalization
Network.
This fiber cable network by the transformer substation communication website of 29 220kV or more and 48 different fibre core numbers cable link
Composition, node average degree are 3.3.No. 14 websites are control centres in figure, and No. 5, No. 20 and No. 29 are 500kV substations,
Remaining website is 220kV substations, and the fibre core number and length of optical cable are marked in figure.Such as " 36F/13.3km " refers to Cable Core Number and is
36 cores, length are 13.3 kilometers.Dotted line link is the lightguide cable link that will be built up and put into operation in figure.In step 901, according to
Documents and materials, it is respectively 7600h and 12h to take MTTF the and MTTR values of every kilometer of power optical fiber, and assumes that the random of each business divides
It is distributed in network.Energy communication service is fallen into 5 types：Ith class business is 500kV/220kV relay protection business, and importance is
0.99；IIth class business is stable system, and business importance is 0.94；IIIth class business is wide area phasor measurement, dispatches automatically
Change, dispatching telephone and electrical energy measurement business, importance 0.62；IVth class business be transformer substation video monitoring, television consultation and
Protection information management business, importance 0.29；Vth class business is office automation, administration telephone and cloud terminal applies industry
Business, importance 0.13.In addition, the balance factor α in step 1003 takes 0.45.
Fig. 4 is institute's extracting method of the present invention (Load and Risk Joint Balance, LRJB) and pure load balancing
Method (Load Balance Technique, LBT) and pure risk balance method for routing (Minimum Fault Risk
Loss Probability Protection, MFRL-PP) blocking rate under different business number of request comparing result.
Blocking rate is defined as the ratio between request sum for the communication request and initiation being blocked.From fig. 4, it can be seen that as business is asked
Several increases, each algorithm blocking rate is asked gradually to rise, the wherein blocking rate of LBT is minimum, the blocking rate highest of MFRL-PP, LRJB
Blocking rate be slightly above the blocking rate of LBT.This is because LBT devises the routing cost function for considering link capacity state, it can
To be effectively reduced obstruction；And MFRL-PP does not account for the initial capacity of link and the state of node then.The blocking rate of LRJB with
Several Typical Load equalization algorithm is very close, and the service request the how closer.This shows LRJB load balancing effects and LBT phases
When, but its risk balance effect is better than LBT, can make the value-at-risk smaller of network.
Fig. 5 is each algorithm link risk standard difference comparison under different business number of request.Its link risk standard difference defines
For：
In formula：REIt is that link risk standard is poor；E is the link set in network；| E | indicate the link sum in network；R
(x, y) is the risk of link x-y, is defined in step 902；μ is the mean value of the risk of each link in network.
In Figure 5, in network business increase, the standard deviation of the value-at-risk of each link gradually increases, this is by electricity
What the convergence characteristic of power communication service determined.Give no thought to the risk standard difference of the LBT of link risk far above MFRL-PP and
LRJB, and the more intensive gap of business is bigger.The risk standard difference of LRJB be when number of request is less than 13000 it is minimum in three,
Average specific MFRL-PP low 0.78, lower than LBT 5.70；It is more than its standard deviation then a little higher than MFRL-PP after 13000 in number of request.This
Illustrate that the risk balance effect of LRJB is close with MFRL-PP, but its blocking rate ratio MFRL-PP is low.
The above embodiments merely illustrate the technical concept and features of the present invention, and its object is to allow person skilled in the art
Scholar cans understand the content of the present invention and implement it accordingly, and it is not intended to limit the scope of the present invention.It is all according to the present invention
Equivalent change or modification made by Spirit Essence, should be covered by the protection scope of the present invention.
Claims (7)
1. the power communication network route method of a kind of load flow and business risk joint equalization, for realizing power telecom network
Equilibrium operating, it is characterised in that：The power communication network route method of the load flow and business risk joint equalization include with
Lower step：
Step 1：The corresponding network topology G=(V, E, D, W) of the power telecom network is inputted, wherein V indicates the power communication
Node set in net, E indicate that the link set in the power telecom network, D indicate the link range of the power telecom network
Matrix, W indicate the link capacity matrix of the power telecom network；Then each of the links in the network topology G are initialized respectively
Load weights and risk weight be 1, and calculate the initial routing metric of each link accordingly；
Step 2：Wait for communication request Rq={ s, d, B, r }, wherein s indicate the communication request RqSource node, d indicate described in
Communication request RqDestination node, B indicates the communication request RqBandwidth on demand, r indicates the communication request RqIt is important
Degree；
Step 3：The communication request RqAfter arrival, the routing metric shortest path based on each link in the network topology G
Method is the communication request RqSearch work path P (s, d) executes step 4 if the operating path P (s, d) exists；Otherwise
Block the communication request Rq, turn to step 2；
Step 4：Judge whether the idle capacity of all links on the operating path P (s, d) is all higher than bandwidth on demand B, if
Then the operating path P (s, d) is available, is operating path P (s, the d) partition capacity, updates each chain in the network topology G
The idle capacity on road executes step 5, otherwise blocks the communication request Rq, turn to step 2；
Step 5：Judge the communication request RqImportance r whether be greater than or equal to r0, r0To need configuration backup path service
Otherwise the minimum value of importance receives the communication request R if so, executing step 6q, turn to step 8；
Step 6：From the link deleted in the network topology G on the operating path P (s, d), the routing power based on each link
Value critical path method (CPM) is the communication request RqBackup path BP (s, d) is searched for, if backup path BP (s, d) exists, is executed
Step 7, otherwise block the communication request Rq, turn to step 2；
Step 7：Judge whether the idle capacity of all links on the backup path BP (s, d) is all higher than bandwidth on demand B, if
Then the backup path BP (s, d) is available, is backup path BP (s, the d) partition capacity, receives the communication request Rq, more
The idle capacity of each link in the new network topology G, executes step 8, be otherwise in release steps 4 the operating path P (s,
D) capacity distributed, blocks the communication request Rq, turn to step 2；
Step 8：Calculate and update the load weights of each link in the network topology G；
Step 9：Calculate and update the risk weight of each link in the network topology G；
Step 10：The routing metric of each link in the network topology G is calculated and updated, step 2 is turned to.
2. the power communication network route method of load flow according to claim 1 and business risk joint equalization, special
Sign is：In the step 8, for the link x-y of connecting node x and node y in the network topology G, pass through following steps
It calculates it and loads weights：
Step 801：Read the remaining idle capacity f (x, y) on the link x-y；
Step 802：It utilizes
With
Calculate separately the flow receiving value λ (y) of the flow receiving value λ (x) and the node y of the node x；Wherein, v represents institute
The arbitrary node in addition to node y described in the node x/ in network topology G is stated, W (x, v)/W (y, v) is the path x-v/
The initial capacity of path y-v, f (x, v)/f (y, v) are the idle capacity of path x-v/ path y-v, sgn (x, v)/sgn
(y, v) is respectively 0 or 1 variable, and when the node x/ nodes y and node v is abutted, sgn (x, v)/sgn (y, v) takes 1, no
Then take 0；
Step 803：It utilizes
Calculate the load weights C of the link x-yLoad(x,y)；Wherein, C0(x, y) is the initial weight of the link x-y, W
(x, y) is the initial capacity of the link x-y.
3. the power communication network route method of load flow according to claim 2 and business risk joint equalization, special
Sign is：The transmission capacity that the initial capacity W (x, y) of the link x-y is multiplied by every core optical cable by the fibre core number of optical cable obtains.
4. the power communication network route method of load flow according to claim 2 and business risk joint equalization, special
Sign is：The initial weight C of the link x-y0(x, y) is by cable length or routing cost determination.
5. the power communication network route method of load flow according to claim 2 and business risk joint equalization, special
Sign is：In the step 9, for the link x-y of connecting node x and node y in the network topology G, pass through following steps
Calculate its risk weight：
Step 901：It utilizes
P (x, y)=AD(x,y)
Calculate the normal working probability p (x, y) of the link x-y；Wherein,；Wherein, D (x, y) indicates that the physics of link x-y is long
Degree, A indicate the availability of every kilometer of optical fiber,In formula, when MTTF refers to average operation before optical fiber fails
Between, MTTR refers to the average value of fiber failure repair time, and the unit of MTTF and MTTR are hour；
Step 902：It utilizes
Calculate the business risk R (x, y) of the link x-y；Wherein, N indicates the business carried on the link x-y sum, riTable
Show the importance of i-th of business；
Step 903：It utilizes
Calculate the maximum traffic value-at-risk R that the link x-y can be carriedM(x,y)；Wherein, BminIndicate all service request bandwidth
Minimum value, rmaxIndicate the maximum value of all service request importances；
Step 904：It utilizes
Calculate the risk weight C of the link x-yRisk(x,y)。
6. the power communication network route method of load flow according to claim 5 and business risk joint equalization, special
Sign is：In the step 10, for the link x-y of connecting node x and node y in the network topology G, pass through following steps
Calculate its routing metric：
Step 1001：It utilizes
To the load weights C of the link x-yLoad(x, y) carries out homogenization processing, maps that on section [0,1] and obtains institute
State value of the load weights of link x-y after homogenizationWhereinFor the maximum of the load weights of all links
Value,For the minimum value of the load weights of all links；
Step 1002：It utilizes
To the risk weight C of the link x-yRisk(x, y) carries out homogenization processing, maps that on section [0,1] and obtains institute
State value of the risk weight of link x-y after homogenizationWhereinFor the maximum of the risk weight of all links
Value,For the minimum value of the risk weight of all links；
Step 1003：Introduce values of the balance factor α to the load weights of the link x-y after homogenizationAnd risk
Value of the weights after homogenizationIt is adjusted, utilizes
Calculate the routing metric C (x, y) of the link x-y；Wherein, 0≤α≤1.
7. the power communication network route method of load flow according to claim 6 and business risk joint equalization, special
Sign is：In the step 1, the initial routing of each link is calculated using routing metric=α load weights+(1- α) * risk weights
Weights.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810499836.9A CN108809828B (en) | 2018-05-23 | 2018-05-23 | Power communication network routing method for joint balance of load flow and business risk |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810499836.9A CN108809828B (en) | 2018-05-23 | 2018-05-23 | Power communication network routing method for joint balance of load flow and business risk |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108809828A true CN108809828A (en) | 2018-11-13 |
| CN108809828B CN108809828B (en) | 2021-02-26 |
Family
ID=64091378
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810499836.9A Active CN108809828B (en) | 2018-05-23 | 2018-05-23 | Power communication network routing method for joint balance of load flow and business risk |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108809828B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109861910A (en) * | 2019-03-11 | 2019-06-07 | 国网福建省电力有限公司 | A kind of power telecom network link importance calculation method based on link availability |
| CN110011916A (en) * | 2019-03-21 | 2019-07-12 | 华北电力大学 | A kind of electric power OTN backbone network route distribution method based on node risk |
| CN112104554A (en) * | 2020-08-27 | 2020-12-18 | 国网内蒙古东部电力有限公司信息通信分公司 | Comprehensive data network service differentiation protection method based on link failure |
| CN112118176A (en) * | 2020-08-27 | 2020-12-22 | 国网内蒙古东部电力有限公司信息通信分公司 | Service reliability-oriented comprehensive data network channel routing load optimization method |
| CN114245245A (en) * | 2021-12-31 | 2022-03-25 | 杭州电子科技大学 | Power service channel resource allocation method and device based on multilink failure |
| CN114553767A (en) * | 2021-11-04 | 2022-05-27 | 国网浙江省电力有限公司湖州供电公司 | Rerouting technology for survivability of power communication network |
| CN114926102A (en) * | 2022-07-21 | 2022-08-19 | 东南大学溧阳研究院 | Energy and information resource cooperative control method under information physical disturbance |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102088409A (en) * | 2011-01-04 | 2011-06-08 | 中国人民解放军信息工程大学 | Multi-next-hop route implementation method |
| CN102546381A (en) * | 2010-12-08 | 2012-07-04 | 中国科学院声学研究所 | Method of selecting IP (internet protocol) network data transmission path |
| CN103152284A (en) * | 2013-03-18 | 2013-06-12 | 神州数码网络(北京)有限公司 | Method for balancing multipath output intelligent loads of router and router |
| CN103268701A (en) * | 2013-06-05 | 2013-08-28 | 王燚 | Urban road network load balancing method |
| CN103560952A (en) * | 2013-10-14 | 2014-02-05 | 广州捷能电力科技有限公司 | Node failure recovery method for micro network |
| CN103685054A (en) * | 2013-12-18 | 2014-03-26 | 武汉烽火网络有限责任公司 | Multipath load balancing method based on service awareness |
| US20140126899A1 (en) * | 2012-11-02 | 2014-05-08 | Anurag Prakash | Mesh restoration and bandwidth allocation systems and methods for shared risk connection groups |
| CN103971182A (en) * | 2014-05-26 | 2014-08-06 | 湖南大学 | Online risk monitoring system of feeder lines of power distribution network and monitoring method thereof |
| CN105376156A (en) * | 2015-11-11 | 2016-03-02 | 国家电网公司 | Multi-attribute decision-making based power backbone transmission network route planning method |
-
2018
- 2018-05-23 CN CN201810499836.9A patent/CN108809828B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546381A (en) * | 2010-12-08 | 2012-07-04 | 中国科学院声学研究所 | Method of selecting IP (internet protocol) network data transmission path |
| CN102088409A (en) * | 2011-01-04 | 2011-06-08 | 中国人民解放军信息工程大学 | Multi-next-hop route implementation method |
| US20140126899A1 (en) * | 2012-11-02 | 2014-05-08 | Anurag Prakash | Mesh restoration and bandwidth allocation systems and methods for shared risk connection groups |
| CN103152284A (en) * | 2013-03-18 | 2013-06-12 | 神州数码网络(北京)有限公司 | Method for balancing multipath output intelligent loads of router and router |
| CN103268701A (en) * | 2013-06-05 | 2013-08-28 | 王燚 | Urban road network load balancing method |
| CN103560952A (en) * | 2013-10-14 | 2014-02-05 | 广州捷能电力科技有限公司 | Node failure recovery method for micro network |
| CN103685054A (en) * | 2013-12-18 | 2014-03-26 | 武汉烽火网络有限责任公司 | Multipath load balancing method based on service awareness |
| CN103971182A (en) * | 2014-05-26 | 2014-08-06 | 湖南大学 | Online risk monitoring system of feeder lines of power distribution network and monitoring method thereof |
| CN105376156A (en) * | 2015-11-11 | 2016-03-02 | 国家电网公司 | Multi-attribute decision-making based power backbone transmission network route planning method |
Non-Patent Citations (1)
| Title |
|---|
| 赵子岩: "基于业务风险均衡度的电力通信网可靠性评估算法", 《电网技术》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109861910A (en) * | 2019-03-11 | 2019-06-07 | 国网福建省电力有限公司 | A kind of power telecom network link importance calculation method based on link availability |
| CN109861910B (en) * | 2019-03-11 | 2021-06-22 | 国网福建省电力有限公司 | Power communication network link importance calculation method based on link availability |
| CN110011916A (en) * | 2019-03-21 | 2019-07-12 | 华北电力大学 | A kind of electric power OTN backbone network route distribution method based on node risk |
| CN112104554A (en) * | 2020-08-27 | 2020-12-18 | 国网内蒙古东部电力有限公司信息通信分公司 | Comprehensive data network service differentiation protection method based on link failure |
| CN112118176A (en) * | 2020-08-27 | 2020-12-22 | 国网内蒙古东部电力有限公司信息通信分公司 | Service reliability-oriented comprehensive data network channel routing load optimization method |
| CN114553767A (en) * | 2021-11-04 | 2022-05-27 | 国网浙江省电力有限公司湖州供电公司 | Rerouting technology for survivability of power communication network |
| CN114245245A (en) * | 2021-12-31 | 2022-03-25 | 杭州电子科技大学 | Power service channel resource allocation method and device based on multilink failure |
| CN114245245B (en) * | 2021-12-31 | 2024-03-26 | 杭州电子科技大学 | Power service channel resource allocation method and device based on multilink failure |
| CN114926102A (en) * | 2022-07-21 | 2022-08-19 | 东南大学溧阳研究院 | Energy and information resource cooperative control method under information physical disturbance |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108809828B (en) | 2021-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108809828A (en) | A kind of power communication network route method of load flow and business risk joint equalization | |
| CN102231647B (en) | Fiber communication network service route configuration method used in electric power | |
| CN103873363B (en) | A kind of double route collocation method of power optical fiber communication network service | |
| CN110365589A (en) | A kind of routing of electric power optical transport and frequency spectrum distributing method based on elastic optical network | |
| CN106506357A (en) | A kind of double route collocation method of power telecom network and device | |
| CN111191918A (en) | Service route planning method and device for smart power grid communication network | |
| CN112887207B (en) | Service route distribution method and device for power IP-optical communication network | |
| CN114025264B (en) | Route planning method for electric power communication SDH optical transmission network | |
| CN104579775A (en) | Resource allocation method and device for electric power communication optical fibers and optical transmission devices | |
| Xing et al. | Load balancing-based routing optimization mechanism for power communication networks | |
| CN105610555B (en) | A kind of practical system-level redundancy communication network framework | |
| CN106506190B (en) | A kind of communication network operating system and operation method | |
| CN109861855B (en) | Method and device for determining importance of nodes in power communication network | |
| CN107453786A (en) | A kind of powerline network method for establishing model and device | |
| Wang et al. | Electricity services based dependability model of power grid communication networking | |
| CN110458375A (en) | A kind of Economic Dispatch method considering electric network swim distributing equilibrium degree | |
| Li et al. | Application of ${p} $-Cycle Protection for the Substation Communication Network Under SRLG Constraints | |
| CN116319565A (en) | Load balancing system, method, equipment and storage medium based on online computing | |
| CN109842522A (en) | Communicate the configuration method and system of route resource | |
| Ji et al. | Comprehensive vulnerability assessment and optimisation method of power communication network | |
| CN107360480A (en) | A kind of ONU packet planing methods based on load balancing | |
| Elroby et al. | Generalized optimal placement of PMUs considering power system observability, communication infrastructure, and quality of service requirements | |
| CN109861910A (en) | A kind of power telecom network link importance calculation method based on link availability | |
| Du et al. | Multi-objective Routing Optimization for Electric Power Communication Network Considering Business Importance | |
| CN104283779B (en) | A kind of determination method and apparatus of Multiple Spanning Tree (MST) region |
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 |