CN108011817B - Method and system for redeploying power communication private network service route - Google Patents

Method and system for redeploying power communication private network service route Download PDF

Info

Publication number
CN108011817B
CN108011817B CN201711098343.6A CN201711098343A CN108011817B CN 108011817 B CN108011817 B CN 108011817B CN 201711098343 A CN201711098343 A CN 201711098343A CN 108011817 B CN108011817 B CN 108011817B
Authority
CN
China
Prior art keywords
node
service
link
degree
route
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
Application number
CN201711098343.6A
Other languages
Chinese (zh)
Other versions
CN108011817A (en
Inventor
王智慧
丁慧霞
张庚
汪洋
滕玲
吴赛
陈相舟
李哲
李伯仲
喻鹏
秦璇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Information and Telecommunication Co Ltd
Beijing University of Posts and Telecommunications
China Electric Power Research Institute Co Ltd CEPRI
State Grid Hebei Electric Power Co Ltd
Original Assignee
State Grid Information and Telecommunication Co Ltd
Beijing University of Posts and Telecommunications
China Electric Power Research Institute Co Ltd CEPRI
State Grid Hebei Electric Power Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by State Grid Information and Telecommunication Co Ltd, Beijing University of Posts and Telecommunications, China Electric Power Research Institute Co Ltd CEPRI, State Grid Hebei Electric Power Co Ltd filed Critical State Grid Information and Telecommunication Co Ltd
Priority to CN201711098343.6A priority Critical patent/CN108011817B/en
Publication of CN108011817A publication Critical patent/CN108011817A/en
Application granted granted Critical
Publication of CN108011817B publication Critical patent/CN108011817B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • 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/02—Topology update or discovery
    • 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/28—Routing or path finding of packets in data switching networks using route fault recovery

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a method for redeploying a power communication private network service route, which comprises the following steps: acquiring a network topology structure of a power communication private network service route; acquiring a service set influenced by a fault link, service importance corresponding to each service, source point information, destination node information and a constraint vector according to fault information; arranging the services in the service set influenced by the fault link in a descending order according to the service importance; initializing data; configuring a shortest path from a source point to a destination node by using an improved Dijkstra algorithm, and determining a new network topological structure; adding 1 to the cycle number, and comparing the cycle number with a routing threshold; determining a first shortest path and a standby path, and respectively calculating the route intersection degree of each standby path and the first shortest path; arranging the routes corresponding to each service in an ascending order according to the route intersection degree; determining the order of the paths and updating the service distribution.

Description

Method and system for redeploying power communication private network service route
Technical Field
The present invention relates to the field of service route management of power communication private networks, and more particularly, to a method and system for relocating a service route of a power communication private network.
Background
As an important communication component in the power system, the power communication private network mainly provides guarantee for guaranteeing the stable operation of the power system, so that the reliability of the power communication private network is directly related to the reliability of the power system. Aiming at the power communication private network bearing key control services such as stability control, pumped storage control and the like, establishing a high-reliability route is an important aspect for ensuring the reliability of the power communication private network.
At present, most researches on routing problems of power communication private networks are focused on theoretical researches of methods, and a routing deployment method meeting constraint requirements is provided aiming at single-route planning and double-route planning requirements of control services. In consideration of the particularity of the power communication system industry, dual routes need to be deployed for important services such as relay protection, stability control and the like which are easy to cause major influence once faults occur. Considering the randomness of the faults of optical fibers and network equipment, how to quickly switch the service carried on a link to other routes after a fault occurs on any link becomes a problem to be solved urgently, and the availability of alternative routes and the balance of the overall network risk are guaranteed. The existing invention patents all use traditional service-oriented route configuration methods for power communication networks, and some only consider service risk factors and some only consider QoS constraints of services during route configuration, and rarely combine the two methods.
On the basis of a single-route deployment method, the existing route deployment algorithm in the electric power communication private network has an improved Dijkstra algorithm, a Floyd algorithm, a particle swarm algorithm and the like, the algorithms are all based on a single-source shortest path algorithm, single-route distribution can be performed on services according to different objective functions, and the defect is that an alternative route scheme cannot be provided for services with multiple constraints.
Common methods for deploying dual routes include an RF algorithm, a KSP algorithm, and the like. The RF algorithm adopts the idea of deleting paths, double routes are obtained based on the Dijkstra algorithm, the KSP is screened after the first k shortest paths of two points are obtained, and the methods have the problem that the conditions such as network load balance and the like are not considered.
All the methods are methods considering route deployment from the planning perspective, and do not consider a service redeployment scheme under the fault condition. Meanwhile, due to the particularity of the power system, operations such as routing configuration and the like are not allowed to be directly performed on the power communication private network. Therefore, the routing of the private power communication network needs to be simulated to determine the problem of relocation of the routing in the private power communication network.
Disclosure of Invention
The invention provides a method and a system for redeploying a service route of a power communication private network, which aim to solve the problem of determining the redeployment of the route in the power communication private network.
In order to solve the above problem, according to an aspect of the present invention, there is provided a method for relocating a traffic route of a private power communication network, the method including:
step 1, acquiring a network topology structure of a power communication private network service route, and determining parameter data of the network topology structure, wherein the parameter data comprises: a weight value for each node and a weight value for each link;
step 2, acquiring a service set influenced by a fault link, service importance corresponding to each service, source point information, destination node information and a constraint vector according to the fault information;
step 3, arranging the services in the service set influenced by the fault link in a descending order according to the service importance;
step 4, setting a routing threshold according to the number of services influenced by the fault link, and setting an initial value of the cycle number to be 1;
step 5, according to the network topological structure, utilizing an improved Dijkstra algorithm to configure the shortest path from a source node to a destination node, establishing a backup node according to each intermediate node of the shortest path, determining a new node set, and determining a new network topological structure according to the new node set;
step 6, adding 1 to the cycle number, comparing the cycle number with a routing threshold value, and returning to the step 5 if the cycle number is smaller than the routing threshold value; otherwise, entering step 7;
step 7, setting the shortest path corresponding to the current fault route as a first shortest path, respectively taking the other shortest paths as standby paths, and respectively calculating the route intersection degree of each standby path and the first shortest path;
8, arranging the routes corresponding to each service in an ascending order according to the route intersection degree;
and 9, respectively calculating the average risk degree, the average risk degree and the delay value of the whole network service in the current network topology structure, determining the sequence of the standby path according to the ascending sequence of the route intersection degree, the shortest path length, the average risk degree and the delay value of the service, and updating the service distribution.
Preferably, the fault information includes: failed node information and failed link information.
Preferably, the establishing a backup node according to each intermediate node of the shortest path, determining a new node set, and determining a new network topology according to the new node set includes:
establishing a backup node v according to each intermediate node of the shortest pathi', determining a new node set V' ═ VU { V1',v2',...v'l-1} node { vi-1,viConnect v to each otheriAnd v 'of each node'iAre connected to each other, arc (v)i-1,vi) Move to (v)i-1',vi) And determining a new network topology.
Preferably, the calculating the route intersection degree of each backup path and the first shortest path includes:
DIR＝DIntersection(AP∩BPi),i＝1,2,...k-1，
wherein D isIRIs the route intersection degree; (AP. andgate BPi) K is the number of paths, which is the common node of the shortest path and the ith backup path.
Preferably, the average risk degree of the network-wide service comprises: the average risk degree corresponding to the node and the average risk degree corresponding to the link, wherein the calculation formula of the average risk degree of the whole network service is as follows:
Figure BDA0001462786600000031
Figure BDA0001462786600000032
Figure BDA0001462786600000033
Figure BDA0001462786600000034
Figure BDA0001462786600000041
wherein D isARSThe average risk degree of the whole network service is obtained; dARS tThe average risk degree corresponding to the node t; dARS IijIs a link lijA corresponding average risk; n is a set of nodes t in the network topology structure; dtThe node risk degree is the sum of the risk degrees of all the services borne by each node due to the influence degree of the node equipment failure on the services; dIijThe link risk degree refers to the influence degree of the link failure on the service and the sum of the service risk degrees borne by each link; l is a set of links in the network topology; lijFor a link from node i to node j, lij∈L，i,j∈N；PtIs the failure probability of node t; i ismThe importance of the mth service in the service set carried on the node t is determined;
Figure BDA0001462786600000044
is a link lijThe failure probability of (2); i ismIs a link lijImportance of the mth service in the above loaded service set.
Preferably, the calculation formula of the risk balance of the network wide service is as follows:
Figure BDA0001462786600000042
wherein D isBRSThe risk balance degree of the whole network service is obtained;
Figure BDA0001462786600000043
represents a link lijThe risk level of (c); dtIs the risk of node t.
According to another aspect of the present invention, there is provided a system for redeploying power communication private network service routes, the system comprising:
the device comprises a parameter data determining unit, a parameter data determining unit and a processing unit, wherein the parameter data determining unit is used for acquiring a network topology structure of a power communication private network service route and determining parameter data of the network topology structure, and the parameter data comprises: a weight value for each node and a weight value for each link;
the service set data determining unit is used for acquiring a service set influenced by a fault link, service importance, source point information, destination node information and a constraint vector corresponding to each service according to the fault information;
the first sequencing unit is used for carrying out descending sequencing on the services in the service set influenced by the fault link according to the service importance;
a routing threshold setting unit, configured to set a routing threshold according to the number of services affected by the failed link, and set an initial value of the cycle number to 1;
a new network topology structure determining unit, configured to configure a shortest path from a source node to a destination node according to the network topology structure by using an improved Dijkstra algorithm, establish a backup node according to each intermediate node of the shortest path, determine a new node set, and determine a new network topology structure according to the new node set;
the comparison unit is used for adding 1 to the cycle number, comparing the cycle number with a routing threshold value, and determining a new network topology structure if the cycle number is smaller than the routing threshold value; otherwise, entering a route intersection calculation unit;
the route intersection calculation unit is used for setting the shortest path corresponding to the current fault route as a first shortest path, respectively using the obtained other shortest paths as standby paths, and respectively calculating the route intersection of each standby path and the first shortest path;
the second sorting unit is used for carrying out ascending sorting on the route corresponding to each service according to the route intersection degree;
and the path determining unit is used for respectively calculating the average risk degree, the average risk degree and the time delay value of the whole network service in the current network topology structure, determining the sequence of the standby paths according to the ascending sequence of the route intersection degree, the shortest path length, the average risk degree and the time delay value of the service, and updating the service distribution.
Preferably, the fault information includes: failed node information and failed link information.
Preferably, the determining unit of the new network topology establishes a backup node according to each intermediate node of the shortest path, determines a new node set, and determines the new network topology according to the new node set, including:
establishing a backup node v according to each intermediate node of the shortest pathi', determining a new node set V' ═ VU { V1',v2',...v'l-1} node { vi-1,viConnect v to each otheriAnd v 'of each node'iAre connected to each other, arc (v)i-1,vi) Move to (v)i-1',vi) And determining a new network topology.
Preferably, the route intersection calculation unit calculates the route intersection of each backup path and the first shortest path, and includes:
DIR＝DIntersection(AP∩BPi),i＝1,2,...k-1，
wherein D isIRIs the route intersection degree; (AP. andgate BPi) K is the number of the backup paths, and is the common node of the shortest path and the ith backup path.
Preferably, the average risk degree of the network-wide service comprises: the average risk degree corresponding to the node and the average risk degree corresponding to the link, wherein the calculation formula of the average risk degree of the whole network service is as follows:
Figure BDA0001462786600000061
Figure BDA0001462786600000062
Figure BDA0001462786600000063
Figure BDA0001462786600000064
Figure BDA0001462786600000065
wherein D isARSThe average risk degree of the whole network service is obtained; dARS tThe average risk degree corresponding to the node t; dARS IijIs a link lijA corresponding average risk; n is a set of nodes t in the network topology structure; dtThe node risk degree is the sum of the risk degrees of all the services borne by each node due to the influence degree of the node equipment failure on the services; dIijThe link risk degree refers to the influence degree of the link failure on the service and the sum of the service risk degrees borne by each link; l is a set of links in the network topology; lijFor a link from node i to node j, lij∈L，i,j∈N；PtIs the failure probability of node t; i ismThe importance of the mth service in the service set carried on the node t is determined;
Figure BDA0001462786600000067
is a link lijThe failure probability of (2); i ismIs a link lijImportance of the mth service in the above loaded service set.
Preferably, the calculation formula of the risk balance of the network wide service is as follows:
Figure BDA0001462786600000066
wherein D isBRSThe risk balance degree of the whole network service is obtained;
Figure BDA0001462786600000068
represents a link lijThe risk level of (c); dtIs the risk of node t.
The method and the system for redeploying the service route of the power communication private network firstly define the simulation scene and the process of redeployment of the service of the power communication private network, and then find a plurality of shortest route groups meeting multiple constraints for a source point and a destination node in the network by improving the KSP algorithm; and finally, determining a plurality of groups of routing schemes according to evaluation indexes such as route intersection, shortest path, time delay, average risk degree and risk balance degree of the whole network service, and selecting one group with all values approximately minimum as an optimal routing scheme, so that all risk differentiated services borne on a fault route can be simultaneously and quickly switched to a link corresponding to the optimal scheme, the waiting time of service recovery is reduced, the transmission efficiency is improved, and the reliability of the power communication system is ensured.
Drawings
A more complete understanding of exemplary embodiments of the present invention may be had by reference to the following drawings in which:
fig. 1 is a flowchart of a method 100 for relocating a service route of a private power communication network according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a simulated network topology according to an embodiment of the present invention; and
fig. 3 is a schematic structural diagram of a system 300 for redeploying a power communication private network service route according to an embodiment of the present invention.
Detailed Description
The exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, however, the present invention may be embodied in many different forms and is not limited to the embodiments described herein, which are provided for complete and complete disclosure of the present invention and to fully convey the scope of the present invention to those skilled in the art. The terminology used in the exemplary embodiments illustrated in the accompanying drawings is not intended to be limiting of the invention. In the drawings, the same units/elements are denoted by the same reference numerals.
Unless otherwise defined, terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. Further, it will be understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense.
Fig. 1 is a flowchart of a method 100 for relocating a service route of a private power communication network according to an embodiment of the present invention. As shown in fig. 1, the method for redeploying a service route of a private power communication network according to the embodiment of the present invention first defines a simulation scenario and a flow of redeployment of a service of a private power communication network, and then finds a plurality of shortest route groups satisfying multiple constraints for a source node and a destination node in a network by improving a KSP algorithm; and finally, determining a plurality of groups of routing schemes according to evaluation indexes such as route intersection, shortest path, time delay, average risk degree and risk balance degree of the whole network service, and selecting one group with all values approximately minimum as an optimal routing scheme, so that all risk differentiated services borne on a fault route can be simultaneously and quickly switched to a link corresponding to the optimal scheme, the waiting time of service recovery is reduced, the transmission efficiency is improved, and the reliability of the power communication system is ensured. The method 100 for redeploying the service route of the private network for power communication in the embodiment of the present invention starts with step 101, and in step 101, a network topology structure of the service route of the private network for power communication is obtained, and parameter data of the network topology structure is determined, where the parameter data includes: a weight value for each node and a weight value for each link.
In the embodiment of the invention, the simulation process of the power communication private network service redeployment mainly comprises the following steps: the method comprises the following processes of data source acquisition, simulation triggering, simulation execution and simulation result output. In the data acquisition stage, network resources and configuration parameter information required by the service redeployment simulation are mainly acquired in various ways, and the data acquisition source can be an interface of a network management system or an offline data file. The data and definitions that need to be acquired include:
g is network of service route in electric power communication network changeThe topological structure diagram is an abstraction of the physical structure of the network; n is a set of network nodes and is an abstraction of switching equipment installed in a factory, a station, a dispatching center and the like; l is a set of network links; r is a set of constraints; lijFor a link from node i to node j, lij∈L,i,j∈N；DiThe node risk degree refers to the total of the risk degrees of all services borne by each node due to the influence degree of the node equipment failure on the services. The calculation formula of the node risk degree is as follows:
Figure BDA0001462786600000081
wherein, PtIs the failure probability of the node t, derived from the operation and maintenance data, ImThe importance of the mth service in the service set carried on the node t can be set in the system.
Figure BDA0001462786600000082
The link risk degree refers to the influence degree of the link failure on the service, and is measured by a service risk value carried on each link. The calculation formula of the link risk degree is as follows:
Figure BDA0001462786600000091
wherein the content of the first and second substances,
Figure BDA0001462786600000092
is a link lijBy system acquisition, ImIs a link lijImportance of the mth service in the above loaded service set.
Preferably, in step 102, a service set affected by the failed link, a service importance corresponding to each service, source point information, destination node information, and a constraint vector are obtained according to the failure information.
Preferably, the fault information includes: failed node information and failed link information.
In the embodiment of the invention, the simulation trigger is data of a base network topology structure, a fault state is set by selecting a link or a node on a topological graph, and the network topology displays the fault link and the affected service and prompts the relocation of the simulation trigger. After the simulation is triggered, the simulation execution stage realizes the service redeployment according to the service redeployment routing method aiming at the service loaded on the fault link according to the acquired data.
Preferably, in step 103, the services in the service set affected by the failed link are sorted in descending order according to the service importance.
Preferably, in step 104, a routing threshold is set according to the number of services affected by the failed link, and an initial value of the number of loops is set to 1. For example, if the number of affected services is 5, k0 may be set to 7.
Preferably, in step 105, according to the network topology, a shortest path from a source node to a destination node is configured by using an improved Dijkstra algorithm, a backup node is established according to each intermediate node of the shortest path, a new node set is determined, and a new network topology is determined according to the new node set.
Preferably, the establishing a backup node according to each intermediate node of the shortest path, determining a new node set, and determining a new network topology according to the new node set includes:
establishing a backup node v according to each intermediate node of the shortest pathi', determining a new node set V' ═ VU { V1',v2',...v'l-1} node { vi-1,viConnect v to each otheriAnd v 'of each node'iAre connected to each other, arc (v)i-1,vi) Move to (v)i-1',vi) And determining a new network topology.
Preferably, in step 106, adding 1 to the cycle number, comparing the cycle number with a routing threshold, and returning to step 105 if the cycle number is smaller than the routing threshold; otherwise, step 107 is entered.
Preferably, in step 107, the shortest path corresponding to the current failed route is set as the first shortest path, the obtained other shortest paths are respectively backup paths, and the route intersection degrees of each backup path and the first shortest path are respectively calculated.
Preferably, the calculating the route intersection degree of each backup path and the first shortest path includes:
DIR＝DIntersection(AP∩BPi),i＝1,2,...k-1，
wherein D isIRIs the route intersection degree; (AP. andgate BPi) K is the number of the backup paths, and is the common node of the shortest path and the ith backup path.
Preferably, in step 108, the routes corresponding to each service are sorted in ascending order according to the route intersection.
Preferably, in step 109, the average risk degree, and the delay value of the entire network service in the current network topology are respectively calculated, and the sequence of the backup paths is determined according to the route intersection degree, the shortest path length, the average risk degree, and the ascending sequence of the delay, and the service distribution is updated.
Preferably, the average risk degree of the network-wide service comprises: the average risk degree corresponding to the node and the average risk degree corresponding to the link, wherein the calculation formula of the average risk degree of the whole network service is as follows:
Figure BDA0001462786600000101
Figure BDA0001462786600000102
Figure BDA0001462786600000103
Figure BDA0001462786600000104
Figure BDA0001462786600000111
wherein D isARSThe average risk degree of the whole network service is obtained; dARS tThe average risk degree corresponding to the node t; dARS IijIs a link lijA corresponding average risk; n is a set of nodes t in the network topology structure; dtThe node risk degree is the sum of the risk degrees of all the services borne by each node due to the influence degree of the node equipment failure on the services; dIijThe link risk degree refers to the influence degree of the link failure on the service and the sum of the service risk degrees borne by each link; l is a set of links in the network topology; lijFor a link from node i to node j, lij∈L，i,j∈N；PtIs the failure probability of node t; i ismThe importance of the mth service in the service set carried on the node t is determined;
Figure BDA0001462786600000112
is a link lijThe failure probability of (2); i ismIs a link lijImportance of the mth service in the above loaded service set.
Preferably, the calculation formula of the risk balance of the network wide service is as follows:
Figure BDA0001462786600000113
wherein D isBRSThe risk balance degree of the whole network service is obtained;
Figure BDA0001462786600000114
represents a link lijThe risk level of (c); dtIs the risk of node t.
In the embodiment of the invention, when the power communication private network service is redeployed, firstly, a redeployed routing mathematical model is established as follows:
the objective function is: min (D)IR),min(DARS),min(DBRS)，
The constraint conditions are as follows:
Figure BDA0001462786600000115
wherein, min (D) in the objective functionIR),min(DARS),min(DBRS) Respectively indicating that the intersection degree, the service average risk degree and the service risk balance degree of any two routes are minimum.
DARSFor the Average Risk Degree (hierarchy on Average Risk of service) of the whole network service, the Average Risk Degree corresponding to the node t and the link IijThe corresponding average risk degree is composed of two parts, and the calculation formula is as follows:
Figure BDA0001462786600000116
DBRSfor the Risk balance of the network-wide service (hierarchy on Balancing task of service), the calculation formula is:
Figure BDA0001462786600000121
wherein D isBRSThe risk balance degree of the whole network service is obtained;
Figure BDA0001462786600000122
represents a link lijThe risk level of (c); dtIs the risk of node t.
DIRThe route Intersection Degree (Degree on Intersection Routing) represents the number of common elements (nodes or links) in two routes. Supposing that k (k is more than or equal to 2) maximum disjoint routes are arranged, one of the routes is selected as a main switching route and recorded as AP, and the other routes are used as standby routes and recorded as BP1，BP2，...BPk-1The calculation formula is DIR＝DIntersection(AP∩BPi),i＝1,2,...k-1。
To simplify the problem, the QoS constraint mainly considers the additive constraint shortest distance and the time delay, because the multiplicative constraint can be converted into the additive constraint by taking the negative logarithm, and other constraints can be preprocessed initially, RiIs a threshold value for each constraint.
When the power communication private network service route is reconfigured based on reliability, according to the characteristics of a target function and a constraint condition, k paths can be solved once by using an improved KSP algorithm, and all services on a failed link need to be subjected to route switching, in order to improve the transmission efficiency of the services and ensure the reliability of a system, the adopted strategy is to simultaneously perform route switching on all the services, and the specific algorithm is as follows:
initializing network G (N, L, W) information, inputting weight matrix W (N) of nodes in the networki)＝{w1(ni),w2(ni) The weight matrix W (l) of the linkj)＝{w1(lj),w2(lj)}；
Service distribution set S influenced by fault node on input networkmAnd the corresponding constraint vector:
R(Sm)＝{r1(Sm),r2(Sm)}；
acquiring a service distribution set Sf influenced by a fault link, corresponding service importance, source point information and destination node information and a constraint vector R (S) under constraint conditionsf)＝{r1(Sf),r2(Sf)}；
Arranging the services in the Sf in a descending order according to the importance;
setting a routing threshold value k0 according to the number f of services influenced by the fault link, and initializing the cycle number k to be 1;
calling an improved Dijkstra algorithm in a network topology structure chart G to configure a first shortest path AP from a source point to a destination node;
for each intermediate node v of the path APi(1 < i < l) establishingA backup node vi', a new set of nodes V' ═ VU { V } is generated1',v2',...v'l-1Will node vi-1,viConnect v to each otheriAnd each node v 'is not on path p'iAre connected to each other, arc (v)i-1,vi) Move to (v)i-1',vi) Obtaining a new graph G';
in the new graph G', k is set to be k +1, if k is less than k0, the step of calling the improved Dijkstra algorithm to configure the first shortest path AP from the source point to the destination node is returned, the former k shortest paths are calculated, and otherwise, the operation is continued;
assuming that the current fault route is the first shortest path AP, the rest k-1 paths are set as BP in sequence1，BP2...BPk-1Calculating AP and BPk-1The degree of intersection;
for service set SfEach service in (k is more than or equal to 0 and less than or equal to k) is arranged according to ascending order of route intersection degree, and f routes are determined;
calculating the average risk degree D of the whole network service in the network at the momentARSBusiness risk balance degree DBRSAnd a delay value; according to the intersection degree, the shortest path length and the average risk degree D of the serviceARSAnd business risk balance degree DBRSAnd determining an approximate optimal path scheme Pk1 and standby path schemes Pk2 and Pk3 … Pkf in a time delay ascending order, outputting Pk1, and updating the service distribution in the network.
In order to verify the effectiveness of the method provided by the patent, the existing power communication private network is simulated. FIG. 2 is a schematic diagram of a simulated network topology according to an embodiment of the present invention. As shown in fig. 2, there are 8 nodes and 12 links (optical cables). The failure probability of the node is randomly generated in 0.00010.001, the failure probability of the link is randomly generated in 0.0010.01, and the traffic distribution in the network at a certain time is shown in table 1. The shortest path group information composed by calculating the first 4 shortest paths using the improved KSP algorithm is shown in table 2 below.
Table 1 traffic distribution in a network
Figure BDA0001462786600000131
Table 2 shortest path group information calculated using the modified KSP algorithm
Figure BDA0001462786600000132
Figure BDA0001462786600000141
Assuming that a l4 link in the network fails at a certain time, the traffic carried on the AP path is switched to other shortest paths according to the improved KSP algorithm, and the configuration result is shown in table 3.
Table 3 configuration results table
Figure BDA0001462786600000142
According to the service importance, the most important service selects the route with the minimum intersection degree with the original route as much as possible, meanwhile, the average risk degree, the risk balance degree and the QoS constraint of the corresponding service are both approximately minimum, and the rest of the services are analogized, so the scheme 2 is the optimal scheme, and the rest of the schemes are standby schemes.
Fig. 3 is a schematic structural diagram of a system 300 for redeploying a power communication private network service route according to an embodiment of the present invention. As shown in fig. 3, a system 300 for relocating a service route of a private power communication network according to an embodiment of the present invention includes: a parameter data determination unit 301, a traffic set data determination unit 302, a first ordering unit 303, a route threshold setting unit 304, a new network topology determination unit 305, a comparison unit 306, a route intersection calculation unit 307, a second ordering unit 308, and a path determination unit 309.
Preferably, in the parameter data determining unit 301, a network topology structure of the electric power communication private network service route is acquired, and parameter data of the network topology structure is determined, where the parameter data includes: a weight value for each node and a weight value for each link.
Preferably, in the service set data determining unit 302, the service set affected by the failed link, the service importance corresponding to each service, the source point information, the destination node information, and the constraint vector are obtained according to the failure information. Preferably, the fault information includes: failed node information and failed link information.
Preferably, in the first sorting unit 303, the services in the service set affected by the failed link are sorted in descending order according to the service importance.
Preferably, in the routing threshold setting unit 304, the routing threshold is set according to the number of services affected by the failed link, and the initial value of the number of loops is set to 1.
Preferably, in the new network topology determining unit 305, according to the network topology, a shortest path from a source node to a destination node is configured by using an improved Dijkstra algorithm, a backup node is established according to each intermediate node of the shortest path, a new node set is determined, and a new network topology is determined according to the new node set.
Preferably, the determining unit 305 of the new network topology, which establishes a backup node according to each intermediate node of the shortest path, determines a new node set, and determines a new network topology according to the new node set, includes:
establishing a backup node v according to each intermediate node of the shortest pathi', determining a new node set V' ═ VU { V1',v2',...v'l-1} node { vi-1,viConnect v to each otheriAnd v 'of each node'iAre connected to each other, arc (v)i-1,vi) Move to (v)i-1',vi) And determining a new network topology.
Preferably, in the comparing unit 306, the cycle number is added by 1, and the cycle number is compared with the routing threshold, if the cycle number is smaller than the routing threshold, the new network topology determining unit is configured; otherwise, entering a route intersection calculation unit.
Preferably, in the route intersection calculation unit 307, the shortest path corresponding to the current failed route is set as the first shortest path, the obtained other shortest paths are respectively backup paths, and the route intersection of each backup path and the first shortest path is calculated respectively.
Preferably, the route intersection calculation unit 307, calculating the route intersection of each backup path and the first shortest path, includes:
DIR＝DIntersection(AP∩BPi),i＝1,2,...k-1，
wherein D isIRIs the route intersection degree; (AP. andgate BPi) K is the number of the backup paths, and is the common node of the shortest path and the ith backup path.
Preferably, in the second sorting unit 308, the routes corresponding to each service are sorted in ascending order according to the route intersection degree.
Preferably, in the path determining unit 309, the average risk degree, and the delay value of the entire network service in the current network topology are respectively calculated, and the order of the backup paths is determined according to the ascending order of the route intersection degree, the shortest path length, the average risk degree, and the delay value, and the service distribution is updated.
Preferably, the average risk degree of the network-wide service comprises: the average risk degree corresponding to the node and the average risk degree corresponding to the link, wherein the calculation formula of the average risk degree of the whole network service is as follows:
Figure BDA0001462786600000161
Figure BDA0001462786600000162
Figure BDA0001462786600000163
Figure BDA0001462786600000164
Figure BDA0001462786600000171
wherein D isARSThe average risk degree of the whole network service is obtained; dARS tThe average risk degree corresponding to the node t; dARS IijIs a link lijA corresponding average risk; n is a set of nodes t in the network topology structure; dtThe node risk degree is the sum of the risk degrees of all the services borne by each node due to the influence degree of the node equipment failure on the services; dIijThe link risk degree refers to the influence degree of the link failure on the service and the sum of the service risk degrees borne by each link; l is a set of links in the network topology; lijFor a link from node i to node j, lij∈L，i,j∈N；PtIs the failure probability of node t; i ismThe importance of the mth service in the service set carried on the node t is determined;
Figure BDA0001462786600000172
is a link lijThe failure probability of (2); i ismIs a link lijImportance of the mth service in the above loaded service set.
Preferably, the calculation formula of the risk balance of the network wide service is as follows:
Figure BDA0001462786600000173
wherein D isBRSThe risk balance degree of the whole network service is obtained;
Figure BDA0001462786600000174
represents a link lijThe risk level of (c); dtIs the risk of node t.
The system 300 for relocating a service route of a private power communication network according to an embodiment of the present invention corresponds to the method 100 for relocating a service route of a private power communication network according to another embodiment of the present invention, and details thereof are not repeated herein.
The invention has been described with reference to a few embodiments. However, other embodiments of the invention than the one disclosed above are equally possible within the scope of the invention, as would be apparent to a person skilled in the art from the appended patent claims.
Generally, all terms used in the claims are to be interpreted according to their ordinary meaning in the technical field, unless explicitly defined otherwise herein. All references to "a/an/the [ device, component, etc ]" are to be interpreted openly as referring to at least one instance of said device, component, etc., unless explicitly stated otherwise. The steps of any method disclosed herein do not have to be performed in the exact order disclosed, unless explicitly stated.

