CN109768924B - SDN network multilink fault recovery method and system oriented to multi-stream coexistence - Google Patents
SDN network multilink fault recovery method and system oriented to multi-stream coexistence Download PDFInfo
- Publication number
- CN109768924B CN109768924B CN201910114617.9A CN201910114617A CN109768924B CN 109768924 B CN109768924 B CN 109768924B CN 201910114617 A CN201910114617 A CN 201910114617A CN 109768924 B CN109768924 B CN 109768924B
- Authority
- CN
- China
- Prior art keywords
- link
- path
- flow
- network
- fault
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Abstract
The invention relates to a multi-stream coexistence-oriented SDN network multi-link fault recovery method and a multi-stream coexistence-oriented SDN network multi-link fault recovery system, wherein the method comprises the following steps: when a link fault occurs in the SDN network, acquiring the starting point and the end point of all fault links and the original paths and bandwidth requirements of all interrupted data streams, updating the network topology and calculating the available bandwidth of the current normal link; calculating a reroute path for the interrupted data stream based on the current network topology and available bandwidth; and generating a flow table entry according to the rerouting path, installing the flow table entry into a corresponding switch, and completing rerouting of the interrupted data flow. The method is suitable for a scene that a plurality of links have faults and each fault link has a plurality of data flows, aims at minimizing the communication cost of the controller and the switch, and realizes quick recovery of the faults by decomposing the original optimization problem into a plurality of sub-problems which can be executed in parallel, thereby reducing the installation cost of flow table items, shortening the service interruption time, ensuring the continuity of the data flows and improving the performance of the SDN.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a multi-stream coexistence-oriented SDN network multi-link fault recovery method and system.
Background
An SDN (Software Defined Network) is a novel Network architecture model, and its main characteristic is that a control function is separated from a forwarding function, and the control function in a conventional Network device is decoupled to form a centralized control plane. The SDN network has the characteristics of acquiring network topology in real time and monitoring network state, and can perform complex and fine control on network routing.
Link failure is a problem often encountered in networks, with a probability of 30% occurring within a year. When a link fails in a conventional network, a router reconstructs a routing path according to a normal network topology and updates a routing table, while a fault recovery strategy is performed by a controller in an SDN network, and two methods exist for fault recovery of the current SDN network: a backup mechanism and a restore mechanism.
A backup mechanism, i.e. a network administrator specifies which links are failure prone links, when a new flow arrives in the network and the flow routes through the failed link, two paths are calculated by the controller for the flow: one working path and one backup path, and then installing flow tables corresponding to the two paths on corresponding switches. When a link fails and a working path fails, the switch quickly starts a backup path flow rule installed on the switch, the method saves information interaction between the controller and the switch, can realize quick recovery of the failure, but needs to store a standby flow table item on the switch, and can bring more switch storage resource overhead.
The recovery mechanism is that when the controller monitors that a link fails, the controller recalculates an alternative path for the failed link, then generates a flow rule of the alternative path and installs the flow rule on a corresponding switch, and reroutes the flow to the alternative path, and the process involves information interaction between the controller and the switch, and generates more recovery time compared with a backup mechanism. However, even if the backup paths of a large number of data streams may collide in a network having existing backup paths, the backup paths may fail, and thus it is a very important problem to promptly and quickly restore the network to a normal state.
Most of the existing solutions for recovering the SDN network link failure are directed at a single link failure scene, and the method is that a shortest path between a starting point and an end point of a failure link is selected or all paths between the two points are selected and an optimized path is selected from the paths; research on multiple link failures is also limited to scenarios where only one data stream is interrupted. The existing method is only suitable for small networks or simple single link failures, a scene that multiple link failures are considered and multiple interrupted data streams exist is not seen, the current situation is far away from a real network environment, and the rapid recovery of the multiple link failures cannot be realized when multiple streams coexist.
Disclosure of Invention
In view of the above technical problems, the present invention provides a multi-stream coexistence-oriented method and system for recovering a multi-link failure in an SDN network.
The technical scheme for solving the technical problems is as follows: a multi-flow coexistence-oriented SDN network multi-link fault recovery method comprises the following steps:
step 1, when a link fault of the SDN network is monitored, acquiring starting points and end points of all fault links and original paths and bandwidth requirements of all interrupted data streams, updating network topology and calculating available bandwidth of a current normal link;
step 2, calculating a rerouting path for the interrupted data stream based on the current network topology and the available bandwidth, wherein in the calculation process, the minimum number of installed flow table entries is used as an objective function, a source point and a destination point of an original path of the interrupted data stream are respectively used as a starting point and an end point of the rerouting path, the starting point of the rerouting path is only outflow traffic, the end point is only inflow traffic, an intermediate node meets traffic conservation as an equality constraint condition, and the bandwidth requirement of the rerouting path is smaller than the available bandwidth of the current normal link as an inequality constraint condition;
and 3, generating a flow table entry according to the rerouting path, and installing the flow table entry into a corresponding switch to complete rerouting of the interrupted data flow.
In order to achieve the above object, the present invention further provides a system for recovering multilink faults of an SDN network oriented to multi-stream coexistence, including:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring the starting points and the end points of all fault links and the bandwidth requirements of original paths and reroute paths of all interrupted data streams when the situation that a link fault occurs in the SDN network is monitored, updating the network topology and calculating the available bandwidth of the current normal link;
a generating module, configured to calculate a rerouting path for the interrupted data stream based on the current network topology and the available bandwidth, where in the calculation process, a minimum number of installed flow table entries is used as an objective function, a source point and a destination point of an original path of the interrupted data stream are respectively used as a start point and an end point of the rerouting path, an origin point and an end point of the rerouting path are only outflow traffic and only inflow traffic, an intermediate node satisfies traffic conservation as an equality constraint condition, and a bandwidth requirement of the rerouting path is smaller than an available bandwidth of the current normal link as an inequality constraint condition;
and the installation module is used for generating a flow table entry according to the rerouting path, installing the flow table entry into a corresponding switch and completing rerouting of the interrupted data flow.
The invention has the beneficial effects that: the communication cost between the controller and the switch is minimized, namely the minimum number of the installed flow table entries is taken as an optimization target, the rerouting path of the affected flow is generated by solving a planning problem, the installation cost of the flow table entries can be greatly reduced, the service interruption time is shortened, the continuity of the data flow is ensured, and the performance of the SDN network is improved, wherein the planning problem takes the condition that the flow demand of the recovery path of all the flows is smaller than the current available bandwidth as a constraint condition, and the condition that the link congestion still exists in the recovered path is avoided. The method is suitable for a scene that multiple links in the SDN network have faults and multiple data streams pass through each fault link, and is closer to a real SDN network environment.
Drawings
Fig. 1 is a flowchart of a multi-flow coexistence-oriented method for recovering a multi-link failure in an SDN network according to an embodiment of the present invention;
figure 2 is a SDN network architecture diagram;
fig. 3 is a detailed flowchart of step S2 in the method for recovering multilink failure of an SDN network oriented to multiflow coexistence according to the embodiment of the present invention;
fig. 4 is an architecture diagram of an SDN network multilink failure recovery system oriented to multi-flow coexistence according to an embodiment of the present invention.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth by way of illustration only and are not intended to limit the scope of the invention.
Fig. 1 is a flowchart of a multi-flow coexistence-oriented method for recovering a multi-link failure in an SDN network according to an embodiment of the present invention, as shown in fig. 1, the method includes:
s1, when a link fault of the SDN network is monitored, acquiring the starting point and the end point of all fault links and the original paths and bandwidth requirements of all interrupted data streams, updating the network topology and calculating the available bandwidth of the current normal link;
specifically, as shown in fig. 2, the SDN network architecture diagram includes two parts, namely, an underlying device and a controller. The bottom layer equipment needs to support an Openflow protocol, when the switch receives a data packet, if no flow table or no flow table matching item exists in the switch, the data packet is sent to the controller for processing through a packet _ in message, the controller issues the flow table to the switch after making a corresponding decision, the routing of the data flow is completed, the controller is the core of the structure, and the southbound interface interacts with the switch through the Openflow protocol.
Based on the framework, the SDN controller acquires network topology, forwards data flow reaching the network according to a configured routing algorithm, and periodically monitors the network state; once a link failure occurs, the controller obtains information of the failed link and the affected flow, including a source point, a destination point, a sending rate and an original routing path, updates the network topology and calculates the available bandwidth of the current link.
The SDN controller acquires global network topology information by using an LLDP protocol, monitors the port state of the switch, and prompts the port of the switch to be in fault when the port state of the switch is changed from up to down, so that a link connected with the switch is in fault. And meanwhile, packet-out messages of the LLDP packet are periodically sent, and the state of the switch is monitored according to the fed back packet-in messages.
The current available bandwidth is calculated using the following method: and the controller sends FlowStatsreq message to inquire the number of bytes in a port counter of the switch in a time period T, and then calculates the used bandwidth B (T) of the link at the time T according to the change of the number of bytes of the port counter in one period.
The available bandwidth is equal to ab (t) AWB-b (t), where AWB represents the fixed total bandwidth of the link.
S2, calculating a rerouting path for the interrupted data stream based on the current network topology and the available bandwidth, where in the calculation process, a minimum number of installed flow table entries is used as an objective function, a source point and a destination point of an original path of the interrupted data stream are respectively used as a start point and an end point of the rerouting path, a start point of the rerouting path only has outgoing traffic, an end point only has incoming traffic, an intermediate node satisfies traffic conservation as an equality constraint, and a bandwidth requirement of the rerouting path is smaller than an available bandwidth of the current normal link as an inequality constraint;
this step can be transformed according to the following derivation steps:
1) modeling the problem of rapid recovery of multilink faults of the SDN network with coexisting multi-streams, which is to be solved by the invention, and forming a 0-1 nonlinear programming problem by taking the minimized communication cost between a controller and a switch as a target function, namely the minimum number of installed flow table entries, taking the flow conservation of a rerouting path as an equality constraint condition, and taking the bandwidth requirement of the rerouting path smaller than the available bandwidth of the current SDN network and an original path as an inequality constraint condition;
specifically, assume that a network topology of the SDN network is denoted as G ═ V, E, where V denotes a set of nodes in the network and E denotes a set of links in the network; a link in the network is represented by (i, j), where i is the start of the link, j is the end of the link, and the currently available bandwidth of each link (i, j) is ABijSetting the set of failed links as L, E \ L represents the link set obtained after deleting the failed links in the network topology as the updated network topology, the set of interrupted data flows F on all the failed links is F, the number of the interrupted data flows F is m, and the bandwidth requirement of the flow F belonging to the F is RfThe source and destination points of flow f are(s) respectivelyf,df) (ii) a Order to
Indicates whether the original path of the flow F e F passes through the link (i, j), wherein
Representing the original path of flow f through link (i, j),
the original path representing flow f does not pass through link (i, j); order to
Indicates whether the rerouted path for flow F e F traverses a link (i,j) wherein
The rerouted path representing flow f passes through link (i, j),
the rerouted path representing flow f does not traverse link (i, j);
the mathematical model was constructed as follows:
wherein, (1) is equality constraint condition, and (2) is inequality constraint condition.
In the above model, the optimization objective represents communication cost between the controller and the switch, because the most important cost in the SDN network failure recovery process is the communication overhead brought by deletion and addition of the flow table to the controller and the switch, and the controller completes deletion or addition of one link by issuing one flow table to the corresponding switch, the change from the original path to the recovery path of all flows, that is, the sum of the number of links is not repeated, and represents the number of all flow entries that need to be deleted or added.
Constraint (1) means that the source point and the destination point of the flow f are used as the starting point and the end point of the search restoration path, for the restoration path of the flow f, only outflow flow exists at the starting point, only inflow flow exists at the end point, and the intermediate node meets the flow conservation. Constraint (2) indicates that the occupied resources of all restoration paths of the flow F e F on each link must be smaller than the available bandwidth of the current link, so as to avoid network congestion caused by the restoration paths.
2) And equivalently converting the 0-1 nonlinear programming problem into a 0-1 linear programming model without the absolute value function by utilizing the 0-1 characteristic of the problem variable and combining the property of the absolute value function.
The method comprises the following specific steps:
3) and (3) relaxing coupling constraint of occupied bandwidth among multiple streams into an objective function by applying a Lagrange relaxation method for decoupling, decomposing the original problem into a plurality of subproblems, wherein each subproblem is a 0-1 linear programming problem and represents a quick recovery problem of a plurality of link faults on a single flow path.
Relaxing the constraint (2) in the original model, defining the Lagrange multiplier as omegaijThe following lagrangian relaxation function is available:
decomposing G (y, ω), for each stream f the sub-problem can be found as:
s.t. (1),(3)
wherein ω isijIt can be understood as a congestion metric on the link (i, j) for describing the occupation of the bandwidth resources on the link (i, j), and a sub-gradient algorithm, ωijThis update can be done using the following equation:
(7) in the formula, k is the number of iterations,
and
representing the values of the lagrangian multipliers for the (k + 1) th and k-th iterations respectively,
denotes G (y, ω) is in
Sub-gradient of points, αkDenotes the step factor, α, at the kth iteration in the direction of the sub-gradientkMust satisfy the conditions: alpha is alphak≥0,
And
three conditions, this embodiment is to
For the sub-problem (6) described above,
is a known variable, therefore, problem (6) is equivalent to the following optimization problem (8):
s.t. (1),(3)
4) and constructing a brand new network topology and link weight according to the constraint conditions of the subproblems, and solving the subproblems by adopting a classical shortest path algorithm.
For the model (8), a classical algorithm for solving the shortest path, Dijkstra, can be used for solving. And constructing a new network topology, wherein E 'is E \ L, E represents the original network topology, L represents a fault link set, and E' represents a link set obtained after the fault link is deleted in the original network topology. Then, the model (8) is equivalent to when the network topology is E', the link weights are
Time, source point sfTo a destination point dfThe shortest path problem of (2).
5) Calculating a convergence condition, and if the iteration is converged, obtaining a final result; otherwise, updating the Lagrange multiplier and jumping to the step 3); the convergence condition refers to the absence of congested links in the rerouted paths of all flows. In this embodiment, that is, determining whether the conditions are satisfied
Combining the derivation processes of steps 1) to 5), step S2 may be performed according to the following steps:
s2.1, converting the target function and the inequality constraint condition to obtain a converted target function H:
wherein the content of the first and second substances,
lagrange multiplier omegaijIs 0, the converted objective function H and the equality constraint are equivalent to a link weight equal to
Is shortestA path problem;
adopting a shortest path algorithm to solve the converted objective function H in parallel to obtain the shortest path of each interrupted data stream f;
s2.2, judging whether the shortest paths of all the interrupted data flows f meet the condition
If yes, taking the shortest path as a rerouting path of the interrupted data flow f, otherwise, entering the next step;
s2.3, updating omega by adopting a sub-gradient algorithmijReturn to step S2.1.
A detailed flowchart of step S2 is shown in fig. 3.
S3, generating a flow table item according to the rerouting path, and installing the flow table item to a corresponding switch to complete the rerouting of the interrupted data flow.
The embodiment of the invention provides a multi-flow coexistence-oriented SDN network multi-link fault recovery method, which aims to minimize the communication cost between a controller and a switch, namely the minimum number of installed flow table entries, and generates a rerouting path of an affected flow by solving a planning problem, so that the installation cost of the flow table entries can be greatly reduced, the service interruption time is shortened, the continuity of data flows is ensured, and the performance of the SDN network is improved. The method is suitable for a scene that multiple links in the SDN network have faults and multiple data streams pass through each fault link, and is closer to a real SDN network environment.
An embodiment of the present invention provides a system for recovering a multilink fault of an SDN network oriented to multi-stream coexistence, as shown in fig. 4, the system includes:
the system comprises an acquisition module, a data flow calculation module and a data flow calculation module, wherein the acquisition module is used for acquiring the starting points and the end points of all fault links and the bandwidth requirements of source points, destination points and rerouting paths of all interrupted data flows when the situation that a link fault occurs in the SDN network is monitored, updating the network topology and calculating the available bandwidth of the current normal link;
a generating module, configured to calculate a rerouting path for the interrupted data stream based on the current network topology and the available bandwidth, where in the calculation process, a minimum number of installed flow table entries is used as an objective function, a source point and a destination point of the interrupted data stream are respectively used as a start point and an end point of the rerouting path, a start point of the rerouting path is only outflow traffic, an end point of the rerouting path is only inflow traffic, an intermediate node satisfies a traffic conservation equality constraint condition, and a bandwidth requirement of the rerouting path is smaller than an available bandwidth of the current normal link, which is an inequality constraint condition;
and the installation module is used for generating a flow table entry according to the rerouting path, installing the flow table entry into a corresponding switch and completing rerouting of the interrupted data flow.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (6)
1. A multi-stream coexistence-oriented SDN network multi-link fault recovery method is characterized by comprising the following steps:
step 1, when a link fault of the SDN network is monitored, acquiring starting points and end points of all fault links and original paths and bandwidth requirements of all interrupted data streams, updating network topology and calculating available bandwidth of a current normal link;
step 2, calculating a rerouting path for the interrupted data stream based on the current network topology and the available bandwidth, wherein in the calculation process, the minimum number of installed flow table entries is used as an objective function, a source point and a destination point of an original path of the interrupted data stream are respectively used as a starting point and an end point of the rerouting path, the starting point of the rerouting path is only outflow traffic, the end point is only inflow traffic, an intermediate node meets traffic conservation as an equality constraint condition, and the bandwidth requirement of the rerouting path is smaller than the available bandwidth of the current normal link as an inequality constraint condition;
step 3, generating a flow table item according to the rerouting path, and installing the flow table item to a corresponding switch to complete rerouting of the interrupted data flow;
the step of updating the network topology comprises: taking a link set obtained after the fault link is deleted in the network topology as an updated network topology;
a network topology of the SDN network is denoted G ═ V, E, where V denotes a set of nodes in the network and E denotes a set of links in the network; a link in the network is represented by (i, j), wherein i is the starting point of the link, and j is the end point of the link;
the objective function is:
wherein, L is the link set with fault, E \ L represents the link set obtained after deleting the fault link in the network topology, F is the set of the interrupted data flow F on all the fault links,
indicates whether the original path of the flow F e F passes through the link (i, j), wherein
Representing the original path of flow f through link (i, j),
the original path representing flow f does not pass through link (i, j); order to
Indicating whether the rerouted path of flow F ∈ F passes through link (i, j), where
The rerouted path representing flow f passes through link (i, j),
the rerouted path representing flow f does not traverse link (i, j);
the equality constraint is:
wherein(s)f,df) Respectively the source point and the destination point of the flow f;
the inequality constraint conditions are as follows:
wherein, ABijFor each link (i, j) the currently available bandwidth, RfThe bandwidth requirement of F is left to flow F.
2. The method according to claim 1, wherein the step 2 specifically comprises:
step 2.1, converting the objective function and the inequality constraint condition to obtain a converted objective function H:
wherein the content of the first and second substances,
lagrange multiplier omegaijIs 0, the converted objective function H and the equality constraint are equivalent to a link weight equal to
The shortest path problem of (2);
adopting a shortest path algorithm to solve the converted objective function H in parallel to obtain the shortest path of each interrupted data stream f;
step 2.2, judge whether the shortest path of all interrupted data flow f meets the condition
If yes, taking the shortest path as a rerouting path of the interrupted data flow f, otherwise, entering the next step;
step 2.3, updating omega by adopting a sub-gradient algorithmijAnd returning to the step 2.1.
3. The method according to claim 2, characterized in that said step 2.3 comprises in particular: update omega using the following equationij：
Wherein k is the number of iterations,
and
values of Lagrangian multipliers, α, representing the k +1 and k iterations, respectivelykDenotes the step factor, α, at the kth iteration in the direction of the sub-gradientkThe following three conditions are satisfied:
αk≥0,
and
4. a multi-flow coexistence-oriented SDN network multilink failure recovery system, comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring the starting points and the end points of all fault links and the bandwidth requirements of original paths and reroute paths of all interrupted data streams when the situation that a link fault occurs in the SDN network is monitored, updating the network topology and calculating the available bandwidth of the current normal link;
a generating module, configured to calculate a rerouting path for the interrupted data stream based on the current network topology and the available bandwidth, where in the calculation process, a minimum number of installed flow table entries is used as an objective function, a source point and a destination point of an original path of the interrupted data stream are respectively used as a start point and an end point of the rerouting path, an origin point and an end point of the rerouting path are only outflow traffic and only inflow traffic, an intermediate node satisfies traffic conservation as an equality constraint condition, and a bandwidth requirement of the rerouting path is smaller than an available bandwidth of the current normal link as an inequality constraint condition;
an installation module, configured to generate a flow entry according to the rerouting path, and install the flow entry into a corresponding switch, so as to complete rerouting of the interrupted data flow;
the acquisition module is specifically configured to use a link set obtained after the faulty link is deleted from the network topology as an updated network topology;
a network topology of the SDN network is denoted G ═ V, E, where V denotes a set of nodes in the network and E denotes a set of links in the network; a link in the network is represented by (i, j), wherein i is the starting point of the link, and j is the end point of the link;
the objective function is:
wherein, L is the link set with fault, E \ L represents the link set obtained after deleting the fault link in the network topology, F is the set of the interrupted data flow F on all the fault links,
indicates whether the original path of the flow F e F passes through the link (i, j), wherein
Representing the original path of flow f through link (i, j),
the original path representing flow f does not pass through link (i, j); order to
Indicating whether the rerouted path of flow F ∈ F passes through link (i, j), where
The rerouted path representing flow f passes through link (i, j),
the rerouted path representing flow f does not traverse link (i, j);
the equality constraint is:
wherein(s)f,df) Respectively the source point and the destination point of the flow f;
the inequality constraint conditions are as follows:
wherein, ABijFor each link (i, j) the currently available bandwidth, RfThe bandwidth requirement of F is left to flow F.
5. The system of claim 4, wherein the generating module specifically comprises:
a solving unit, configured to convert the objective function and the inequality constraint condition to obtain a converted objective function H:
wherein the content of the first and second substances,
lagrange multiplier omegaijIs 0, the converted objective function H and the equality constraint are equivalent to a link weight equal to
The shortest path problem of (2);
adopting a shortest path algorithm to solve the converted objective function H in parallel to obtain the shortest path of each interrupted data stream f;
a judging unit for judging whether the shortest path of all the interrupted data flow f satisfies the condition
If yes, taking the shortest path as a rerouting path of the interrupted data flow f;
an update unit for updating the dataThe judging unit judges that the shortest paths of all the interrupted data streams f do not meet the condition
Then, the sub-gradient algorithm is adopted to update omegaij。
6. The system according to claim 5, wherein the updating unit is specifically configured to: update omega using the following equationij：
Wherein k is the number of iterations,
and
values of Lagrangian multipliers, α, representing the k +1 and k iterations, respectivelykDenotes the step factor, α, at the kth iteration in the direction of the sub-gradientkThe following three conditions are satisfied:
αk≥0,
and
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910114617.9A CN109768924B (en) | 2019-02-14 | 2019-02-14 | SDN network multilink fault recovery method and system oriented to multi-stream coexistence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910114617.9A CN109768924B (en) | 2019-02-14 | 2019-02-14 | SDN network multilink fault recovery method and system oriented to multi-stream coexistence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109768924A CN109768924A (en) | 2019-05-17 |
| CN109768924B true CN109768924B (en) | 2021-06-08 |
Family
ID=66456128
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910114617.9A Active CN109768924B (en) | 2019-02-14 | 2019-02-14 | SDN network multilink fault recovery method and system oriented to multi-stream coexistence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109768924B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112039764B (en) * | 2019-06-03 | 2022-12-09 | 中兴通讯股份有限公司 | Method and device for realizing rerouting |
| CN110247862B (en) * | 2019-06-14 | 2021-03-23 | 西安电子科技大学 | SDN cluster fault-time service rapid and continuous switching system and method |
| US11243882B2 (en) | 2020-04-15 | 2022-02-08 | International Business Machines Corporation | In-array linked list identifier pool scheme |
| CN113556281A (en) * | 2020-04-23 | 2021-10-26 | 中兴通讯股份有限公司 | Rerouting method and device, electronic equipment and computer readable medium |
| CN111857691B (en) * | 2020-07-28 | 2021-07-23 | 北京航空航天大学 | Software architecture recovery method and device |
| CN112887202B (en) * | 2021-02-02 | 2022-05-27 | 浙江工商大学 | SDN link fault network convergence method based on sub-topology network |
| CN113055084B (en) * | 2021-03-19 | 2022-04-26 | 烽火通信科技股份有限公司 | Method and system for recovering optical network service fault |
| CN113556262B (en) * | 2021-06-16 | 2022-06-24 | 中国船舶重工集团公司第七0九研究所 | Fault diagnosis method and system for two-layer network path abnormity |
| CN115242806B (en) * | 2022-06-14 | 2023-09-29 | 山东省计算中心（国家超级计算济南中心） | Method and device for backing up data of supercomputing center in supercomputing internet |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104579977A (en) * | 2014-12-23 | 2015-04-29 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Bandwidth constraint multipath routing method and system for SDN controller |
| CN105337861A (en) * | 2015-11-18 | 2016-02-17 | 东北大学 | Routing method based on energy efficiency priority and cognitive theory |
| CN105897584A (en) * | 2014-06-09 | 2016-08-24 | 华为技术有限公司 | Route planning method and controller |
| CN106165356A (en) * | 2014-02-13 | 2016-11-23 | 洛克波特网络股份有限公司 | The method of routing packets in distributed direct interference networks |
| CN106230722A (en) * | 2016-08-05 | 2016-12-14 | 山东省计算中心（国家超级计算济南中心） | SDN congestion link method of adjustment based on transfer value |
| CN106506353A (en) * | 2016-10-27 | 2017-03-15 | 吉林大学 | Virtual network single link failure restoration methods and system based on SDN |
| CN107196854A (en) * | 2017-06-20 | 2017-09-22 | 西安交通大学 | Datum plane abnormality eliminating method in a kind of software defined network |
| CN107302496A (en) * | 2017-05-26 | 2017-10-27 | 重庆邮电大学 | A kind of software defined network link failure recovery method based on band control |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9699116B2 (en) * | 2015-01-26 | 2017-07-04 | Telefonaktiebolaget L M Ericsson (Publ) | SDN based interdomain and intradomain traffic engineering |
-
2019
- 2019-02-14 CN CN201910114617.9A patent/CN109768924B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106165356A (en) * | 2014-02-13 | 2016-11-23 | 洛克波特网络股份有限公司 | The method of routing packets in distributed direct interference networks |
| CN105897584A (en) * | 2014-06-09 | 2016-08-24 | 华为技术有限公司 | Route planning method and controller |
| CN104579977A (en) * | 2014-12-23 | 2015-04-29 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Bandwidth constraint multipath routing method and system for SDN controller |
| CN105337861A (en) * | 2015-11-18 | 2016-02-17 | 东北大学 | Routing method based on energy efficiency priority and cognitive theory |
| CN106230722A (en) * | 2016-08-05 | 2016-12-14 | 山东省计算中心（国家超级计算济南中心） | SDN congestion link method of adjustment based on transfer value |
| CN106506353A (en) * | 2016-10-27 | 2017-03-15 | 吉林大学 | Virtual network single link failure restoration methods and system based on SDN |
| CN107302496A (en) * | 2017-05-26 | 2017-10-27 | 重庆邮电大学 | A kind of software defined network link failure recovery method based on band control |
| CN107196854A (en) * | 2017-06-20 | 2017-09-22 | 西安交通大学 | Datum plane abnormality eliminating method in a kind of software defined network |
Non-Patent Citations (4)
| Title |
|---|
| "Inter-flow consistency: A novel SDN update abstraction for supporting inter-flow constraints";Weijie Liu,等;《2015 IEEE Conference on Communications and Network Security (CNS)》;20151207;第469-478页 * |
| "Scalable Routing in SDN-enabled Networks with Consolidated Middleboxes";Andrey Gushchin,等;《HotMiddlebox "15: Proceedings of the 2015 ACM SIGCOMM Workshop on Hot Topics in Middleboxes and Network Function Virtualization》;20150831;第55-60页 * |
| "基于备份资源的SDN数据平面故障恢复方法";张淑娟;《中国优秀硕士学位论文全文数据库信息科技辑》;20180315;I139-66 * |
| "面向SDN的数据中心网络更新研究综述";程克非，等;《电讯技术》;20171031;第1224-1232页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109768924A (en) | 2019-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109768924B (en) | SDN network multilink fault recovery method and system oriented to multi-stream coexistence | |
| JP6393773B2 (en) | Switch replacement of partial software defined network in IP network | |
| EP2911348B1 (en) | Control device discovery in networks having separate control and forwarding devices | |
| JP6062939B2 (en) | Self-healing recognizable hybrid design of controller-switch connectivity in split architecture system | |
| JP5919046B2 (en) | Path calculation method | |
| CN107302496B (en) | Software defined network link failure recovery method based on in-band control | |
| Pfeiffenberger et al. | Reliable and flexible communications for power systems: Fault-tolerant multicast with SDN/OpenFlow | |
| CN110708245B (en) | SDN data plane fault monitoring and recovery method under multi-controller architecture | |
| CN109889350A (en) | A kind of method and device for toggle path in SDN network failure | |
| CN108243123B (en) | Broadcast message processing method and device, controller and switch | |
| CN104980351A (en) | Fast reroute method based on SDN network | |
| Petale et al. | Link failure recovery mechanism in software defined networks | |
| CN106209615B (en) | A kind of Dynamic Route Control method and system calculating forward-path based on SPFA algorithm | |
| CN105406988A (en) | Software-definition survivable network construction method | |
| US20080159127A1 (en) | Autonomous network, node device, network redundancy method and recording medium | |
| WO2023015897A1 (en) | Intelligent control method, apparatus and system for optical network | |
| CN108965013B (en) | System and method for rapidly opening IP and optical network service | |
| CN111800339B (en) | Route optimization method with path number constraint in hybrid SDN scene | |
| CN107733719A (en) | A kind of software definition is anti-to ruin network intact path restoration methods | |
| CN112615750A (en) | Backbone network flow granularity adjusting system and method based on SDN | |
| Geng et al. | Single failure routing protection algorithm in the hybrid SDN network | |
| Fan et al. | An optimization algorithm for spatial information network self-healing based on software defined network | |
| JP2015173378A (en) | Management system, management server and management method | |
| CN109861910B (en) | Power communication network link importance calculation method based on link availability | |
| CN106130895A (en) | The heavy route method of SDN fault and device |
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 |