Traffic forwarding methods, devices, SRv6 header nodes, and storage media

By determining the effective path policy selection group and schedulable SRv6 TE policies in the SRv6 head node, the problems of link detours and redundant paths in SRv6 TE policies are solved, and traffic forwarding efficiency is optimized.

CN116962277BActive Publication Date: 2026-11-10MAIPU COMM TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202310937056.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-07-27
Publication Date
2026-11-10
Estimated Expiration
2043-07-27

AI Technical Summary

Technical Problem

Existing SRv6 TE policies suffer from link detours and redundant paths within the same site during traffic forwarding, leading to an increase in the number of SRv6 TE policies and wasting link bandwidth.

Method used

After learning the service route in the SRv6 head node, the effective path policy selection group is determined from multiple preset path policy selection groups based on the service route and the service traffic to be forwarded, and a schedulable SRv6 TE policy is selected from the SRv6 TE policy set corresponding to the candidate policy group for forwarding.

Benefits of technology

It avoids traffic detours caused by considering multiple WAN lines and multiple tail nodes when planning SRv6 TE strategies, optimizes link utilization, reduces redundant paths, and improves traffic forwarding efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116962277B_ABST
    Figure CN116962277B_ABST
Patent Text Reader

Abstract

This invention provides a traffic forwarding method, apparatus, SRv6 head node, and storage medium, relating to the field of data communication technology. The method involves the SRv6 head node first learning the service route to the target service network; then, based on the service route and the traffic to be forwarded, determining an effective path policy selection group from multiple preset path policy selection groups. Each effective path policy selection group includes multiple candidate policy groups, each corresponding to a set of SRv6TE policies planned based on different WAN lines and tail nodes; furthermore, based on the service route, determining a schedulable SRv6TE policy from the SRv6TE policy sets corresponding to each of the multiple candidate policy groups, and importing the traffic to be forwarded into the schedulable SRv6TE policy to forward the traffic. This avoids the situation where traffic detours between tail nodes due to simultaneously considering multiple WAN lines and multiple tail nodes, which would otherwise occur when the planned SRv6TE policy links are considered simultaneously.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of data communication technology, and more specifically, to a traffic forwarding method, apparatus, SRv6 header node, and storage medium. Background Technology

[0002] Segment Routing (SR) is a technique for forwarding data packets over a network. Segment routing divides a network path into segments and assigns SIDs (Segment IDs) to these segments and network devices. By arranging the segments and network devices to generate a Segment List, a forwarding path can be obtained.

[0003] For SRv6 (Segment Routing IPv6), a segment is an IPv6 address, and a path is the IPv6 address stack encapsulated in the SRH (Segment Routing Header).

[0004] SRv6 Traffic Engineering (SRv6 TE) is a traffic engineering tunneling technology based on SRv6. SRv6 TE technology enables the scheduling of traffic forwarding paths. The industry typically uses SRv6 TE policies to define an SRv6 TE tunnel.

[0005] SRv6 TE policies typically use color (tunnel color identifier) ​​and Endpoint (endpoint IPv6 address) as keywords. An SRv6 TE policy can have multiple candidate paths, and a candidate path can have multiple Segment-Lists. By importing specific traffic into the corresponding SRv6 TE policy, and encapsulating the SRH using the preferred Segment-List from that SRv6 TE policy, traffic forwarding is achieved.

[0006] There are two main existing SRv6 TE strategy scheduling and traffic redirection technologies:

[0007] One approach is based on route routing. It learns SRv6 service routes through BGP (Border Gateway Protocol) and sets the color extended community attribute on the learned service routes through the policy routing Route-MAP. The learned service routes carry VPN SID (such as End.DT6SID or End.DT4 SID), Endpoint, and Color information.

[0008] For service traffic forwarding, first perform route selection to determine the next-hop information in the corresponding routing table entry. Then, use the Endpoint and Color in the next-hop information as keywords to determine the SRv6 TE policy, and then forward the service traffic into the determined SRv6 TE policy.

[0009] One approach is based on packet routing. It learns SRv6 service routes carrying VPN SID and Endpoint information through BGP, and determines the color of service traffic by matching the characteristics of packet 5-tuples through policy-based routing (PBR). It then uses the Endpoint in the routing table entry and the color set by PBR as keywords to determine the SRv6 TE policy, and then forwards the service traffic into the determined SRv6 TE policy.

