Traffic scheduling method and apparatus, and communication node and storage medium

Abstract

Disclosed in the embodiments of the present disclosure are a traffic scheduling method and apparatus, and a communication node and a storage medium. The method comprises: by means of a first path, a first node receiving first information sent by a second node, wherein the first information is sent by the second node after the second node receives second information from a third node, the third node is a forwarding node in a second path between the first node and the second node, and the second information indicates that there is congestion in the second path; and on the basis of the first information, the first node determining that there is congestion in the second path, and performing traffic scheduling on the second path.

Description

Traffic scheduling method, device, communication node and storage medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This disclosure claims priority to Chinese Patent Application No. 202410070899.8 filed in China on January 17, 2024, the entire contents of which are incorporated herein by reference. Technical Field

[0003] The present disclosure relates to the field of communication technology, and in particular to a traffic scheduling method, device, communication node, and storage medium. Background Art

[0004] Traditional Internet Protocol (IP) network traffic scheduling relies on calculating the shortest path based on cost (specifically, the link cost can be derived from link bandwidth information), rather than dynamically routing traffic based on available bandwidth. This can be quite rigid, as even if the shortest path is congested, traffic may not be rerouted. Traffic engineering mechanisms can, to a certain extent, balance the load on network links and more efficiently utilize network resources.

[0005] Traditional traffic engineering (TE) traffic scheduling involves configuring policies (usually at the head node) to identify specific traffic flows and route them along specific paths. This pre-configuration of traffic flows is based on historical experience, allowing some traffic flows to bypass the shortest path. However, this approach lacks real-time performance and struggles to cope with congestion caused by emergencies. Furthermore, it requires collecting network-wide status data for multi-restricted routing calculations, which can be complex.

[0006] In recent years, newer Tactical Traffic Engineering (TTE) solutions have emerged. Once enabled, these solutions automatically trigger nodes to seek out potential network resources for traffic diversion when they predict link congestion (when the link's bandwidth utilization remains above a threshold for a period of time), thus compensating for the reset or decision-making time required by traditional TE. However, this scheduling approach is too dynamic. After TTE is triggered by congestion at the head node of a path, if congestion recurs downstream on the backup path, TTE will be triggered again at intermediate nodes. Since these forwarding nodes (intermediate nodes of the path) face significant forwarding pressure, dynamic routing adjustments at these forwarding nodes are not suitable. Summary of the Invention

[0007] To solve the technical problems existing in related technologies, the embodiments of the present disclosure provide a traffic scheduling method, device, communication node and storage medium.

[0008] To achieve the above objectives, the technical solution of the embodiment of the present disclosure is implemented as follows:

[0009] In a first aspect, an embodiment of the present disclosure provides a traffic scheduling method, which is applied to a first node and includes:

[0010] A first node receives first information sent by a second node via a first path, the first information being sent after the second node receives second information from a third node; the third node is a forwarding node in a second path between the first node and the second node, and the second information indicates that congestion exists on the second path;

[0011] The first node determines, based on the first information, that congestion exists on the second path, and performs traffic scheduling on the second path.

[0012] In the above solution, before the first node receives the first information sent by the second node through the first path, the method further includes:

[0013] The first node obtains first routing policy information, where the first routing policy information includes candidate paths. The candidate paths include multiple paths and a weight value corresponding to each path.

[0014] In the above solution, the second path is one of the multiple paths; wherein,

[0015] The second path is the shortest path among the multiple paths or the path passing through the least nodes, or the second path is the path with the largest weight value among the multiple paths.

[0016] In the above solution, performing traffic scheduling on the second path includes:

[0017] The first node lowers the weight value of the second path and / or increases the weight value of at least one path among the multiple paths except the second path, and performs traffic scheduling of the second path and the at least one path according to the adjusted weight values.

[0018] In the above solution, before the first node receives the first information sent by the second node through the first path, the method further includes:

[0019] The first node obtains second routing policy information, where the second routing policy information includes information about a primary path and information about one or more backup paths, where the backup path information includes a routing prefix, an outbound interface, and a corresponding status, where the status is either an activated state or a deactivated state;

[0020] The second path is the main path.

[0021] In the above solution, performing traffic scheduling on the second path includes:

[0022] The first node adjusts at least one of the backup paths that is in an inactive state to an active state, and performs traffic scheduling of the second path and the at least one backup path adjusted to the active state.

[0023] In the above solution, before the first node determines that congestion exists on the second path based on the first information, the method further includes:

[0024] The first node determines the second path associated with the first path based on a preconfigured first association relationship, and the first path and the second path are reverse paths to each other.

[0025] In the above scheme, the first node receives the first information sent by the second node through the first path, including: the first node receives the first message sent by the second node through the first path, the first indication field in the first message is marked as a first identifier, and the first identifier is used to represent the first information.

[0026] In the above solution, when the first message is forwarded through a node in the first path, the first identifier of the first indication field in the first message is not modified.

[0027] In the above solution, after executing traffic scheduling of the second path, the method further includes:

[0028] The first node does not receive the first information sent by the second node through the first path after a first time, determines that congestion on the second path has been alleviated, and re-executes traffic scheduling on the second path.

[0029] In a second aspect, an embodiment of the present disclosure further provides a traffic scheduling method, which is applied to a second node and includes:

[0030] The second node receives second information from the third node via the second path, where the second information indicates that congestion exists on the second path;

[0031] The second node sends first information to the first node through the first path, where the first information is used by the first node to perform traffic scheduling on the second path.

[0032] In the above solution, before the second node sends the first information to the first node through the first path, the method further includes:

[0033] The second node determines, based on a preconfigured second association relationship, a first path associated with the second path, where the second path and the first path are reverse paths to each other.

[0034] In the above scheme, the second node receives the second information from the third node through the second path, including: the second node receives the second message from the third node through the second path, the first indication field in the second message is marked as the second identifier, and the second identifier is used to represent the second information.

[0035] In the above solution, the second node sends the first information to the first node through the first path, including:

[0036] The second node sends a first message to the first node through the first path. The first indication field in the first message is marked as a first identifier, and the first identifier is used to represent the first information.

[0037] In the above solution, when the first message is forwarded through a node in the first path, the first identifier of the first indication field in the first message is not modified.

[0038] In a third aspect, an embodiment of the present disclosure further provides a traffic scheduling method, which is applied to a third node and includes:

[0039] When the third node senses congestion, it sends second information to the second node through the second path. The second information indicates that there is congestion on the second path. The second information is used by the second node to send first information to the first node. The third node is a forwarding node in the second path between the first node and the second node.

[0040] In the above solution, the sending of the second information to the second node through the second path includes:

[0041] The third node sends a second message to the second node through the second path, the first indication field in the second message is marked as a second identifier, and the second identifier is used to represent the second information.

[0042] In a fourth aspect, an embodiment of the present disclosure further provides a traffic scheduling device, which is applied to a first node and includes: a first communication unit and a first processing unit; wherein,

[0043] the first communication unit is configured to receive, via a first path, first information sent by a second node, the first information being sent after the second node receives second information from a third node; the third node being a forwarding node in a second path between the first node and the second node, and the second information indicating congestion on the second path;

[0044] The first processing unit is configured to determine, based on the first information, that congestion exists on the second path, and perform traffic scheduling on the second path.

[0045] In the fifth aspect, an embodiment of the present disclosure also provides a traffic scheduling device, which is applied to a second node, and the device includes: a second communication unit, used to receive second information from a third node through a second path, and the second information indicates that there is congestion on the second path; and also used to send first information to the first node through the first path, and the first information is used for the first node to perform traffic scheduling on the second path.

[0046] In the sixth aspect, an embodiment of the present disclosure also provides a traffic scheduling device, which is applied to a third node, and the device includes: a third communication unit, which is used to send second information to the second node through a second path when congestion is sensed, and the second information indicates that there is congestion on the second path, and the second information is used by the second node to send first information to the first node, and the third node is a forwarding node in the second path between the first node and the second node.

[0047] In the seventh aspect, the embodiments of the present disclosure further provide a computer-readable storage medium on which a computer program is stored, which, when executed by a processor, implements the steps of the traffic scheduling method described in the first aspect, second aspect or third aspect of the embodiments of the present disclosure.

[0048] In the eighth aspect, an embodiment of the present disclosure also provides a communication node, including a memory, a processor, and a computer program stored in the memory and runnable on the processor, wherein when the processor executes the program, the steps of the traffic scheduling method described in the first aspect, the second aspect, or the third aspect of the embodiment of the present disclosure are implemented.

[0049] The traffic scheduling method, device, communication node and storage medium provided by the embodiments of the present disclosure include: a first node receives a first message sent by a second node through a first path, and the first message is sent after the second node receives a second message from a third node; the third node is a forwarding node in the second path between the first node and the second node, and the second message indicates that the second path is congested; the first node determines that the second path is congested based on the first information, and performs traffic scheduling on the second path. Using the technical solution of the embodiments of the present disclosure, when the third node senses congestion, there is no need to configure TTE at the third node, and information can still be sent according to the original destination node (the second node). The second node sends the first message to the first node, thereby performing TTE (i.e., traffic scheduling) at the first node, and avoiding the problem of traffic congestion as much as possible. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] FIG1 is a flow chart of a traffic scheduling method according to an embodiment of the present disclosure;

