SDN data plane fault recovery method and system based on bionic optimization and weighted multipath protocol
By adopting bionic optimization and weighted multipath protocols in the SDN network, combining IPv6 stream tags and Markov chain models, dynamically adjusting the traffic paths, the problem of low failure recovery efficiency in the SDN network is solved, and efficient and global failure recovery is achieved and load balancing to meet the telecommunications-level failure recovery requirements.
Patent Information
- Application Number
- CN202411090270.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-09
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2044-08-09
AI Technical Summary
In SDN networks, traditional failure recovery solutions are difficult to achieve efficient, fast, and global failure recovery, especially when the switch has limited capacity to store flow table entries and the quality of backup path generation is difficult to guarantee, resulting in extended failure recovery time and may cause additional failure recovery times and may cause congestion.
Using a method based on bionic optimization and weighted multipath protocol, traffic is aggregated through IPv6 stream tag fields, and Markov chain probability model and improved proboscoon optimization algorithm are used to realize a two-stage bionic optimization algorithm to search the global maximum Optimize weights, dynamically adjust traffic paths, reduce the impact of failures on traffic forwarding, and pause the optimization of the following traffic table rules when the network is stable.
The traffic load balancing is realized, the impact of faults on traffic forwarding is reduced, the fault link or node is bypassed, the global QoS is realized, and the efficiency of fault recovery and link bandwidth utilization is improved through fast online weight updates.
Smart Images