[0010] As can be seen, existing SRv6 TE policy-based traffic redirection technology logically decomposes the traffic redirection process into two steps: routing table selection and SRv6 TE policy selection. The routing table selection step determines the VPN SID and Endpoint, i.e., determines the SRv6 tunnel egress device. The SRv6 TE policy selection step determines the tunnel path to the Endpoint by combining routing or packet information.

[0011] The existing method of relying solely on routing tables to determine the tail node of SRv6 tunnels cannot achieve endpoint-level scheduling and will further lead to the following two problems:

[0012] Problem 1: Traffic bypass exists between the tail nodes of the same site;

[0013] Question 2: When planning SRv6 TE strategies, multiple WAN lines and multiple tail nodes need to be considered simultaneously, which doubles the number of SRv6 TE strategies.

[0014] For example, in such Figure 1 In the Hub-Spoke network shown, for traffic forwarded from the data center to point 1, Hub1 learns two next-hop routes, Spoke11 and Spoke12. To fully utilize the two WAN lines, at least four SRv6 TE policies destined for point 1 need to be planned on Hub1. Figure 1 There are four paths in the diagram. Paths 2 and 3 detour between Spoke11 and Spoke12.

[0015] Taking path 2 as an example, the true intention of planning this path is to forward traffic from the left-hand WAN line. However, since the endpoint obtained from the route selection is Spoke12, the traffic still needs to detour to Spoke12 after reaching Spoke11. It can be seen that paths 2 and 3 are actually redundant paths, which increases the number of SRv6 TE policies on the one hand, and wastes the link bandwidth between Spoke11 and Spoke12 on the other hand. Summary of the Invention

[0016] To overcome the shortcomings of the prior art, the present invention provides a traffic forwarding method, apparatus, SRv6 header node, and storage medium.

[0017] The technical solution of this invention can be implemented as follows:

[0018] In a first aspect, the present invention provides a traffic forwarding method applied to an SRv6 header node, the method comprising:

[0019] Learn the service routes to reach the target service network;

[0020] Based on the service route and the service traffic to be forwarded, an effective path policy selection group is determined from multiple preset path policy selection groups. The effective path policy selection group includes multiple candidate policy groups, and each of the multiple candidate policy groups corresponds to an SRv6 TE policy set planned based on different WAN lines and tail nodes.

[0021] Based on the service route, a schedulable SRv6 TE policy is determined from the SRv6 TE policy sets corresponding to each of the multiple candidate policy groups, and the service traffic to be forwarded is imported into the schedulable SRv6 TE policy to forward the service traffic to be forwarded.

[0022] Optionally, the service route includes multiple routing table entries, each corresponding to a different service type. The step of determining a valid path policy selection group from multiple preset path policy selection groups based on the service route and the service traffic to be forwarded includes:

[0023] Based on the type of the service traffic to be forwarded, a valid routing table entry is determined from the plurality of routing table entries, and the service type corresponding to the valid routing table entry is the type of the service traffic to be forwarded.

[0024] The effective path policy selection group is determined from multiple preset path policy selection groups based on the service color identifier contained in the next-hop information in the effective routing table entry.

[0025] Optionally, each of the plurality of preset path policy selection groups has a different selection group color identifier, and the step of determining the effective path policy selection group from the plurality of preset path policy selection groups based on the service color identifier contained in the next-hop information in the effective routing table entry includes:

[0026] The preset path strategy selection group whose selection group color is identified by the business color is determined as the effective path strategy selection group.

[0027] Optionally, after learning the service routes to the target service network, the method further includes:

[0028] Based on the traffic characteristics of the traffic to be forwarded, obtain the service color identifier of the traffic to be forwarded;

[0029] Based on the service color identifier of the traffic to be forwarded, the effective path policy selection group is determined from a plurality of preset path policy selection groups, and the selection group color identifier of the effective path policy selection group is the service color identifier of the traffic to be forwarded.

[0030] Optionally, the service route includes a valid routing table entry, the valid routing table entry including at least one next-hop information, and the step of determining the schedulable SRv6 TE policy from the SRv6 TE policy sets corresponding to each of the multiple candidate policy groups according to the service route includes:

[0031] Based on the tail node in each of the next-hop information, all pending SRv6 TE strategies are determined from the multiple candidate strategy groups;