[0051] FIG2 is a schematic diagram of an application scenario of the traffic scheduling method according to an embodiment of the present disclosure;

[0052] FIG3 is a schematic diagram of an SR strategy in a traffic scheduling method according to an embodiment of the present disclosure;

[0053] FIG4 is a second schematic diagram of an application scenario of the traffic scheduling method according to an embodiment of the present disclosure;

[0054] FIG5 is a schematic diagram of an ECN mechanism in a traffic scheduling method according to an embodiment of the present disclosure;

[0055] FIG6 is a second flow chart of the traffic scheduling method according to an embodiment of the present disclosure;

[0056] FIG7 is a third flow chart of the traffic scheduling method according to an embodiment of the present disclosure;

[0057] FIG8 is a schematic diagram of the first structure of the flow scheduling device according to an embodiment of the present disclosure;

[0058] FIG9 is a second schematic diagram of the structure of the flow scheduling device according to an embodiment of the present disclosure;

[0059] FIG10 is a third structural diagram of the flow scheduling device according to an embodiment of the present disclosure;

[0060] FIG11 is a schematic diagram of the hardware structure of a communication node according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0061] The present disclosure will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0062] The technical solutions of the embodiments of the present disclosure can be applied to various communication systems, such as the Global System of Mobile communication (GSM) system, the Long Term Evolution (LTE) system, or the 54th Generation mobile communication technology (5G) system. Optionally, the 5G system or 5G network can also be referred to as a New Radio (NR) system or NR network.

[0063] Exemplarily, the communication system applied in the embodiments of the present disclosure may include a network device and a terminal device (also referred to as a terminal, a communication terminal, etc.); the network device may be a device that communicates with the terminal device. Among them, the network device can provide communication coverage within a certain area and can communicate with terminals located in the area. Optionally, the network device can be a base station in each communication system, such as an evolved base station (Evolutional Node B, eNB) in an LTE system, or a base station (the next Generation Node B, gNB) in a 5G system or an NR system.

[0064] It should be understood that in the embodiments of the present disclosure, devices with communication functions in a network / system may be referred to as communication devices. Communication devices may include network devices and terminals with communication functions. The network devices and terminal devices may be the specific devices described above and will not be described in detail here. Communication devices may also include other devices in the communication system, such as network controllers, mobility management entities, and other network entities, which are not limited in the embodiments of the present disclosure.

[0065] It should be understood that the terms "system" and "network" are often used interchangeably herein. The term "and / or" is simply a description of an association between related objects, indicating that three possible relationships exist. For example, "A and / or B" can represent: A exists alone, A and B exist simultaneously, or B exists alone. Furthermore, the character " / " generally indicates that the related objects are in an "or" relationship.