Claims (6)

1. A method for redeploying service routing of a power communication private network is characterized by comprising the following steps:
step 1, acquiring a network topology structure of a power communication private network service route, and determining parameter data of the network topology structure, wherein the parameter data comprises: a weight value for each node and a weight value for each link;
step 2, acquiring a service set influenced by a fault link, corresponding service importance, source point information, destination node information and a constraint vector under a constraint condition according to the fault information;
step 3, arranging the services in the service set influenced by the fault link in a descending order according to the service importance;
step 4, setting a routing threshold according to the number of services influenced by the fault link, and setting an initial value of the cycle number to be 1;
step 5, according to the network topological structure, utilizing an improved Dijkstra algorithm of DixTel to configure a shortest path from a source node to a destination node, establishing a backup node according to each intermediate node of the shortest path, determining a new node set, and determining a new network topological structure according to the new node set;
step 6, adding 1 to the cycle number, comparing the cycle number with a routing threshold value, and returning to the step 5 if the cycle number is smaller than the routing threshold value; otherwise, entering step 7;
step 7, setting the shortest path corresponding to the current fault route as a first shortest path, respectively taking the other shortest paths as standby paths, and respectively calculating the route intersection degree of each standby path and the first shortest path;
8, arranging the routes corresponding to each service in an ascending order according to the route intersection degree;
step 9, respectively calculating the average risk degree, the average risk degree and the time delay value of the whole network service in each new network topology structure, determining an approximate optimal path scheme and a standby path scheme according to the ascending sequence of the route intersection degree, the shortest path length, the average risk degree and the time delay of the whole network service, the average risk degree and the time delay value of the whole network service, outputting the approximate optimal path scheme, and updating service distribution;
wherein the calculating the route intersection degree of each backup path and the first shortest path comprises:
DIR＝DIntersection(AP∩BPi),i＝1,2,...k-1，
wherein D isIRRepresenting the number of common nodes in two routes for the intersection degree of the routes; (AP. andgate BPi) K is the number of the standby paths;
the average risk degree of the whole network service comprises the following steps: the average risk degree corresponding to the node and the average risk degree corresponding to the link, wherein the calculation formula of the average risk degree of the whole network service is as follows:
Figure FDA0002640217220000021
Figure FDA0002640217220000022
Figure FDA0002640217220000023
Figure FDA0002640217220000024
Figure FDA0002640217220000025
wherein D isARSThe average risk degree of the whole network service is obtained; dARS tThe average risk degree corresponding to the node t; dARS IijIs a link lijA corresponding average risk; n is a set of nodes t in the network topology structure; dtThe node risk degree is the sum of the risk degrees of all the services borne by each node due to the influence degree of the node equipment failure on the services; dIijThe link risk degree refers to the influence degree of the link failure on the service and the sum of the service risk degrees borne by each link; l is a set of links in the network topology; lijFor a link from node i to node j, lij∈L，i,j∈N；PtIs the failure probability of node t; i ismThe importance of the mth service in the service set carried on the node t is determined;
Figure FDA0002640217220000026
is a link lijThe failure probability of (2); i ismIs a link lijThe importance of the mth service in the loaded service set;
the calculation formula of the risk balance degree of the whole network service is as follows:
Figure FDA0002640217220000031
wherein D isBRSThe risk balance degree of the whole network service is obtained;
Figure FDA0002640217220000032
represents a link lijThe risk level of (c); dtIs the risk of node t.
2. The method of claim 1, wherein the fault information comprises: failed node information and failed link information.
3. The method of claim 1, wherein establishing a backup node from each intermediate node of the shortest path, determining a new set of nodes, and determining a new network topology from the new set of nodes comprises: establishing a backup node v according to each intermediate node of the shortest pathi', determining a new node set V' ═ VU { V1',v2',...v'l-1} node { vi-1,viConnect v to each otheriAnd v 'of each node'iAre connected to each other, arc (v)i-1,vi) Move to (v)i-1',vi) And determining a new network topology.
4. A system for redeploying power communication private network service routes, the system comprising:
the device comprises a parameter data determining unit, a parameter data determining unit and a processing unit, wherein the parameter data determining unit is used for acquiring a network topology structure of a power communication private network service route and determining parameter data of the network topology structure, and the parameter data comprises: a weight value for each node and a weight value for each link;
the service set data determining unit is used for acquiring a service set influenced by a fault link, corresponding service importance, source point information, destination node information and a constraint vector under a constraint condition according to the fault information;
the first sequencing unit is used for carrying out descending sequencing on the services in the service set influenced by the fault link according to the service importance;
a routing threshold setting unit, configured to set a routing threshold according to the number of services affected by the failed link, and set an initial value of the cycle number to 1;
a new network topology structure determining unit, configured to configure a shortest path from a source point to a destination node according to the network topology structure by using an improved Dijkstra algorithm, establish a backup node according to each intermediate node of the shortest path, determine a new node set, and determine a new network topology structure according to the new node set;
the comparison unit is used for adding 1 to the cycle number, comparing the cycle number with a routing threshold value, and determining a new network topology structure if the cycle number is smaller than the routing threshold value; otherwise, entering a route intersection calculation unit;
the route intersection calculation unit is used for setting the shortest path corresponding to the current fault route as a first shortest path, respectively using the obtained other shortest paths as standby paths, and respectively calculating the route intersection of each standby path and the first shortest path;
the second sorting unit is used for carrying out ascending sorting on the route corresponding to each service according to the route intersection degree;
the path determining unit is used for respectively calculating the average risk degree, the average risk degree and the time delay value of the whole network service in each new network topology structure, determining an approximate optimal path scheme and a standby path scheme according to the ascending sequence of the route intersection degree, the shortest path length, the average risk degree of the whole network service, the average risk degree and the time delay value of the whole network service, outputting the approximate optimal path scheme and updating the service distribution;
wherein, the route intersection calculation unit calculates the route intersection of each backup path and the first shortest path, and includes:
DIR＝DIntersection(AP∩BPi),i＝1,2,...k-1，
wherein D isIRRepresenting the number of common nodes in two routes for the intersection degree of the routes; (AP. andgate BPi) K is the number of the standby paths;
the average risk degree of the whole network service comprises the following steps: the average risk degree corresponding to the node and the average risk degree corresponding to the link, wherein the calculation formula of the average risk degree of the whole network service is as follows:
Figure FDA0002640217220000041
Figure FDA0002640217220000042
Figure FDA0002640217220000051
Figure FDA0002640217220000052
Figure FDA0002640217220000053
wherein D isARSThe average risk degree of the whole network service is obtained; dARS tThe average risk degree corresponding to the node t; dARS lijIs a link lijA corresponding average risk; n is a set of nodes t in the network topology structure; dtThe node risk degree is the sum of the risk degrees of all the services borne by each node due to the influence degree of the node equipment failure on the services; dlijThe link risk degree refers to the influence degree of the link failure on the service and the sum of the service risk degrees borne by each link; l is a set of links in the network topology; lijFor a link from node i to node j, lij∈L，i,j∈N；PtIs the failure probability of node t; i ismThe importance of the mth service in the service set carried on the node t is determined;
Figure FDA0002640217220000054
is a link lijThe failure probability of (2); i ismIs a link lijThe importance of the mth service in the loaded service set;
the calculation formula of the risk balance degree of the whole network service is as follows:
Figure FDA0002640217220000055
wherein D isBRSThe risk balance degree of the whole network service is obtained;
Figure FDA0002640217220000056
represents a link lijThe risk level of (c); dtIs the risk of node t.
5. The system of claim 4, wherein the fault information comprises: failed node information and failed link information.
6. The system of claim 4, wherein the new network topology determining unit, which establishes a backup node according to each intermediate node of the shortest path, determines a new node set, and determines a new network topology according to the new node set, comprises:
establishing a backup node v according to each intermediate node of the shortest pathi', determining a new node set V' ═ VU { V1',v2',...v'l-1} node { vi-1,viConnect v to each otheriIs not on the shortest route from the predecessor node to each node v'iAre connected to each other, arc (v)i-1,vi) Move to (v)i-1',vi) And determining a new network topology.
CN201711098343.6A 2017-11-09 2017-11-09 Method and system for redeploying power communication private network service route Active CN108011817B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711098343.6A CN108011817B (en) 2017-11-09 2017-11-09 Method and system for redeploying power communication private network service route

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711098343.6A CN108011817B (en) 2017-11-09 2017-11-09 Method and system for redeploying power communication private network service route