[0032] The schedulable SRv6 TE policy is determined based on the priority coefficient and policy state of each pending SRv6 TE policy.

[0033] Optionally, the candidate strategy group includes a tail node list, where different tail nodes in the tail node list are used to plan different preset SRv6 TE strategies in the SRv6 TE strategy set corresponding to the candidate strategy group. The step of determining all pending SRv6 TE strategies from the SRv6 TE strategy sets corresponding to each of the multiple candidate strategy groups based on the tail nodes in each next-hop information includes:

[0034] For each candidate strategy group, if the tail node list of the candidate strategy group records at least one tail node from the next hop information, then the candidate strategy group is designated as the pending strategy group.

[0035] For each of the pending strategy groups, the preset SRv6 TE strategy planned based on the tail node in any of the next-hop information in the SRv6 TE strategy set corresponding to the pending strategy group is taken as the pending SRv6 TE strategy.

[0036] Optionally, the step of determining the schedulable SRv6 TE policy based on the priority coefficient and policy state of each of the pending SRv6 TE policies includes:

[0037] The pending SRv6TE policy with the highest priority coefficient and the policy state being fault-free is selected as the schedulable SRv6 TE policy.

[0038] Secondly, the present invention provides a traffic forwarding device applied to an SRv6 domain header node, the device comprising:

[0039] The learning module is used to learn service routes to reach the target service network;

[0040] The determination module is configured to determine an effective path policy selection group from multiple preset path policy selection groups based on the service route and the service traffic to be forwarded. Each effective path policy selection group includes multiple candidate policy groups, and each candidate policy group corresponds to a preset SRv6 TE policy set planned based on different WAN lines and tail nodes. Based on the service route, the module determines a schedulable SRv6 TE policy from the SRv6 TE policy sets corresponding to each of the multiple candidate policy groups, and imports the service traffic to be forwarded into the schedulable SRv6 TE policy to forward the service traffic.

[0041] Thirdly, the present invention provides an SRv6 header node, which includes a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, it implements the traffic forwarding method as described in the first aspect above.

[0042] Fourthly, the present invention provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the traffic forwarding method as described in the first aspect above.

[0043] Compared to existing technologies, the traffic forwarding method provided in this embodiment of the invention first learns the service route to the target service network from the SRv6 head node; then, based on the service route and the service traffic to be forwarded, it determines an effective path policy selection group from multiple preset path policy selection groups. Each effective path policy selection group includes multiple candidate policy groups, and each candidate policy group corresponds to a set of SRv6 TE policies planned based on different WAN lines and tail nodes. Next, based on the service route, it determines a schedulable SRv6 TE policy from the SRv6 TE policy sets corresponding to each of the multiple candidate policy groups, and imports the service traffic to be forwarded into the schedulable SRv6 TE policy to forward the service traffic. Because this embodiment of the invention sets a path policy selection group containing multiple candidate policy groups, and each candidate policy group corresponds to a set of SRv6 TE policies planned based on different WAN lines and tail nodes, it avoids the situation where traffic detours between tail nodes when planning SRv6 TE policies due to simultaneously considering multiple WAN lines and multiple tail nodes. Attached Figure Description

[0044] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0045] Figure 1 An example of the structure of a Hub-Spoke network provided in an embodiment of the present invention. Figure 1 ;

[0046] Figure 2 A flowchart illustrating a traffic forwarding method provided in an embodiment of the present invention. Figure 1 ;

[0047] Figure 3 An example of the structure of a Hub-Spoke network provided in an embodiment of the present invention. Figure 2 ;

[0048] Figure 4 A flowchart illustrating a traffic forwarding method provided in an embodiment of the present invention. Figure 2 ;

[0049] Figure 5 A functional unit block diagram of a traffic forwarding device provided in an embodiment of the present invention;

[0050] Figure 6 This is a schematic block diagram of the structure of an SRv6 head node provided in an embodiment of the present invention.

[0051] Icons: 100 - Traffic forwarding device; 101 - Learning module; 102 - Determining module; 200 - SRv6 head node; 210 - Memory; 220 - Processor. Detailed Implementation

[0052] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.

[0053] Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0054] It should be noted that similar labels and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures.

[0055] It should be noted that, where there is no conflict, the features in the embodiments of the present invention can be combined with each other.

[0056] To address the shortcomings of existing technologies, this invention provides a traffic forwarding method for SRv6 head nodes, which will be described in detail below.

[0057] Please refer to Figure 2 The traffic forwarding method includes steps S101 to S103.

[0058] S101, learn the service routes to reach the target service network.

[0059] In a possible implementation, service routes to the target service network can be learned via BGP.

[0060] based on Figure 1 The network topology shown is exemplary. Assume that the SRv6 head node is Hub1, the target service network belongs to point 1, and Hub1 learns the service route to the target service network in point 1 through BGP.

[0061] S102, based on the service route and the service traffic to be forwarded, determine the effective path policy selection group from multiple preset path policy selection groups.

[0062] The effective path strategy selection group includes multiple candidate strategy groups, each of which corresponds to a set of SRv6 TE strategies planned based on different WAN lines and tail nodes.

[0063] In other words, for any two candidate strategy groups A and B in the same path strategy selection group, the WAN line used to plan the SRv6 TE strategy set corresponding to candidate strategy group A is completely different from that of candidate strategy group B, and the tail node used to plan the SRv6 TE strategy set corresponding to candidate strategy group A is also completely different from that of candidate strategy group B.

[0064] Meanwhile, each candidate strategy group includes a tail node list. For any candidate strategy group, different tail nodes in the tail node list are used to plan different preset SRv6 TE strategies in the SRv6 TE strategy set corresponding to the candidate strategy group. That is, the tail nodes in the tail node list correspond one-to-one with the preset SRv6 TE strategies in the SRv6 TE strategy set.

[0065] based on Figure 1 The network topology shown is exemplary, assuming that the service traffic forwarded by the Hub to the Spoke is mainly divided into two types: production service traffic and office service traffic. The rules set by the user for these two types of service traffic are that production service traffic takes priority to the left link, and office service traffic takes priority to the right link, with the two links serving as backups for each other.

[0066] Two SRv6 TE policies are planned along the forwarding direction from Hub1 to Network Point 1, corresponding to two forwarding paths, as follows: Figure 3 The paths A and B are shown.

[0067] Similarly, two SRv6 TE strategies can be planned along the forwarding direction from Hub1 to Site 2.

[0068] Hub1 created the following two preset path policy selection groups, where preset path policy selection group 1 is used for production business traffic:

[0069]

[0070] Preset path strategy selection group 1 includes candidate strategy group 1 and candidate strategy group 2:

[0071] (1) The priority coefficient of candidate strategy group 1 is 20, the path color is 100, and the Endpoint (IPv6 address) list includes Spoke11 (spoke on the left side of point 1) and Spoke21 (spoke on the left side of point 2);

[0072] (2) The priority coefficient of candidate strategy group 2 is 10, the path color is 200, and the Endpoint (IPv6 address) list includes Spoke12 (spoke on the right side of point 1) and Spoke22 (spoke on the right side of point 2).

[0073] The SRv6 TE policy set corresponding to candidate policy group 1 includes two SRv6 policies planned based on the WAN lines on the left and Spoke11 and Spoke21. The forwarding path corresponding to the SRv6 TE policy planned based on the WAN lines on the left and Spoke11 is... Figure 3 Path A in the text.

[0074] The SRv6 TE policy set corresponding to candidate policy group 2 includes two SRv6 policies planned based on the WAN lines on the right and Spoke12 and Spoke22. The forwarding path corresponding to the SRv6 TE policy planned based on the WAN lines on the right and Spoke12 is as follows: Figure 3 Path B in the text.

[0075] Preset path strategy selection group 2 is used for office business traffic:

[0076]

[0077] Preset path strategy selection group 2 includes candidate strategy group 3 and candidate strategy group 4.

[0078] (1) The priority coefficient of candidate strategy group 3 is 20, the path color is 200, and the Endpoint list includes Spoke12 (spoke on the right side of point 1) and Spoke22 (spoke on the right side of point 2);

[0079] (2) The priority coefficient of candidate strategy group 4 is 10, the path color is 100, and the Endpoint list includes Spoke11 (spoke on the left side of point 1) and Spoke21 (spoke on the left side of point 2).

[0080] The SRv6 TE policy set corresponding to candidate policy group 3 includes two SRv6 TE policies planned based on the WAN lines on the right and Spoke12 and Spoke22. The forwarding path corresponding to the SRv6 TE policy planned based on the WAN lines on the right and Spoke12 is... Figure 3 Path B in the path.

[0081] The SRv6 TE policy set corresponding to candidate policy group 4 includes two SRv6 TE policies planned based on the WAN lines on the left and Spoke11 and Spoke21. The forwarding path corresponding to the SRv6 TE policy planned based on the WAN lines on the left and Spoke11 is... Figure 3 Path A in the text.

[0082] As can be seen from the above, the same type of business traffic destined for different network points can reuse the same path strategy selection group and candidate strategy group.

[0083] In this embodiment of the invention, the service routing includes multiple routing table entries, each corresponding to a different service type.

[0084] based on Figure 1 The network topology shown is such that the service traffic forwarded by Hub to Spoke is mainly divided into two types: production service traffic and office service traffic. For example, Hub1 learns the service route to Spoke 1 through BGP, which includes two routing table entries.

[0085] Among them, the service type corresponding to routing table entry 1 is production service:

[0086]

[0087] The service type corresponding to route table entry 2 is office service.

[0088]

[0089]

[0090] In a possible implementation, step S102 includes sub-steps S102-1 to S102-2.

[0091] S102-1, determine the valid routing table entry from multiple routing table entries based on the type of service traffic to be forwarded.

[0092] Among them, the service type corresponding to the valid routing table entry is the type of service traffic to be forwarded.

[0093] based on Figure 1 In the network topology shown, for example, assume that Hub1 forwards production service traffic. In this case, since the service type corresponding to routing table entry 1 is production service, the valid routing table entry is routing table entry 1.

[0094] S102-2, Based on the service color identifier contained in the next-hop information in the valid routing table entry, determine the valid path policy selection group from multiple preset path policy selection groups.

[0095] For example, assuming the valid routing table entry is the aforementioned routing table entry 1, routing table entry 1 includes two next-hop information entries, both of which contain the same service color identifier, which is 1000.

[0096] In this embodiment of the invention, each of the multiple preset path strategy selection groups has a different selection group color identifier. For example, the selection group color identifier of the preset path strategy selection group 1 is 1000, and the selection group color identifier of the preset path strategy selection group 2 is 2000.

[0097] Understandably, in this embodiment of the invention, a preset path strategy selection group whose selection group color is identified by a business color can be determined as a valid path strategy selection group.

[0098] For example, assuming the valid routing table entry is the aforementioned routing table entry 1, the service color identifier contained in the next-hop information in routing table entry 1 is 1000, the selection group color identifier of the aforementioned preset path policy selection group 1 is 1000, and the selection group color identifier of the preset path policy selection group 2 is 2000. Since the selection group color identifier of the preset path policy selection group 1 is the same as the service color identifier contained in the next-hop information in routing table entry 1, the preset path policy selection group 1 is a valid path policy selection group.

[0099] In addition to determining the effective path policy selection group from multiple preset path policy selection groups based on service routing and the service traffic to be forwarded, this embodiment of the invention also provides a method for determining the effective path policy selection group. Please refer to... Figure 4 The traffic forwarding method also includes steps S104 to S105, which are parallel to step S102.

[0100] S104. Based on the traffic characteristics of the traffic to be forwarded, obtain the service color identifier of the traffic to be forwarded.

[0101] In this embodiment of the invention, the service color identifier of the traffic to be forwarded can be determined based on the packet information using ACL / PBR, for example, the service color identifier of the traffic to be forwarded can be determined by matching the five-tuple and other features of the packet using policy routing (PBR).

[0102] S105, determine the effective path strategy selection group from multiple preset path strategy selection groups based on the service color identifier of the traffic to be forwarded.

[0103] Among them, the color identifier of the effective path strategy selection group is the service color identifier of the traffic to be forwarded.

[0104] For example, assuming the service color identifier of the traffic to be forwarded is 1000, the selection group color identifier of the preset path policy selection group 1 is 1000, and the selection group color identifier of the preset path policy selection group 2 is 2000, since the selection group color identifier of the preset path policy selection group 1 is the same as the service color identifier of the traffic to be forwarded, the preset path policy selection group 1 is a valid path policy selection group.

[0105] The following section will continue with the description of step S103.

[0106] S103, based on the service routing, determine the schedulable SRv6 TE policy from the SRv6 TE policy sets corresponding to each of the multiple candidate policy groups, and import the service traffic to be forwarded into the schedulable SRv6 TE policy to forward the service traffic to be forwarded.

[0107] The service route includes valid routing table entries, and each valid routing table entry includes at least one next-hop information.

[0108] For example, assuming the valid routing table entry is the above-mentioned routing table entry 1, routing table entry 1 includes two next-hop information, with corresponding Endpoints Spoke11 and Spoke12 respectively.

[0109] In a possible implementation, step S103 includes sub-steps S103-1 to S103-2.

[0110] S103-1, Based on the tail node in each next-hop information, determine all pending SRv6 TE policies from the SRv6 TE policy sets corresponding to each of the multiple candidate policy groups.

[0111] In this embodiment of the invention, step S103-1 can be implemented as follows:

[0112] S103-1a, for each candidate strategy group, if the tail node list of the candidate strategy group records at least one tail node in the next hop information, then the candidate strategy group is regarded as a pending strategy group.

[0113] S103-1b, for each pending strategy group, the preset SRv6 TE strategy planned based on the tail node in any next-hop information in the SRv6 TE strategy set corresponding to the pending strategy group is taken as the pending SRv6 TE strategy.

[0114] For example, assuming the effective path policy selection group is the aforementioned preset path policy selection group 1, the effective routing table entry is the aforementioned routing table entry 1, the preset path policy selection group 1 includes candidate policy group 1 and candidate policy group 2, and the routing table entry 1 includes next-hop information 1 and next-hop information 2.

[0115] Since the Endpoint in the next hop information 1, namely Spoke11, is in the Endpoint list of candidate policy group 1, candidate policy group 1 can be used as a pending policy group.

[0116] Since the Endpoint in the next hop information 2, namely Spoke12, is in the Endpoint list of candidate policy group 2, candidate policy group 2 can also be used as a pending policy group.

[0117] Since the SRv6 TE policy planned based on the Endpoint (i.e. Spoke11) in the next hop information 1 in the SRv6 TE policy set corresponding to candidate policy group 1 is Policy1, Policy1 is taken as the undetermined SRv6 TE policy.

[0118] Since the SRv6 TE policy planned based on the Endpoint (i.e. Spoke12) in the next hop information 2 in the SRv6 TE policy set corresponding to candidate policy group 2 is Policy2, Policy2 is selected as the pending SRv6 TE policy.

[0119] S103-2, determine the schedulable SRv6 TE policies based on the priority coefficient and policy state of each pending SRv6 TE policy.

[0120] In this embodiment of the invention, step S103-2 can be implemented as follows:

[0121] First, the pending SRv6 TE policy with the highest priority coefficient and a fault-free policy state is selected as the schedulable SRv6 TE policy.

[0122] For example, suppose the pending SRv6 TE policy includes Policy1 (corresponding to) determined from candidate policy group 1 and candidate policy group 2 in the preset path policy selection group 1. Figure 3 Path A) and Policy2 (corresponding to Figure 3 In path B), the path Color corresponding to candidate policy group 1 is 100 with a priority coefficient of 20, and the path Color corresponding to candidate policy group 2 is 200 with a priority coefficient of 10. Policy 1 and Policy 2 are based on...<Endpoint:Spoke11,Color:100> ,<Endpoint:Spoke12,Color:200> They were determined separately.

[0123] When all links in the SRv6 domain are functioning normally, both Policy1 and Policy2 are in the UP state, meaning they are both in a fault-free state. Policy1, with its higher priority, can be used as the schedulable SRv6 TE policy, utilizing the corresponding... Figure 3 Traffic is forwarded via path A in the code.

[0124] when Figure 3 When link A in path A fails, Policy1 is in the DOWN state and Policy2 is in the UP state. That is, Policy1 is in a fault state and Policy2 is in a fault-free state. In this case, Policy2 is used as a schedulable SRv6 TE policy, utilizing the corresponding... Figure 3 Traffic is forwarded via path B in the code.

[0125] In order to perform the corresponding steps in the above method embodiments and various possible implementations, an implementation of a traffic forwarding device 100 applied to an SRv6 head node is given below.

[0126] Please refer to Figure 5 The traffic forwarding device includes a learning module 101 and a determination module 102.

[0127] Learning module 101 is used to learn the service routes to the target service network.

[0128] The determination module 102 is used to determine an effective path policy selection group from multiple preset path policy selection groups based on the service route and the service traffic to be forwarded. The effective path policy selection group includes multiple candidate policy groups, each of which corresponds to a set of SRv6 TE policies planned based on different WAN lines and tail nodes. Based on the service route, the module determines a schedulable SRv6 TE policy from the SRv6 TE policy sets corresponding to each of the multiple candidate policy groups, and imports the service traffic to be forwarded into the schedulable SRv6 TE policy to forward the service traffic.

[0129] Optionally, the service route includes multiple routing table entries, each corresponding to a different service type. The determining module 102 is specifically used to determine a valid routing table entry from the multiple routing table entries based on the type of the service traffic to be forwarded, wherein the service type corresponding to the valid routing table entry is the type of the service traffic to be forwarded; and to determine a valid path policy selection group from multiple preset path policy selection groups based on the service color identifier contained in the next-hop information in the valid routing table entry.

[0130] Optionally, each of the multiple preset path policy selection groups has a different selection group color identifier. When determining the valid path policy selection group from the multiple preset path policy selection groups based on the service color identifier contained in the next hop information in the valid routing table entry, the determining module 102 is specifically used to determine the preset path policy selection group whose selection group color identifier is the service color identifier as the valid path policy selection group.

[0131] Optionally, the determining module 102 is further configured to obtain the service color identifier of the service traffic to be forwarded based on the traffic characteristics of the service traffic to be forwarded; and to determine the effective path strategy selection group from multiple preset path strategy selection groups based on the service color identifier of the service traffic to be forwarded, wherein the selection group color identifier of the effective path strategy selection group is the service color identifier of the service traffic to be forwarded.

[0132] Optionally, the service route includes a valid routing table entry, which includes at least one next-hop information. The determining module 102 is further specifically used to determine all pending SRv6 TE policies from the SRv6 TE policy sets corresponding to each of the multiple candidate policy groups based on the tail node in each next-hop information; and to determine the schedulable SRv6 TE policy based on the priority coefficient and policy status of each pending SRv6 TE policy.

[0133] Optionally, the candidate strategy group includes a tail node list. Different tail nodes in the tail node list are used to plan different preset SRv6 TE strategies in the SRv6 TE strategy set corresponding to the candidate strategy group. When the determining module 102 determines all pending SRv6 TE strategies from the SRv6 TE strategy sets corresponding to multiple candidate strategy groups based on the tail nodes in each next-hop information, specifically for each candidate strategy group, if the tail node list of the candidate strategy group records at least one tail node in the next-hop information, then the candidate strategy group is regarded as a pending strategy group; for each pending strategy group, the preset SRv6 TE strategy planned based on the tail node in any next-hop information in the SRv6 TE strategy set corresponding to the pending strategy group is regarded as a pending SRv6 TE strategy.

[0134] Optionally, when determining a schedulable SRv6 TE strategy based on the priority coefficient and strategy status of each pending SRv6 TE strategy, the determining module 102 specifically selects the pending SRv6 TE strategy with the highest priority coefficient and the strategy status as a fault-free state as the schedulable SRv6 TE strategy.

[0135] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working process of the traffic forwarding device 100 described above can be referred to the corresponding process in the foregoing method embodiments, and will not be repeated here.

[0136] Furthermore, this embodiment of the invention also provides an SRv6 head node 200, please refer to... Figure 6 The SRv6 head node 200 may include a memory 210 and a processor 220.

[0137] The processor 220 may be a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits used to control the execution of a program for controlling the traffic forwarding method provided in the above method embodiments.

[0138] The memory 210 may be a ROM or other type of static storage device capable of storing static information and instructions, RAM or other type of dynamic storage device capable of storing information and instructions, or an electrically erasable programmable-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but not limited thereto. The memory 210 may exist independently and be connected to the processor 220 via a communication bus. The memory 210 may also be integrated with the processor 220. The memory 210 is used to store machine-executable instructions for executing the scheme of this application. The processor 220 is used to execute the machine-executable instructions stored in the memory 210 to implement the above-described method embodiments.

[0139] This invention also provides a computer-readable storage medium containing a computer program, which, when executed, can be used to perform related operations in the traffic forwarding method provided in the above-described method embodiments.

[0140] The above are merely specific embodiments of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A traffic forwarding method, characterized in that, Applied to SRv6 head nodes, the method includes: Learn service routes to reach the target service network; each service route includes multiple routing table entries, and each routing table entry corresponds to a different service type. Based on the type of the service traffic to be forwarded, a valid routing table entry is determined from the plurality of routing table entries, and the service type corresponding to the valid routing table entry is the type of the service traffic to be forwarded. Based on the service color identifier included in the next-hop information of the valid routing table entry, a valid path policy selection group is determined from multiple preset path policy selection groups. Each valid path policy selection group includes multiple candidate policy groups, and each candidate policy group corresponds to a set of SRv6 TE policies planned based on different WAN lines and tail nodes. Each valid routing table entry includes at least one next-hop information. Based on the tail node in each next-hop information, all pending SRv6 TE policies are determined from the SRv6 TE policy sets corresponding to each of the multiple candidate policy groups; based on the priority coefficient and policy state of each pending SRv6 TE policy, a schedulable SRv6 TE policy is determined, and the traffic to be forwarded is imported into the schedulable SRv6 TE policy to forward the traffic to be forwarded.

2. The method as described in claim 1, characterized in that, Each of the multiple preset path policy selection groups has a different selection group color identifier. The step of determining the valid path policy selection group from the multiple preset path policy selection groups based on the service color identifier contained in the next-hop information in the valid routing table entry includes: The preset path strategy selection group whose selection group color is identified by the business color is determined as the effective path strategy selection group.

3. The method as described in claim 1, characterized in that, After learning the service routes to the target service network, the method further includes: Based on the traffic characteristics of the traffic to be forwarded, obtain the service color identifier of the traffic to be forwarded; Based on the service color identifier of the traffic to be forwarded, the effective path policy selection group is determined from a plurality of preset path policy selection groups, and the selection group color identifier of the effective path policy selection group is the service color identifier of the traffic to be forwarded.

4. The method as described in claim 1, characterized in that, The candidate strategy group includes a tail node list, where different tail nodes are used to plan different preset SRv6 TE strategies in the SRv6 TE strategy set corresponding to the candidate strategy group. The step of determining all pending SRv6 TE strategies from the SRv6 TE strategy sets corresponding to each of the multiple candidate strategy groups based on the tail nodes in each next-hop information includes: For each candidate strategy group, if the tail node list of the candidate strategy group records at least one tail node from the next hop information, then the candidate strategy group is designated as a pending strategy group. For each of the pending strategy groups, the preset SRv6 TE strategy planned based on the tail node in any of the next-hop information in the SRv6 TE strategy set corresponding to the pending strategy group is taken as the pending SRv6 TE strategy.

5. The method as described in claim 1, characterized in that, The step of determining the schedulable SRv6 TE policy based on the priority coefficient and policy state of each of the pending SRv6 TE policies includes: The pending SRv6 TE policy with the highest priority coefficient and the policy state being fault-free is selected as the schedulable SRv6 TE policy.

6. A traffic forwarding device, characterized in that, The device, applied to SRv6 domain head nodes, includes: The learning module is used to learn service routes to the target service network. The service routes include multiple routing table entries, each of which corresponds to a different service type. The determination module is configured to: determine a valid routing table entry from a plurality of routing table entries based on the type of the traffic to be forwarded, wherein the type of the valid routing table entry corresponds to the type of the traffic to be forwarded; determine a valid path policy selection group from a plurality of preset path policy selection groups based on the service color identifier contained in the next-hop information of the valid routing table entry, wherein the valid path policy selection group includes a plurality of candidate policy groups, each of the plurality of candidate policy groups corresponding to a set of SRv6 TE policies planned based on different WAN lines and tail nodes, and the valid routing table entry includes at least one next-hop information; determine all pending SRv6 TE policies from the SRv6 TE policy sets corresponding to each of the plurality of candidate policy groups based on the tail node in each of the next-hop information; determine a schedulable SRv6 TE policy based on the priority coefficient and policy status of each pending SRv6 TE policy, and import the traffic to be forwarded into the schedulable SRv6 TE policy to forward the traffic to be forwarded.

7. An SRv6 head node, characterized in that, It includes a memory and a processor, the memory storing a computer program that, when executed by the processor, implements the traffic forwarding method as described in any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that, It stores a computer program that, when executed by a processor, implements the traffic forwarding method as described in any one of claims 1 to 5.

Citation Information

Patent Citations

  • Service flow forwarding method and device based on 5G core network, and equipment

    CN113676959A

  • Adaptive bearing method for multiple types of services based on SRv6 scene

    CN115665038A