[0066] The terms "first," "second," and the like in the specification and claims of the present disclosure are used to distinguish similar objects and are not necessarily used to describe a particular order or sequential sequence. It should be understood that the terms used in this manner are interchangeable where appropriate, so that the embodiments of the present disclosure described herein can, for example, be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having," and any variations thereof, are intended to cover non-exclusive inclusions, e.g., a process, method, system, product, or apparatus comprising a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units that are not explicitly listed or that are inherent to these processes, methods, products, or apparatus.

[0067] The present disclosure provides a traffic scheduling method. FIG1 is a flow chart of the traffic scheduling method according to the present disclosure. As shown in FIG1 , the method includes:

[0068] Step 101: A first node receives first information sent by a second node via a first path. The first information is sent after the second node receives second information from a third node. The third node is a forwarding node in a second path between the first node and the second node. The second information indicates that congestion exists on the second path.

[0069] Step 102: The first node determines that congestion exists on the second path based on the first information, and performs traffic scheduling on the second path.

[0070] In this embodiment, the first node, the second node and the third node can all be referred to as operator nodes; in a distributed routing scenario, the first node and the second node are operator edge (Provider Edge, PE) nodes, or can also be referred to as edge nodes for short; wherein, the first node is an ingress PE, or can also be referred to as a head node, a source node, or a tunnel source node, and the second node is an egress PE, or can also be referred to as a tail node, a target (or destination) node, or a tunnel target (or destination) node. The third node is an operator (Provider, P) node, or can also be referred to as a node, a forwarding node, an intermediate node, a routing node, etc. Referring to the application scenario shown in Figure 2, the ingress 1 (Ingress1, I1) node, the egress 1 (Egress1, E1) node, and the egress 2 (Egress2, E2) node are all PE nodes, wherein the I1 node is the first node, and the second node is one of the E1 node and the E2 node; the R1 node-R6 node can all serve as P nodes, and the third node can be one of the R1 node-R6 node.

[0071] In this embodiment, there are at least two paths between the first node and the second node as PE nodes, that is, the service or traffic can be transmitted in at least one path according to the policy and sent from the first node to the second node. The second path can be called a default path, an active path, or a main path, that is, the first node uses the second path to transmit the service or traffic to the second node according to the policy, or mainly uses the second path to transmit the service or traffic to the second node. The first node mainly uses the second path to transmit the service or traffic to the second node, which specifically means that in addition to using the second path, other paths can also be used to transmit the service or traffic between the first node and the second node, but the proportion of using the second path to transmit the service or traffic is greater than the proportion of using other paths to transmit the service or traffic.

[0072] In this embodiment, the third node is located on the second path. When the third node, acting as a P node or a forwarding node, senses congestion, the third node continues to transmit second information indicating congestion via the second path until the second information is sent to the second node. After receiving the second information, the second node, acting as an egress PE node, determines that congestion has occurred somewhere along the second path, and then sends first information to the first node, acting as an ingress PE node, via the first path. The first information may indicate congestion or congestion on the path, and the first node performs relevant adjustments, which may include adjusting traffic distribution, activating backup paths, and so on. The first path and the second path are reverse paths to each other. For example, the first path is a tunnel path from the second node to the first node, and the second path is a tunnel path from the first node to the second node.

[0073] Conventional TTE requires both PE and P nodes to be configured. In response to PE congestion, the PE node can execute TTE to divert traffic. However, if congestion reoccurs at a P node along the diverted path (possibly due to the diverted traffic), the congested P node will execute TTE again to divert traffic, introducing significant uncertainty in traffic forwarding. Furthermore, in this case, TTE deployment requires updating all P nodes, significantly impacting traffic flow.

[0074] The most significant difference between this embodiment and traditional TTE solutions is that it configures and enables TTE only on edge nodes (e.g., the first node), not on P nodes. This raises the question of how PE nodes can detect P node congestion and perform TTE processing.

[0075] Based on this, in the embodiment of the present disclosure, when the third node senses congestion, there is no need to configure TTE at the third node. It is only necessary to send information according to the original destination node (second node) or according to the original path (second path). The second node sends the first information to the first node through the reverse path (first path) of the second path, thereby performing TTE (i.e., traffic scheduling) at the first node, which can avoid the problem of traffic congestion as much as possible.

[0076] In some optional embodiments of the present disclosure, before the first node receives the first information sent by the second node through the first path, the method further includes: the first node obtains first routing policy information, the first routing policy information includes candidate paths, and the candidate paths include multiple paths and a weight value corresponding to each path.

[0077] This embodiment is applicable to the weighted path scenario. The first node obtains the first routing policy information, which can be called the segment routing (SR) policy (SR Policy). The first routing policy information may include the source address, the destination address and the color (color), or the first routing policy information may include the headend (Headend), the endpoint (Endpoint) and the color (color); the headend (Headend) indicates the place where the policy is generated / implemented; the endpoint (Endpoint) indicates the end point of the policy, which can be an Internet Protocol version 4 (IPv4) / Internet Protocol version 6 (IPv6) address; the color (color) is used to distinguish multiple SR Policies between the same headend and endpoint pair, and can be represented by any 32-bit value.

[0078] In this embodiment, there are multiple first routing policy information (or first SR Policies) between the first node and the second node, and each first routing policy information includes a candidate path (candidate Path), and each candidate path may include one or more segment routing identifier (Segment Routing ID, SID) lists (SID list), including a weight value (weight). Taking the first routing policy information as SR Policy as an example, as shown in Figure 3, the SR Policy may include multiple candidate paths. In Figure 3, the candidate path is represented as path; wherein, the candidate path may also include multiple paths, and the multiple paths included in the candidate path are reflected in the form of SID lists. For example, in Figure 3, Path1 corresponds to two SID lists, which are respectively recorded as SID lists. 11 and SID list 12 , where SID list 11 The corresponding weight value is Weight 1, and the corresponding weight value is Weight 4. In other optional embodiments, the candidate path included in the first routing policy information may also include one path, for example, Path 2 in FIG3 corresponds to a SID list, but the SID list does not correspond to a weight value.

[0079] It should be noted that, as shown in Figure 3, the candidate paths of the SR Policy can be provided by local configuration, such as Path1 and Path2. In other optional embodiments, the candidate paths can also be provided by Border Gateway Protocol (BGP) Segment Routing Traffic Engineering (SRTE), but the source of the path does not affect the selection. The path selection depends on the validity and priority (Preference, Pref).

[0080] In some optional embodiments, the second path is one of the multiple paths; wherein the second path is the shortest path among the multiple paths or the path passing through the fewest nodes, or the second path is the path with the largest weight value among the multiple paths.

[0081] In this embodiment, before executing traffic scheduling of the second path, or in the initial state, the second path for business or traffic transmission between the first node and the second node is selected as the default path. The second path is one of the multiple paths included in the candidate paths in the first routing policy information, for example, the shortest path among the multiple paths or the path with the fewest nodes passed through, or the second path is the path with the largest weight value among the multiple paths.

[0082] In some optional embodiments, executing traffic scheduling of the second path includes: the first node lowering the weight value of the second path, and / or increasing the weight value of at least one path among the multiple paths except the second path, and executing traffic scheduling of the second path and the at least one path according to the adjusted weight values.

[0083] Taking the scenario shown in Figure 2 as an example, for the I1 node, in its corresponding first routing policy information (or first SR Policy), the candidate paths (such as path) included include two SID lists, that is, corresponding to two paths. The paths are Path 1 (corresponding to SID list1): <R1 node, R2 node, E node 1> and Path 2 (corresponding to SID list2): <R4 node, R5 node, R6 node, E1 node>. Among them, Path 1 is set as the default path, and the weight value is, for example, 2; Path 2 is the backup path, and the weight value is, for example, 0. Normally, the traffic between the I1 node and the E1 node is default to be transmitted through Path 1 because it is the shortest path, passing through fewer nodes and occupying less network resources as much as possible. However, when the network traffic is unbalanced, for example, the traffic of Path 1 continues to have a large load, load balancing is started, the weight value of Path 1 (corresponding to SID list1) is decreased, and / or the weight value of Path 2 (corresponding to SID list2) is increased. Assuming that only the weight value of Path 2 (corresponding to SID list2) is increased to 1, the traffic is load-shared between Path 1 and Path 2 in a ratio of 2:1, which is equivalent to Path 2 taking part of the traffic of Path 1 and reducing the load of Path 1.

[0084] In some other optional embodiments of the present disclosure, before the first node receives the first information sent by the second node through the first path, the method further includes: the first node obtains second routing policy information, and the second routing policy information includes information of the primary path and information of one or more backup paths. The information of the backup path includes a routing prefix, an egress interface, and a corresponding status, and the status is an active state or a deactivated state; then the second path is the primary path.

[0085] This embodiment is applicable to the scenario of activating the backup path. The first node obtains second routing policy information, and the second routing policy information will trigger the first node to generate or update a routing forwarding table or routing entries; there are multiple paths between the first node and the second node, and this path can be called a tunnel. The relevant information of the multiple paths (tunnels) can be in the routing forwarding table or routing entries. Among them, the multiple paths (tunnels) can include a primary path and a backup path, and the primary path is default to be in an active state; the information of the backup path can include that the corresponding path is in an active state or a deactivated state. Exemplarily, the second node can publish one or more routing policies, and the first node can generate a routing forwarding table or routing entries to reach the second node based on the one or more routing policies (i.e., the second routing policy information) published by the second node, and perform traffic scheduling according to the routing forwarding table or routing entries.

[0086] It should be noted that the second routing policy information is provided by the second node; in other alternative embodiments, the second routing policy information may also be provided by a controller, a control node, or a control function in the network.

[0087] In some alternative embodiments, performing traffic scheduling for the second path includes: the first node adjusts at least one standby path in the standby path that is in an inactive state to an active state, and performs traffic scheduling for the second path and at least one standby path adjusted to an active state.

[0088] In this embodiment, before performing traffic scheduling for the second path, or in the initial state, the first node may generate or update a routing forwarding table or routing entry according to the second routing policy information, and select an active path among multiple paths to the second node according to the routing forwarding table or routing entry for traffic transmission; among them, the active path includes the second path as the primary path; in other alternative embodiments, the active path may also include an active alternative path. When the second path is congested or has a large load, the alternative path can be started, that is, the originally inactive alternative path is switched to an active state, and the traffic is matched to the newly switched active alternative path, thereby reducing the load pressure on the primary path.

[0089] As shown in the scenario of FIG. 4, for the I1 node, the corresponding second routing policy information includes Path 1 (Tunnel1) and Path 2 (Tunnel2). Path 1 (Tunnel1) is <R1 node, R2 node, E node 1>, and Path 2 (Tunnel2) is <R4 node, R5 node, R6 node, E1 node>. In this example, it is set that Path 1 (Tunnel1) is the default path and is default in an active state, and Path 2 (Tunnel2) is the alternative path and is in an inactive state. In this case, the traffic between the I1 node and the E1 node is default transmitted through Path 1 because it is the shortest path and passes through fewer nodes, occupying as little network resources as possible. However, when the network traffic is unbalanced, for example, the traffic of Path 1 continues to have a large load, the alternative path is started, for example, Path 2 (Tunnel2) is switched to an active state, and while matching the traffic to Path 1 (Tunnel1) for transmission, part of the traffic is matched to Path 2 (Tunnel2) for transmission.

[0090] In some alternative embodiments of the present disclosure, after performing traffic scheduling for the second path, the method further includes: when the first node does not receive the first information sent by the second node through the first path after a first time, it is determined that the congestion of the second path has been alleviated, and the traffic scheduling for the second path is re - executed.

[0091] In this embodiment, if the first node does not receive the first information sent by the second node through the first path after the first time, that is, it is determined that one or some congestion on the second path has been relieved, or it is determined that the congestion of the second path has been relieved or the traffic load is lower than the threshold, then the traffic scheduling of the second path can be re-executed, for example, in the weighted path scenario, the weight value of the second path is re-adjusted, and / or the weight value of at least one path other than the second path in the multiple paths is lowered. For example, in the scenario shown in Figure 2, the weight value of path 2 (corresponding to SID list2) is readjusted to 0, so that path 2 does not participate in load sharing, and all traffic is transmitted through path 1. Alternatively, in the scenario of activating the backup path, at least one backup path in the backup path that is in an activated state is readjusted to an inactivated state, and the traffic scheduling of the second path is re-executed, that is, all traffic is transmitted through the second path, or the traffic scheduling of the second path and at least one backup path adjusted to an activated state is re-executed. For example, in the scenario shown in Figure 4, the state of path 2 (Tunnel2) is readjusted to an inactivated state (deactive).

[0092] In some optional embodiments of the present disclosure, before the first node determines that congestion exists on the second path based on the first information, the method further includes: the first node determines, based on a preconfigured first association relationship, the second path associated with the first path, the first path and the second path being reverse paths to each other.

[0093] In this embodiment, the first node receives the first information sent by the second node through the first path. The first information can only indicate that there is congestion on the path, but the specific path where the congestion occurs needs to be determined through the first path where the first information is received. That is, the first node can determine, based on the preconfigured first association relationship, that the first path where the first information is received and the second path are reverse paths to each other, and thus determine that congestion occurs somewhere on the second path, thereby performing traffic scheduling on the second path.

[0094] In some optional embodiments of the present disclosure, the first node receives the first information sent by the second node through the first path, including: the first node receives the first message sent by the second node through the first path, the first indication field in the first message is marked as a first identifier, and the first identifier is used to represent the first information.

[0095] In this embodiment, the notification of relevant information is implemented with reference to the traditional Explicit Congestion Notification (ECN). The traditional ECN mechanism enables the ECN flag in the IP header when encapsulating the outer IP. The ECN flag is usually 2 bits and has four encoding formats. The ECN flag is marked when the link is congested or about to be congested. Referring to Figure 5, the traditional ECN mechanism includes the following steps:

[0096] 1. The sender (source node) sends an ECN-capable packet with the ECN flag set to 10 or 10. 2. If congestion occurs at a router, the ECN flag is changed to 11, indicating that the packet is marked by a router. 3. The receiver (destination node) responds with an ACK indicating an ECN response (ECN-echo, ECE). 4. The sender (source node) processes the received packet and responds with a congestion window reduction (CWR). After receiving the CWR, the receiver no longer marks the ECE flag.

[0097] The embodiments of the present disclosure do not involve ECE and CWR. Specifically, when the first node transmits business traffic to the second node through the second path, the business or traffic is reflected in the form of a message, and the ECN flag position in the message is 10; when the third node in the second path detects congestion, the ECN flag in the message is changed to 11; when the second node receives the message, if the ECN flag is 10, no response is made. If the ECN flag is 11, a first message is sent to the first node through the reverse path of the second path (i.e., the first path), and the first indication field in the first message is marked with a first identifier, and the first identifier is, for example, 01, to indicate congestion; the first node receives the first message, and determines that the path is congested according to the first identifier in the first message, and can determine the second path that is the reverse of the first path through the pre-configured first association relationship, that is, determine that the second path is congested, and then perform traffic scheduling of the second path.

[0098] In some optional embodiments, when the first message is forwarded through a node in the first path, the first identifier of the first indication field in the first message is not modified.

[0099] In this embodiment, when the first message is transmitted between the second node and the first node through the first path, it passes through each node (P node) in the first path. Then, when each node (P node) receives the first message, it does not modify the first identifier in the first message.

[0100] Based on the above embodiments, the present disclosure also provides a traffic scheduling method. FIG6 is a flow chart of the traffic scheduling method according to the present disclosure. As shown in FIG6 , the method includes:

[0101] Step 201: A second node receives second information from a third node via a second path, where the second information indicates that congestion exists on the second path.

[0102] Step 202: The second node sends first information to the first node through the first path, where the first information is used by the first node to perform traffic scheduling on the second path.

[0103] In this embodiment, the first node, the second node, and the third node may all be referred to as operator nodes. In a distributed routing scenario, the first node and the second node are PE nodes, or may also be referred to as edge nodes. The first node is an ingress PE, or may also be referred to as a head node, a source node, or a tunnel source node, and the second node is an egress PE, or may also be referred to as a tail node, a target (or destination) node, or a tunnel target (or destination) node. The third node is a P node, or may also be referred to as a node, a forwarding node, an intermediate node, a routing node, and so on. Referring to the application scenario shown in FIG2 , the ingress 1 (I1) node, the egress 1 (E1) node, and the egress 2 (E2) node are all PE nodes, wherein the I1 node is the first node, and the second node is one of the E1 and E2 nodes. The R1-R6 nodes may all serve as P nodes, and the third node may be one of the R1-R6 nodes.

[0104] In some optional embodiments, before the second node sends the first information to the first node through the first path, the method further includes: the second node determines the first path associated with the second path based on a preconfigured second association relationship, and the second path and the first path are reverse paths to each other.

[0105] In this embodiment, when the third node on the second path senses congestion, it continues to forward the second information indicating that the second path is congested to the second node along the second path; after receiving the second information, the second node uses a preconfigured second association relationship to find a first path that is a reverse path to the second path, and sends the first information to the first node via the first path. The first information may indicate congestion or congestion on the path. After the first node receives the first information, the first node performs relevant adjustments, which may include adjusting traffic distribution, activating backup paths, and so on. The first path and the second path are reverse paths to each other. For example, the first path is a tunnel path from the second node to the first node, and the second path is a tunnel path from the first node to the second node.

[0106] In some optional embodiments, the second node receives the second information from the third node via the second path, including: the second node receives the second message from the third node via the second path, the first indication field in the second message is marked as a second identifier, and the second identifier is used to represent the second information.

[0107] In some optional embodiments, the second node sends the first information to the first node via the first path, including: the second node sends a first message to the first node via the first path, the first indication field in the first message is marked as a first identifier, and the first identifier is used to represent the first information.

[0108] In this embodiment, when the first node transmits service traffic to the second node via the second path, the service or traffic is reflected in the form of a message, and the ECN flag bit in the message is 10; when the third node in the second path detects congestion, it continues to send a message to the second node via the second path. This message can be recorded as a second message, and the ECN flag bit in the second message is changed to 11; when the second node receives the message, if the ECN flag bit is 10, it does not respond; if the ECN flag bit is 11, it sends a first message to the first node via the reverse path of the second path (i.e., the first path), and the first indicator field in the first message is marked with a first identifier, for example, 01, which is used to indicate congestion; after receiving the first message, the first node determines that the path is congested based on the first identifier in the first message.

[0109] In some optional embodiments, when the first message is forwarded through a node in the first path, the first identifier of the first indication field in the first message is not modified.

[0110] In this embodiment, when the first message is transmitted between the second node and the first node through the first path, it passes through each node (P node) in the first path. Then, when each node (P node) receives the first message, it does not modify the first identifier in the first message.

[0111] The present disclosure also provides a traffic scheduling method. FIG7 is a flow chart of the traffic scheduling method according to the present disclosure. As shown in FIG7 , the method includes:

[0112] Step 301: When the third node senses congestion, it sends second information to the second node through the second path. The second information indicates that there is congestion on the second path. The second information is used by the second node to send first information to the first node. The third node is a forwarding node in the second path between the first node and the second node.

[0113] In some optional embodiments, sending the second information to the second node via the second path includes: the third node sending a second message to the second node via the second path, the first indication field in the second message is marked as a second identifier, and the second identifier is used to represent the second information.

[0114] Based on the above embodiment, the present disclosure also provides a traffic scheduling device, which is applied to the first node. Figure 8 is a schematic diagram of the structure of the traffic scheduling device of the present disclosure embodiment; As shown in Figure 8, the device includes: a first communication unit 11 and a first processing unit 12; wherein,

[0115] The first communication unit 11 is configured to receive, via a first path, first information sent by a second node, the first information being sent after the second node receives second information from a third node; the third node being a forwarding node in a second path between the first node and the second node, and the second information indicating congestion on the second path;

[0116] The first processing unit 12 is configured to determine that congestion exists on the second path based on the first information, and perform traffic scheduling on the second path.

[0117] In some optional embodiments of the present disclosure, the first processing unit 12 is further used to obtain first routing policy information before the first communication unit 11 receives the first information sent by the second node through the first path, where the first routing policy information includes candidate paths, and the candidate paths include multiple paths and a weight value corresponding to each path.

[0118] In some optional embodiments of the present disclosure, the second path is one of the multiple paths; wherein,

[0119] The second path is the shortest path among the multiple paths or the path passing through the least nodes, or the second path is the path with the largest weight value among the multiple paths.

[0120] In some optional embodiments of the present disclosure, the first processing unit 12 is used to lower the weight value of the second path and / or increase the weight value of at least one path among the multiple paths except the second path, and perform traffic scheduling of the second path and the at least one path according to the adjusted weight values.

[0121] In some optional embodiments of the present disclosure, the first processing unit 12 is further configured to obtain second routing policy information before the first communication unit 11 receives the first information sent by the second node through the first path, where the second routing policy information includes information about a primary path and information about one or more backup paths, where the information about the backup paths includes a routing prefix, an outbound interface, and a corresponding status, where the status is an activated state or a deactivated state;

[0122] The second path is the main path.

[0123] In some optional embodiments of the present disclosure, the first processing unit 12 is configured to adjust at least one of the backup paths that is in an inactive state to an active state, and perform traffic scheduling of the second path and the at least one backup path adjusted to the active state.

[0124] In some optional embodiments of the present disclosure, the first processing unit 12 is further configured to determine, before determining based on the first information that congestion exists on the second path, the second path associated with the first path based on a preconfigured first association relationship, where the first path and the second path are reverse paths to each other.

[0125] In some optional embodiments of the present disclosure, the first communication unit 11 is configured to receive a first message sent by a second node through a first path, wherein the first indication field in the first message is marked as a first identifier, and the first identifier is used to represent the first information.

[0126] In some optional embodiments of the present disclosure, when the first message is forwarded through a node in the first path, the first identifier of the first indication field in the first message is not modified.

[0127] In some optional embodiments of the present disclosure, the first processing unit 12 is further configured to, after executing traffic scheduling on the second path, determine that congestion on the second path has been alleviated if the first communication unit 11 does not receive the first information sent by the second node through the first path after a first time, and re-execute traffic scheduling on the second path.

[0128] In the embodiment of the present disclosure, the first processing unit 12 in the device can be implemented by a central processing unit (CPU), a digital signal processor (DSP), a microcontroller unit (MCU) or a field-programmable gate array (FPGA) in actual applications; the first communication unit 11 in the device can be implemented by a communication module (including: basic communication kit, operating system, communication module, standardized interface and protocol, etc.) and a transceiver antenna in actual applications.

[0129] The present disclosure also provides a traffic scheduling device, which is applied to a second node. Figure 9 is a second schematic diagram of the structure of the traffic scheduling device of the present disclosure. As shown in Figure 9, the device includes: a second communication unit 21, which is used to receive second information from a third node via a second path, the second information indicating congestion on the second path; and further used to send first information to a first node via a first path, the first information being used by the first node to perform traffic scheduling on the second path.

[0130] In some optional embodiments of the present disclosure, the device also includes a second processing unit 22, which is used to determine the first path associated with the second path based on a preconfigured second association relationship before the second communication unit 21 sends the first information to the first node through the first path, and the second path and the first path are reverse paths to each other.

[0131] In some optional embodiments of the present disclosure, the second communication unit 21 is configured to receive a second message from a third node via a second path, the first indication field in the second message is marked as a second identifier, and the second identifier is used to represent the second information.

[0132] In some optional embodiments of the present disclosure, the second communication unit 21 is configured to send a first message to the first node via a first path, wherein the first indication field in the first message is marked as a first identifier, and the first identifier is used to represent the first information.

[0133] In some optional embodiments of the present disclosure, when the first message is forwarded through a node in the first path, the first identifier of the first indication field in the first message is not modified.

[0134] In the embodiment of the present disclosure, the second processing unit 22 in the device can be implemented by a CPU, DSP, MCU or FPGA in actual applications; the second communication unit 21 in the device can be implemented by a communication module (including: basic communication kit, operating system, communication module, standardized interface and protocol, etc.) and a transceiver antenna in actual applications.

[0135] The present disclosure also provides a traffic scheduling device, which is applied to a third node. Figure 10 is a schematic diagram of the third structure of the traffic scheduling device of the present disclosure; as shown in Figure 10, the device includes: a third communication unit 31, which is used to send second information to the second node via a second path when congestion is detected, wherein the second information indicates that congestion exists on the second path, and the second information is used by the second node to send first information to the first node, and the third node is a forwarding node in the second path between the first node and the second node.

[0136] In some optional embodiments of the present disclosure, the third communication unit 31 is configured to send a second message to the second node via a second path, wherein the first indication field in the second message is marked as a second identifier, and the second identifier is used to represent the second information.

[0137] In the embodiment of the present disclosure, the third communication unit 31 in the device can be implemented in actual applications through a communication module (including: basic communication kit, operating system, communication module, standardized interface and protocol, etc.) and a transceiver antenna.

[0138] It should be noted that the traffic scheduling device provided in the above embodiment only uses the division of the above program modules as an example to illustrate traffic scheduling. In actual applications, the above processing can be assigned to different program modules as needed, that is, the internal structure of the device can be divided into different program modules to complete all or part of the processing described above. In addition, the traffic scheduling device provided in the above embodiment and the traffic scheduling method embodiment are of the same concept. The specific implementation process is detailed in the method embodiment and will not be repeated here.

[0139] The present disclosure also provides a communication node, which can be a first node, a second node, or a third node. FIG11 is a schematic diagram of the hardware structure of the communication node according to the present disclosure. As shown in FIG11 , the communication node includes a memory 42, a processor 41, and a computer program stored in the memory 42 and executable on the processor 41. When the processor 41 executes the program, the steps of the traffic scheduling method applied to the first node, the second node, or the third node according to the present disclosure are implemented.

[0140] Optionally, the communication node also includes at least one network interface 43. The various components in the communication node are coupled together via a bus system 44. It will be appreciated that bus system 44 is used to enable connectivity and communication between these components. In addition to a data bus, bus system 44 also includes a power bus, a control bus, and a status signal bus. However, for clarity, in FIG11 , all of these buses are labeled as bus system 44.

[0141] It is understood that the memory 42 can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic random access memory (FRAM), a flash memory, a magnetic surface memory, an optical disk, or a compact disc read-only memory (CD-ROM); the magnetic surface memory can be a magnetic disk memory or a magnetic tape memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), SyncLink Dynamic Random Access Memory (SLDRAM), and Direct Rambus Random Access Memory (DRRAM).The memory 42 described in the embodiments of the present disclosure is intended to include, but is not limited to, these and any other suitable types of memory.

[0142] The methods disclosed in the above embodiments of the present disclosure can be applied to or implemented by the processor 41. The processor 41 may be an integrated circuit chip with signal processing capabilities. During implementation, the steps of the above methods can be completed by hardware integrated logic circuits in the processor 41 or instructions in software form. The above processor 41 may be a general-purpose processor, a DSP, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The processor 41 can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present disclosure. A general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in the embodiments of the present disclosure can be directly embodied as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium, which is located in the memory 42. The processor 41 reads the information in the memory 42 and completes the steps of the above methods in combination with its hardware.

[0143] In an exemplary embodiment, the communication node may be implemented by one or more application-specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), complex programmable logic devices (CPLDs), FPGAs, general-purpose processors, controllers, MCUs, microprocessors, or other electronic components to perform the aforementioned method.

[0144] In an exemplary embodiment, the present disclosure further provides a computer-readable storage medium, such as a memory 42 including a computer program. The computer program can be executed by a processor 41 of a communication node to perform the steps of the aforementioned method. The computer-readable storage medium can be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface mount storage, optical disk, or CD-ROM; or various devices including any one or any combination of the aforementioned memories.

[0145] The computer-readable storage medium provided by the embodiment of the present disclosure stores a computer program thereon, which, when executed by a processor, implements the steps of the traffic scheduling method applied to the first node, the second node, or the third node by the embodiment of the present disclosure.

[0146] The methods disclosed in the several method embodiments provided in this disclosure can be arbitrarily combined without conflict to obtain new method embodiments.

[0147] The features disclosed in the several product embodiments provided in this disclosure can be arbitrarily combined without conflict to obtain new product embodiments.

[0148] The features disclosed in several method or device embodiments provided in this disclosure may be arbitrarily combined without conflict to obtain new method embodiments or device embodiments.

[0149] In the several embodiments provided in the present disclosure, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as: multiple units or components can be combined, or can be integrated into another system, or some features can be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical or other forms.

[0150] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0151] In addition, all functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above-mentioned integrated units may be implemented in the form of hardware or in the form of hardware plus software functional units.

[0152] Those skilled in the art will understand that all or part of the steps of implementing the above-mentioned method embodiment can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps of the above-mentioned method embodiment; and the aforementioned storage medium includes: mobile storage devices, ROM, RAM, disks or optical disks, etc. Various media that can store program codes.

[0153] Alternatively, if the above-mentioned integrated unit of the present disclosure is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present disclosure is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the methods described in each embodiment of the present disclosure. The aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROM, RAM, magnetic disks or optical disks.

[0154] The above description is merely a specific embodiment of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this disclosure should be included in the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.

Claims

1. A traffic scheduling method, which is applied to a first node, and the method includes: The first node receives first information sent by a second node through a first path, and the first information is sent after the second node receives second information from a third node; The third node is a forwarding node in a second path between the first node and the second node, and the second information indicates that there is congestion in the second path; The first node determines that there is congestion in the second path based on the first information, and performs traffic scheduling for the second path.

2. The method according to claim 1, wherein Before the first node receives the first information sent by the second node through the first path, the method further includes: The first node obtains first routing policy information, and the first routing policy information includes candidate paths, and the candidate paths include multiple paths and weight values corresponding to each path.

3. The method according to claim 2, wherein, The second path is one of the multiple paths; wherein, The second path is the shortest path or the path with the fewest nodes among the multiple paths, or the second path is the path with the largest weight value among the multiple paths.

4. The method according to claim 2 or 3, wherein The performing traffic scheduling for the second path includes: The first node lowers the weight value of the second path, and / or raises the weight value of at least one path other than the second path among the multiple paths, and performs traffic scheduling for the second path and the at least one path according to the adjusted weight values.

5. The method according to claim 1, wherein Before the first node receives the first information sent by the second node through the first path, the method further includes: The first node obtains second routing policy information, and the second routing policy information includes information about a primary path and information about one or more backup paths. The information about the backup paths includes a routing prefix, an egress interface, and a corresponding status, and the status is an active state or a deactivated state; The second path is the primary path.

6. The method according to claim 5, wherein The performing traffic scheduling for the second path includes: The first node adjusts at least one backup path in the non-active state among the backup paths to the active state, and performs traffic scheduling for the second path and at least one backup path adjusted to the active state.

7. The method according to claim 1, wherein Before the first node determines that there is congestion in the second path based on the first information, the method further includes: The first node determines the second path associated with the first path based on a pre-configured first association relationship, and the first path and the second path are reverse paths to each other.

8. The method according to claim 1, wherein The first node receiving the first information sent by the second node through the first path includes: The first node receives a first message sent by the second node through the first path, and a first indication field in the first message is marked with a first identifier, and the first identifier is used to represent the first information.

9. The method according to claim 8, wherein, When the first message is forwarded by a node in the first path, the first identifier of the first indication field in the first message is not modified.

10. The method according to claim 1, wherein, After performing traffic scheduling for the second path, the method further includes: After the first node does not receive the first information sent by the second node through the first path after a first time, it determines that the congestion of the second path has been alleviated and re - executes the traffic scheduling of the second path.

11. A traffic scheduling method, which is applied to a second node, and the method includes: The second node receives second information from a third node through a second path, and the second information indicates that there is congestion in the second path; The second node sends first information to a first node through a first path, and the first information is used for the first node to execute the traffic scheduling of the second path.

12. The method according to claim 11, wherein, Before the second node sends the first information to the first node through the first path, the method further includes: The second node determines the first path associated with the second path based on a pre - configured second association relationship, and the second path and the first path are reverse paths to each other.

13. The method according to claim 11, wherein, The second node receiving second information from a third node through a second path includes: The second node receives a second message from a third node through the second path, and a first indication field in the second message is marked with a second identifier, and the second identifier is used to represent the second information.

14. The method according to claim 11, wherein The second node sending first information to the first node through the first path includes: The second node sends a first message to the first node through the first path, and a first indication field in the first message is marked with a first identifier, and the first identifier is used to represent the first information.

15. The method according to claim 14, wherein, When the first message is forwarded by a node in the first path, the first identifier of the first indication field in the first message is not modified.

16. A traffic scheduling method, which is applied to a third node, and the method includes: When the third node senses congestion, it sends second information to the second node through the second path, and the second information indicates that there is congestion in the second path. The second information is used for the second node to send first information to the first node. The third node is a forwarding node in the second path between the first node and the second node.

17. The method according to claim 16, wherein The sending the second information to the second node through the second path includes: The third node sends a second message to the second node through the second path, and a first indication field in the second message is marked with a second identifier, and the second identifier is used to represent the second information.

18. A traffic scheduling device, which is applied to a first node, and the device includes: A first communication unit and a first processing unit; wherein, The first communication unit is configured to receive first information sent by a second node through a first path, and the first information is sent after the second node receives second information from a third node; the third node is a forwarding node in the second path between the first node and the second node, and the second information indicates that there is congestion in the second path; The first processing unit is configured to determine that there is congestion in the second path based on the first information and execute the traffic scheduling of the second path.

19. A traffic scheduling device, the device is applied to a second node, and the device includes: The second communication unit is configured to receive second information from a third node through a second path, and the second information indicates that there is congestion in the second path; It is also used to send first information to a first node through a first path, where the first information is used for the first node to perform traffic scheduling for the second path.

20. A traffic scheduling device, which is applied to a third node, and the device includes: A third communication unit is configured to, when congestion is sensed, send second information to a second node through a second path, where the second information indicates that there is congestion in the second path, and the second information is used for the second node to send the first information to the first node, and the third node is a forwarding node in the second path between the first node and the second node.

21. A computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the steps of the method according to any one of claims 1 to 10 are implemented; or, when the program is executed by the processor, the steps of the method according to any one of claims 11 to 15 are implemented; or, when the program is executed by the processor, the steps of the method according to claim 16 or 17 are implemented.

22. A communication node, including a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the program, the steps of the method according to any one of claims 1 to 10 are implemented; or, when the processor executes the program, the steps of the method according to any one of claims 11 to 15 are implemented; or, when the processor executes the program, the steps of the method according to claim 16 or 17 are implemented.

Images