CN112887207A - Service route distribution method and device for power IP-optical communication network - Google Patents
Service route distribution method and device for power IP-optical communication network Download PDFInfo
- Publication number
- CN112887207A CN112887207A CN202110105228.7A CN202110105228A CN112887207A CN 112887207 A CN112887207 A CN 112887207A CN 202110105228 A CN202110105228 A CN 202110105228A CN 112887207 A CN112887207 A CN 112887207A
- Authority
- CN
- China
- Prior art keywords
- service
- path
- link
- satisfaction
- routing
- 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
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
- H04B—TRANSMISSION
- H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
- H04B10/25—Arrangements specific to fibre transmission
-
- 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/74—Address processing for routing
Abstract
The invention provides a service route distribution method and a device for an electric power IP-optical communication network, wherein the method comprises the following steps: establishing a service routing path satisfaction model according to the station level difference, the link availability and the shared link risk group of the target service; solving the service routing path satisfaction degree model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths meeting preset conditions and path satisfaction degrees corresponding to each service routing path; and acquiring an optimal service working path of the target service according to the service type of the target service and the path satisfaction value, so as to complete routing distribution according to the optimal service working path. The invention can ensure that the communication time delay meets the preset requirement, and enhances the risk resistance of the link interruption of the whole power IP-optical communication network, thereby reducing the service transmission risk and the blocking rate.
Description
Technical Field
The present invention relates to the field of power communication technologies, and in particular, to a method and an apparatus for allocating a service route for a power IP-optical communication network.
Background
The Cyber-Physical System (CPS) is a multidimensional System organically combining computing, network and Physical environment, effectively coordinates computing resources and Physical resources, and provides heuristic perception, dynamic control and information service for large-scale engineering systems. The power IP-optical communication network is a typical CPS, and carries various power communication services, such as a relay protection service, a safety and stability control service, a scheduling automation service, a video conference, and the like, which have various functions in a power system, and are important guarantees for realizing real-time performance, reliability, and safety of the power system. These services are carried on the communication links of the information network, and if a link carrying critical services is interrupted, the network will be damaged greatly.
In the prior art, a service route is planned based on service importance, and system centralized risks are changed into scattered risks; the service importance is also sequenced, and the configuration of two completely disjoint double routing methods is completed through an improved Bhandari algorithm, however, in the prior art, only the service importance index is considered, and the time delay characteristic of the power communication service is ignored; and calculating the total risk degree according to the importance degree of the service, and determining the optimal path according to the total risk degree, but determining the optimal path only through the total risk often causes the situation that the risk of individual channels is particularly high, and when a high-risk channel fails, the safety of the power communication network is seriously influenced.
Therefore, a method and an apparatus for allocating traffic routes for a power IP-optical communication network are needed to solve the above problems.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a service route distribution method and a service route distribution device for an electric power IP-optical communication network.
The invention provides a service route distribution method for an electric power IP-optical communication network, which comprises the following steps:
establishing a service routing path satisfaction model according to the station level difference, the link availability and the shared link risk group of the target service;
solving the service routing path satisfaction degree model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths meeting preset conditions and path satisfaction degrees corresponding to each service routing path;
and acquiring an optimal service working path of the target service according to the service type of the target service and the path satisfaction value, so as to complete routing distribution according to the optimal service working path.
According to the service route allocation method for the power IP-optical communication network provided by the invention, before the establishment of the service route path satisfaction model according to the station level difference, the link availability and the shared link risk group of the target service, the method further comprises the following steps:
acquiring the voltage grade of each power transformation site in the target service, and obtaining a site grade difference according to the voltage grade;
obtaining the link availability according to the link importance and the unit length link availability;
and constructing a shared link risk group according to links passing through the same high-voltage line tower and connecting different power transformation sites.
According to the service route allocation method for the power IP-optical communication network provided by the invention, the service route satisfaction model specifically comprises the following steps:
Ae＝MTBF/(MTBF+MTTR)；
wherein u isiIndicating the ith node voltage level, ujRepresents the jth node voltage level, uxRepresents the x-th node voltage level, uyRepresenting the y-th node voltage level, e representing the link between the node pair (i, j), l representing the nodeLink between point pairs (x, y), DeIndicating normalized values of site level differences of links E, V indicating a set of nodes, E indicating a set of communication links, psieIndicating the edge argument, ψ, of the link ex,y(e) Indicating the shortest path number, psi, across the linkx,yRepresents the number of shortest paths in the network,
for the normalized link voltage level value,
indicating the power line voltage level to which the communication link corresponds,
represents the maximum value in the line voltage set U,
represents the minimum value, I, of the line voltage set UeIndicates link importance, χeIndicating link availability, CeDenotes the link type parameter, L denotes the length of the link e, Ae LIndicating the link availability of length L, MTBF indicating the mean time between two failures, MTTR indicating the mean time between failure repairs, δeThe decision variables are represented by a representation of,
representing the set of all shared risk link groups in the network,
indicating link satisfaction, w1Represents a link availability weight, w2Representing edge betweenness weight, w3Representing the site level difference parameter weight, p representing the path set, nhopRepresenting the total number of hops of the path.
According to the service route distribution method for the power IP-optical communication network, the link availability weight, the edge betweenness weight and the station level difference weight are obtained by calculation through an entropy weight method.
According to the service route allocation method for the power IP-optical communication network, the service route satisfaction model is solved according to a deep reinforcement learning algorithm to obtain a plurality of service route paths meeting preset conditions and a path satisfaction value corresponding to each service route path, and the method comprises the following steps:
and solving the service routing path satisfaction degree model through K shortest path algorithms, judging the solved result, and if the preset time delay requirement is met, acquiring a plurality of service routing paths and a path satisfaction degree value corresponding to each service routing path.
According to the service route allocation method for the power IP-optical communication network provided by the invention, the method for acquiring the optimal service working path of the target service according to the service type of the target service and the path satisfaction value comprises the following steps:
taking mutually disjoint service routing paths in the plurality of service routing paths as target service routing paths;
acquiring a target service path corresponding to a maximum path satisfaction value, and acquiring an optimal service working path according to the target service path corresponding to the maximum path satisfaction value and the service type of the target service;
and performing service routing distribution on the target service according to the optimal service working path.
According to the service route allocation method for the power IP-optical communication network provided by the present invention, the obtaining of the optimal service working path according to the target service path corresponding to the maximum path satisfaction value and the service type of the target service includes:
judging the routing distribution requirement of the target service according to the service type of the target service;
if the target service is judged to be a service without double-channel requirement, directly taking the target service path corresponding to the maximum path satisfaction value as the optimal service working path of the target service;
and if the target service is judged and known to be the dual-channel required service, determining an optimal service working path and a service working standby path of the target service according to a path satisfaction value sequencing result of the target service path, wherein the optimal service working path is the target service path corresponding to the maximum path satisfaction value.
The present invention also provides a service route allocation device for an electrical IP-optical communication network, comprising:
the model establishing module is used for establishing a service routing path satisfaction model according to the station level difference, the link availability and the shared link risk group of the target service;
the satisfaction obtaining module is used for solving the service routing path satisfaction model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths meeting preset conditions and path satisfaction values corresponding to the service routing paths;
and the route distribution module is used for acquiring the optimal service working path of the target service according to the service type of the target service and the path satisfaction value so as to complete route distribution according to the optimal service working path.
The present invention also provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the steps of the traffic route allocation method for power IP-optical communication network as described in any of the above when executing the program.
The present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the traffic route allocation method for a power IP-optical communications network as described in any one of the above.
According to the service route distribution method and device for the power IP-optical communication network, the service route satisfaction model is established, the route planning is carried out on the route satisfaction model by adopting the deep reinforcement learning algorithm, the optimal service working path is obtained, the communication time delay meets the preset requirement, the risk resistance of link interruption of the whole power IP-optical communication network is enhanced, and therefore the service transmission risk and the blocking rate are reduced.
Drawings
In order to more clearly illustrate the technical solutions of the present invention or the prior art, the drawings needed for the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a schematic flow chart of a service route allocation method for an electrical IP-optical communication network according to the present invention;
fig. 2 is a schematic diagram of a shared risk link group of a traffic routing allocation method for a power IP-optical communication network according to the present invention;
fig. 3 is a schematic diagram illustrating a calculation flow of a weight parameter of a service route allocation method for an electrical IP-optical communication network according to the present invention;
fig. 4 is a schematic structural diagram of a service route distribution device for an electrical IP-optical communication network according to the present invention;
fig. 5 is a schematic structural diagram of an electronic device provided in the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is obvious that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a schematic flow chart of a service route allocation method for an electrical IP-optical communication network, which is provided by the present invention, and as shown in fig. 1, the present invention provides a service route allocation method for an electrical IP-optical communication network, including:
In the invention, specifically, the station level difference is replaced by a station voltage level, the station level difference and the station voltage value are in a direct proportion relation, and the higher the station voltage value is, the higher the station level is correspondingly. The link with the smaller difference value between the grades of the stations at two ends of the link is higher in probability of being selected in routing, and the smaller in probability of being selected in the routing process, otherwise.
The energy internet is a typical information physical system composed of a communication network and a physical power grid, a communication link and a power line are usually laid in the same structure, and relevant communication equipment such as a switch and a router is usually deployed in a substation. Different transformer substation station grades are also different, and the station grade value generally has positive correlation with the station voltage value. According to the principle of voltage class relation and area division, when power service transmission is required, site classes of adjacent power transformation sites are required to be the same or similar, cross-site class transmission is avoided as much as possible, but in a cross-region interconnected power grid, in order to realize long-distance power transmission and reduce power transmission cost, a high-voltage (extra-high voltage and extra-high voltage) power transmission line often crosses and crosses multiple low-level sites and lines in an adjacent region in the power transmission process, if the site classes on a path are not limited, a service roundabout path is possibly too long, service transmission delay and network risk are increased, and the concept of site class difference is provided.
In particular, link availability is a key factor influencing path selection, and is closely related to the factors of edge betweenness of links in a network, link importance and link availability.
Specifically, the Shared Link Risk Group (SRLG) is defined as: a group of SRLGs is usually defined by sharing the same physical resource with a group of links and sharing the same optical fiber with the same network, and sharing a single fiber channel and a fiber wavelength channel accessing the same node. In engineering practice it has been found that more failures in a network are due to SRLG factors than to single point or single link failures.
The shared link risk group is provided under the condition that a plurality of optical fibers in the same optical cable channel have the possibility of simultaneous failure under the condition of channel failure or optical fiber cutting, and the shared link risk group represents the correlation between links and the correlation between failures.
Specifically, in step 101, a service routing path satisfaction model is established according to the site level difference, the link availability and the shared link risk group of the target service, and further includes, for the target service request, in order to achieve accurate and efficient target service routing calculation, considering the site level difference, the link availability and the link reliability influence factor of the shared link risk group in the target service request data, and establishing a link model to obtain the service routing path satisfaction.
And 102, solving the service routing path satisfaction degree model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths meeting preset conditions and a path satisfaction degree value corresponding to each service routing path.
Specifically, the deep reinforcement learning algorithm includes, but is not limited to, a K-Shortest path algorithm (KSP) algorithm.
Specifically, the preset condition includes a set condition of a target time delay requirement, in the present invention, the protection-type service communication time delay threshold is 10 milliseconds, and the control-type service time delay range is 30 milliseconds.
Specifically, the step 102 further includes performing iterative learning on the service routing path satisfaction model for multiple times according to a deep reinforcement learning algorithm, seeking an optimal solution of the path, and implementing more accurate and efficient service routing calculation of the service in the model to obtain multiple service routing paths meeting the preset conditions and satisfaction values corresponding to the multiple service routing paths.
Step 103, obtaining an optimal service working path of the target service according to the service type of the target service and the path satisfaction value, so as to complete routing distribution according to the optimal service working path.
Specifically, a dual-channel-free demand service and a dual-channel demand service are divided according to the service type of a target service, different service working paths are respectively planned according to the classification requirements of the target service, the selection of an optimal working path is determined through the size of a path satisfaction value, the path with the largest path satisfaction value can be directly selected as the optimal working path by the dual-channel-free demand service, the path with the largest path satisfaction value is selected as the optimal working path by the dual-channel demand service, and the other path is used as an alternative path (other paths which are only smaller than the maximum path satisfaction value can be selected).
According to the service route distribution method for the power IP-optical communication network, the service route satisfaction model is established, the route planning is carried out on the path satisfaction model by adopting the deep reinforcement learning algorithm, the optimal service working path is obtained, the communication time delay is ensured to meet the preset requirement, the risk resistance of link interruption of the whole power IP-optical communication network is enhanced, and therefore the service transmission risk and the blocking rate are reduced.
On the basis of the above embodiment, before the establishing a service routing path satisfaction model according to the site level difference, the link availability, and the shared link risk group of the target service, the method further includes:
acquiring the voltage grade of each power transformation site in the target service, and obtaining a site grade difference according to the voltage grade;
obtaining the link availability according to the link importance and the unit length link availability;
and constructing a shared link risk group according to links passing through the same high-voltage line tower and connecting different power transformation sites.
Specifically, the communication network topology is represented by an undirected graph G (V, E), where V is a set of nodes and is an abstraction of an IP layer data switching device and an optical transmission device in the energy internet communication network, and E is a set of communication links and is an abstraction of communication links between different sites.
Specifically, the link with the smaller difference between the grades of the stations at the two ends of the link has a higher probability of being selected during routing, and vice versa.
Specifically, the station voltage classes have μ classes of different voltage classes, which are denoted as a set U, and the voltage class may be 66KV, 110KV, 220KV, 500KV, or 750 KV.
Further, the station voltage class is used to replace the station rank value, and the station rank difference calculation method is as follows:
wherein u isiIndicating the ith node voltage level, ujRepresents the jth node voltage level, uxRepresents the x-th node voltage level, uyIndicating the yth node voltage level, e indicating the link between the node pair (i, j), l indicating the link between the node pair (x, y), DeRepresenting the link e site level difference normalization value.
Specifically, the edge betweenness reflects the global feature quantity of the action and influence of the link in the whole network, and is represented by the ratio of the shortest path number passing through the edge to all the shortest path numbers in the network during calculation, and the calculation formula is represented as:
wherein psieIndicating the edge argument, ψ, of the link ex,y(e) Indicating the shortest path number, psi, across the linkx,yRepresenting the number of shortest paths in the network.
Specifically, the link importance is obtained by standardizing the line voltage level by a min-max method, and the standardized processing formula is as follows:
wherein the content of the first and second substances,
for the purpose of a normalized line voltage value,
indicating the power line voltage level to which the communication link corresponds,
represents the maximum value in the line voltage set U,
represents the minimum value, I, of the line voltage set UeIndicating link importance, IeAnd
in direct proportion.
It should be noted that, in the present invention, the link importance refers to the degree of influence on the stable operation of the energy internet when a link fails. Since communication links and power lines are often built with the same architecture in an energy internet communication network, the importance of the power lines is used to approximate the importance of the communication links. The importance of the power line is related to the voltage class of the transmission line, and a higher voltage class means a wider transmission range, and therefore the importance of the link is also higher.
Specifically, the link availability is an important index for describing line stability, and is related To Mean Time Between Failures (MTBF, abbreviated) and Mean Time To Repair Time of link (MTTR), and the link availability per unit length is:
Ae＝MTBF/(MTBF+MTTR)；
wherein MTBF represents an average time between two failures, MTTR represents an average time between failure repairs, AeIs the link availability per unit length.
It should be noted that, because the power communication optical cable is installed or laid in a remote field environment, it is inevitable that a link failure occurs due to the influence of natural factors (such as thunderstorm, strong wind, ice cover, etc.) or artificial damage, and therefore, the link availability ratio is required to be used as an important index for describing the line stability. In an energy internet communication network, 3 transmission media of All-Dielectric Self-Supporting (ADSS) Optical fibers, Optical Fiber Composite Overhead Ground wires (OPGWs) and common Optical fibers are mainly used for transmitting traffic among different levels of power transformation sites, and the availability of different types of Optical fibers is different even under the same condition. Relevant studies have shown that: the failure rate of the ADSS optical cable is 0.4-0.6% higher than that of the OPGW optical cable per kilometer, so the link type is also an important factor influencing the link availability.
Further, link availability is closely related to link importance and link availability factor of a link in a network, and the link availability formula is represented as:
wherein, χeIndicating link availability, CeDenotes the link type parameter, L denotes the length of the link e, Ae LIndicating the link availability of length L.
It should be noted that the communication link with a large importance is often a key line for information aggregation in the network, and the larger the carried communication traffic is, the lower the overall risk of the network is for balanced service distribution, so that the availability of the link with a large importance is lower.
Preferably, the availability of the OPGW line with high availability is greater than that of the ADSS optical cable with low availability.
Fig. 2 is a schematic diagram of a group of shared risk links of the service routing allocation method for the power IP-optical communication network according to the present invention, which can be referred to in fig. 2, wherein a group of links passing through the same high-voltage tower and connecting different power transformation sites in the energy internet is defined as an SRLG (since the SRLGs in the network are determined according to actual cable erection), as indicated by 3 SRLGs in fig. 2. Since the links AD, AC, AB pass through the same tower, once the tower fails, the three links will fail at the same time, so they belong to one SRLG, and similarly, the links ED, EF and FD, FE, FG are each one SRLG. It can also be seen that an SRLG often has multiple links, and a link may also belong to multiple SRLGs, such as link EF.
Specifically, note
For all SRLG sets in the network, δeFor decision variables, link e is taken
The attribution case in (1) is expressed as:
wherein, deltaeIn order to make a decision on a variable,
is aggregated for all shared risk link groups in the network.
Further, the service routing link satisfaction is obtained according to the weighted sum of the station level difference, the link availability and the edge betweenness, and the formula for obtaining the link satisfaction is as follows:
wherein the content of the first and second substances,
for link satisfaction, w1As link availability weight, w2Is an edge weight, w3Is the site level difference parameter weight. It should be noted that, the link satisfaction and the link availability are in a positive correlation, the larger the link availability value is, the higher the link satisfaction is, and otherwise, the lower the link satisfaction is; the larger the edge betweenness is, the more the link is passed by the shortest path in the network, the stronger the transmission and control capability of the link is, therefore, in the transmission process, the service is easier to be carried out inSuch aggregation on links results in lower link satisfaction as the network impact upon link outage or failure increases. Likewise, the greater the site level difference, the lower the link satisfaction.
Fig. 3 is a schematic diagram of a weight parameter calculation flow of the service route allocation method for the power IP-optical communication network provided by the present invention, and reference may be made to fig. 3, where on the basis of the foregoing embodiment, the link availability weight, the edge number weight, and the site level difference weight are calculated by an entropy weight method, and the step of specifically calculating the weight parameter by the entropy weight method includes:
301, establish a first matrix [ Amn]|E|×3Obtaining the largest matrix in the first matrices:
each row of elements in the first matrix are 3 indexes of link availability, edge betweenness and link site level difference, and | E | represents the number of links in the network;
M＝(Mmn)|E|×3；
Mmn＝Amn/A*，m＝1,2,...|E|,n＝1,2,3；
wherein the content of the first and second substances,
the entropy value of the nth parameter is shown, theta is a normal number, and theta is 1;
the entropy can measure uncertainty, and the dispersion degree of each index can be determined in comprehensive evaluation, wherein indexes with large dispersion degrees have smaller corresponding entropy values when the influence weight is larger in the comprehensive evaluation.
further, the link availability weight, the edge betweenness weight and the site level difference weight are calculated by an entropy weight method, a link satisfaction value is obtained according to the link availability, the edge betweenness, the site level difference and the weighted sum of the corresponding weight parameters, and a service routing path satisfaction is obtained according to the link satisfaction value, wherein the service routing path satisfaction formula is as follows:
wherein the content of the first and second substances,
for link satisfaction, δeAs decision variables, p is a set of paths, nhopIs the total number of hops of the path.
When the service routing in the power grid is planned and divided, an Integer linear Programming (ILP for short) is adopted to obtain an optimal solution of the problem, but the optimal solution belongs to an NP complete problem in a large-scale network due to the influence and the restriction of a plurality of variables such as service distribution, the number of nodes, the number of links, time slices, the number of frequency slots and the like in the network, the solving complexity is high, the calculation efficiency is low, and the service requirement is difficult to meet. In order to reduce the solving difficulty, a heuristic solving scheme is adopted for the RMSA problem in the large-scale network so as to obtain the solution of the problem within the allowable range of cost (such as time, cost and hop count).
On the basis of the above embodiment, the solving the service routing path satisfaction model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths satisfying a preset condition and a path satisfaction value corresponding to each service routing path includes:
and solving the service routing path satisfaction degree model through K shortest path algorithms, judging the solved result, and if the preset time delay requirement is met, acquiring a plurality of service routing paths and a path satisfaction degree value corresponding to each service routing path.
The K shortest path algorithms are algorithms for finding shortest paths in the initial node and the target node according to the given initial node and target node, and the shortest paths are found, so that the service transmission from the initial node to the target node is completed with the least hop count. Besides, the shortest path is determined, and the secondary short path and the third short path are sequentially determined until the Kth short path is obtained.
K paths meeting the preset time delay requirement are generated from the service routing path satisfaction model through a K shortest path algorithm, and path satisfaction values corresponding to the K paths are obtained at the same time.
On the basis of the above embodiment, the obtaining an optimal service working path of the target service according to the service type of the target service and the path satisfaction value includes:
taking mutually disjoint service routing paths in the plurality of service routing paths as target service routing paths;
acquiring a target service path corresponding to a maximum path satisfaction value, and acquiring an optimal service working path according to the target service path corresponding to the maximum path satisfaction value and the service type of the target service;
and performing service routing distribution on the target service according to the optimal service working path.
Specifically, in the existing energy internet communication network, various services such as relay protection, safety and stability control, scheduling automation and the like are also carried. According to the business partition principle and the function in the operation of the energy Internet, the business is divided into a production control area and a management information area, wherein the production control area is further divided into a control area and a non-control area, and in the invention, the target business divides the energy Internet communication business into the following 4 types according to the difference of business importance, double channels, real-time performance and reliability indexes:
the class I service has a dual-channel configuration requirement, is extremely important to the stable operation of the energy Internet for protection and control services, has extremely strict requirements on real-time performance and reliability indexes, and generally requires end-to-end transmission within millisecond time scale; adopting double-route configuration, switching to a pre-configured standby path after a working path fails, and realizing service bandwidth allocation according to reserved special resources;
the class II service has a dual-channel configuration requirement, and the real-time performance and reliability indexes are only second to those of the class I service, such as scheduling telephone, scheduling automation, wide-area phasor measurement and telemetering service; it should be noted that although there are dual path requirements, different from the resource monopolizing mode in the above class I service, this type of service often adopts shared backup path protection to improve the resource utilization rate, but because its service level is higher, it has absolute occupation right for the channel in the transmission period, and the occupied channel can not be occupied by other services until the service is processed;
the third class of service has no double-channel requirement, and real-time broadband services, such as video conferences, transformer substation video monitoring, lightning positioning monitoring, protection information management and the like, are the third class of services;
the IV type service has no double-channel requirement, and non-real-time narrow-band services, such as lightning location monitoring, protection information management, office automation and the like, are the IV type service.
For the above 4 types of services, normalization processing is performed on 3 indexes of dual channels, real-time performance and bandwidth requirements, and then a triangular mold fusion method is adopted to determine the grade, which can refer to table 1:
TABLE 1
Specifically, K shortest path algorithms are adopted to calculate K paths meeting the preset time delay requirement, and mutually disjoint service routing paths in the K service routing paths are obtained and used as target service routing paths; and selecting a path with the maximum path satisfaction value from mutually-disjoint target service routing paths, obtaining an optimal service working path by combining the service type of the target service, and completing an optimal distribution scheme of the service routing so as to minimize the comprehensive risk of the system.
On the basis of the above embodiment, obtaining an optimal service working path according to the target service path corresponding to the maximum path satisfaction value and the service type of the target service includes:
judging the routing distribution requirement of the target service according to the service type of the target service;
if the target service is judged to be a service without double-channel requirement, directly taking the target service path corresponding to the maximum path satisfaction value as the optimal service working path of the target service;
and if the target service is judged and known to be the dual-channel required service, determining an optimal service working path and a service working standby path of the target service according to a path satisfaction value sequencing result of the target service path, wherein the optimal service working path is the target service path corresponding to the maximum path satisfaction value.
In particular, K bars are usedCalculating K paths meeting the preset time delay requirement by using a short path algorithm, and storing mutually disjoint service routing paths and corresponding path satisfaction degrees in the K service routing paths in a set
In (1). The mutually disjoint service routing paths are selected to avoid or reduce the association fault caused by the links belonging to the same shared link risk group, so that the reliability of the paths can be improved.
Further, different working path allocation schemes are selected according to the service type of the target service:
if the service type of the target service is type III service or type IV service and the requirement of no double channels is met, the set is collected
The path with the maximum medium path satisfaction value is used as the optimal service working path of the target service; if the service type of the target service is class I service or class II service and meets the dual-channel requirement service, according to the sorting result of the path satisfaction value, the target service is gathered
The service route path with the largest path satisfaction value is selected from the non-intersected service route paths as the optimal service working path of the target service, and the other path with the second shortest path is used as a service standby path, so that the time delay sensitivity requirement of the service is ensured, and the transmission risk is reduced.
If the satisfaction degrees of the two paths are the same, the path with the small time delay is selected as a service working path, and the other path is selected as a standby path.
Fig. 4 is a schematic structural diagram of a service route allocation apparatus for an electrical IP-optical communication network according to the present invention, and as shown in fig. 4, the present invention provides a service route allocation apparatus for an electrical IP-optical communication network, including a model building module 401, a satisfaction obtaining module 402, and a route allocation module 403, where the model building module 401 is configured to build a service route satisfaction model according to a station level difference, a link availability, and a shared link risk group of a target service; the satisfaction obtaining module 402 is configured to solve the service routing path satisfaction model according to a deep reinforcement learning algorithm, and obtain a plurality of service routing paths that satisfy a preset condition and a path satisfaction value corresponding to each service routing path; the route allocation module 403 is configured to obtain an optimal service working path of the target service according to the service type of the target service and the path satisfaction value, so as to complete route allocation according to the optimal service working path.
The service route distribution device for the power IP-optical communication network establishes a service route satisfaction model through the model establishing module, performs route planning on the route satisfaction model by adopting a deep reinforcement learning algorithm in the satisfaction acquiring module, acquires a plurality of service route paths meeting preset conditions and a route satisfaction value corresponding to each service route path, acquires an optimal service working path through the route distribution module, completes the route distribution of the service working path, ensures that communication delay meets preset requirements, and enhances the risk resistance of link interruption of the whole power IP-optical communication network, thereby reducing service transmission risk and blocking rate.
The apparatus provided in the embodiment of the present invention is used for executing the above method embodiments, and for details of the process and the details, reference is made to the above embodiments, which are not described herein again.
Fig. 5 is a schematic structural diagram of an electronic device provided in the present invention, and as shown in fig. 5, the electronic device may include: a processor (processor)501, a communication Interface (Communications Interface)502, a memory (memory)503, and a communication bus 504, wherein the processor 501, the communication Interface 502, and the memory 503 are configured to communicate with each other via the communication bus 504. Processor 501 may invoke logic instructions in memory 503 to perform a method of traffic route assignment for a power IP-optical communications network, the method comprising: establishing a service routing path satisfaction model according to the station level difference, the link availability and the shared link risk group of the target service; solving the service routing path satisfaction degree model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths meeting preset conditions and path satisfaction degrees corresponding to each service routing path; and acquiring an optimal service working path of the target service according to the service type of the target service and the path satisfaction value, so as to complete routing distribution according to the optimal service working path.
In addition, the logic instructions in the memory 503 may be implemented in the form of software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In another aspect, the present invention also provides a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, enable the computer to perform the method for allocating traffic routes for an electrical IP-optical communications network provided by the above methods, the method comprising: establishing a service routing path satisfaction model according to the station level difference, the link availability and the shared link risk group of the target service; solving the service routing path satisfaction degree model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths meeting preset conditions and path satisfaction degrees corresponding to each service routing path; and acquiring an optimal service working path of the target service according to the service type of the target service and the path satisfaction value, so as to complete routing distribution according to the optimal service working path.
In yet another aspect, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored, the computer program being implemented by a processor to execute the traffic route allocation method for a power IP-optical communication network provided in the foregoing embodiments, the method including: establishing a service routing path satisfaction model according to the station level difference, the link availability and the shared link risk group of the target service; solving the service routing path satisfaction degree model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths meeting preset conditions and path satisfaction degrees corresponding to each service routing path; and acquiring an optimal service working path of the target service according to the service type of the target service and the path satisfaction value, so as to complete routing distribution according to the optimal service working path.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A method for traffic routing assignment for a power IP-optical communications network, comprising:
establishing a service routing path satisfaction model according to the station level difference, the link availability and the shared link risk group of the target service;
solving the service routing path satisfaction degree model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths meeting preset conditions and path satisfaction degrees corresponding to each service routing path;
and acquiring an optimal service working path of the target service according to the service type of the target service and the path satisfaction value, so as to complete routing distribution according to the optimal service working path.
2. The traffic route allocation method for a power IP-optical communications network according to claim 1, wherein before said establishing a traffic route path satisfaction model based on site level differences, link availability and shared link risk groups of a target traffic, the method further comprises:
acquiring the voltage grade of each power transformation site in the target service, and obtaining a site grade difference according to the voltage grade;
obtaining the link availability according to the link importance and the unit length link availability;
and constructing a shared link risk group according to links passing through the same high-voltage line tower and connecting different power transformation sites.
3. The method according to claim 2, wherein the traffic routing path satisfaction model specifically comprises:
Ae＝MTBF/(MTBF+MTTR)；
θe＝w1χe-w2ψe-w3De；
wherein u isiIndicating the ith node voltage level, ujRepresents the jth node voltage level, uxRepresents the x-th node voltage level, uyIndicating the yth node voltage level, e indicating the link between the node pair (i, j), l indicating the link between the node pair (x, y), DeIndicating normalized values of site level differences of links E, V indicating a set of nodes, E indicating a set of communication links, psieIndicating the edge argument, ψ, of the link ex,y(e) Indicating the shortest path number, psi, across the linkx,yRepresents the number of shortest paths in the network,
for the normalized link voltage level value,
indicating the power line voltage level to which the communication link corresponds,
represents the maximum value in the line voltage set U,
represents the minimum value, I, of the line voltage set UeIndicates link importance, χeIndicating link availability, CeDenotes the link type parameter, L denotes the length of the link e, Ae LIndicating the link availability of length L, MTBF indicating the mean time between two failures, MTTR indicating the mean time between failure repairs, δeThe decision variables are represented by a representation of,
representing the set of all shared risk link groups in the network, θeIndicating link satisfaction, w1Represents a link availability weight, w2Representing edge betweenness weight, w3Representing the site level difference parameter weight, p representing the path set, nhopRepresenting the total number of hops of the path.
4. The traffic routing method for power IP-optical communications network according to claim 3, wherein the link availability weight, the edge betweenness weight and the site level difference weight are calculated by an entropy weight method.
5. The method of claim 1, wherein the solving the service routing path satisfaction model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths satisfying a preset condition and a path satisfaction value corresponding to each service routing path comprises:
and solving the service routing path satisfaction degree model through K shortest path algorithms, judging the solved result, and if the preset time delay requirement is met, acquiring a plurality of service routing paths and a path satisfaction degree value corresponding to each service routing path.
6. The method according to claim 1, wherein the obtaining an optimal service working path of the target service according to the service type of the target service and the path satisfaction value comprises:
taking mutually disjoint service routing paths in the plurality of service routing paths as target service routing paths;
acquiring a target service path corresponding to a maximum path satisfaction value, and acquiring an optimal service working path according to the target service path corresponding to the maximum path satisfaction value and the service type of the target service;
and performing service routing distribution on the target service according to the optimal service working path.
7. The method of claim 6, wherein obtaining an optimal service working path according to a target service path corresponding to the maximum path satisfaction value and a service type of the target service comprises:
judging the routing distribution requirement of the target service according to the service type of the target service;
if the target service is judged to be a service without double-channel requirement, directly taking the target service path corresponding to the maximum path satisfaction value as the optimal service working path of the target service;
and if the target service is judged and known to be the dual-channel required service, determining an optimal service working path and a service working standby path of the target service according to a path satisfaction value sequencing result of the target service path, wherein the optimal service working path is the target service path corresponding to the maximum path satisfaction value.
8. A traffic routing assignment arrangement for a power IP-optical communications network, the arrangement comprising:
the model establishing module is used for establishing a service routing path satisfaction model according to the station level difference, the link availability and the shared link risk group of the target service;
the satisfaction obtaining module is used for solving the service routing path satisfaction model according to a deep reinforcement learning algorithm to obtain a plurality of service routing paths meeting preset conditions and path satisfaction values corresponding to the service routing paths;
and the route distribution module is used for acquiring the optimal service working path of the target service according to the service type of the target service and the path satisfaction value so as to complete route distribution according to the optimal service working path.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor, when executing the program, carries out the steps of the method for traffic route allocation for a power IP-optical communications network according to any one of claims 1 to 7.
10. A non-transitory computer readable storage medium having stored thereon a computer program, which when executed by a processor, carries out the steps of the method for traffic route allocation for a power IP-optical communications network according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110105228.7A CN112887207B (en) | 2021-01-26 | 2021-01-26 | Service route distribution method and device for power IP-optical communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110105228.7A CN112887207B (en) | 2021-01-26 | 2021-01-26 | Service route distribution method and device for power IP-optical communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112887207A true CN112887207A (en) | 2021-06-01 |
| CN112887207B CN112887207B (en) | 2022-07-01 |
Family
ID=76053593
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110105228.7A Active CN112887207B (en) | 2021-01-26 | 2021-01-26 | Service route distribution method and device for power IP-optical communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112887207B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113660038A (en) * | 2021-06-28 | 2021-11-16 | 华南师范大学 | Optical network routing method based on deep reinforcement learning and knowledge distillation |
| CN115134293A (en) * | 2022-09-01 | 2022-09-30 | 浪潮通信信息系统有限公司 | Telecommunication route recommendation method, device and server |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006040903A1 (en) * | 2004-10-14 | 2006-04-20 | Tokyo Denki University | Exchange node and exchange node control method |
| CN105007222A (en) * | 2015-04-20 | 2015-10-28 | 中国电信股份有限公司 | Business transmission path selection method and business transmission path selection device |
| US20170063666A1 (en) * | 2015-08-27 | 2017-03-02 | Facebook, Inc. | Routing with flow over shared risk link groups |
| CN111106999A (en) * | 2019-12-27 | 2020-05-05 | 国网江苏省电力公司信息通信分公司 | IP-optical network communication service joint distribution method and device |
| CN111342889A (en) * | 2020-03-06 | 2020-06-26 | 中国电力科学研究院有限公司 | Risk separation protection path searching method and system for safety and stability control type service |
-
2021
- 2021-01-26 CN CN202110105228.7A patent/CN112887207B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006040903A1 (en) * | 2004-10-14 | 2006-04-20 | Tokyo Denki University | Exchange node and exchange node control method |
| CN105007222A (en) * | 2015-04-20 | 2015-10-28 | 中国电信股份有限公司 | Business transmission path selection method and business transmission path selection device |
| US20170063666A1 (en) * | 2015-08-27 | 2017-03-02 | Facebook, Inc. | Routing with flow over shared risk link groups |
| CN111106999A (en) * | 2019-12-27 | 2020-05-05 | 国网江苏省电力公司信息通信分公司 | IP-optical network communication service joint distribution method and device |
| CN111342889A (en) * | 2020-03-06 | 2020-06-26 | 中国电力科学研究院有限公司 | Risk separation protection path searching method and system for safety and stability control type service |
Non-Patent Citations (3)
| Title |
|---|
| BAOJU LIU，等: ""Risk-Aware Service Routes Planning for System Protection Communication Network in Energy Internet"", 《2019 IFIP/IEEE SYMPOSIUM ON INTEGRATED NETWORK AND SERVICE MANAGEMENT (IM)》 * |
| 刘保菊等: "电力SDN通信网中面向负载均衡的路由重构", 《北京邮电大学学报》 * |
| 祁兵，等: ""基于业务优先级和SRLG的电力需求响应业务调度优化算法"", 《电网技术》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113660038A (en) * | 2021-06-28 | 2021-11-16 | 华南师范大学 | Optical network routing method based on deep reinforcement learning and knowledge distillation |
| CN115134293A (en) * | 2022-09-01 | 2022-09-30 | 浪潮通信信息系统有限公司 | Telecommunication route recommendation method, device and server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112887207B (en) | 2022-07-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108809828B (en) | Power communication network routing method for joint balance of load flow and business risk | |
| CN109038794B (en) | QoS control-oriented extra-high voltage power grid system protection service path planning method | |
| CN112887207B (en) | Service route distribution method and device for power IP-optical communication network | |
| CN105656198B (en) | A kind of acquisition methods of powerline network redundant path strategy | |
| CN114025264B (en) | Route planning method for electric power communication SDH optical transmission network | |
| Xing et al. | Load balancing-based routing optimization mechanism for power communication networks | |
| Guo et al. | EMS communication routings’ optimisation to enhance power system security considering cyber‐physical interdependence | |
| Zhao et al. | A routing optimization method based on risk prediction for communication services in smart grid | |
| CN109494728A (en) | A kind of distribution terminal addressing selection method | |
| Jereb | Network reliability: models, measures and analysis | |
| CN110740394B (en) | Power optical transmission network optimization method and system based on site classification business classification | |
| CN114615184A (en) | Double-route planning method, device and system for power service | |
| Ti et al. | Operational risk-averse routing optimization for cyber-physical power systems | |
| Myhre et al. | Modeling interdependencies with complex network theory in a combined electrical power and ICT system | |
| Ghasemkhani et al. | An efficient multi-objective approach for designing of communication interfaces in smart grids | |
| CN111147288A (en) | Power dispatching communication network node importance identification and evaluation method | |
| Dong et al. | A service routing reconstruction approach in cyber-physical power system based on risk balance | |
| Li et al. | P-cycle based protection scheme with cycle multiplexing and capacity balance for multicast service in substation communication network | |
| Xing et al. | PLC-oriented access point location planning algorithm in smart-grid communication networks | |
| Wang et al. | Electricity services based dependability model of power grid communication networking | |
| CN109842522A (en) | Communicate the configuration method and system of route resource | |
| CN108493908B (en) | A kind of locality protection partition method considering communication constraint | |
| CN110472867A (en) | Power distribution network Network adaptation assessment processing method and device | |
| CN113408921B (en) | Cascading failure risk assessment method based on network dependency relationship | |
| Lv et al. | Service awareness recovery under N-1 failure in power grid optical communication networks |
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 |