Figure CN118972315A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the field of communication technology, and mainly relates to an SDN data plane fault recovery method and system based on bionic optimization and weighted multipath protocol. Background Art
[0002] Software Defined Networking (SDN) is a new type of network architecture that can define and control the network through software programming. It has the characteristics of separation of control plane and forwarding plane and open programmability. It is considered a revolution in the field of network. SDN provides a new experimental approach for the research of new Internet architecture and greatly promotes the development of the next generation of Internet.
[0003] In traditional networks, fault recovery is usually achieved through redundancy, fast convergence routing protocols, and protocols such as HSRP and VRRP. However, in the new situation of SDN, solving the fault recovery problem has several challenges: 1. TCAM (ternary content addressable memory) is limited, and too many flow table rules may cause overflow; 2. The controller may face greater computing pressure when calculating the backup path of all flows; 3. The communication cost between the controller and the switch also needs to be considered. At present, SDN mainly divides fault recovery into reactive recovery and proactive recovery. Reactive recovery is to notify the controller when the switch detects a fault, and the controller re-issues the flow table according to the current network topology to ensure normal communication. Proactive recovery will configure the backup path in advance. When the main path fails, there is almost no need for the controller to participate, and the data flow will automatically switch to the backup path.
[0004] In order to achieve the requirements of carrier-grade reliability, that is, the fault recovery time is within 50ms, the current solution basically adopts active recovery, but the backup path calculated in advance may cause additional congestion for the diversion of a certain flow, and the global impact cannot be considered. In addition, the switch has limited ability to store flow table entries, the quality of the generation of the primary / backup path is difficult to guarantee, and there are often a large number of invalid paths when the data flow is switched from the primary path to the backup path. Summary of the invention
[0005] The present invention is aimed at the problem that the existing technology cannot perform fault recovery efficiently, quickly and globally in traditional networks, and provides a SDN data plane fault recovery method and system based on bionic optimization and weighted multipath protocol. The flow label field of IPv6 is used to aggregate the traffic, and a flow label is assigned to each aggregated flow. By using a weighted multipath protocol based on a Markov chain probability model, the aggregated flow can be load balanced according to the weight to respond to changes in the network; a two-stage bionic optimization algorithm is implemented in the controller, the first stage is the exploration stage, searching for the global optimum, and the second stage is the development stage, jumping out of the local optimum; when the network changes, the optimization is started, and when the network is stable, the optimization is suspended and the flow table is issued; by using the improved coati optimization algorithm to efficiently solve the optimal weight, the existing weight is iterated when the network changes or fails, and after convergence, the new flow table rules are suspended and issued, so as to achieve adaptive and fast fault recovery.
[0006] In order to achieve the above object, the technical solution adopted by the present invention is: an SDN data plane fault recovery method based on bionic optimization and weighted multipath protocol, comprising the following steps:
[0007] S1. Obtaining global topology: The controller obtains the global network topology through the Link Layer Discovery Protocol (LLDP);
[0008] S2, flow aggregation: use the flow label field of IPv6 to aggregate traffic and assign a flow label to each aggregated flow;
[0009] S3, weight allocation: According to the inbound and outbound switches and network topology of the aggregated flow, a set of forwarding weights is allocated to the aggregated flow. The weight is the probability that the flow is forwarded to the corresponding port when passing through each switch. Through the flow aggregation of S2 and the weight allocation of S3, each flow will be forwarded along multiple paths according to the Markov chain probability model. Each path has a weight. We call this set of forwarding rules "weighted multipath protocol";
[0010] S4, weight update: Based on the improved coati optimization algorithm, the global health value of the network is optimized to solve the optimal weight; specifically, the following steps are included:
[0011] S41, initialization stage: initialize the weight set to vector W, establish a population, the size of the population is N, and initialize the maximum number of iterations T;
[0012] S42, exploration phase: update weights and search for global optimum;
[0013] S43, development stage: the population randomly jumps around the original location and jumps out of the local optimum;
[0014] The weight update includes two stages: exploration and development. The exploration stage searches for the global optimum, and the development stage jumps out of the local optimum.
[0015] S5, iterative convergence: repeat step S4, when the global health value of the network S is best If the value is basically unchanged, it is considered to have converged and the iteration is suspended;
[0016] S6, send flow table rules: the corresponding weight W best It is sent to the switch to guide the switch to divert traffic.
[0017] As an improvement of the present invention, step S2 specifically includes the following steps:
[0018] S21: Encode the edge switch connected to the host using the auto-increment rule, with a coding length of 10 bits;
[0019] S22: For each flow, parse the switch encoding ID of its entry / exit network in and ID out ;
[0020] S23: Allocate a flow label label = ID to the flow in ||ID out .
[0021] As another improvement of the present invention, the exploration phase of step S42 specifically includes the following steps:
[0022] S421: Divide the population established in step S41 into two, and update the weight of one half of the population according to the following formula:
[0023]
[0024] in, represents the i-th agent in the population, represents the jth weight of the ith agent in the population, P1 represents the exploration phase, and W best represents the current optimal weight set, and the range of i is the first half of the population, that is, The range of j is the length of the weight vector;
[0025] S422: For the other half of the population, move randomly according to the following formula:
[0026] Direc: Direc j =rand(0,1)
[0027] Among them, Direc j Indicates the moving direction of the jth element;
[0028] Then update the weights according to the following rules:
[0029]
[0030] Where S i represents the score of the i-th element, that is, the network health value under this weight;
[0031] S423: For all individuals in the population, weights are updated according to the following rules:
[0032]
[0033] As another improvement of the present invention, the step S43 development phase specifically includes the following steps:
[0034] S431: All individuals in the population follow Make a jump, among which represents the i-th agent in the population, represents the jth weight of the ith agent in the population, P2 represents the development stage, and ub j =1 / t represents the upper bound of the random number, which is determined by t, where t represents the number of rounds since the last pause;
[0035] S432: Update weights during development:
[0036]
[0037] S433: Select the individual with the highest score at present and record its weight value in W best , the score is recorded as S best In order to achieve the above object, the present invention also adopts a technical solution: an SDN data plane fault recovery system based on bionic optimization and weighted multipath protocol, including a computer program, which implements the steps of any of the above methods when executed by a processor.
[0038] Compared with the prior art, the present invention has the following beneficial effects: the present invention designs a weighted multipath protocol, which enables the switch to load balance the traffic, thereby bringing three benefits: first, the probability of the impact of failures on traffic forwarding is reduced; second, the traffic can be diverted by adjusting the weights to bypass the faulty links or nodes; third, the forwarding of the network is adjusted globally to achieve global QoS. The present invention optimizes weights through an improved coati algorithm. This two-stage optimization algorithm facilitates the rapid online update of weights and achieves extremely fast convergence speed at a very low computational cost. The present invention aggregates flows through IPv6 flow labels, distributes the same flow labels to flows with the same ingress and egress switches, and achieves the goal of reducing the number of flow tables and computational complexity. BRIEF DESCRIPTION OF THE DRAWINGS
[0039] Figure 1 It is a flowchart of the steps of the SDN data plane fault recovery method based on bionic optimization and weighted multipath protocol of the present invention;
[0040] Figure 2 This is a schematic diagram of the SDN network topology structure in Example 2 of the present invention;
[0041] Figure 3 This is a schematic diagram of SDN fault recovery in Example 3 of the present invention. DETAILED DESCRIPTION
[0042] The present invention will be further explained below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the following specific embodiments are only used to illustrate the present invention and are not used to limit the scope of the present invention.
[0043] Example 1
[0044] SDN data plane fault recovery method based on bionic optimization and weighted multipath protocol, such as Figure 1 As shown, the following steps are included:
[0045] S1. Obtaining global topology: The controller obtains the global network topology through the Link Layer Discovery Protocol (LLDP).
[0046] S2, flow aggregation: Use the flow label field of IPv6 to aggregate traffic and assign a flow label to each aggregated flow; mainly includes the following steps:
[0047] S21, use the self-increment rule to encode the edge switch connected to the host, and the encoding length is 10 bits;
[0048] S22. For each flow, parse the switch encoding ID of its entry / exit network in and ID out ;
[0049] S23. Allocate a flow label label = ID to the flow in ||ID out .
[0050] S3, weight allocation: According to the inbound and outbound switches and network topology of the aggregated flow, a set of forwarding weights, W, is allocated to the aggregated flow. f ={w0,w1,…,w m}, represents the probability of the flow being forwarded to the corresponding port when passing through each switch. Through flow aggregation in S2 and weight allocation in S3, each flow will be forwarded along multiple paths according to the Markov chain probability model, and each path has a weight. We call this set of forwarding rules "weighted multipath protocol";
[0051] S4. Weight update: Based on the improved raccoon optimization algorithm, the global health value of the network is optimized. The link health value can be expressed as H l =1 / U l 1 / D l , where U l represents bandwidth utilization, D l represents the link delay, and the global health value can be expressed as This step can be divided into two phases: exploration and development:
[0052] S41, initialization phase: Initialize the weight set to a vector W, establish a population, the size of the population is N, which is a specified parameter, initialize a maximum number of iterations T, which means that the iteration will stop after convergence of T rounds.
[0053] S42, exploration stage: Split the population into two, perform the following steps respectively, and globally search for the optimal weight. P1 represents the population in the first stage, and represents the i-th agent in the population, and Represents the jth weight of the i-th agent in the population:
[0054] S421. Update the weight of this half population according to the following formula:
[0055]
[0056] Where W best represents the current optimal weight set, i is the range of the first half of the population, that is, The range of j is the length of the weight vector;
[0057] S422. For the other half of the population, they need to move randomly according to the following rules:
[0058] Direc: Direc j =rand(0,1)
[0059] Direc j represents the moving direction of the jth element, where the range of j is the length of the weight vector;
[0060] Then update the weights according to the following rules:
[0061]
[0062] Where S i represents the score of the i-th element, that is, the network health value under this weight;
[0063] S423. For all individuals in the population, weights are updated according to the following rules:
[0064]
[0065] S43, Development stage: The population needs to perform random jumps near the original location, which helps to quickly jump out of the local optimal solution and respond quickly in the local area when a network failure occurs, without having to converge again from a random state. The definition rules of the symbols in the following formulas are consistent with those in the exploration stage.
[0066] S431, according to Make a jump, where ub j =1 / t, t represents the number of rounds counted from the last pause;
[0067] S432. Update weights in the development phase:
[0068]
[0069] S433. Select the individual with the highest score at present and record its weight value in W best , the score is recorded as S best .
[0070] S5, repeat S4, when S is executed for T consecutive times best If the value is basically unchanged, it is considered to have converged and the iteration is suspended.
[0071] S6. The corresponding weight W best It is sent to the switch to guide the switch to guide the traffic. When a network failure occurs, starting from the development stage of step S43, steps S42 and S43 are repeated until the next convergence, and the flow table rules are sent again.
[0072] Example 2
[0073] See also Figure 2 The present invention provides a SDN data plane fault recovery method based on bionic optimization and weighted multipath protocol. It should be noted that the method takes several flows as an example, and other flows are similar. The method includes the following contents:
[0074] S1. The controller obtains the global network topology through the Link Layer Discovery Protocol (LLDP), assigns the corresponding switch ID, and discovers the corresponding link;
[0075] S2. Assign a flow label to each flow, label = ID in ||ID out , where ID in and ID outis the number corresponding to the switch that flows into / out of the network. For example, switch S0 is numbered 0000000001 and switch S3 is numbered 0000000100. Then the flow from switch S0 to switch S3 has a flow label of "00000000010000000100";
[0076] S3, assign weights to the aggregated flows from switch S0 to switch S3, W 0-3 ={w1,w2,w3}. From the picture, if w1=w2=w3=1, the aggregated flow will be transmitted according to L0->L1->L5. If w3 becomes 0.5, half of the flow will be transmitted according to L0->L1->L6->L4, and the other half will still be transmitted according to L0->L1->L5. Assuming that there are other flows in the network, they are from switch S1 to switch S4, from switch S0 to switch S4, and from switch S1 to switch S3. Then, according to the same rule, the corresponding weights are assigned to them, and the global weight set W={w1,w2,…,w 12};
[0077] S4. During the optimization process, an optimal network health value is calculated through the corresponding formula. It is related to the overall bandwidth occupancy rate and latency. We need to maximize the health value through optimization. First, the population size N = 30 is set, and 30 individuals are allowed to initialize W respectively. For example, the first individual Update the weights in two steps until convergence.
[0078] S5. After obtaining the converged weights, for switch S0, the corresponding flow table rules can be expressed as follows:
[0079] Flow table rule 1:
[0080] Match Fields:
[0081] - Ingress port is 0
[0082] -IPv6 Flow Label field is 00000000010000000010
[0083] Actions:
[0084] - Output to port 1
[0085] Priority:2
[0086] Flow table rule 2:
[0087] Match Fields:
[0088] - Ingress port is 0
[0089] -IPv6 Flow Label field is 00000000010000000010
[0090] Actions:
[0091] - Output to port 2
[0092] Priority:1
[0093] S6. When a network failure occurs, the optimization process is restarted and the corresponding flow table is modified after convergence;
[0094] Example 3
[0095] See also Figure 3 The present invention provides an SDN data plane fault recovery method based on bionic optimization and weighted multipath protocol. Example 3 takes a certain flow as an example to introduce the weighted multipath protocol. The method includes the following contents:
[0096] S1. The controller obtains the global network topology through the Link Layer Discovery Protocol (LLDP), assigns the corresponding switch ID, and discovers the corresponding link;
[0097] S2. The controller assigns a flow label to a flow from switch S0 to switch S3: “00000000010000000011”.
[0098] S3, assign weights to the aggregated flows from switch S0 to switch S3, W 0-3 ={w0,w1,w2};
[0099] S4. During the optimization process, this method maximizes the network health value (which is related to the overall bandwidth occupancy and latency) through the method in the specification, updates the weights in two steps until convergence, and issues the corresponding flow table rules;
[0100] S5. In this embodiment, after any number of convergences, the flow from S0 to S3 will be forwarded along the green link, i.e., {L0->L1->L5}, with a probability of w0×w1×w2, and forwarded along the link {L7->L5} with a probability of (1-w0)×w2, and so on, and the same applies to other links;
[0101] S6. For example, when w0=w1=w2=1, the flows listed in this embodiment will be completely in accordance with Figure 3The green link, i.e., {L0->L1->L5}, is forwarded; when a fault occurs in the network, such as severe congestion or short circuit in the L3 and L5 links, the bionic optimization algorithm will adjust the weights in the weighted multipath protocol until convergence to help the network recover. Since L3\L5 fails or is severely congested, and the traffic efficiency of L7\L6\L4 is relatively high, the weights will eventually converge to w0=w2=0. At this time, the flow exemplified in this embodiment will be forwarded along the link {L7->L6->L4} with a probability of 100%. Until L5 restores its transmission capacity, the algorithm will adjust the weights again so that the traffic can be load balanced on the two links {L0->L1->L5} and {L7->L6->L4}.
[0102] In summary, the present invention provides an efficient data plane protection method that can be deployed in an SDN network. When the optimization parameters are appropriate and the network resources are redundant, the method can quickly find the optimal weight combination for the network, dynamically adjust the network steady state, and respond to faults. Compared with the traditional responsive and active fault recovery mechanisms, the method is based on the equivalent multi-path protocol and the bionic optimization algorithm, and iterates while forwarding, which greatly improves the utilization rate of the link bandwidth. In addition, in the case of extreme network congestion, in order to solve certain faults, the diversion of traffic will not be at the expense of other links. It is a global optimization mechanism that can achieve network load balancing. It meets the telecommunications-level fault recovery requirements.
[0103] It should be noted that the above content only illustrates the technical idea of the present invention and cannot be used to limit the protection scope of the present invention. For ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principle of the present invention. These improvements and modifications all fall within the protection scope of the claims of the present invention.
Claims
1. An SDN data plane fault recovery method based on bionic optimization and weighted multipath protocol, characterized in that , including the following steps: S1. Obtaining global topology: The controller obtains the global network topology through the Link Layer Discovery Protocol (LLDP); S2, flow aggregation: use the flow label field of IPv6 to aggregate traffic and assign a flow label to each aggregated flow; S3, weight allocation: according to the inbound and outbound switches and network topology of the aggregated flow, a set of forwarding weights is allocated to the aggregated flow. The weight is the probability that the flow is forwarded to the corresponding port when passing through each switch. Each aggregated flow takes multiple forwarding paths according to the Markov chain probability model. S4, weight update: Based on the improved coati optimization algorithm, the global health value of the network is optimized to solve the optimal weight; specifically, the following steps are included: S41, initialization stage: initialize the weight set to vector W, establish a population, the size of the population is N, and initialize the maximum number of iterations T; S42, exploration stage: update weights and search for global optimum; S43, development stage: the population randomly jumps around the original location and jumps out of the local optimum; The weight update includes two stages: exploration and development. The exploration stage searches for the global optimum, and the development stage jumps out of the local optimum. S5, iterative convergence: repeat step S4, when the global health value of the network S is best If the value is basically unchanged, it is considered to have converged and the iteration is suspended; S6, send flow table rules: the corresponding weight W best It is sent to the switch to guide the switch to divert traffic.
2. The SDN data plane fault recovery method based on bionic optimization and weighted multipath protocol according to claim 1, characterized in that: The step S2 specifically includes the following steps: S21: Encode the edge switch connected to the host using the auto-increment rule, with a coding length of 10 bits; S22: For each flow, parse the switch encoding ID of its entry / exit network in and ID out ; S23; Assign a flow label label = ID to the flow in ||ID out .
3. The SDN data plane fault recovery method based on bionic optimization and weighted multipath protocol as claimed in claim 2, characterized in that: The exploration phase of step S42 specifically includes the following steps: S421: Divide the population established in step S41 into two, and update the weight of one half of the population according to the following formula: in, represents the i-th agent in the population, represents the jth weight of the ith agent in the population, P1 represents the exploration phase, and W best represents the current optimal weight set, and the range of i is the first half of the population, that is, The range of j is the length of the weight vector; S422: For the other half of the population, move randomly according to the following formula: Direct:Direct j =row(0,1) Among them, Direc j Indicates the moving direction of the jth element; Then update the weights according to the following rules: Where S i represents the score of the i-th element, that is, the network health value under this weight; S423: For all individuals in the population, weights are updated according to the following rules:
4. The SDN data plane fault recovery method based on bionic optimization and weighted multipath protocol as claimed in claim 3, characterized in that: The step S43 development phase specifically includes the following steps: S431: All individuals in the population follow Perform a jump, where represents the i-th agent in the population, represents the jth weight of the ith agent in the population, P2 represents the development stage, and ub j =1 / t represents the upper bound of the random number, which is determined by t, where t represents the number of rounds since the last pause; S432: Update weights during development: S433: Select the individual with the highest score at present and record its weight value in W best , the score is recorded as S best .
5. A SDN data plane fault recovery system based on bionic optimization and weighted multipath protocol, comprising a computer program, characterized in that: When the computer program is executed by a processor, the steps of any of the above methods are implemented.
Citation Information
Patent Citations
Ant colony optimization load balancing routing algorithm based on SDN
CN107094115A
SDN data plane self-healing method based on bionic mechanism
CN116016314A
Communication network fault recovery method based on link importance
CN118200229A
KR20190001402A