Publications (2)

Publication Number Publication Date
CN108011817A CN108011817A (en) 2018-05-08
CN108011817B true CN108011817B (en) 2020-11-17

Family

ID=62052389

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711098343.6A Active CN108011817B (en) 2017-11-09 2017-11-09 Method and system for redeploying power communication private network service route

Country Status (1)

Country Link
CN (1) CN108011817B (en)

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108833271B (en) * 2018-05-28 2021-02-09 全球能源互联网研究院有限公司 Power grid wide area control service communication path selection method and server
CN109038794B (en) * 2018-07-11 2021-09-17 中国电力科学研究院有限公司 QoS control-oriented extra-high voltage power grid system protection service path planning method
CN110855352B (en) * 2018-08-20 2020-12-18 ***通信集团广东有限公司 Method and system for determining service influence of optical cable cutting and connecting
CN110177029B (en) * 2019-05-30 2022-05-27 国网甘肃省电力公司经济技术研究院 Power communication network service operation quality evaluation method
CN110224930B (en) * 2019-05-30 2021-10-29 国网福建省电力有限公司 Power communication network service recovery method based on logic cascade failure model
CN110719191A (en) * 2019-08-30 2020-01-21 中国电力科学研究院有限公司 Network reliability assessment method for secondary failure
CN111343093B (en) * 2020-02-28 2021-07-09 腾讯科技（深圳）有限公司 Service data transmission method and device
CN111813883B (en) * 2020-06-23 2024-05-28 上海阿尔卡特网络支援***有限公司 Shortest path query method and query system
CN112118176B (en) * 2020-08-27 2022-07-19 国网内蒙古东部电力有限公司信息通信分公司 Service reliability-oriented routing load optimization method for channel of integrated data network
CN112260946B (en) * 2020-09-10 2024-03-19 视联动力信息技术股份有限公司 Link failure processing method and device, terminal equipment and storage medium
CN112653623B (en) * 2020-12-21 2023-03-14 国家电网有限公司信息通信分公司 Relay protection service-oriented route distribution method and device
CN112702107B (en) * 2020-12-21 2021-10-19 北京邮电大学 Method and system for calculating backup route of satellite network based on betweenness centrality
CN113094115B (en) * 2021-03-29 2023-05-02 联想(北京)有限公司 Deployment strategy determining method, system and storage medium
CN113225259B (en) * 2021-04-13 2022-11-29 国家电网公司华北分部 Communication network route planning method
CN113114514B (en) * 2021-05-07 2022-06-14 广东电网有限责任公司电力调度控制中心 Network resource backup method and system based on multi-attribute analytic hierarchy process
CN113225215B (en) * 2021-05-19 2022-04-12 华北电力大学 Method and system for identifying differentiated service network key link under SDN architecture
CN114553767A (en) * 2021-11-04 2022-05-27 国网浙江省电力有限公司湖州供电公司 Rerouting technology for survivability of power communication network

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105634954A (en) * 2016-01-08 2016-06-01 烽火通信科技股份有限公司 Shortest path calculation method by considering light damage based on WSON
CN106789646A (en) * 2016-12-09 2017-05-31 国网北京市电力公司 Service transmission path determines method and device

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IL179026A (en) * 2006-11-02 2011-04-28 Eci Telecom Ltd Method for finding protected path in mesh networks
WO2012115679A1 (en) * 2011-02-24 2012-08-30 The University Of Tulsa Network-based hyperspeed communication and defense
CN103281245B (en) * 2013-04-26 2016-02-24 广东电网公司电力调度控制中心 Determine method and the device of business routed path
CN106549779B (en) * 2015-09-18 2020-01-24 中国电力科学研究院 Multi-constraint power communication service maximum disjoint double-route configuration method
CN105429894B (en) * 2015-11-30 2018-10-30 国网冀北电力有限公司信息通信分公司 Service route selecting method and device in a kind of power telecom network
CN106209618A (en) * 2016-07-27 2016-12-07 国网辽宁省电力有限公司 A kind of communication mixed networking method and system improving intelligence adapted electric energy effect

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105634954A (en) * 2016-01-08 2016-06-01 烽火通信科技股份有限公司 Shortest path calculation method by considering light damage based on WSON
CN106789646A (en) * 2016-12-09 2017-05-31 国网北京市电力公司 Service transmission path determines method and device

