CN106230724B - Power telecom network route computing method - Google Patents
Power telecom network route computing method Download PDFInfo
- Publication number
- CN106230724B CN106230724B CN201610862577.2A CN201610862577A CN106230724B CN 106230724 B CN106230724 B CN 106230724B CN 201610862577 A CN201610862577 A CN 201610862577A CN 106230724 B CN106230724 B CN 106230724B
- Authority
- CN
- China
- Prior art keywords
- node
- voltage class
- weight matrix
- present
- starting point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004364 calculation method Methods 0.000 title claims abstract description 39
- 239000011159 matrix material Substances 0.000 claims abstract description 83
- 238000000034 method Methods 0.000 claims abstract description 12
- 238000013178 mathematical model Methods 0.000 claims description 3
- 230000000452 restraining effect Effects 0.000 claims description 2
- 238000011161 development Methods 0.000 abstract description 5
- 238000004891 communication Methods 0.000 description 22
- 230000008569 process Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 230000005611 electricity Effects 0.000 description 2
- 238000001914 filtration Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000010248 power generation Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005111 flow chemistry technique Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
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/124—Shortest path evaluation using a combination of metrics
-
- 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/302—Route determination based on requested QoS
- H04L45/306—Route determination based on the nature of the carried application
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of power telecom network route computing methods, and the method includes: the initial weight matrix of the start node is established by the distance between start node and each node information；At least one filtered matrix is established respectively according at least one power business restrictive condition；The weight matrix of the with constraint conditions of start node is obtained by the initial weight matrix and the filtered matrix；The business obtained between start node and terminal node is calculated according to the weight matrix of the with constraint conditions routes optimal path；With this, original power telecom network Shortest path routing calculation method is improved, the coordinated development of business demand and path planning is realized.
Description
Technical field
The present invention relates to field of power communication, espespecially a kind of power communication network service route computing method.
Background technique
Power communication is to realize the basis of power generation dispatching automation and management modernization, is to ensure that power grid security, steady
Fixed, economical operation important guarantee, is the indispensable link of power generation.With strong smart grid development, power grid
Requirements at the higher level are proposed to communication bandwidth, time delay and reliability etc., the type of operation control business is also being continuously increased, to communication
Degree of dependence it is higher and higher.
As the basis of power telecom network construction, the result of communication network planning and design is built upon the calculation method of science
On the basis of reliable initial data, there are many problems for communication planning work at present.On the one hand, due to lacking scientific number
Scale according to management system and planning initial data constantly expands, and seriously limits the accuracy and planning effect of planning.It is another
Aspect, with the development of power telecom network, stage construction, multi-vendor, polymorphic type equipment are run on same communication network, network
Scale it is increasing, structure becomes increasingly complex, and type of business is more various, and service traffics are unevenly distributed weighing apparatus, how accurate high
Planning service path in effect ground is particularly important.
Business routing is planned currently, being proposed in terms of considering reliability of electric force communication network in existing technical solution
Algorithm and consider route different degree in terms of come distribute business routing method, but they only consider unilaterally because usually realization pair
The planning of service path is not suitable for requirement of the practical communication wire side to plan of operation, and is not carried out engineering；Big portion simultaneously
Sub-path planning algorithm all only only accounts for the parameter in path itself, such as length, and node degree of communication etc. does not consider power business
Demand, the business demand for thering is an other algorithm to consider, but algorithm complexity is high, can theoretically realize, but in real work
In it is not easy to operate, can not large-scale promotion application.
Summary of the invention
It is an object of that present invention to provide a kind of power telecom network route computing method towards power business demand, to
While considering that business demand is planned, the problems such as algorithm complexity is high and not easy to operate is reduced, before accurately and effectively
Putting makes the calculation method can be in large-scale application.
In order to achieve the above object, the present invention specifically provides a kind of power telecom network route computing method, the method includes: logical
Cross the initial weight matrix that the distance between start node and each node information establish the start node；According at least one electricity
Power business restrictive condition establishes at least one filtered matrix respectively；It is obtained by the initial weight matrix and the filtered matrix
The weight matrix of the with constraint conditions of start node；According to the weight matrix of the with constraint conditions calculate obtain start node and
Business between terminal node routes optimal path.
In above-mentioned power telecom network route computing method, it is preferred that it is described respectively obtain starting point start node and
The nodal information of the terminal node of clearing end also includes: when power telecom network includes different node levels；Obtain present node
VnVoltage class and destination node VkVoltage class, and compare present node VnVoltage class and the destination node Vk
Node level；The start node of starting point and the terminal node of clearing end are determined according to comparison result.
In above-mentioned power telecom network route computing method, it is preferred that the weight square according to the with constraint conditions
Battle array calculates the business routing optimal path obtained between start node and terminal node: according to the start node VnElectricity
Press grade and the terminal node VkVoltage class, inquire between the start node VnVoltage class and the terminal node
Point VkVoltage class between voltage class corresponding to channel node Vn+b(n+b < k) and the start node VnWhether deposit
In optimal path；With the channel node V if existingn+bFor new start node, according to the new start node Vn+bWith
Destination node VkAcquisition optimal path.
In above-mentioned power telecom network route computing method, it is preferred that the relatively present node VnVoltage class with
The destination node VkNode level also include: compare present node VnVoltage class and the destination node VkNode
Grade, as the destination node VkVoltage class be less than the present node VnVoltage class, and the destination node Vk's
Voltage class and the present node VnVoltage class it is adjacent when (n-k=1)；With the destination node VkFor rising for starting point
Beginning node, with the present node VnFor the terminal node of clearing end.
In above-mentioned power telecom network route computing method, it is preferred that the relatively present node VnVoltage class with
The destination node VkNode level also include: as the destination node VkVoltage class be less than and the present node Vn
Voltage class, and the destination node VkVoltage class and the present node VnVoltage class it is non-conterminous when (n-k >
1)；With the destination node VkFor the start node of starting point, with the node of voltage class that is adjacent and being greater than the starting point
As terminal node Vk+1；Circulation determines the start node and new terminal node of new starting point, and the optimal road between calculating
Diameter, until the start node V of new starting pointk+aFor present node VnWhen, conformity calculation obtains all optimal paths, is worked as
Front nodal point VnWith destination node VkOptimal path.
In above-mentioned power telecom network route computing method, it is preferred that the relatively present node VnVoltage class with
The destination node VkNode level also include: compare present node VnVoltage class and the destination node VkNode
Grade, as the destination node VkVoltage class be greater than or equal to the present node VnVoltage class, and the target section
Point VkVoltage class and the present node VnVoltage class it is adjacent when (k-n=1)；With the present node VnFor starting
The start node at end, with the destination node VkFor the terminal node of clearing end.
In above-mentioned power telecom network route computing method, it is preferred that the relatively present node VnVoltage class with
The destination node VkNode level also include: as the destination node VkVoltage class be greater than and the present node Vn
Voltage class, and the destination node VkVoltage class and the present node VnVoltage class it is non-conterminous when (k-n >
1)；With the present node VnFor the start node of starting point, with the node of voltage class that is adjacent and being greater than the starting point
As terminal node Vn+1；Circulation determines the start node and new terminal node of new starting point, and the optimal road between calculating
Diameter, until the start node V of new starting pointn+aFor destination node VkWhen, conformity calculation obtains all optimal paths, is worked as
Front nodal point VnWith destination node VkOptimal path.
In above-mentioned power telecom network route computing method, it is preferred that it is described by the initial weight matrix with it is described
The weight matrix that filtered matrix obtains the with constraint conditions of start node includes: by the initial weight matrix and the filtering
Matrix establishes the mathematical model of the weight matrix of the with constraint conditions as follows:
A=B.*C(1).*C(2).*…C(k) (2)
In above formula (1)-(2), aijIndicate weight of the weight matrix A of final with constraint conditions at (i, j)；bijIt indicates
Weight of the initial weight matrix B at (i, j),Indicate the filtered matrix C under k-th of restrictive condition is formed(k)At (i, j)
Numerical value, numerical value is 1 or ∞, and 1 indicates that current connection meets k-th of restrictive condition, and ∞ indicates that current connection is unsatisfactory for k-th
Restrictive condition.
In above-mentioned power telecom network route computing method, it is preferred that the weight square according to the with constraint conditions
Battle array calculates the business routing optimal path obtained between start node and terminal node: being solved by Dijkstra's algorithm
The weight matrix of the with constraint conditions, the business obtained between start node and terminal node route optimal path.
The beneficial technical effect of the present invention lies in: it is comprehensive in the communication network route computing method towards power business demand
The multi-constraint conditions such as line length and service bearer ability are considered, business demand is can satisfy and network communications capability coordinates hair
The requirement of exhibition, while the target factor that actual needs considers is turned into the restrictive condition to connection relationship between its website,
It is handled by 1- ∞ization, forms multiple 1- ∞ type filtered matrix, initial weight matrix and each filtered matrix dot product obtain final
The weight matrix of with constraint conditions, this method is relatively simple and easy to accomplish and verifies, and versatile, and it is logical to be not limited to electric power
Believe the routing algorithm of net, and is suitable for layering, classification, the more demanding communication network of QoS of survice.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present invention, constitutes part of this application, not
Constitute limitation of the invention.In the accompanying drawings:
Fig. 1 is the flow diagram of power telecom network route computing method provided by the present invention；
Fig. 2 is one preferred embodiment topological diagram of power telecom network route computing method provided by the present invention；
Fig. 3 is one preferred embodiment flow chart of power telecom network route computing method provided by the present invention；
Specific embodiment
Understand in order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below with reference to embodiment and attached
Figure, is described in further details the present invention.Here, the illustrative embodiments of the present invention and their descriptions are used to explain the present invention,
But it is not as a limitation of the invention.
It please refers to shown in Fig. 1, a kind of power telecom network route computing method provided by the present invention is mainly according to power communication
It is the characteristics of net classification, excellent using multiple target in communication site at the same level using the entire power telecom network service path of Hierarchical optimisation
Change path calculation method, the target factor that actual needs considers is turned into the limitation item to connection relationship between its website
Part is handled by 1- ∞ization, forms multiple 1- ∞ type filtered matrix and obtain initial weight matrix and each filtered matrix dot product
The weight matrix of final with constraint conditions, finally utilizes Dijkstra's algorithm, realizes path searching process not at the same level；Specific meter
Calculation method includes: S101 establishes the initial weight square of the start node by the distance between start node and each node information
Battle array；S102 establishes at least one filtered matrix according at least one power business restrictive condition respectively；S103 passes through described initial
Weight matrix and the filtered matrix obtain the weight matrix of the with constraint conditions of start node；S104 is according to the belt restraining item
The weight matrix of part calculates the business obtained between start node and terminal node and routes optimal path, with this, to original electricity
Power communication network Shortest path routing calculation method is improved, and the coordinated development of business demand and path planning is realized.
In the above-described embodiments, S102 is mainly by being converted to multiple filtered matrix C for a variety of restrictive conditions(k): 1 represents
The route meets the restrictive condition, and ∞ represents the route and is unsatisfactory for the restrictive condition (pact of representative route everywhere on diagonal line
Beam value is considered as 1, and the binding occurrence for being not connected to route is considered as ∞), required filtered matrix is obtained with this；Mainly pass through in S103
The initial weight matrix and the filtered matrix establish the mathematical modulo of the weight matrix of the with constraint conditions as follows
Type obtains the weight matrix of corresponding with constraint conditions with this；
A=B.*C(1).*C(2).*…C(k) (2)
In above formula (1)-(2), aijIndicate weight of the weight matrix A of final with constraint conditions at (i, j)；bijIt indicates
Weight of the initial weight matrix B at (i, j),Indicate the filtered matrix C under k-th of restrictive condition is formed(k)At (i, j)
Numerical value, numerical value is 1 or ∞, and 1 indicates that current connection meets k-th of restrictive condition, and ∞ indicates that current connection is unsatisfactory for k-th
Restrictive condition.
Thereafter by the above mathematical model, the initial weight matrix that S101 and S102 are obtained respectively and filtered matrix are carried out
Dot product obtains the weight matrix A of the final with constraint conditions for meeting business demand, and finally to meet business demand i.e. band about
Adjacency matrix of the weight matrix A of beam condition as multi-objective restriction solves optimal path using Dijkstra's algorithm.
For clearer explanation above-described embodiment, below using the environment of path optimizing under brother of node multi-constraint condition as base
Plinth is described further above-described embodiment:
It please refers to shown in Fig. 2, Fig. 2 is with some small-sized communication network topology under level-one, the business of each route carrying
Amount statistical conditions are as shown in table 1, now need to find the path for meeting the following conditions: (1) avoiding congestion route and evade node V3
Under the conditions of V0 to V6 optimal path.If (the used bandwidth of route accounts for 50% of total bandwidth or more, is considered as at this route
In congestion state).
Table 1
Through the foregoing embodiment, the initial weight matrix B of network topology is obtained first in the present context；
Thereafter, two kinds of restrictive conditions are converted to two filtered matrix: 1, which represents the route, meets the restrictive condition, ∞ generation
The table route is unsatisfactory for the restrictive condition, and (binding occurrence of representative route is considered as 1 everywhere on diagonal line, is not connected to the constraint of route
Value is considered as ∞)；Wherein, evading the restriction matrix under congestion line condition is C(1)。
Evading the restriction matrix under the conditions of node V3 is C(2)。
Then by filtered matrix and initial weight matrix dot product, the weight matrix of final with constraint conditions is obtained；
Finally using the weight matrix A of final with constraint conditions as adjacency matrix, solved most using Dijkstra's algorithm
Shortest path can obtain planning path are as follows: V0 → V1 → V2 → V5 → V6.
In actual conditions form power communication network node substation have different voltage class, as 35kV, 110kV,
220kV, 500kV are even higher.When planning service path between two websites, need to abide by from low-voltage-grade net to height
The regulation of voltage class net.For this purpose, in a preferred embodiment of the invention, also being mentioned according to such feature of power telecom network
The calculation method of power telecom network service path in the case where for different node levels solves the industry towards power telecom network with this
Business path planning problem, the embodiment is mainly according to the series of network, using the thought of distributed treatment, from start node and end
Only node finds path to greater degree node step by step respectively, is finally connected in certain level-one or highest realize.
It please refers to shown in Fig. 3, Fig. 3 is the meter of present invention power telecom network service path in the case where different node levels
The flow diagram of calculation method specifically includes in the process: obtaining present node VnVoltage class and destination node VkVoltage
Grade, and compare present node VnVoltage class and the destination node VkNode level；It is determined and is originated according to comparison result
The start node at end and the terminal node of clearing end；According to the start node and the terminal node, pass through S101 to S104
Obtain present node VnWith destination node VkOptimal path.Wherein when determining optimal path, in order to more it is fast and simple really
Determine optimal path, it can also be according to the start node VnVoltage class and the terminal node VkVoltage class, inquiry be situated between
In the start node VnVoltage class and the terminal node VkVoltage class between voltage class corresponding to channel
Node Vn+b(n+b < k) and the start node VnWith the presence or absence of optimal path；With the channel node V if existingn+bIt is new
Start node, the new start node V is obtained by S101 to S104n+bWith destination node VkOptimal path.
In the above-described embodiments, compare present node VnVoltage class and the destination node VkNode level when deposit
In two kinds of possibility, i.e. present node VnMore than or equal to destination node VkAnd present node VnLess than destination node Vk, wherein
As present node VnLess than destination node VkSpecific process flow processing is as follows:
Compare present node VnVoltage class and the destination node VkNode level, as the destination node Vk's
Voltage class is less than the present node VnVoltage class, and the destination node VkVoltage class and the present node
VnVoltage class it is adjacent when (n-k=1)；With the destination node VkFor the start node of starting point, with the present node Vn
For the terminal node of clearing end, present node V is obtained by S101 to S104nWith destination node VkOptimal path；Such as when described
Destination node VkVoltage class be less than and the present node VnVoltage class, and the destination node VkVoltage class
With the present node VnVoltage class it is non-conterminous when (n-k > 1)；With the destination node VkFor the start node of starting point,
Using the node of voltage class that is adjacent and being greater than the starting point as terminal node Vk+1, terminated by S101 to S104
Node Vk+1With destination node VkOptimal path；With the terminal node Vk+1For the start node of new starting point, with adjacent
And greater than the node of the voltage class of the starting point as new terminal node Vk+2, new rise is obtained by S101 to S104
Beginning node Vk+1With new terminal node Vk+2Optimal path；The start node of the determining new starting point of circulation and new terminal node
Point, and the optimal path between calculating, when cycle-index is more than predetermined threshold M, conformity calculation obtains all optimal paths,
Obtain present node VnWith destination node VkOptimal path.
Wherein present node VnMore than or equal to destination node VkWhen the processing of specific process flow it is as follows: compare present node
VnVoltage class and the destination node VkNode level, as the destination node VkVoltage class be greater than or equal to institute
State present node VnVoltage class, and the destination node VkVoltage class and the present node VnVoltage class phase
When adjacent (k-n=1)；With the present node VnFor the start node of starting point, with the destination node VkFor the termination of clearing end
Node obtains present node V by S101 to S104nWith destination node VkOptimal path；Such as the destination node VkElectricity
Grade is pressed to be greater than and the present node VnVoltage class, and the destination node VkVoltage class and the present node
VnVoltage class it is non-conterminous when (k-n > 1)；With the present node VnFor the start node of starting point, with adjacent and be greater than institute
The node of the voltage class of starting point is stated as terminal node Vn+1, terminal node V is obtained by S101 to S104n+1With work as prosthomere
Point VnOptimal path；With the terminal node Vn+1For the start node of new starting point, with adjacent and be greater than the starting point
Voltage class node as new terminal node Vn+2, new start node V is obtained by S101 to S104n+1With new end
Only node Vn+2Optimal path；Circulation determines the start node and new terminal node of new starting point, and between calculating most
Shortest path, when cycle-index is more than predetermined threshold M, conformity calculation obtains all optimal paths, obtains present node VnWith
Destination node VkOptimal path.
In the above-described embodiments, the predetermined threshold M and the powerline network series K relationship are as follows: M > 3K.
For the clearer specific process flow for illustrating above-described embodiment, please referred to shown in Fig. 3 below, to above-described embodiment
Do overall description:
Step 1, using starting point as the starting point in starting point path, using terminating point as the starting point in clearing end path, respectively
Judge the node level of starting point path starting point Yu clearing end path starting point；
It is more about using peer if the starting point of step 2, current starting point path is equal with the starting point series in clearing end path
Path planning algorithm under the conditions of beam finds path；If path exists, step 5 is executed；If it does not exist and currently start node grade
Number is less than network highest node level, then skips the condition of step 3 execution, executes step 4；Otherwise path is not present, and terminates institute
There is operation.
If the series of step 3, the starting point of current starting point is greater than the series in clearing end path, with current clearing end path
Starting point be starting point, find the starting point to the path of its upper level, the i.e. node of neighboring voltage levels；If the path exists,
The path (existing path before not covering) into clearing end path is saved, while using the path termination as current clearing end
The starting point in path.
If the series of step 4, the starting point of current starting point is less than the series in clearing end path, with current starting point path
Starting point be starting point, find the starting point to the path of its upper level, the i.e. node of neighboring voltage levels；If the path exists,
The path (existing path before not covering) into starting point path is saved, while using the path termination as current starting point
The starting point in path.
Step 5 repeats step 2 to step 4, until current cycle time is more than given cycle threshold.
Step 6 integrates starting point path and clearing end path, obtains the optimal path of starting point to terminating point.
The overview flow chart that it is realized is as shown in Figure 2.
Wherein, the size of cycle threshold M is related with the series K of the network, and there are following relationships between them:
M>3K
The calculation method of power telecom network service path provided by the present invention is in the communication network towards power business demand
Route computing method has comprehensively considered the multi-constraint conditions such as line length and service bearer ability, can satisfy business demand and
The requirement of network communications capability coordinated development, while target factor that actual needs considers being turned to connecting between its website
The restrictive condition for connecing relationship is handled by 1- ∞ization, multiple 1- ∞ type filtered matrix is formed, by original weight matrix and each filtering
Matrix dot product obtains the weight matrix of final with constraint conditions, and this method is relatively simple and easy to accomplish and verifies, and versatility
By force, it is not limited to the routing algorithm of power telecom network, and is suitable for layering, classification, the more demanding communication network of QoS of survice
Network.
Particular embodiments described above has carried out further in detail the purpose of the present invention, technical scheme and beneficial effects
Describe in detail it is bright, it should be understood that the above is only a specific embodiment of the present invention, the guarantor being not intended to limit the present invention
Range is protected, all within the spirits and principles of the present invention, any modification, equivalent substitution, improvement and etc. done should be included in this
Within the protection scope of invention.
Claims (6)
1. a kind of power telecom network route computing method, which is characterized in that the method includes:
The initial weight matrix of the start node is established by the distance between start node and each node information；
At least one filtered matrix is established respectively according at least one power business restrictive condition；
The weight matrix of the with constraint conditions of start node is obtained by the initial weight matrix and the filtered matrix；
It is optimal that the business routing obtained between start node and terminal node is calculated according to the weight matrix of the with constraint conditions
Path；
Before the initial weight matrix for establishing the start node by the distance between start node and each node information
Also include:
When power telecom network includes different node levels；
Obtain present node VnVoltage class and destination node VkVoltage class, and compare present node VnVoltage class
With the destination node VkVoltage class；
The start node of starting point and the terminal node of clearing end are determined according to comparison result；
The weight matrix of the with constraint conditions that start node is obtained by the initial weight matrix and the filtered matrix
Include: establishing the weight matrix of the with constraint conditions as follows by the initial weight matrix and the filtered matrix
Mathematical model:
A=B.*C(1).*C(2).*...C(k) (2)
In above formula (1)-(2), wherein i, j respectively indicate the line number and row number of corresponding element in weight matrix, are the ropes of element
Draw；K indicates the index of the weight matrix of constraint condition in route planning；aijIndicate that the weight matrix A of final with constraint conditions exists
Weight at (i, j)；bijIndicate weight of the initial weight matrix B at (i, j),Under indicating that k-th of restrictive condition is formed
Filtered matrix C(k)Numerical value at (i, j), numerical value are 1 or ∞, and 1 indicates that current connection meets k-th of restrictive condition, ∞ table
Show that current connection is unsatisfactory for k-th of restrictive condition；
The business obtained between start node and terminal node that calculated according to the weight matrix of the with constraint conditions routes
Optimal path includes: solving the weight matrix of the with constraint conditions by Dijkstra's algorithm, obtains start node and end
Only the business between node routes optimal path.
2. power telecom network route computing method according to claim 1, which is characterized in that described according to the belt restraining
The weight matrix of condition calculates the business routing optimal path obtained between start node and terminal node: according to described
Beginning node VnVoltage class and the terminal node VkVoltage class, calculate between the start node VnVoltage class
With the terminal node VkVoltage class between voltage class corresponding to relay node Vn+bWith the start node VnIt is
It is no that there are optimal paths；With the channel node V if existingn+bFor new start node, according to the new start node
Vn+bWith destination node VkOptimal path is obtained, wherein n+b < k.
3. power telecom network route computing method according to claim 1, which is characterized in that the relatively present node Vn
Voltage class and the destination node VkVoltage class also include:
Compare present node VnVoltage class and the destination node VkVoltage class, as the destination node VkVoltage
Grade is less than the present node VnVoltage class, and the destination node VkVoltage class and the present node Vn's
When voltage class is adjacent, wherein n-k=1；
With the destination node VkFor the start node of starting point, with the present node VnFor the terminal node of clearing end.
4. power telecom network route computing method according to claim 1, which is characterized in that the relatively present node Vn
Voltage class and the destination node VkVoltage class also include:
As the destination node VkVoltage class be less than the present node VnVoltage class, and the destination node Vk's
Voltage class and the present node VnVoltage class it is non-conterminous when, wherein n-k > 1；
With the destination node VkFor the start node of starting point, with the node of voltage class that is adjacent and being greater than the starting point
As terminal node Vk+1；
Circulation determines the start node and new terminal node of new starting point, and the optimal path between calculating, until new
The start node V of starting pointk+aFor present node VnWhen, a=n-k, according to all optimal paths, selection obtains present node VnWith
Destination node VkOptimal path.
5. power telecom network route computing method according to claim 1, which is characterized in that the relatively present node Vn
Voltage class and the destination node VkVoltage class also include:
Compare present node VnVoltage class and the destination node VkVoltage class, as the destination node VkVoltage
Grade is greater than or equal to the present node VnVoltage class, and the destination node VkVoltage class and described work as prosthomere
Point VnVoltage class it is adjacent when, wherein k-n=1；
With the present node VnFor the start node of starting point, with the destination node VkFor the terminal node of clearing end.
6. power telecom network route computing method according to claim 1, which is characterized in that the relatively present node Vn
Voltage class and the destination node VkNode level also include:
As the destination node VkVoltage class be greater than the present node VnVoltage class, and the destination node Vk's
Voltage class and the present node VnVoltage class it is non-conterminous when, wherein k-n > 1；
With the present node VnFor the start node of starting point, with the node of voltage class that is adjacent and being greater than the starting point
As terminal node Vn+1；
Circulation determines the start node and new terminal node of new starting point, and the optimal path between calculating, until new
The start node V of starting pointn+aFor destination node VkWhen, a=k-n, according to all optimal paths, selection obtains present node VnWith
Destination node VkOptimal path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610862577.2A CN106230724B (en) | 2016-09-28 | 2016-09-28 | Power telecom network route computing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610862577.2A CN106230724B (en) | 2016-09-28 | 2016-09-28 | Power telecom network route computing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106230724A CN106230724A (en) | 2016-12-14 |
| CN106230724B true CN106230724B (en) | 2019-04-05 |
Family
ID=58077415
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610862577.2A Active CN106230724B (en) | 2016-09-28 | 2016-09-28 | Power telecom network route computing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106230724B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110768904B (en) * | 2019-10-31 | 2022-02-15 | 广东电网有限责任公司 | Service communication detection method, device, terminal and storage medium for power communication network |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667972B (en) * | 2009-10-19 | 2011-09-28 | 国网信息通信有限公司 | Power communication network service routing method and device |
| CN102904811B (en) * | 2012-10-29 | 2016-02-24 | 广东电网公司电力调度控制中心 | Towards route selection method and the system of power business |
| JP6322835B2 (en) * | 2013-05-21 | 2018-05-16 | 国立大学法人京都大学 | Power packet generator, power router and power network |
| CN103873363B (en) * | 2014-03-24 | 2017-04-05 | 华北电力大学（保定） | A kind of double route collocation method of power optical fiber communication network service |
| CN105306364B (en) * | 2015-11-10 | 2019-01-29 | 国家电网公司 | Energy communication service route distribution method based on business different degree |
-
2016
- 2016-09-28 CN CN201610862577.2A patent/CN106230724B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN106230724A (en) | 2016-12-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105376156B (en) | A kind of electric power backbone transport networks route planning method based on multiple attribute decision making (MADM) | |
| CN107591799B (en) | Power distribution network short-term planning method based on maximum power supply capacity | |
| CN106941256B (en) | power distribution network main transformer contact structure optimization planning method considering MPSC and MCCC | |
| Wang et al. | On bus type assignments in random topology power grid models | |
| CN105703973B (en) | A kind of power communication fiber optic network reliability consideration method based on composite measure | |
| CN106685745B (en) | A kind of constructing network topology method and device | |
| CN105870914B (en) | Key transmission cross-section searching method based on the electrical partitioning containing electromagnetic looped network | |
| CN102665224A (en) | Optimization method and device for mobile terminal communication network | |
| CN108988400A (en) | Power distribution method and electronic equipment for multi-machine parallel connection electric power electric transformer | |
| CN102970163A (en) | Method and system for upgrading nodes in power communication backbone network | |
| CN102930140B (en) | Solving method for transmission equation of complex same-tower multi-loop transmission line | |
| CN103500999A (en) | Low voltage distribution area power supply radius optimization method based on real-time loss | |
| CN106230724B (en) | Power telecom network route computing method | |
| CN106295094B (en) | A kind of electrical network weak link identification emulation mode considering relay protection hidden failure | |
| CN112887207B (en) | Service route distribution method and device for power IP-optical communication network | |
| CN104242993B (en) | Mesolow power communication Access Network bandwidth prediction method | |
| CN107453786A (en) | A kind of powerline network method for establishing model and device | |
| CN104573267B (en) | A kind of emulation mode assessed ultra-high voltage transformer station and enter line segment thunderbolt security | |
| CN107919978B (en) | Method and device for controlling cutting and connecting process of electric power communication network service | |
| CN107911763B (en) | Intelligent power distribution and utilization communication network EPON network planning method based on QoS | |
| CN110677306A (en) | Network topology replica server configuration method and device, storage medium and terminal | |
| CN110768260A (en) | Power grid cascading failure model building method based on electrical betweenness | |
| CN107360480B (en) | A kind of ONU grouping planing method based on load balancing | |
| CN110768198B (en) | 10kV overhead insulated line lightning stroke disconnection comprehensive protection optimization method and device | |
| CN103826280B (en) | Mobile communication network route optimizing method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |