CN108011817A - A kind of method and system disposed again to power communication private network business route - Google Patents
A kind of method and system disposed again to power communication private network business route Download PDFInfo
- Publication number
- CN108011817A CN108011817A CN201711098343.6A CN201711098343A CN108011817A CN 108011817 A CN108011817 A CN 108011817A CN 201711098343 A CN201711098343 A CN 201711098343A CN 108011817 A CN108011817 A CN 108011817A
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/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 method disposed again is route to power communication private network business the invention discloses a kind of, the described method includes：Obtain the network topology structure of power communication private network business route；Collection of services, the corresponding business importance of each business, source point information, destination node information and the constrained vector of faulty link influence are obtained according to fault message；Business in the collection of services influenced on the faulty link carries out descending arrangement according to business importance；Data are initialized；The shortest path from source point to destination node is configured using improved dijkstra's algorithm, and determines new network topology structure；It is compared by cycle-index plus 1, and by the cycle-index and route threshold value；Determine the first shortest path and backup path, and calculate the route Intersection of each backup path and the first shortest path respectively；The corresponding route of each business is subjected to ascending order arrangement according to route Intersection；Determine the order in path, and service distribution is updated.
Description
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, the dual-route needs to be deployed for important services such as relay protection, stability control and the like which are easy to cause significant 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, route deployment algorithms in the existing electric power communication private network include an improved Dijkstra algorithm, a Floyd algorithm, a particle swarm algorithm and the like, wherein 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 that an alternative routing scheme cannot be provided for services with multiple constraints is caused.
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, it is necessary to simulate the routing of the private power communication network 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 redeploying a power communication private network traffic route, 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, performing descending order on the services in the service set influenced by the fault link according to the service importance degree;
step 4, setting a routing threshold value 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;
step 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 path i ', determining a new set of nodes V' = VU { V } 1 ',v 2 ',...v' l-1 H, connect node { v } i-1 ,v i Connect up v i And v 'of each node' i Connect, connect the arcs (v) i-1 ,v i ) Move to (v) i-1 ',v i ) And determining a new network topology.
Preferably, the calculating the route intersection degree of each backup path and the first shortest path includes:
D IR ＝D Intersection (AP∩BP i ),i＝1,2,...k-1，
wherein D is IR Is the route intersection degree; (AP. Andgate BP i ) 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:
wherein D is ARS The average risk degree of the whole network service is obtained; d ARS t The average risk degree corresponding to the node t; d ARS Iij Is a link l ij A corresponding average risk; n is a set of nodes t in the network topology structure; d t The 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; d Iij The 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; l ij For a link from node i to node j, l ij ∈L，i,j∈N；P t Is the failure probability of node t; i is m The importance of the mth service in the service set loaded on the node t is determined;is a link l ij The failure probability of (2); i is m Is a link l ij Importance 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:
wherein D is BRS The risk balance degree of the whole network service is obtained;represents a link l ij The risk level of (c); d t Is 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 sequencing the services in the service set influenced by the fault link in a descending order 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 path i ', determining a new set of nodes V' = VU { V } 1 ',v 2 ',...v' l-1 } node { v i-1 ,v i Connect v to each other i And v 'of each node' i Are connected to each other, arc (v) i-1 ,v i ) Move to (v) i-1 ',v i ) 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:
D IR ＝D Intersection (AP∩BP i ),i＝1,2,...k-1，
wherein D is IR Is the route intersection degree; (AP. Andgate BP i ) 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:
wherein D is ARS The average risk degree of the whole network service is obtained; d ARS t The average risk degree corresponding to the node t; d ARS Iij Is a link l ij The corresponding average risk; n is a set of nodes t in a network topology structure; d t The node risk degree refers to the influence degree of the node equipment failure on the service and the total of all service risk degrees borne by each nodeAnd; d Iij The 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; l ij For a link from node i to node j, l ij ∈L，i,j∈N；P t Is the failure probability of node t; I.C. A m The importance of the mth service in the service set loaded on the node t is determined;is a link l ij The failure probability of (2); i is m Is a link l ij Importance 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:
wherein D is BRS The risk balance degree of the whole network service is obtained;represents a link l ij The risk level of (c); d t Is the risk of node t.
The method and the system for redeploying the service route of the private power communication network firstly define the simulation scene and the simulation process of redeployment of the service of the private power communication network, and then find a plurality of shortest route groups meeting multiple constraints for a source node and a destination node in the 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.
Drawings
Exemplary embodiments of the invention may be more completely understood in consideration of the following drawings:
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
Example embodiments of the present invention will now be described with reference to the accompanying drawings, however, the invention may be embodied in many different forms and should not be construed as limited to the embodiments set forth herein, which are provided for a complete and complete disclosure of the invention and to fully convey the scope of the 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 process for redeploying 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 power communication network, which is disclosed by the embodiment of the invention, starts from step 101, and in step 101, a network topology structure of the service route of the private power communication network is obtained, and parameter data of the network topology structure is determined, wherein the parameter data comprises: 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 a network topological structure schematic diagram of a service route in the power communication network, and is an abstraction of a network physical structure; 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; l ij For a link from node i to node j, l ij ∈L,i,j∈N；D i The node risk degree refers to the total of the degree of influence of node equipment failure on the service and the risk degree of all services borne by each node. The calculation formula of the node risk degree is as follows:
wherein, P t Is the failure probability of node t, derived from the operation and maintenance data, I m The importance of the mth service in the service set carried by the node t can be set in the system.
The link risk degree refers to the influence degree of the service due to link failure, and is measured by a service risk value carried on each link. The calculation formula of the link risk degree is as follows:
wherein the content of the first and second substances,is a link l ij Failure probability by system acquisition, I m Is a link l ij Importance 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 phase realizes the service redeployment according to the routing method of the service redeployment aiming at the service carried 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 path i ', determine a new set of nodes V' = V utou { V } 1 ',v 2 ',...v' l-1 H, connect node { v } i-1 ,v i Connect up v i And each node v 'that is not on the shortest predecessor node' i Connect, connect the arcs (v) i-1 ,v i ) Move to (v) i-1 ',v i ) 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 backup paths, and the route intersection degree between each backup path and the first shortest path is calculated.
Preferably, the calculating the route intersection degree of each backup path and the first shortest path includes:
D IR ＝D Intersection (AP∩BP i ),i＝1,2,...k-1，
wherein D is IR Is the route intersection degree; (AP. Andgate BP i ) 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:
wherein D is ARS The average risk degree of the whole network service is obtained; d ARS t The average risk degree corresponding to the node t; d ARS Iij Is a link l ij The corresponding average risk; n being node t in the network topologyGathering; d t The node risk degree refers to the influence degree of the node equipment failure on the service and the sum of all service risk degrees borne by each node; d Iij The 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; l ij For a link from node i to node j, l ij ∈L，i,j∈N；P t Is the failure probability of node t; i is m The importance of the mth service in the service set carried on the node t is determined;is a link l ij The failure probability of (2); i is m Is a link l ij Importance 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:
wherein D is BRS The risk balance degree of the whole network service is obtained;represents a link l ij The risk level of (c); d t Is 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(D ARS ),min(D BRS )，
The constraint conditions are as follows:
wherein, min (D) in the objective function IR ),min(D ARS ),min(D BRS ) Respectively indicating that the intersection degree, the service average risk degree and the service risk balance degree of any two routes are minimum.
D ARS The Average Risk Degree and the link I corresponding to the node t are the Average Risk Degree (hierarchy on Average Risk of service) of the whole network service ij The corresponding average risk degree is composed of two parts, and the calculation formula is as follows:
D BRS for the Risk balance of the whole network service (aware on Balancing task of service), the calculation formula is:
wherein D is BRS The risk balance degree of the whole network service is obtained;represents a link l ij The risk level of (c); d t Is the risk of node t.
D IR The 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 BP 1 ，BP 2 ，...BP k-1 The calculation formula is D IR ＝D Intersection (AP∩BP i ),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, R i Is 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 network i )＝{w 1 (n i ),w 2 (n i ) The weight matrix W (l) of the link and the j )＝{w 1 (l j ),w 2 (l j )}；
Service distribution set S influenced by fault node on input network m And the corresponding constraint vector:
R(S m )＝{r 1 (S m ),r 2 (S m )}；
obtaining 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 conditions f )＝{r 1 (S f ),r 2 (S f )}；
Arranging the services in the Sf in a descending order according to the importance degree;
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 AP i (1 < i < l) establishing a backup node v i ', a new set of nodes V' = V U { V } V is generated 1 ',v 2 ',...v' l-1 Will node v i-1 ,v i Connect up v i And each node v 'is not on path p' i Connect, connect the arcs (v) i-1 ,v i ) Move to (v) i-1 ',v i ) Obtaining a new graph G';
in a new graph G', k = k +1 is set, if k is less than k0, the step of calling an improved Dijkstra algorithm to configure a first shortest path AP from a source point to a destination node is returned, the previous 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 sequence 1 ，BP 2 ...BP k-1 Calculating AP and BP k-1 The degree of intersection;
for service set S f Each 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 moment ARS Business risk balance degree D BRS And a delay value; according to the intersection degree, the shortest path length and the average risk degree D of the service ARS And business risk balance degree D BRS And determining an approximate optimal path scheme Pk1 and standby path schemes Pk2 and Pk3 \ 8230and Pkf in a time delay ascending order, outputting the Pk1 and updating 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 within [ 0.0001.001 ], the failure probability of the link is randomly generated within [ 0.001.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
Table 2 shortest path group information calculated using the modified KSP algorithm
Assuming that a l4 link in the network fails at a certain time, the traffic carried on the AP path is switched to the other shortest path according to the improved KSP algorithm, and the configuration result is shown in table 3.
Table 3 configuration results table
According to the importance of the service, 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 in the same way, so that 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 redeploying a service route of a private power communication network according to an embodiment of the present invention includes: a parameter data determining unit 301, a traffic aggregate data determining unit 302, a first ordering unit 303, a route threshold setting unit 304, a new network topology determining unit 305, a comparing unit 306, a route intersection calculating unit 307, a second ordering unit 308, and a path determining 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 path i ', determining a new set of nodes V' = VU { V } 1 ',v 2 ',...v' l-1 H, connect node { v } i-1 ,v i Connect v to each other i And v 'of each node' i Are connected to each other, arc (v) i-1 ,v i ) Move to (v) i-1 ',v i ) 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 degree between 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:
D IR ＝D Intersection (AP∩BP i ),i＝1,2,...k-1，
wherein D is IR Is the route intersection degree; (AP. Andgate BP i ) 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:
wherein D is ARS The average risk degree of the whole network service is obtained; d ARS t The average risk degree corresponding to the node t; d ARS Iij Is a link l ij A corresponding average risk; n is a set of nodes t in the network topology structure; d t The node risk degree refers to the influence degree of the node equipment failure on the service and the sum of all service risk degrees borne by each node; d Iij The 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; l ij For a link from node i to node j, l ij ∈L，i,j∈N；P t Is the failure probability of node t; i is m The importance of the mth service in the service set carried on the node t is determined;is a link l ij The failure probability of (2); i is m Is a link l ij Importance of the mth service in the service set carried by the user.
Preferably, the calculation formula of the risk balance of the network wide service is as follows:
wherein D is BRS The risk balance degree of the whole network service is obtained;represents a link l ij The risk level of (c); d t Is 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 (12)
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, 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, configuring the shortest path from a source point to a destination node by using an improved Dijkstra algorithm, 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, go to 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.
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 path i ', determining a set of new nodes V' = V { [ V ] V = V } 1 ',v 2 ',...v' l-1 } node { v i-1 ,v i Connect up v i And each node v 'that is not on the shortest predecessor node' i Connect, connect the arcs (v) i-1 ,v i ) Move to (v) i-1 ',v i ) And determining a new network topology.
4. The method of claim 1, wherein calculating the route intersection of each backup path and the first shortest path comprises:
D IR ＝D Intersection (AP∩BP i ),i＝1,2,...k-1，
wherein D is IR Is the route intersection degree; (AP. Andgate BP) i ) K is the number of the backup paths, and is the common node of the shortest path and the ith backup path.
5. The method of claim 1, wherein the average risk level 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:
wherein D is ARS The average risk degree of the whole network service is obtained; d ARS t The average risk degree corresponding to the node t; d ARS Iij Is a link l ij A corresponding average risk; n is a set of nodes t in the network topology structure; d t The 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; d Iij The link risk refers to the influence of link failure on the serviceThe degree, the sum of the service risk carried on each link; l is a set of links in the network topology; l ij For a link from node i to node j, l ij ∈L，i,j∈N；P t Is the failure probability of node t; i is m The importance of the mth service in the service set carried on the node t is determined;is a link l ij The failure probability of (2); I.C. A m Is a link l ij Importance of the mth service in the above loaded service set.
6. The method according to claim 5, wherein the calculation formula of the risk balance of the network-wide service is as follows:
wherein D is BRS The risk balance degree of the whole network service is obtained;represents a link l ij The risk level of (c); d t Is the risk of node t.
7. 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 degree calculation unit is used for setting the shortest path corresponding to the current fault route as a first shortest path, respectively taking the other acquired shortest paths as standby paths, and respectively calculating the route intersection degree of each standby path and the first shortest path;
the second sorting unit is used for sorting the routes corresponding to each service in an ascending order 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.
8. The system of claim 7, wherein the fault information comprises: failed node information and failed link information.
9. The system of claim 7, 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 path i ', determine a new set of nodes V' = V utou { V } 1 ',v 2 ',...v' l-1 } node { v i-1 ,v i Connect up v i Of the predecessor node and each node v 'that is not on the shortest path' i Connect, connect the arcs (v) i-1 ,v i ) Move to (v) i-1 ',v i ) And determining a new network topology.
10. The system according to claim 7, wherein the route intersection calculation unit calculates the route intersection of each backup path and the first shortest path, and includes:
D IR ＝D Intersection (AP∩BP i ),i＝1,2,...k-1，
wherein D is IR Is the route intersection degree; (AP. Andgate BP) i ) K is the number of the backup paths, and is the common node of the shortest path and the ith backup path.
11. The system of claim 7, wherein the network-wide traffic average risk 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:
wherein D is ARS The average risk degree of the whole network service is obtained; d ARS t The average risk degree corresponding to the node t is obtained; d ARS lij Is a link l ij A corresponding average risk; n is a set of nodes t in the network topology structure; d t The 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; d lij The 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; l. the ij For a link from node i to node j, l ij ∈L，i,j∈N；P t Is the failure probability of node t; I.C. A m The importance of the mth service in the service set carried on the node t is determined;is a link l ij The failure probability of (2); i is m Is a link l ij Importance of the mth service in the above loaded service set.
12. The system according to claim 11, wherein the calculation formula of the risk balance of the network-wide service is:
wherein D is BRS The risk balance of the whole network service is obtained;represents a link l ij The risk level of (a); d t Is the risk of node t.
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 true CN108011817A (en) | 2018-05-08 |
| CN108011817B 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) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108833271A (en) * | 2018-05-28 | 2018-11-16 | 全球能源互联网研究院有限公司 | A kind of power grid wide-area control service communication routing resource and server |
| CN109038794A (en) * | 2018-07-11 | 2018-12-18 | 中国电力科学研究院有限公司 | A kind of extra-high voltage grid system protection service path planing method towards QoS control |
| CN110177029A (en) * | 2019-05-30 | 2019-08-27 | 国网甘肃省电力公司经济技术研究院 | A kind of power telecom network service operation method for evaluating quality |
| CN110224930A (en) * | 2019-05-30 | 2019-09-10 | 国网福建省电力有限公司 | A kind of power telecom network service restoration method of logic-based cascading failure model |
| CN110719191A (en) * | 2019-08-30 | 2020-01-21 | 中国电力科学研究院有限公司 | Network reliability assessment method for secondary failure |
| CN110855352A (en) * | 2018-08-20 | 2020-02-28 | 中国移动通信集团广东有限公司 | Method and system for determining service influence of optical cable cutting and connecting |
| CN111343093A (en) * | 2020-02-28 | 2020-06-26 | 腾讯科技（深圳）有限公司 | Service data transmission method and device |
| CN111813883A (en) * | 2020-06-23 | 2020-10-23 | 上海阿尔卡特网络支援系统有限公司 | Shortest path query method and query system |
| CN112118176A (en) * | 2020-08-27 | 2020-12-22 | 国网内蒙古东部电力有限公司信息通信分公司 | Service reliability-oriented comprehensive data network channel routing load optimization method |
| CN112260946A (en) * | 2020-09-10 | 2021-01-22 | 视联动力信息技术股份有限公司 | Link fault processing method and device, terminal equipment and storage medium |
| CN112653623A (en) * | 2020-12-21 | 2021-04-13 | 国家电网有限公司信息通信分公司 | Relay protection service-oriented route distribution method and device |
| CN112702107A (en) * | 2020-12-21 | 2021-04-23 | 北京邮电大学 | Method and system for calculating backup route of satellite network based on betweenness centrality |
| CN113094115A (en) * | 2021-03-29 | 2021-07-09 | 联想(北京)有限公司 | Deployment strategy determining method, system and storage medium |
| CN113114514A (en) * | 2021-05-07 | 2021-07-13 | 广东电网有限责任公司电力调度控制中心 | Network resource backup method and system based on multi-attribute analytic hierarchy process |
| CN113225215A (en) * | 2021-05-19 | 2021-08-06 | 华北电力大学 | Method and system for identifying differentiated service network key link under SDN architecture |
| CN113225259A (en) * | 2021-04-13 | 2021-08-06 | 国家电网公司华北分部 | Communication network route planning method |
| CN114553767A (en) * | 2021-11-04 | 2022-05-27 | 国网浙江省电力有限公司湖州供电公司 | Rerouting technology for survivability of power communication network |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100157794A1 (en) * | 2006-11-02 | 2010-06-24 | Eci Telecom Ltd. | Method for finding protected path in mesh networks |
| CN103281245A (en) * | 2013-04-26 | 2013-09-04 | 广东电网公司电力调度控制中心 | Method and device for determining routing path of service |
| US20130339545A1 (en) * | 2011-02-24 | 2013-12-19 | The University Of Tulsa | Network-based hyperspeed communication and defense |
| CN105429894A (en) * | 2015-11-30 | 2016-03-23 | 国网冀北电力有限公司信息通信分公司 | Service route selection method and device in electric power communication network |
| CN105634954A (en) * | 2016-01-08 | 2016-06-01 | 烽火通信科技股份有限公司 | Shortest path calculation method by considering light damage based on WSON |
| CN106209618A (en) * | 2016-07-27 | 2016-12-07 | 国网辽宁省电力有限公司 | A kind of communication mixed networking method and system improving intelligence adapted electric energy effect |
| CN106549779A (en) * | 2015-09-18 | 2017-03-29 | 中国电力科学研究院 | A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service |
| CN106789646A (en) * | 2016-12-09 | 2017-05-31 | 国网北京市电力公司 | Service transmission path determines method and device |
-
2017
- 2017-11-09 CN CN201711098343.6A patent/CN108011817B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100157794A1 (en) * | 2006-11-02 | 2010-06-24 | Eci Telecom Ltd. | Method for finding protected path in mesh networks |
| US20130339545A1 (en) * | 2011-02-24 | 2013-12-19 | The University Of Tulsa | Network-based hyperspeed communication and defense |
| CN103281245A (en) * | 2013-04-26 | 2013-09-04 | 广东电网公司电力调度控制中心 | Method and device for determining routing path of service |
| CN106549779A (en) * | 2015-09-18 | 2017-03-29 | 中国电力科学研究院 | A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service |
| CN105429894A (en) * | 2015-11-30 | 2016-03-23 | 国网冀北电力有限公司信息通信分公司 | Service route selection method and device in electric power communication network |
| CN105634954A (en) * | 2016-01-08 | 2016-06-01 | 烽火通信科技股份有限公司 | Shortest path calculation method by considering light damage based on WSON |
| CN106209618A (en) * | 2016-07-27 | 2016-12-07 | 国网辽宁省电力有限公司 | A kind of communication mixed networking method and system improving intelligence adapted electric energy effect |
| CN106789646A (en) * | 2016-12-09 | 2017-05-31 | 国网北京市电力公司 | Service transmission path determines method and device |
Non-Patent Citations (1)
| Title |
|---|
| 陈冉: "电力通信网路由配置策略及算法研究", 《中国优秀硕士学位论文全文数据库工程科技II辑》 * |
Cited By (27)
| 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 |
| CN108833271A (en) * | 2018-05-28 | 2018-11-16 | 全球能源互联网研究院有限公司 | A kind of power grid wide-area control service communication routing resource and server |
| CN109038794A (en) * | 2018-07-11 | 2018-12-18 | 中国电力科学研究院有限公司 | A kind of extra-high voltage grid system protection service path planing method towards QoS control |
| CN109038794B (en) * | 2018-07-11 | 2021-09-17 | 中国电力科学研究院有限公司 | QoS control-oriented extra-high voltage power grid system protection service path planning method |
| CN110855352A (en) * | 2018-08-20 | 2020-02-28 | 中国移动通信集团广东有限公司 | Method and system for determining service influence of optical cable cutting and connecting |
| CN110177029A (en) * | 2019-05-30 | 2019-08-27 | 国网甘肃省电力公司经济技术研究院 | A kind of power telecom network service operation method for evaluating quality |
| CN110224930A (en) * | 2019-05-30 | 2019-09-10 | 国网福建省电力有限公司 | A kind of power telecom network service restoration method of logic-based cascading failure model |
| CN110177029B (en) * | 2019-05-30 | 2022-05-27 | 国网甘肃省电力公司经济技术研究院 | Power communication network service operation quality evaluation method |
| CN110719191A (en) * | 2019-08-30 | 2020-01-21 | 中国电力科学研究院有限公司 | Network reliability assessment method for secondary failure |
| CN111343093A (en) * | 2020-02-28 | 2020-06-26 | 腾讯科技（深圳）有限公司 | Service data transmission method and device |
| CN111343093B (en) * | 2020-02-28 | 2021-07-09 | 腾讯科技（深圳）有限公司 | Service data transmission method and device |
| CN111813883A (en) * | 2020-06-23 | 2020-10-23 | 上海阿尔卡特网络支援系统有限公司 | Shortest path query method and query system |
| CN111813883B (en) * | 2020-06-23 | 2024-05-28 | 上海阿尔卡特网络支援系统有限公司 | Shortest path query method and query system |
| CN112118176A (en) * | 2020-08-27 | 2020-12-22 | 国网内蒙古东部电力有限公司信息通信分公司 | Service reliability-oriented comprehensive data network channel routing load optimization method |
| CN112260946A (en) * | 2020-09-10 | 2021-01-22 | 视联动力信息技术股份有限公司 | Link fault processing method and device, terminal equipment and storage medium |
| CN112260946B (en) * | 2020-09-10 | 2024-03-19 | 视联动力信息技术股份有限公司 | Link failure processing method and device, terminal equipment and storage medium |
| CN112653623A (en) * | 2020-12-21 | 2021-04-13 | 国家电网有限公司信息通信分公司 | Relay protection service-oriented route distribution method and device |
| CN112702107A (en) * | 2020-12-21 | 2021-04-23 | 北京邮电大学 | Method and system for calculating backup route of satellite network based on betweenness centrality |
| CN112653623B (en) * | 2020-12-21 | 2023-03-14 | 国家电网有限公司信息通信分公司 | Relay protection service-oriented route distribution method and device |
| CN113094115A (en) * | 2021-03-29 | 2021-07-09 | 联想(北京)有限公司 | Deployment strategy determining method, system and storage medium |
| 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 |
| CN113225259A (en) * | 2021-04-13 | 2021-08-06 | 国家电网公司华北分部 | Communication network route planning method |
| CN113114514A (en) * | 2021-05-07 | 2021-07-13 | 广东电网有限责任公司电力调度控制中心 | 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 |
| CN113225215A (en) * | 2021-05-19 | 2021-08-06 | 华北电力大学 | 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108011817B (en) | 2020-11-17 |
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 | |
| JP2014526190A (en) | Self-healing recognizable hybrid design of controller-switch connectivity in split architecture system | |
| CN111565146B (en) | Network topology aware power communication network link fault recovery method | |
| WO2016153506A1 (en) | Fast failover recovery in software defined networks | |
| CN112543151B (en) | SDN controller deployment method and device, electronic equipment and storage medium | |
| JP2019514309A (en) | System and method for communication network service connectivity | |
| Ciavarella et al. | Progressive damage assessment and network recovery after massive failures | |
| Benyamina et al. | On the design of reliable wireless mesh network infrastructure with QoS constraints | |
| Al-Rumaih et al. | Spare capacity planning for survivable mesh networks | |
| CN103067298A (en) | Network flow allocation method and system | |
| CN111800352A (en) | Service function chain deployment method and storage medium based on load balancing | |
| CN112653623B (en) | Relay protection service-oriented route distribution method and device | |
| CN106130895B (en) | The heavy route method and device of SDN network failure | |
| CN114257510A (en) | Network function chain optimization method for multicast routing | |
| Pereira et al. | Comparison of single and multi-objective evolutionary algorithms for robust link-state routing | |
| Booker et al. | Efficient availability evaluation for transport backbone networks | |
| Wang et al. | Alternate routing optimization method for power communication network | |
| CN112187657B (en) | Extensible routing method for realizing load balancing in software defined wide area network | |
| Ho et al. | Using local search for traffic engineering in switched ethernet networks | |
| US7924729B2 (en) | Determining a minimum cost solution for resolving covering-by-pairs problem |
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 |