CN110233796B - Power communication network optimization method and equipment based on weighted routing algorithm - Google Patents
Power communication network optimization method and equipment based on weighted routing algorithm Download PDFInfo
- Publication number
- CN110233796B CN110233796B CN201910465091.9A CN201910465091A CN110233796B CN 110233796 B CN110233796 B CN 110233796B CN 201910465091 A CN201910465091 A CN 201910465091A CN 110233796 B CN110233796 B CN 110233796B
- Authority
- CN
- China
- Prior art keywords
- route
- reachable
- cost
- routes
- service
- 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
- 238000004891 communication Methods 0.000 title claims abstract description 58
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000005457 optimization Methods 0.000 title claims abstract description 27
- 238000012216 screening Methods 0.000 claims abstract description 13
- 230000003287 optical effect Effects 0.000 claims description 52
- 238000004590 computer program Methods 0.000 claims description 14
- 238000003860 storage Methods 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 102100020786 Adenylosuccinate synthetase isozyme 2 Human genes 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
Images
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
- H04L45/123—Evaluation of link 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/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/22—Alternate routing
-
- 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/24—Multipath
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure provides a power communication network optimization method and equipment based on a weighted routing algorithm. The optimization method is applied to single-channel service from a service starting point to a service end point, and the optimization method of the power communication network comprises the following steps: acquiring all reachable routes from a service starting point to a service end point; each reachable route is divided into a plurality of sections according to the nodes; calling a routing section cost configuration table, and calculating the cost of each section of all reachable routes; accumulating the cost of each section to obtain the total cost of each reachable route; and screening out the reachable route with the minimum total cost from the total costs of all reachable routes as the working route of the single-channel service.
Description
Technical Field
The disclosure belongs to the field of power communication networks, and particularly relates to a power communication network optimization method and device based on a weighted routing algorithm.
Background
The statements in this section merely provide background information related to the present disclosure and may not necessarily constitute prior art.
The network scale of the power communication system is gradually complicated along with the gradual expansion of the construction scale of the transformer station and the gradual promotion of the extra-high voltage project, and the arrangement of the operation modes of various services is the foundation for influencing the operation safety of the power grid.
The inventor finds that the existing power communication network optimization method is complex, multiple factors such as routing nodes, optical cable types, optical cable service lives, voltage levels and circuit utilization rate are not comprehensively considered, optimization efficiency is low, and stability of the power communication network is poor.
Disclosure of Invention
In order to solve the above problems, a first aspect of the present disclosure provides a power communication network optimization method based on a weighted routing algorithm, which comprehensively considers a plurality of factors, such as a routing node, an optical cable type, an optical cable lifetime, a voltage class, and a circuit utilization rate, and can improve optimization efficiency and power communication network stability.
In order to achieve the purpose, the following technical scheme is adopted in the disclosure:
a power communication network optimization method based on a weighted routing algorithm is applied to single-channel service from a service starting point to a service end point, and comprises the following steps:
acquiring all reachable routes from a service starting point to a service end point; each reachable route is divided into a plurality of sections according to the nodes;
calling a routing section cost configuration table, and calculating the cost of each section of all reachable routes;
accumulating the cost of each section to obtain the total cost of each reachable route;
and screening out the reachable route with the minimum total cost from the total costs of all reachable routes as the working route of the single-channel service.
Further, comparing the residual reachable routes with the working routes one by one, if any section in the residual reachable routes is overlapped with the section in the working routes, judging that the route is a rerouting route, increasing the cost of the section in the residual corresponding reachable routes, and increasing the cost of the section in the working routes to obtain the total cost updating value of the residual reachable routes;
and screening out the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes as the protection route of the working route.
The technical scheme has the advantages that the re-routing is searched by comparing the residual reachable routes with the working routes one by one, the cost of the section in the residual corresponding reachable routes is increased, the added value is the cost of the section in the working routes, and then the total cost updating value of the residual reachable routes is obtained; and selecting the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes as the protection route of the working route, so as to quickly and accurately obtain the working route and the protection route thereof, thereby improving the efficiency of network optimization and the stability of network operation.
Furthermore, the routing section cost value configuration table is configured in advance, and corresponding cost values are configured correspondingly according to the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the optical cable, the utilization rate of the channel, the number of protection channels, whether the service starting point direction channel and the service end point direction channel on the jumper connection point are the same as the channel, the operation condition of the power supply in the station and the operation age of the power supply in the station.
The technical scheme has the advantages that the factors of the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the cable, the utilization rate of the channel, the number of protection channels, whether the channels in the directions of the service starting point and the service ending point on the jump point are the same as the channels, the running condition of the power supply in the station and the running age of the power supply in the station are comprehensively considered when the routing cost is calculated, and the stability of the electrified network is ensured.
Further, when the total cost of a certain reachable route exceeds a preset cost threshold, the reachable route has hidden danger, and the reachable route is stored in a hidden danger route database.
The technical scheme has the advantages that whether hidden danger exists in the route is judged by comparing the total cost of the reachable route with the preset cost threshold, the fault rate of the route is reduced, and the stability of the communication network is ensured.
A power communication network optimization method based on a weighted routing algorithm is applied to a dual-channel service from a service starting point to a service end point, the power communication network applicable to the dual-channel service comprises a first power communication network and a second power communication network, and the optimization method comprises the following steps:
for a first power communication network and a second power communication network, respectively:
acquiring all reachable routes from a service starting point to a service end point; each reachable route is divided into a plurality of sections according to the nodes;
calling a routing section cost configuration table, and calculating the cost of each section of all reachable routes;
accumulating the cost of each section to obtain the total cost of each reachable route;
and screening out the reachable route with the minimum total cost from the total costs of all reachable routes to obtain a first working route of the first power communication network and a second working route of the second power communication network.
Further, for the first and second power communication networks, respectively:
comparing the residual reachable routes with the working routes one by one, if any section in the residual reachable routes is overlapped with the section in the working routes, judging that the route is a rerouting route, increasing the cost of the section in the residual corresponding reachable routes, and increasing the cost of the section in the working routes to obtain the total cost updating value of the residual reachable routes;
and screening out the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes to obtain a first protection route of the first working route and a second protection route of the second working route.
The technical scheme has the advantages that the re-routing is searched by comparing the residual reachable routes with the working routes one by one, the cost of the section in the residual corresponding reachable routes is increased, the added value is the cost of the section in the working routes, and then the total cost updating value of the residual reachable routes is obtained; and selecting the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes as the protection route of the working route, so as to quickly and accurately obtain the working route and the protection route thereof, thereby improving the efficiency of network optimization and the stability of network operation.
Furthermore, the routing section cost value configuration table is configured in advance, and corresponding cost values are configured correspondingly according to the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the optical cable, the utilization rate of the channel, the number of protection channels, whether the service starting point direction channel and the service end point direction channel on the jumper connection point are the same as the channel, the operation condition of the power supply in the station and the operation age of the power supply in the station.
The technical scheme has the advantages that the factors of the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the cable, the utilization rate of the channel, the number of protection channels, whether the channels in the directions of the service starting point and the service ending point on the jump point are the same as the channels, the running condition of the power supply in the station and the running age of the power supply in the station are comprehensively considered when the routing cost is calculated, and the stability of the electrified network is ensured.
Further, when the total cost of a certain reachable route exceeds a preset cost threshold, the reachable route has hidden danger, and the reachable route is stored in a hidden danger route database.
The technical scheme has the advantages that whether hidden danger exists in the route is judged by comparing the total cost of the reachable route with the preset cost threshold, the fault rate of the route is reduced, and the stability of the communication network is ensured.
In order to solve the above problems, a second aspect of the present disclosure provides a computer-readable storage medium that comprehensively considers a plurality of factors, such as a routing node, a cable type, a cable lifetime, a voltage class, and a circuit usage rate, and is capable of improving optimization efficiency and power communication network stability.
In order to achieve the purpose, the following technical scheme is adopted in the disclosure:
a computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the above-mentioned method for optimizing an electric power communication network based on a weighted routing algorithm.
In order to solve the above problems, a third aspect of the present disclosure provides an electronic device that comprehensively considers a plurality of factors, such as a routing node, a type of an optical cable, a lifetime of the optical cable, a voltage class, and a circuit usage rate, and is capable of improving optimization efficiency and stability of a power communication network.
In order to achieve the purpose, the following technical scheme is adopted in the disclosure:
an electronic device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps of the method for optimizing a power communication network based on a weighted routing algorithm.
The beneficial effects of this disclosure are:
(1) the method searches for the rerouting by comparing the residual reachable routes with the working routes one by one, the cost of the section in the residual corresponding reachable routes is increased, the added value is the cost of the section in the working routes, and then the total cost updating value of the residual reachable routes is obtained; and selecting the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes as the protection route of the working route, so as to quickly and accurately obtain the working route and the protection route thereof, thereby improving the efficiency of network optimization and the stability of network operation.
(2) The method and the device comprehensively consider factors such as the type of the optical cable, the service life of the optical cable, the matching of the voltage grade of the optical cable and the service grade, the length of the optical cable, the utilization rate of a channel, the number of protection channels, whether a channel in the direction of a service starting point and a channel in the direction of a service destination on a jump point are the same as the channel, the running condition of the power supply in the station and the running age of the power supply in the station when calculating the routing cost, and ensure the stability of the electrified network.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure and are not to limit the disclosure.
Fig. 1 is a flowchart of an electric power communication network optimization method based on a weighted routing algorithm according to an embodiment of the present disclosure.
Detailed Description
The present disclosure is further described with reference to the following drawings and examples.
It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present disclosure. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
Example one
As shown in fig. 1, a power communication network optimization method based on a weighted routing algorithm according to this embodiment is applied to a single-channel service from a service start point to a service end point, and includes:
s101: acquiring all reachable routes from a service starting point A to a service terminal point Z; each reachable route is divided into segments according to nodes.
And when the service is single channel service, defining the bearing equipment as A network equipment.
Calculating N reachable routes R on A networkA1-RAN。
RAn＝[a b…z]
Where N is 1 to N, a denotes a start node, z denotes a stop node, b denotes an intermediate jump point, and M is defined as RAnThe number of jump points.
S102: and calling a routing section cost value configuration table, and calculating the cost of each section of all reachable routes.
Specifically, the routing section cost value configuration table is configured in advance, and corresponding cost values are configured correspondingly according to the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the optical cable, the utilization rate of a channel, the number of protection channels, whether a service starting point direction channel and a service end point direction channel on a jumper connection point are the same as the channel, the operation condition of a power supply in a station and the operation age of the power supply in the station.
CAnjThe sum of the cost values of j sections, the value of each attribute is ajkThe table of values is shown in table 1.
CAnj＝Σajk(k＝1～7，j＝2～M)
Wherein, when j is 1, CAnj＝0。CAnjIs the sum of the cost values of j sections, ajkThe values of the attributes in each section are shown, and the table of values is detailed in table 1.
TABLE 1 cost evaluation Table
Wherein:
aj1 represents a cost value of the cable type and has an attribute of [ OPGW ADSS regular cable ].
aj2 represents the cost value of the service life of the optical cable, and the attribute is [ more than 30 years and 20 years and 30 years and 10 years and less than 20 years and 10 years ].
aj3 represents the cost value of matching the cable voltage level to the service level, the result of which is derived from the comparison of the service level and the cable voltage level.
and aj4 represents the length of the optical cable, and the attribute is [ ≧ 200100-50 < 50 ].
aj5 represents the channel utilization with attributes [ 40% below to 80% above).
aj6 represents the number of protection channels on a channel with an attribute of [ < 8 ≧ 8 ].
aj7 indicates whether the a direction and the Z direction at the jump point j are the same channel, and its attribute is [ different channels from the channel ].
aj8 represents the power supply operation condition in the jump point j station, and the attribute is [ double power supply single power supply ].
aj9 represents the operating age of the power supply in the jump point j station, and the attribute is [ < 8 ≧ 8 ].
The technical scheme has the advantages that the factors of the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the cable, the utilization rate of the channel, the number of protection channels, whether the channels in the directions of the service starting point and the service ending point on the jump point are the same as the channels, the running condition of the power supply in the station and the running age of the power supply in the station are comprehensively considered when the routing cost is calculated, and the stability of the electrified network is ensured.
S103: accumulating the cost of each section to obtain the total cost of each reachable route;
defining the cost value of each route as CAn(n＝1～N)。CAnIs the sum of the cost values of all the hop sections.
CAn＝ΣCAnj(j＝1～M)
Wherein, CAnjRepresenting the cost value at the jth hop.
S104: and screening out the reachable route with the minimum total cost from the total costs of all reachable routes as the working route of the single-channel service.
Specifically, after the working route is screened out, the protection route of the working route is screened out again:
the specific process comprises the following steps:
will remain the reachable route RA2～RANAnd the working route RA1Comparing one by one, if the residual reachable route RA2～RANIf there is coincidence between any section in the route and the section in the working route, the route is judged to be the rerouting route, the cost of the section in the residual corresponding reachable route is increased, the added value is the cost of the section in the working route of the section, and then the residual reachable route is obtainedUpdating the value of the total cost of the route;
and screening out the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes as the protection route of the working route.
The technical scheme has the advantages that the re-routing is searched by comparing the residual reachable routes with the working routes one by one, the cost of the section in the residual corresponding reachable routes is increased, the added value is the cost of the section in the working routes, and then the total cost updating value of the residual reachable routes is obtained; and selecting the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes as the protection route of the working route, so as to quickly and accurately obtain the working route and the protection route thereof, thereby improving the efficiency of network optimization and the stability of network operation.
As an optional implementation manner, when the total cost of a certain reachable route exceeds a preset cost threshold, the reachable route has a hidden danger, and the reachable route is stored in the hidden danger route database.
The technical scheme has the advantages that whether hidden danger exists in the route is judged by comparing the total cost of the reachable route with the preset cost threshold, the fault rate of the route is reduced, and the stability of the communication network is ensured.
Example two
The method for optimizing the power communication network based on the weighted routing algorithm is applied to a dual-channel service from a service starting point to a service end point, the power communication network applicable to the dual-channel service comprises a first power communication network and a second power communication network, and the method for optimizing the power communication network comprises the following steps:
for a first power communication network a and a second power communication network B, respectively:
acquiring all reachable routes from a service starting point A to a service terminal point Z; each reachable route is divided into segments according to nodes.
Calculating N reachable routes R on A networkA1-RAN。
RAn＝[a b…z]
Wherein N is 1 to N, a represents an initial node,z represents a termination node, b represents an intermediate hop, and M is defined as RAnThe number of jump points.
Calculating N reachable routes R on B networkB1-RBN。
RBn＝[a b…z]
Where N is 1 to N, a denotes a start node, z denotes a stop node, b denotes an intermediate jump point, and M is defined as RBnThe number of jump points.
Calling a routing section cost configuration table, and calculating the cost of each section of all reachable routes;
specifically, the routing section cost value configuration table is configured in advance, and corresponding cost values are configured correspondingly according to the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the optical cable, the utilization rate of a channel, the number of protection channels, whether a service starting point direction channel and a service end point direction channel on a jumper connection point are the same as the channel, the operation condition of a power supply in a station and the operation age of the power supply in the station.
CAnjThe sum of the cost values of j sections of the A network, and the value of each attribute is ajkThe table of values is shown in table 1.
CAnj＝Σajk(k＝1～7，j＝2～M)
Wherein, when j is 1, CAnj＝0。CAnjIs the sum of the cost values of j sections, ajkThe values of the attributes in each section are shown, and the table of values is detailed in table 1.
CBnjThe sum of the cost values of j sections of the B network, and the value of each attribute is BjkThe table of values is shown in table 1.
CBnj＝Σbjk(k＝1～7，j＝2～M)
Wherein, when j is 1, CBnj＝0。CBnjIs the sum of the cost values of the j sections, bjkThe values of the attributes in each section are shown, and the table of values is detailed in table 1.
TABLE 1 cost evaluation Table
Wherein:
aj1 represents a cost value of the cable type and has an attribute of [ OPGW ADSS regular cable ].
aj2 represents the cost value of the service life of the optical cable, and the attribute is [ more than 30 years and 20 years and 30 years and 10 years and less than 20 years and 10 years ].
aj3 represents the cost value of matching the cable voltage level to the service level, the result of which is derived from the comparison of the service level and the cable voltage level.
and aj4 represents the length of the optical cable, and the attribute is [ ≧ 200100-50 < 50 ].
aj5 represents the channel utilization with attributes [ 40% below to 80% above).
aj6 represents the number of protection channels on a channel with an attribute of [ < 8 ≧ 8 ].
aj7 indicates whether the a direction and the Z direction at the jump point j are the same channel, and its attribute is [ different channels from the channel ].
aj8 represents the power supply operation condition in the jump point j station, and the attribute is [ double power supply single power supply ].
aj9 represents the operating age of the power supply in the jump point j station, and the attribute is [ < 8 ≧ 8 ].
The technical scheme has the advantages that the factors of the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the cable, the utilization rate of the channel, the number of protection channels, whether the channels in the directions of the service starting point and the service ending point on the jump point are the same as the channels, the running condition of the power supply in the station and the running age of the power supply in the station are comprehensively considered when the routing cost is calculated, and the stability of the electrified network is ensured.
Accumulating the cost of each section to obtain the total cost of each reachable route;
and screening out the reachable route with the minimum total cost from the total costs of all reachable routes to obtain a first working route of the first power communication network and a second working route of the second power communication network.
Further, for the first and second power communication networks, respectively:
comparing the residual reachable routes with the working routes one by one, if any section in the residual reachable routes is overlapped with the section in the working routes, judging that the route is a rerouting route, increasing the cost of the section in the residual corresponding reachable routes, and increasing the cost of the section in the working routes to obtain the total cost updating value of the residual reachable routes;
and screening out the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes to obtain a first protection route of the first working route and a second protection route of the second working route.
The technical scheme has the advantages that the re-routing is searched by comparing the residual reachable routes with the working routes one by one, the cost of the section in the residual corresponding reachable routes is increased, the added value is the cost of the section in the working routes, and then the total cost updating value of the residual reachable routes is obtained; and selecting the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes as the protection route of the working route, so as to quickly and accurately obtain the working route and the protection route thereof, thereby improving the efficiency of network optimization and the stability of network operation.
Further, when the total cost of a certain reachable route exceeds a preset cost threshold, the reachable route has hidden danger, and the reachable route is stored in a hidden danger route database.
The technical scheme has the advantages that whether hidden danger exists in the route is judged by comparing the total cost of the reachable route with the preset cost threshold, the fault rate of the route is reduced, and the stability of the communication network is ensured.
EXAMPLE III
The present embodiment provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the steps in the power communication network optimization method based on the weighted routing algorithm according to the first embodiment or the second embodiment.
Example four
The embodiment provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the program, the steps in the power communication network optimization method based on the weighted routing algorithm according to the first embodiment or the second embodiment are implemented.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The above description is only a preferred embodiment of the present disclosure and is not intended to limit the present disclosure, and various modifications and changes may be made to the present disclosure by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present disclosure should be included in the protection scope of the present disclosure.
Claims (6)
1. A power communication network optimization method based on a weighted routing algorithm is applied to a single-channel service from a service starting point to a service end point, and comprises the following steps:
acquiring all reachable routes from a service starting point to a service end point; each reachable route is divided into a plurality of sections according to the nodes;
calling a routing section cost configuration table, and calculating the cost of each section of all reachable routes;
accumulating the cost of each section to obtain the total cost of each reachable route;
screening out the reachable route with the minimum total cost from the total costs of all reachable routes as a working route of the single-channel service;
comparing the residual reachable routes with the working routes one by one, if any section in the residual reachable routes is overlapped with the section in the working routes, judging that the route is a rerouting route, increasing the cost of the section in the residual corresponding reachable routes, and increasing the cost of the section in the working routes to obtain the total cost updating value of the residual reachable routes;
screening out the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes as a protection route of the working route;
the routing section cost value configuration table is configured in advance, and corresponding generation values are configured correspondingly according to the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the optical cable, the utilization rate of a channel, the number of protection channels, whether a service starting point direction channel and a service terminal point direction channel on a jump connection point are the same channel, the operation condition of a power supply in a station and the operation age of the power supply in the station.
2. The method as claimed in claim 1, wherein when the total cost of a reachable route exceeds a preset cost threshold, the reachable route has a hidden danger, and the reachable route is stored in a hidden danger route database.
3. A method for optimizing an electric power communication network based on a weighted routing algorithm is characterized in that the method is applied to a dual-channel service from a service starting point to a service end point, the electric power communication network applicable to the dual-channel service comprises a first electric power communication network and a second electric power communication network, and the optimization method comprises the following steps:
for a first power communication network and a second power communication network, respectively:
acquiring all reachable routes from a service starting point to a service end point; each reachable route is divided into a plurality of sections according to the nodes;
calling a routing section cost configuration table, and calculating the cost of each section of all reachable routes;
accumulating the cost of each section to obtain the total cost of each reachable route;
screening out the reachable route with the minimum total cost from the total costs of all reachable routes to obtain a first working route of the first power communication network and a second working route of the second power communication network;
wherein for a first power communication network and a second power communication network respectively:
comparing the residual reachable routes with the working routes one by one, if any section in the residual reachable routes is overlapped with the section in the working routes, judging that the route is a rerouting route, increasing the cost of the section in the residual corresponding reachable routes, and increasing the cost of the section in the working routes to obtain the total cost updating value of the residual reachable routes;
screening out the reachable route with the minimum total cost updating value from the total cost updating values of the residual reachable routes to obtain a first protection route of the first working route and a second protection route of the second working route;
the routing section cost value configuration table is configured in advance, and corresponding generation values are configured correspondingly according to the type of the optical cable, the service life of the optical cable, the matching of the voltage level of the optical cable and the service level, the length of the optical cable, the utilization rate of a channel, the number of protection channels, whether a service starting point direction channel and a service terminal point direction channel on a jump connection point are the same channel, the operation condition of a power supply in a station and the operation age of the power supply in the station.
4. The method as claimed in claim 3, wherein when the total cost of a reachable route exceeds a preset cost threshold, the reachable route has a hidden danger, and the reachable route is stored in the hidden danger route database.
5. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method for optimizing an electric power communication network based on a weighted routing algorithm according to any one of claims 1 to 3;
or which program, when being executed by a processor, carries out the steps of the method for optimizing an electric power communication network based on a weighted routing algorithm according to any one of claims 3 to 4.
6. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program implements the steps in the weighted routing algorithm based power communication network optimization method according to any one of claims 1-2;
or the processor, when executing the program, implements the steps in the method for optimizing an electric power communication network based on a weighted routing algorithm according to any one of claims 3 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910465091.9A CN110233796B (en) | 2019-05-30 | 2019-05-30 | Power communication network optimization method and equipment based on weighted routing algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910465091.9A CN110233796B (en) | 2019-05-30 | 2019-05-30 | Power communication network optimization method and equipment based on weighted routing algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110233796A CN110233796A (en) | 2019-09-13 |
| CN110233796B true CN110233796B (en) | 2021-12-14 |
Family
ID=67858223
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910465091.9A Active CN110233796B (en) | 2019-05-30 | 2019-05-30 | Power communication network optimization method and equipment based on weighted routing algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110233796B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115775088B (en) * | 2023-02-13 | 2023-05-05 | 成都秦川物联网科技股份有限公司 | Intelligent gas inspection plan determining method and Internet of things system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1756233A (en) * | 2004-09-30 | 2006-04-05 | 富士通株式会社 | Route selection method in the communication network and device |
| CN1863135A (en) * | 2005-05-12 | 2006-11-15 | 中兴通讯股份有限公司 | Path selecting method of regulating link cost |
| CN104579775A (en) * | 2015-01-05 | 2015-04-29 | 国家电网公司 | Resource allocation method and device for electric power communication optical fibers and optical transmission devices |
| GB2540212A (en) * | 2015-07-10 | 2017-01-11 | Craft-E Com Ltd | Electro-mechanical power distribution |
| CN109344975A (en) * | 2018-08-24 | 2019-02-15 | 国网天津市电力公司 | A kind of the verification optimization method and its system of energy communication service Single Point of Faliure |
-
2019
- 2019-05-30 CN CN201910465091.9A patent/CN110233796B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1756233A (en) * | 2004-09-30 | 2006-04-05 | 富士通株式会社 | Route selection method in the communication network and device |
| CN1863135A (en) * | 2005-05-12 | 2006-11-15 | 中兴通讯股份有限公司 | Path selecting method of regulating link cost |
| CN104579775A (en) * | 2015-01-05 | 2015-04-29 | 国家电网公司 | Resource allocation method and device for electric power communication optical fibers and optical transmission devices |
| GB2540212A (en) * | 2015-07-10 | 2017-01-11 | Craft-E Com Ltd | Electro-mechanical power distribution |
| CN109344975A (en) * | 2018-08-24 | 2019-02-15 | 国网天津市电力公司 | A kind of the verification optimization method and its system of energy communication service Single Point of Faliure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110233796A (en) | 2019-09-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8443079B2 (en) | Mixed integer programming model for minimizing leased access network costs | |
| CN106803790B (en) | A kind of upgrade control method and device of group system | |
| US8923113B2 (en) | Optimizations in multi-destination tree calculations for layer 2 link state protocols | |
| CN113193996B (en) | Power optical transmission network optimization method, device, equipment and storage medium | |
| CN108832968B (en) | Method and device for determining important service bearing capacity of power communication network | |
| CN102413050B (en) | Optical fiber scheduling method and device | |
| CN104094565A (en) | Controller, load-balancing method, non-temporary computer-readable medium for storing program, computer system, and control device | |
| CN104579775A (en) | Resource allocation method and device for electric power communication optical fibers and optical transmission devices | |
| CN112565940B (en) | Optical fiber path planning method and device for optical fiber network | |
| CN110233796B (en) | Power communication network optimization method and equipment based on weighted routing algorithm | |
| CN110740394B (en) | Power optical transmission network optimization method and system based on site classification business classification | |
| CN114662799A (en) | Power transmission line maintenance plan optimization method, device, equipment and storage medium | |
| CN113434326B (en) | Method and device for realizing network system fault positioning based on distributed cluster topology, processor and computer readable storage medium thereof | |
| Ivanchev et al. | Bisos: Backwards incremental system optimum search algorithm for fast socially optimal traffic assignment | |
| Al-Muhaini et al. | Minimal cut sets, Petri nets, and prime number encoding in distribution system reliability evaluation | |
| CN110866739B (en) | Power distribution network comprehensive power failure time representation method considering troubleshooting path | |
| CN107248952B (en) | Method and system for determining service alternative route | |
| CN110854824B (en) | Method and device for monitoring availability of relay protection service of power communication network | |
| Ríos et al. | Survivable capacitated network design problem: new formulation and Lagrangean relaxation | |
| CN109150706B (en) | Risk path identification method and device | |
| CN106034266A (en) | Optical route generation method and apparatus | |
| CN108366024A (en) | Message forwarding method and device | |
| CN109861910B (en) | Power communication network link importance calculation method based on link availability | |
| CN114205242A (en) | Method and device for determining false loop | |
| CN109962812B (en) | Electrical layer discrete service back calculation method and system |
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 |