Also Published As

Publication number Publication date
CN108011817A (en) 2018-05-08

Similar Documents

Publication Publication Date Title
CN108011817B (en) Method and system for redeploying power communication private network service route
US7200117B2 (en) Method of optimizing network capacity and fault tolerance in deadlock-free routing
EP1246415B1 (en) Method and apparatus for communications traffic engineering
EP2552065B1 (en) Controller placement for fast failover in the split architecture
US8923113B2 (en) Optimizations in multi-destination tree calculations for layer 2 link state protocols
US8862775B2 (en) Network server and load balancing routing method for networks thereof
US7395351B1 (en) Method for assigning link weights in a communications network
CN106817306B (en) Method and device for determining target route
CN112543151B (en) SDN controller deployment method and device, electronic equipment and storage medium
WO2016153506A1 (en) Fast failover recovery in software defined networks
JP2019514309A (en) System and method for communication network service connectivity
CN111800352B (en) Service function chain deployment method and storage medium based on load balancing
Perepelkin et al. Algorithm and software of virtual slices formation in software defined networks
CN103200071A (en) MTSP multiple-case calculating method and MTSP multiple-case calculating equipment
CN112511230A (en) Optimal optical fiber path selection method and device
CN113472671A (en) Method and device for determining multicast route and computer readable storage medium
Al-Rumaih et al. Spare capacity planning for survivable mesh networks
Soualah et al. PR-VNE: Preventive reliable virtual network embedding algorithm in cloud's network
CN114244713A (en) Resource backup method and device for power 5G network slice
JP6323194B2 (en) Network management apparatus and method
CN103067298A (en) Network flow allocation method and system
CN112653623B (en) Relay protection service-oriented route distribution method and device
CN104410528A (en) Method for deploying minimum fault-tolerant coverage of controller based on software defined data center network
JP6389811B2 (en) Physical resource allocation device, physical resource allocation method, and program
CN106130895B (en) The heavy route method and device of SDN network failure

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