Message processing method, equipment and medium

Abstract

The invention provides a message processing method and device and a medium, and relates to the technical field of communication, and the message processing method comprises the steps: receiving a deterministic service message, determining a target exception processing strategy under the condition that the received deterministic service message is determined to have a target exception event, and sending the target exception processing strategy to the deterministic service message; and then performing target processing operation on the deterministic service message according to the target exception processing strategy, thereby realizing exception traffic processing of the forwarding plane.

Description

Technical Field

[0001] Embodiments of the present application relate to the field of communication technologies, and in particular, to a method, device, and medium for processing packets. Background Art

[0002] At present, the IETF DetNet working group has proposed deterministic network technologies. One of the key technologies of deterministic network technologies is resource reservation. To avoid resource conflicts at the aggregation nodes in the network, the control plane and the forwarding plane need to work together. The control plane is responsible for business path orchestration to avoid resource conflicts, and the forwarding plane needs to perform admission of traffic flows according to the orchestration results of the control plane to avoid congestion at the aggregation points and ensure the quality of service of the services entering the deterministic network domain.

[0003] Each node on the end-to-end path may be a traffic aggregation node. Aggregate traffic belonging to the same category will share the planned resources at the egress. In an ideal situation, each member traffic in the category is planned according to the control plane, so as to meet the requirements of a narrow sense of deterministic network. However, in actual applications, the network will still have abnormal situations of aggregation conflicts for various reasons. In relevant control plane processing strategies, a large amount of redundant resources are reserved for a certain type of traffic flow by the control plane, which will cause serious resource waste. In relevant forwarding plane processing strategies, when an abnormal situation of aggregation conflict occurs in the network, the forwarding plane may choose to directly discard the packet or cache the packet and wait to send it when the resources are available. However, the above processing strategies will greatly affect the quality of service. Therefore, for the deterministic forwarding plane, if it only relies on the orchestration of the control plane or the forwarding plane only has the ability to handle normal traffic, it is not enough to handle various abnormal situations in the network. Summary of the Invention

[0004] Embodiments of the present application provide a method, device, and medium for processing packets, aiming to implement abnormal traffic processing on the forwarding plane.

[0005] In a first aspect, an embodiment of the present application provides a method for processing packets, the method including:

[0006] When it is determined that a target abnormal event occurs for a received deterministic service packet, determining a target abnormal processing strategy;

[0007] Performing a target processing operation on the deterministic service packet according to the target abnormal processing strategy.

[0008] In a second aspect, an embodiment of the present application provides an electronic device, including:

[0009] One or more processors;

[0010] A memory stores one or more programs, which, when executed by one or more processors, cause the one or more processors to implement the message processing method described in the first aspect above.

[0011] In a third aspect, an embodiment of the present application provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the message processing method described in the first aspect above.

[0012] The message processing method, device, and medium provided by the embodiments of the present application. The message processing method includes: receiving a deterministic service message, determining a target exception handling strategy when it is determined that a target exception event has occurred in the received deterministic service message, and then performing a target processing operation on the deterministic service message according to the target exception handling strategy, which can implement the exception traffic processing on the forwarding plane. Description of the Drawings

[0013] The drawings are used to provide a further understanding of the technical solutions of the present invention and constitute a part of the specification. They are used together with the embodiments of the present invention to explain the technical solutions of the present invention and do not constitute a limitation to the technical solutions of the present invention.

[0014] Figure 1 is a network system architecture diagram provided by an embodiment of the present application;

[0015] Figure 2 is a schematic flowchart of a message processing method provided by an embodiment of the present application;

[0016] Figure 3 is a schematic flowchart of a message processing method provided by another embodiment of the present application;

[0017] Figure 4 is a schematic flowchart of a message processing method provided by another embodiment of the present application;

[0018] Figure 5 is Figure 2 a sub-step flowchart of step S120 in

[0019] Figure 6 is Figure 2 a sub-step flowchart of step S120 in

[0020] Figure 7 is Figure 2 a sub-step flowchart of step S120 in

[0021] Figure 8 is a schematic flowchart of a message processing method provided by another embodiment of the present application;

[0022] Figure 9It is a schematic flow diagram of a method for judging message anomalies provided by an embodiment of the present application;

[0023] Figure 10 It is a schematic flow diagram of a message processing method based on an extrusion processing strategy provided by an embodiment of the present application;

[0024] Figure 11 It is a schematic diagram of a message encapsulation format provided by an embodiment of the present application;

[0025] Figure 12 It is a schematic diagram of a message encapsulation format provided by an embodiment of the present application;

[0026] Figure 13 It is a schematic flow diagram of a message processing method based on a degradation processing strategy provided by an embodiment of the present application

[0027] Figure 14 It is a schematic flow diagram of a message processing method based on a degradation processing strategy provided by an embodiment of the present application;

[0028] Figure 15 It is a schematic diagram of a message encapsulation format provided by an embodiment of the present application;

[0029] Figure 16 It is a schematic flow diagram of a method for configuring an exception handling strategy provided by an embodiment of the present application;

[0030] Figure 17 It is a schematic flow diagram of a message processing method provided by an embodiment of the present application;

[0031] Figure 18 It is a schematic flow diagram of a message processing method provided by an embodiment of the present application

[0032] Figure 19 It is a schematic flow diagram of a message processing method provided by an embodiment of the present application;

[0033] Figure 20 It is a schematic diagram of a message encapsulation format provided by an embodiment of the present application;

[0034] Figure 21 It is a schematic diagram of a message encapsulation format provided by an embodiment of the present application;

[0035] Figure 22 It is a schematic flow diagram of a message processing method provided by an embodiment of the present application;

[0036] Figure 23 It is a schematic diagram of a message encapsulation format provided by an embodiment of the present application;

[0037] Figure 24 It is a schematic diagram of the device structure of an electronic device provided by an embodiment of the present application. Detailed implementation manners

[0038] In order to make the objectives, technical solutions and advantages of the present invention more clear and understandable, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention, but not to limit the present invention.

[0039] It should be understood that in the description of the embodiments of the present application, if there is a description of "first", "second", etc., it is only for the purpose of distinguishing technical features, and cannot be understood as indicating or implying relative importance or implicitly indicating the quantity of the indicated technical features or implicitly indicating the sequence of the indicated technical features. "At least one" means one or more, and "a plurality" means two or more. " / ", Describing the association relationship of associated objects, indicates that three relationships may exist. For example, A and / or B may indicate the situation of A alone, A and B existing simultaneously, and B alone. Wherein A and B may be singular or plural. The character " / " generally indicates that the associated objects before and after are an "or" relationship. "At least one of the following" and its similar expressions refer to any group of these items, including any group of single items or plural items. For example, at least one of a, b, and c may indicate: a, b, c, a and b, a and c, b and c, or, a and b and c, where a, b, and c may be single or multiple.

[0040] In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0041] Currently, the IETF DetNet working group has proposed deterministic network technology. One of the key technologies of deterministic network technology is resource reservation. To avoid resource conflicts in the aggregation nodes in the network, the control plane and the forwarding plane need to work together. The control plane is responsible for service path orchestration to avoid resource conflicts, and the forwarding plane needs to perform service flow admission according to the orchestration results of the control plane to avoid service congestion at the aggregation point and ensure the quality of service of the services entering the deterministic network domain.

[0042] Each node on the end-to-end path may be a traffic aggregation node. Aggregated traffic belonging to the same category shares the planned resources at the egress. In an ideal situation, each member traffic in the category is planned according to the control plane, so as to meet the requirements of a narrow-sense deterministic network. However, in practical applications, the network may still encounter abnormal aggregation conflicts for various reasons. For example, deterministic network traffic includes various types such as periodic services, bandwidth classes, and burst classes. Even if the boundary node is rate-limited according to the average bandwidth (e.g., 100 Mbps), bursts still occur frequently in the fine-grained time dimension. Another example is that the length of service packets has a range of variation (e.g., 64 - 9000 bytes). If the control plane always plans according to the maximum packet length, it may cause serious waste of network resources. If the control plane plans according to the average length, there may be resource conflicts. Additionally, network software and hardware also affect the aggregation conflicts in a deterministic network. From the perspective of the control plane, there may be loopholes in the control plane algorithm, resulting in conflicts in some or extreme scenarios that cannot be avoided. From the perspective of the forwarding plane, protocol packets with the highest priority may be sent frequently in some cases. For example, the ARP protocol is frequently triggered in abnormal situations, and protocol packets preempt the sending resources of service packets. Or when a node hardware fails, resource protection and switching may also cause conflicts.

[0043] In response to the above various abnormal situations, in relevant control plane processing strategies, a large amount of redundant resources are reserved for a certain type of service traffic through the control plane, or protection technologies such as the Packet Replication Elimination Ordering Function (PREOF) are used in multiple paths to avoid performance losses as much as possible. However, this will cause serious waste of network resources and even extremely light network loads. For example, in the PREOF technology, if multiple paths do not share links, the resource utilization rate is no more than 50% even in the best case. A deterministic network is based on a packet-based soft pipeline mechanism, and extremely light loads and resource waste may weaken the advantages of deterministic technologies.

[0044] In relevant forwarding plane processing strategies, when abnormal aggregation conflicts occur in the network, the forwarding plane may choose to directly discard packets or cache them and wait to send them when resources are available. However, the above processing strategies will greatly affect the quality of service. For example, in the Cyclic Queuing and Forwarding (CQF) mechanism, when the aggregation conflict exceeds a certain value, if the packets are cached and waited for the next round of sending, the delay jitter performance may be worse than that of traditional QoS mechanisms. Therefore, for a deterministic forwarding plane, relying solely on the control plane's orchestration or the forwarding plane only having the ability to handle normal traffic is not sufficient to handle various abnormal situations in the network.

[0045] Based on this, the embodiments of the present application provide a message processing method, device, and medium, which can implement the processing of abnormal traffic on the forwarding plane.

[0046] Before introducing the technical solution of the embodiments of the present application, the network architecture of the embodiments of the present application will be exemplarily described. Please refer to Figure 1 , Figure 1 is a schematic diagram of a network architecture provided by the embodiments of the present application. Figure 1 The network architecture in is divided into a control plane and a forwarding plane. The forwarding plane includes multiple forwarding nodes. The message processing method provided by the embodiments of the present application can be applied to the forwarding nodes in the forwarding plane, specifically, node devices such as routers and switches, and corresponding configuration units.

[0047] The embodiments of the present application first propose a message processing method. Please see Figure 2 , Figure 2 shows a message processing method provided by the embodiments of the present application. As Figure 2 shown, the message processing method includes but is not limited to step S110 and step S120.

[0048] Step S110, when it is determined that a target abnormal event occurs in the received deterministic service message, determine a target abnormal handling strategy.

[0049] It can be understood that the message processing method can be applied to the forwarding plane in a deterministic network. The forwarding node receives the deterministic service message sent by the previous node. When the deterministic service message reaches the current forwarding node, the forwarding node determines whether a target abnormal event occurs in the deterministic service message based on its own forwarding mechanism, that is, determines whether there is a convergence traffic conflict in the deterministic network.

[0050] It should be understood that when a target abnormal event occurs in the deterministic service message, that is, when the deterministic service message is determined to be an abnormal message, a target abnormal handling strategy is determined. Among them, the abnormal handling strategy of the forwarding plane can be configured through the control plane or the CLI command line, so that the forwarding plane can process the abnormal traffic according to the configured abnormal handling strategy. It should be noted that when there is no abnormality in the deterministic service message, the deterministic service message is processed according to the normal process.

[0051] Step S120, perform a target processing operation on the deterministic service message according to the target abnormal handling strategy.

[0052] It can be understood that after determining the target exception handling policy, the target processing operation is performed on the deterministic service message according to the target exception status policy, so as to implement the exception traffic processing on the forwarding plane. Among them, the forwarding node can support multiple exception handling policies, and there are multiple exception handling policies that can be enabled simultaneously. In addition, different exception handling policies have their own priorities. When multiple exception handling policies are enabled simultaneously, the node can perform the target processing operation on the deterministic service message according to the policy priorities in sequence according to the target exception handling policy. Exemplarily, when it is detected that an exception occurs in the deterministic service message and the forwarding node has enabled exception handling policy A and exception handling policy B, and the priority of exception handling policy A is higher than that of B, the forwarding node first performs the target processing operation on the exception message according to exception handling policy A. When there are still exception messages and the forwarding node no longer supports continuing to execute exception handling policy A, the target processing operation is performed on the exception message according to exception handling policy B.

[0053] The message processing method provided by the embodiments of the present application determines the target exception handling policy when it is determined that a target exception event occurs in the received deterministic service message, and performs the target processing operation on the deterministic service message according to the target exception handling policy, so as to implement the exception traffic processing on the forwarding plane.

[0054] In some embodiments, see Figure 3 , Figure 3 which shows a message processing method provided by the embodiments of the present application. As Figure 3 shown, the target exception event is determined according to step S210 and step S220.

[0055] Step S210, determine the target outgoing time slot corresponding to the deterministic service message.

[0056] Step S220, when the first load corresponding to the target outgoing time slot is greater than a preset first load threshold, determine that a target exception event occurs in the deterministic service message, where the first load represents the load after the target outgoing time slot joins the deterministic service message.

[0057] It should be understood that if the forwarding node uses a time-slot mechanism to forward packets, when a deterministic packet is received, the corresponding target output time-slot can be determined according to the parameters carried in the packet. Each output time-slot in the forwarding node is associated with a buffer queue, and then it is determined whether the packet has a target abnormal event according to the buffer depth of the buffer queue corresponding to the target output time-slot. Exemplarily, for the TQF mechanism, the target output time-slot of the packet on this node can be determined according to the upstream time-slot number carried in the packet and the time-slot mapping relationship of the node itself. For example, if the upstream time-slot number carried in the packet is 0 and the time-slot mapping relationship of the node itself is 0→4, then the target output time-slot of the packet on this node can be determined to be 4; for the Deadline mechanism, the target output time-slot of the packet on this node can be determined according to the information such as the budget and delay target carried in the packet.

[0058] When the packet arrives at the forwarding node, the corresponding buffer queue is determined according to the target output time-slot of the packet and the packet is put into the buffer queue. Please refer to Figure 9 , Figure 9 FIG. shows a schematic flow diagram of packet abnormal judgment provided by an embodiment of the present application. As Figure 9 shown, for the CQF mechanism, if the currently scheduled output time-slot is 1, the packet with the target output time-slot of 5 can enter the corresponding buffer queue 5 in advance. The allowable carrying capacity threshold of the buffer queue 5 is 4 packet quantities, that is, the first carrying threshold of the target output time-slot is 4 packet quantities. Then, it is determined whether the packet has an abnormal event according to the queue depth after the packet enters the buffer queue. Specifically, if the queue depth after the packet enters the buffer queue does not exceed the allowable carrying capacity threshold of the buffer queue, the packet is added to the queue; if the queue depth after the packet enters the buffer queue exceeds the allowable carrying capacity threshold of the buffer queue, it is determined that the packet has a target abnormal event. As Figure 9 shown, the packets numbered 1 to 4 can normally enter the buffer queue 5 of the target output time-slot. After that, if the packet numbered 5 is also put into the buffer queue 5, the queue depth of the buffer queue 5 will exceed the preset allowable carrying capacity threshold, that is, the carrying capacity (5 packet quantities) after adding the packet 5 to the target output time-slot 5 is greater than the first carrying threshold (4 packet quantities). Then, the packets numbered 5 and 6 are regarded as abnormal packets.

[0059] In some embodiments, please refer to Figure 4 , Figure 4 FIG. shows a packet processing method provided by an embodiment of the present application. As Figure 4 shown, the target abnormal event is determined according to step S310 and step S320.

[0060] Step S310, obtain the legal time of the deterministic service packet.

[0061] Step S320: When the legal time exceeds the preset constraint time, it is determined that a target abnormal event occurs for the deterministic service message, where the constraint time is the sum of the preset arrival time and the preset maximum residence time.

[0062] It should be understood that for the Asynchronous Traffic Shaper (ATS) mechanism, ATS is based on UBS (Urgency-based Scheduler) and provides deterministic latency without strict time synchronization by reshaping the TSN flow at each hop. If the forwarding node adopts the ATS mechanism, it can determine the target abnormal event of the deterministic service message by obtaining the legal time of the deterministic service message. When the legal time exceeds the sum of the arrival time and the maximum residence time, the deterministic service message is regarded as an abnormal message.

[0063] It should be noted that the above embodiments describe determining whether a target abnormal event occurs for the received deterministic service message based on the allowable carrying capacity threshold of the cache queue and the arrival time and residence time constraints of the message. In practical applications, other abnormal judgment methods can also be used to determine that a target abnormal event occurs for the deterministic service message, which is not specifically limited in the embodiments of this application.

[0064] In some embodiments, the target abnormal handling strategy includes a squeezing handling strategy.

[0065] Correspondingly, please refer to Figure 5 , Figure 5 which shows Figure 2 the flowchart of the sub-steps of step S120 in Figure 5 As shown, target processing operations are performed on the deterministic service message according to the target abnormal handling strategy, including but not limited to step S410 and step S420.

[0066] Step S410: Determine the target output time slot corresponding to the deterministic service message.

[0067] Step S420: When the first carrying capacity corresponding to the target output time slot is greater than the preset first carrying threshold and less than the preset second carrying threshold, according to the squeezing handling strategy, add the deterministic service message to the cache queue of the target output time slot, where the second carrying threshold is greater than the first carrying threshold.

[0068] It is understandable that the target exception handling policy includes a squeezing handling policy. The squeezing handling policy supports multiple queue mechanisms such as TQF and Deadline, allowing packets that are not sent within the specified time to be squeezed into subsequent times for sending until the queue cache is emptied. The forwarding plane can be configured through the control plane to enable the squeezing handling policy and the specific squeezing threshold. When the forwarding node determines that a target exception event occurs for a deterministic service packet and the squeezing handling policy is enabled, it first determines the target output time slot corresponding to the deterministic service packet, and further determines the cache queue corresponding to the target output time slot. If the queue depth after the deterministic service packet enters the cache queue exceeds the allowable carrying capacity threshold (i.e., the first carrying threshold) of the cache queue and is less than the squeezing threshold (i.e., the second carrying threshold), according to the squeezing handling policy, the deterministic service packet is added to the cache queue of the target output time slot. Exemplarily, please refer to Figure 19 , Figure 19 which shows a packet processing method provided by an embodiment of the present application. As Figure 19 shown, the forwarding plane uses the TQF mechanism to forward packets. The control plane configures the forwarding plane to enable the squeezing handling policy and configures the squeezing threshold to 15000 bit. The current cache depth of queue 5 is 8000 bit, the allowable carrying capacity threshold is 10000 bit, the size of each packet of the traffic flow is 1000 bit, and the cycle template of packets numbered 1 to 10 is A and carries the output time slot number 0. When packets numbered 1 and 2 enter queue 5 according to the time slot mapping relationship 0→5 of template A, the cache depth of queue 5 has reached 10000 bit at this time. Since the squeezing handling policy is enabled on the forwarding plane and the squeezing threshold is 15000 bit, according to the squeezing handling policy, packets numbered 3 to 7 can be added to the cache queue 5 corresponding to the target output time slot.

[0069] In the case where the forwarding node uses the TQF mechanism, the time slot number carried by the deterministic service packet that has undergone squeezing processing is the time slot encoding corresponding to the current cache queue. Please refer to Figure 10 , Figure 10 which shows a schematic flowchart of a packet processing method based on the squeezing handling policy provided by an embodiment of the present application. As Figure 10 shown, the forwarding node A forwards packets to the forwarding node B. The output time slot number corresponding to the cache queue 0 in the forwarding node A is x. Among them, according to the squeezing handling policy, squeezing processing is performed on the exception packet with the output time slot number x. The time slot number carried by the deterministic service packet that has undergone squeezing processing is x. The downstream forwarding node B receives the packet with the time slot number x within three time slots (time slot y - 3, time slot y - 2, time slot y), and thus maps the packet with the time slot number x to the same output time slot according to the mapping relationship x→y. In the case of squeezing of bursty non-persistent abnormal traffic, for the TQF mechanism, using the squeezing handling policy can maintain end-to-end deterministic jitter.

[0070] It should be noted that when the Deadline mechanism is adopted by the forwarding node, if the deterministic service packet is subjected to corresponding squeezing processing according to the squeezing processing strategy, it is necessary to record the delay postponed by the squeezing strategy in the deterministic service packet that has been subjected to squeezing processing, so as to support the recalculation of the budget time of the deterministic service packet in the subsequent node.

[0071] In some embodiments, the target exception handling strategy includes a degradation handling strategy.

[0072] Correspondingly, please refer to Figure 6 , Figure 6 shows Figure 2 the sub-step flowchart of step S120 in Figure 6 As shown, the target processing operation on the deterministic service packet according to the target exception handling strategy includes, but is not limited to, step S510 and step S520.

[0073] Step S510, according to the degradation handling strategy, reduce the service priority of the deterministic service packet from the first priority to the second priority.

[0074] Step S520, add the deterministic service packet to the cache queue corresponding to the second priority.

[0075] It should be understood that the target exception handling strategy includes a degradation handling strategy, and the forwarding plane can be configured through the control plane to enable the degradation handling strategy and configure corresponding degradation parameters. Specifically, when a target exception event occurs for the deterministic service packet, according to the degradation handling strategy, the service priority of the deterministic service packet is reduced from the first priority to the second priority, and the deterministic service packet is added to the cache queue corresponding to the second priority.

[0076] Taking TQF as an example, if the forwarding plane supports a multi-template mechanism (for example, templates A, B, and C in descending order of time slots), for the deterministic service packet that has a target exception time, the degradation handling strategy is set to degrade successively according to the periodic template. Assuming that the current deterministic service packet belongs to template A, it can be degraded to template B. If the current deterministic service packet belongs to template B, it can be degraded to target C. If the current deterministic service packet belongs to template C, the packet priority can be modified and degraded to the CS6 (Class Selector 6) to the Best Effort (BE) queue and use the traditional Quality of Service (QoS) scheduling. Please refer to Figure 13 , Figure 13 shows the schematic flowchart of a packet processing method based on the degradation handling strategy provided by the embodiment of the present application, as Figure 13As shown, the messages numbered 1 to 6 correspond to the target output queue 5. After the messages numbered 1 to 4 enter the queue 5 of template A, the cache depth of queue 5 reaches the allowable carrying capacity threshold. It is determined that the messages numbered 5 and 6 are abnormal messages. According to the degradation processing strategy, the messages numbered 5 and 6 are downgraded from template A to template B, and the messages numbered 5 and 6 are added to the cache queue corresponding to template B.

[0077] Taking the Deadline mechanism as an example, the degradation processing strategy is adopted, that is, the residence time of the abnormal message in this node is increased. Based on the target transmission time slot of the message, a certain time budget is postponed before transmission. It should also be noted that for the ATS mechanism, when the legal time exceeds the residence time constraint, the residence time limit of the current message can be appropriately relaxed. The relaxation amount can be configured through the control plane. For example, it can be flexibly adjusted according to the importance and urgency of the application, ignoring the clock deviation between input and output. For abnormal messages, when the legal time is greater than the sum of the message arrival time, the maximum residence time, and the relaxation amount, the subsequent processing of the abnormal message is carried out according to the legal time and the relaxation amount.

[0078] In some embodiments, the target abnormal processing strategy includes a squeezing processing strategy and a degradation processing strategy.

[0079] Correspondingly, please refer to Figure 7 , Figure 7 shows Figure 2 the sub-step flowchart of step S120 in Figure 7 As shown, the target processing operation is performed on the deterministic service message according to the target abnormal processing strategy, including step S610, step S620, and step S630.

[0080] Step S610, determining the target output time slot corresponding to the deterministic service message.

[0081] Step S620, when the first carrying capacity corresponding to the target output time slot is greater than the preset first carrying threshold and less than the preset second carrying threshold, according to the squeezing processing strategy, adding the deterministic service message to the cache queue of the target output time slot, where the second carrying threshold is greater than the first carrying threshold.

[0082] Step S630, when the first carrying capacity corresponding to the target output time slot is greater than the second carrying threshold, according to the degradation processing strategy, reducing the service priority of the deterministic service message from the first priority to the second priority, and adding the deterministic service message to the cache queue corresponding to the second priority.

[0083] It should be understood that the target exception handling policies include the squeezing handling policy and the downgrading handling policy. The forwarding plane can be configured through the control plane to enable the squeezing handling policy and the downgrading handling policy, as well as configure the corresponding squeezing threshold and downgrading parameters. When the forwarding node determines a target exception event for the deterministic service packet transmission and both the squeezing handling policy and the downgrading handling policy are enabled, it first determines the target output time slot corresponding to the deterministic service packet, and further determines the buffer queue corresponding to the target output time slot. If the queue depth exceeds the allowable carrying capacity threshold (i.e., the first carrying threshold) of the buffer queue and is less than the squeezing threshold (i.e., the second carrying threshold) after the deterministic service packet enters the buffer queue, according to the squeezing handling policy, the deterministic service packet is added to the buffer queue of the target output time slot. When the first carrying capacity corresponding to the target output time slot is greater than the second carrying threshold, according to the downgrading handling policy, the service priority of the deterministic service packet is reduced from the first priority to the second priority, and the deterministic service packet is added to the buffer queue corresponding to the second priority. Please refer to Figure 19 , Figure 19 which shows a packet processing method provided by an embodiment of the present application. As Figure 19 shown, the control plane configures the forwarding plane to enable the squeezing handling policy and configures the squeezing threshold to 15,000 bit. The current buffer depth of queue 5 is 8,000 bit, the allowable carrying capacity threshold is 10,000 bit, the size of each packet of the service flow is 1,000 bit, and the cycle template of the packets numbered 1 to 10 is A and carries the output time slot number 0. When the packets numbered 1 and 2 enter queue 5 according to the time slot mapping relationship 0→5 of template A, the buffer depth of queue 5 has reached 10,000 bit at this time. Since the squeezing handling policy is enabled on the forwarding plane and the squeezing threshold is 15,000 bit, according to the squeezing handling policy, the packets numbered 3 to 7 can be added to the buffer queue 5 corresponding to the target output time slot. At this time, for the packets numbered 8 to 10, if the packets numbered 8 to 10 are added to the buffer queue 5 corresponding to the target output time slot, the first carrying capacity 18,000 bit corresponding to the target output time slot will be greater than the second carrying threshold 15,000 bit. Therefore, according to the downgrading handling policy, the service priority of the deterministic service packet is reduced from the first priority to the second priority. Specifically, the packets numbered 8 to 10 are downgraded from template A to template B for processing.

[0084] In the embodiments of the present application, the forwarding node enables both the squeezing processing strategy and the degradation processing strategy. When the first carrying capacity corresponding to the target outgoing time slot is greater than the preset first carrying threshold and less than the preset second carrying threshold, the squeezing processing strategy is executed for the abnormal packets. When the first carrying capacity corresponding to the target outgoing time slot is greater than the second carrying threshold, the degradation processing strategy is executed. That is to say, when abnormal packets appear, the squeezing processing strategy is preferentially executed. If there are still abnormal packets after executing the squeezing processing strategy and the first carrying capacity corresponding to the target outgoing time slot is greater than the second carrying threshold, the abnormal packets are further processed according to the degradation processing strategy. In addition, when abnormal packets appear, the degradation processing strategy can be first executed for the abnormal packets. If there are still abnormal packets after executing the degradation processing strategy, the abnormal packets are further processed according to the squeezing processing strategy. Exemplarily, if the packets with serial numbers 5 to 10 are determined to be abnormal packets, the packets with serial numbers 5 to 10 are first degraded from template A to template B. Assume that after the packets with serial numbers 5 to 9 enter the cache queue corresponding to template B and the queue depth of this cache queue reaches the allowable carrying capacity threshold, the squeezing processing strategy is then executed for the packet with serial number 10, and the packet with serial number 10 is squeezed into the cache queue corresponding to template B.

[0085] In some embodiments, the cache queue corresponding to the second priority includes multiple sub-cache queues, and each sub-cache queue corresponds to an outgoing time slot.

[0086] Correspondingly, please refer to Figure 8 , Figure 8 which shows a packet processing method provided by the embodiments of the present application. As Figure 8 shown, adding the deterministic service packets to the cache queue corresponding to the second priority includes, but is not limited to, step S710 and step S720.

[0087] Step S710, determining the target outgoing time slot corresponding to the deterministic service packet under the second priority.

[0088] Step S720, adding the deterministic service packet to the sub-cache queue corresponding to the target outgoing time slot.

[0089] It can be understood that the cache queue corresponding to the second priority includes multiple sub-cache queues, and each sub-cache queue is associated with an outgoing time slot. After the service priority of the deterministic service packet degrades to the second priority, first determine the target outgoing time slot corresponding to the deterministic service packet under the second priority, and then add the deterministic service packet to the sub-cache queue corresponding to the target outgoing time slot.

[0090] Exemplarily, please refer to Figure 19 , Figure 19 which shows a schematic flowchart of a packet processing method provided by the embodiments of the present application. As Figure 19As shown, the time slot mapping relationship of template A is 0→5, the time slot mapping relationship of template B is 0→3. The buffer queue corresponding to template B includes 4 sub-buffer queues, and each sub-buffer queue corresponds to output time slots 0 to 3 in sequence. Assume that the periodic template of the packets numbered 1 to 10 is A and carries the output time slot number 0. When the service priorities of the packets numbered 8 to 10 are degraded to use template B, it can be determined that the target output time slots corresponding to the packets numbered 8 to 10 under template B are 3. Therefore, the packets numbered 8 to 10 are added to the sub-buffer queue corresponding to the target output time slot 3.

[0091] In some embodiments, reducing the service priority of a deterministic service packet from a first priority to a second priority includes:

[0092] When a preset degradation condition is satisfied, reducing the service priority of a deterministic service packet from a first priority to a second priority.

[0093] Among them, the degradation condition includes at least one of the following:

[0094] The delay amount generated after the degradation of the deterministic service packet is less than a preset upper limit of the delay amount.

[0095] The number of packets currently undergoing degradation processing is less than a preset upper limit of the number of degraded packets.

[0096] It should be understood that before performing the degradation processing on the service priority of the deterministic service packet, it is judged whether to perform the degradation processing on the deterministic service packet according to the delay amount generated after the degradation, such as Figure 22As shown in the figure, the out-port deadline mechanism of the forwarding node consists of 10 time-slot queues, each time slot has a length of 10 us, numbered from 0 to 9. The size of the traffic flow packet is a fixed length of 1000 bit. The target out time slots of the packets numbered 1 to 10 are 3, and the depth of the buffer queue 3 is 5000 bit. After adding the packets numbered 1 to 5 to queue 3 in sequence, the depth of queue 3 reaches the allowable carrying capacity threshold of 10000 bit. When the packets numbered 6 to 10 arrive, since the queue corresponding to the out time slot 3 is full, the packets numbered 6 to 10 are determined to be abnormal packets. At this time, the packets numbered 6 to 10 are degraded according to the degradation processing strategy. Assuming that the upper limit value of the postponed delay is 50 us, the packets numbered 6 to 10 can only be added to the queues before time-slot queue 7. If the packets numbered 6 to 10 are added to the queues after time-slot queue 7, the postponed delay amount generated after the packet degradation will be greater than the upper limit value of the postponed delay; or, it is determined whether to degrade the deterministic service packets according to the number of packets to be degraded currently. Referring to the above example, the packets numbered 6 to 10 are the packets to be degraded currently, and the number is 5. At this time, the depth of queue 4 is 2000 bit. If it is specified that no abnormal packets can enter the queue after the depth of the queue reaches 5000 bit, the upper limit value of the degraded packet number can be determined to be 3. Therefore, only the packets numbered 6 to 8 can be added to queue 4, and the service priorities of the packets numbered 9 and 10 are further reduced.

[0097] In some embodiments, the packet processing method further includes one of the following:

[0098] In the case where the preset degradation condition is not satisfied, discard the deterministic service packets;

[0099] Or,

[0100] In the case where the preset degradation condition is not satisfied, add the deterministic service packets to the best-effort BE queue.

[0101] It should be understood that in the case where the preset degradation condition is not satisfied, that is, the postponed delay amount generated after the degradation of the deterministic service packets is less than the preset upper limit value of the postponed delay, or the number of packets to be degraded currently is less than the preset upper limit value of the degraded packet number, then the deterministic service packets can be discarded, or the deterministic service packets can be added to the best-effort BE queue.

[0102] Exemplarily, as Figure 13 shown, the forwarding node supports a multi-template mechanism, including template A, template B, and template C, and also includes port queues CS6 to BE. In the case where the preset degradation condition is not satisfied, the deterministic service packets can be directly added to the best-effort BE queue; or as Figure 22As shown, the forwarding node uses the Deadline mechanism to forward packets. The Deadline mechanism consists of 10 time-slot queues. If the preset degradation condition cannot be met and the deterministic service packet cannot be added to any time-slot queue, the deterministic service packet can be discarded.

[0103] In some embodiments, before adding the deterministic service packet to the cache queue corresponding to the second priority, the packet processing method further includes one of the following:

[0104] Modify the first field in the deterministic service packet to the value corresponding to the second priority, where the first field is used to identify the service priority corresponding to the deterministic service packet;

[0105] Add delay information in the second field of the deterministic service packet, where the delay information is used to indicate the amount of delay generated after the downgrade of the deterministic service packet.

[0106] In step S810, taking the TQF mechanism as an example, if the forwarding plane supports the multi-template mechanism (for example, templates A, B, and C in descending order of time slots), please refer to Figure 11 , Figure 11 shows a schematic diagram of a packet encapsulation format provided by an embodiment of the present application. As Figure 11 shown, taking SRv6 encapsulation as an example, for the deterministic service packet with the target exception time, the downgrading processing strategy is set to gradually downgrade according to the periodic template. The service priority of the deterministic service packet is downgraded from template A to template B. At this time, the first field cycle-template in the deterministic service packet used to identify the service priority corresponding to the deterministic service packet is modified to the value corresponding to the second priority, that is, from template A to template B, and the target out time slot is recalculated and the out-slot field of the packet is modified accordingly. Please refer to Figure 12 , Figure 12 shows a schematic diagram of a packet encapsulation format provided by an embodiment of the present application. As Figure 12 shown, taking IPv6 encapsulation as an example, if the deterministic service packet is downgraded to be processed according to BE, the first field in the deterministic service packet used to identify the service priority corresponding to the deterministic service packet needs to be set to 0, that is, the priority (PCP / DSCP / EXP) field is set to 0.

[0107] In step S820, taking the Deadline mechanism as an example, a degradation processing strategy is adopted, that is, the residence time of the exception message at this node is increased. Based on the target transmission time slot of the message, the message is postponed by a certain time budget before being sent. The postponed time budget can be flexibly adjusted according to the busy or idle state of the current node port. And before the message is added to the corresponding buffer queue, the postponed event budget is used as the postponed delay information and added to the second field indicating the postponed delay amount generated after degradation, so as to support the recalculation of the budget time of this deterministic service message at the subsequent node.

[0108] Please refer to Figure 14 , Figure 14 FIG. shows a schematic flow chart of a message processing method based on a degradation processing strategy provided by an embodiment of the present application. As Figure 14 shown, the messages numbered 1 to 6 correspond to the target output queue 5, and the messages numbered 7 to 9 correspond to the target output queue 6. After the messages numbered 1 to 4 enter the queue 5 of template A, the buffer depth of queue 5 reaches the allowable carrying capacity threshold. Therefore, according to the degradation processing strategy, corresponding processing operations are performed on the messages numbered 5 and 6. By increasing the residence time of the messages numbered 5 and 6 at this node by 3T on the basis of the target transmission time slot, where T is the queue scheduling period, and then adding the postponed delay information to the second field in the message indicating the postponed delay amount generated after the degradation of the deterministic service message. At this time, the postponed delay information is the residence time 3T. Finally, the messages numbered 5 and 6 are added to queue 8 for sending.

[0109] It should also be noted that in the degradation processing strategy, the standard protocols 802.1CB and 802.1QciPSFP mechanisms can be used to identify specific service flow messages and perform modifications to the priority fields. Technologies such as BGP-FS and ACL can be used to match the message header fields and perform corresponding actions on the messages, including adjusting the internal scheduling parameters of the messages, modifying the existing fields of the messages, and inserting new fields into the messages. The embodiments of the present application do not specifically limit the methods for identifying and modifying the message header fields.

[0110] In some embodiments, the first priority and the second priority are adjacent service priorities, or the first priority and the second priority are non-adjacent service priorities.

[0111] It can be understood that the first priority and the second priority are adjacent service priorities, or the first priority and the second priority are non-adjacent service priorities, that is, the degradation processing strategy can be gradually degraded or non-gradually degraded. For example, Figure 13As shown, the packets numbered 1 to 6 correspond to the target output queue 5, and the packets numbered 7 to 9 correspond to the target output queue 6. After the packets numbered 1 to 4 enter the queue 5 of template A, the cache depth of queue 5 reaches the allowable carrying capacity threshold. Therefore, according to the downgrading processing strategy, corresponding processing operations are performed on the packets numbered 5 and 6. The packets numbered 5 and 6 can be downgraded to template B for processing through successive downgrading, or they can be downgraded to the BE queue for processing through non-successive downgrading.

[0112] In the embodiments of the present application, for the deterministic service packets that have undergone exception handling, in addition to modifying the existing fields as needed (such as cycle templates, priorities, etc.) for subsequent scheduling and forwarding, additional fields can be extended in the packet header to add the processing strategy adopted by the current packet and the corresponding policy parameters.

[0113] In some embodiments, before adding the deterministic service packet to the cache queue of the target output time slot, the packet processing method further includes adding squeeze bit information to the third field of the deterministic service packet, where the squeeze bit information is used to indicate the number of squeeze bits generated by the deterministic service packet.

[0114] It can be understood that, please refer to Figure 15 , Figure 15 shows a schematic diagram of a packet encapsulation format provided by the embodiments of the present application. As Figure 15 shown, taking the SRv6 service packet as an example, a third field jiya-bit for indicating the number of squeeze bits generated by the deterministic service packet is extended in the packet header, and before adding the deterministic service packet to the cache queue of the target output time slot, squeeze bit information is added to the third field to facilitate the scheduling and processing of the packet at subsequent nodes.

[0115] In some embodiments, after determining the target exception handling strategy, the packet processing method further includes adding a policy identifier corresponding to the target exception handling strategy to the fourth field of the deterministic service packet.

[0116] It should be understood that, as Figure 15 shown, taking the SRv6 service packet as an example, a fourth field jiya-flag and jiangji-flag for indicating the exception handling strategy adopted by the deterministic service packet are extended in the packet header, and before determining the target exception handling strategy, a policy identifier corresponding to the target exception handling strategy is added to the fourth field. For example, setting the value of the fourth field jiangji-flag to 1 indicates that the current packet has undergone downgrading processing.

[0117] In a specific embodiment, please refer to Figure 16 , Figure 16The flowchart of an exception handling policy configuration method provided by an embodiment of the present application is shown. As Figure 16 shown, if the forwarding plane supports multiple exception handling policies, the exception handling policies enabled for the forwarding node and related parameters can be configured in multiple ways such as through the control plane, CLI command line, etc. For example, for the congestion handling policy, a congestion threshold can be configured. For the degradation handling policy, an upper limit value of the postponed delay can be configured, or degradation parameters such as indicating downgrading from template A to template B, from template B to template C, from template C to template BE, or from template A to template C can be configured.

[0118] In a specific embodiment, please refer to Figure 17 , Figure 17 The flowchart of a packet processing method provided by an embodiment of the present application is shown. As Figure 17 shown, after the forwarding plane automatically handles abnormal traffic according to the congestion or degradation handling policy, it reports the occurring abnormal situation to the controller so that the controller can perceive the specific abnormal situation in the network to make relevant responses such as reorchestration, table entry reconfiguration, or resource expansion. The abnormal information reported by the forwarding plane to the control plane through the interface includes, but is not limited to: basic information, abnormal flow and packet information, abnormal handling policy information, and parameter information. Among them, the basic information includes node ID, port ID, etc. The abnormal flow and packet information includes flow ID, packet sequence number range, etc. The abnormal handling policy information and parameter information include the adopted handling policy (congestion, degradation, or natural handling), policy-related parameters (including congestion amount, number of packets, etc., or including postponed delay amount, cycle templates before and after degradation, number of packets, etc., or including the number of packets for handling such as discarding, downgrading to BE, etc.).

[0119] In a specific embodiment, please refer to Figure 18 , Figure 18 The flowchart of a packet processing method provided by an embodiment of the present application is shown. As Figure 18 shown, when the forwarding node receives a deterministic service packet, its processing flow includes the following steps:

[0120] 1) Start, receive a deterministic service packet;

[0121] 2) Determine whether the current packet is abnormal. If not, go to 8); otherwise, go to 3);

[0122] 3) Determine which exception handling policies the forwarding plane supports. If no exception handling policy is enabled, go to 4); if both the congestion and degradation handling policies are enabled, go to 5); if only the congestion handling policy is enabled, go to 6); if only the degradation handling policy is enabled, go to 7);

[0123] 4) Process the abnormal packet according to the existing process, go to 9);

[0124] 5) Determine whether the extrusion threshold is exceeded. If not, go to 6); otherwise, go to 7).

[0125] 6) Process the abnormal message according to the extrusion processing strategy, and go to 9).

[0126] 7) Transfer to the degradation processing strategy to process the abnormal message, and go to 9).

[0127] 8) Process the normal message according to the existing process.

[0128] 9) End.

[0129] The message processing method provided by the present application is described below through specific examples.

[0130] Example 1

[0131] Example 1 describes the abnormal detection method and abnormal processing strategy when the forwarding plane adopts the TQF mechanism. As Figure 19 shown, the egress port TQF mechanism of the forwarding node supports three cycle templates, namely template A, template B, and template C. The time slot lengths of templates A to C increase in powers of two, and the number of time slots decreases in powers of two. The time slot mapping relationship of template A is 0 → 5, 2 → 7, the time slot mapping relationship of template B is 0 → 3. Assume that the allowed carrying capacity threshold of each TQF time slot of template A is 10000 bit, the allowed carrying capacity threshold of each TQF time slot of template B is 20000 bit, and the allowed carrying capacity threshold of each TQF time slot of template C is 40000 bit. When the queue buffer depth corresponding to template A exceeds 10000 bit, it indicates an abnormality.

[0132] The control plane configures the forwarding plane to enable the extrusion processing strategy, and the extrusion threshold is set to 15000 bit. The control plane configures the forwarding plane to enable the step-by-step degradation processing strategy. The size of each message of the service flow is 1000 bit. The cycle templates of messages numbered 1 to 10 are A and carry the outgoing time slot number 0. The cycle templates of messages numbered 11 to 15 are A and carry the outgoing time slot number 2. When message No. 1 arrives at the forwarding node, the current buffer depth of queue 5 is 8000 bit, and the current buffer depth of queue 7 is 0 bit.

[0133] The processing process of the service flow message sequence 1 to 15 is as Figure 19 shown. When messages No. 1 and 2 enter queue 5 according to the time slot mapping relationship 0 → 5 of template A, the buffer depth of queue 5 has reached 10000 bit at this time. When message No. 3 arrives, if it also enters queue 5 according to the time slot mapping relationship 0 → 5 of template A, the buffer depth of queue 5 will be greater than the allowed carrying capacity threshold, thus determining that abnormal traffic has occurred.

[0134] The forwarding node has currently enabled the extrusion processing policy, and the extrusion threshold is 15,000 bits. Among the packets in the outgoing time slot 0, the packets with sequence numbers 3 to 7 can be subjected to extrusion processing. The packets with sequence numbers 3 to 7 enter queue 5. After extrusion processing, the packets with sequence numbers 3 to 7 still carry the outgoing time slot number 5. When the packet with sequence number 8 arrives, if it enters queue 5 according to the time slot mapping relationship 0→5 of template A, the cache depth of queue 5 will exceed the extrusion threshold of 15,000 bits.

[0135] The forwarding node has currently enabled the downgrading processing policy and degrades successively. Therefore, the packets with sequence numbers 8 to 10 are downgraded from template A to template B for processing. According to the outgoing time slot number 0 corresponding to template A carried by the packets, it can be converted to the outgoing time slot code 0 of template B, and then processed according to the time slot mapping relationship 0→3 of template B. The packets with sequence numbers 8 to 10 enter template B queue 3. The packets with sequence numbers 11 to 15 enter the cache queue 7 of template A according to the time slot mapping relationship 2→7 of template A. After all the packets enter queue 7, the cache depth of queue 7 is 10,000 bits, which does not exceed the allowable carrying capacity threshold.

[0136] As Figure 20 and Figure 21 shown, for SRv6 service packets, the following extended fields exist in the packet header: cycle-tmp, out-slot, jiya-flag, jiya-bit, recover-flag, jiangji-flag, old-cycle-tmp, old-out-slot, delayed-time, reserved, which are used to identify the abnormal processing policy and related parameters adopted by the packets.

[0137] Taking abnormal packet 3 as an example, abnormal packet 3 adopts the extrusion processing policy and the extrusion amount is 1,000 bits. It belongs to template A and the corresponding outgoing time slot is 5. The corresponding field values of abnormal packet 3 are as Figure 20 shown: the value of the jiya-flag field is true, indicating that the packet adopts the extrusion processing policy; the value of the jiya-bit field is 1,000, indicating that the extrusion amount is 1,000 bits; the value of the cycle-tmp field is A, indicating that the packet uses template A for forwarding; the value of the out-slot field is 5, indicating that the outgoing time slot of the packet is 5.

[0138] Taking abnormal packet 8 as an example, abnormal packet 4 adopts the downgrading processing policy and is downgraded from template A to template B. The corresponding outgoing time slot before downgrading is 5, and the corresponding outgoing time slot after downgrading is 3. The corresponding field values of abnormal packet 3 are as Figure 20As shown below: when the value of the jiangji-flag field is true, it indicates that the message adopts a degradation processing strategy; when the value of the cycle-tmp field is B, it indicates that the message uses template B for forwarding after degradation; when the value of the old-cycle-tmp field is A, it indicates that the message uses template A for forwarding before degradation; when the value of the out-slot field is 3, it indicates that the corresponding output time slot after message degradation is 3; when the value of the old-out-slot field is 5, it indicates that the corresponding output time slot before message degradation is 5.

[0139] Example 2

[0140] Example 2 describes the abnormal detection method and abnormal handling strategy when the forwarding plane adopts the Deadline mechanism. Please refer to Figure 22 , Figure 22 shows the schematic flow diagram of the message processing method provided by the embodiments of the present application. As Figure 22 shown, the output port Deadline mechanism of the forwarding node consists of 10 time slot queues, each time slot has a length of 10 us, numbered from 0 to 9, and the allowable carrying capacity threshold of each time slot is 10000 bit. Assuming that due to the existence of aggregated traffic, the depth of buffer queue 3 is 5000 bit, the depth of buffer queue 4 is 2000 bit, the depth of buffer queue 5 is 5000 bit, the depth of buffer queue 6 is 1000 bit, and the depths of buffer queues 7, 8, and 9 are 10000 bit.

[0141] The forwarding plane is configured to enable the degradation processing strategy, and the maximum allowable degradation amount is configured to be 50 us, allowing the forwarding plane to flexibly degrade within 50 us. The size of the service flow message is a fixed length of 1000 bit. According to the delay budget, the target output time slots of the messages with sequence numbers 1 to 10 are 3, and the target output time slots of the messages with sequence numbers 11 to 16 are 4. As Figure 22 shown, the messages with sequence numbers 1 to 5 are sequentially added to queue 3. At this time, the depth of queue 3 reaches the allowable carrying capacity threshold of 10000 bit. When the messages with sequence numbers 6 to 10 arrive, since the queue corresponding to the output time slot 3 is full, the messages after message 5 are determined to be abnormal messages.

[0142] The forwarding plane has enabled the degradation processing strategy and allows the degradation amount to be flexibly set according to the situation of the export queue. Assuming that when the queue depth does not exceed 5000 bit, the abnormal messages are postponed in the shortest delay manner. Therefore, the messages with sequence numbers 6 to 8 enter queue 4. At this time, the buffer depth of queue 4 reaches 5000 bit and no more abnormal messages can enter; the depth of queue 5 has reached 5000 bit, the depth of queue 6 is 1000 bit, and the maximum postponement amount is 40 us < the specified value of 50 us. Therefore, the messages with sequence numbers 9 and 10 enter queue 6, and the depth of queue 6 is 3000 bit at this time.

[0143] The packets numbered from 11 to 15 enter queue 4 according to the normal process. At this time, the depth of queue 4 reaches the allowable carrying capacity threshold of 10,000 bits. The packet numbered 16 is marked as an abnormal service packet, and the packet numbered 16 is postponed by 20 us and enters queue 6. At this time, the depth of queue 6 is 4,000 bits.

[0144] Among them, please refer to Figure 23 , Figure 23 which shows a schematic diagram of a packet encapsulation format provided by an embodiment of the present application. As Figure 23 shown, taking the example of downgrading the abnormal packet numbered 6 to queue 4 for processing, the maximum possible delay time is 20 us. Based on the encapsulation method of the deadline encapsulation draft 6man IPv6 Option type, the extended carry downgrade delay time (delayedtime) information is carried.

[0145] An embodiment of the present application also provides an electronic device, as Figure 15 shown. The electronic device 1400 includes:

[0146] One or more processors 1410;

[0147] A memory 1420, on which one or more programs are stored. When the one or more programs are executed by the one or more processors 1410, the one or more processors 1410 implement the packet processing method.

[0148] The memory 1420, as a non-transitory network system, can be used to store non-transitory software programs and non-transitory computer-executable programs. In addition, the memory 1420 may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state storage devices. In some embodiments, the memory 1420 may optionally include a memory 1420 remotely disposed relative to the processor 1410, and these remote memories 1420 may be connected to the processor 1410 through a network. Examples of the above networks include, but are not limited to, the Internet, an enterprise intranet, a local area network, a mobile communication network, and combinations thereof.

[0149] The memory 1420 may be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM), etc. The memory 1420 may store an operating system and other application programs. When implementing the technical solutions provided by the embodiments of the present specification through software or firmware, the relevant program codes are stored in the memory 1420 and are called by the processor 1410 to execute the methods of the embodiments of the present application.

[0150] The processor 1410 can be implemented in the form of a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, etc., and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application.

[0151] In some embodiments, the electronic device further includes:

[0152] An input / output interface for implementing information input and output;

[0153] A communication interface for implementing communication interaction between this device and other devices. Communication can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.);

[0154] A bus for transmitting information between various components of the device (such as the processor 1410, the memory 1420, the input / output interface, and the communication interface);

[0155] Among them, the processor 1410, the memory 1420, the input / output interface, and the communication interface can achieve communication connections with each other inside the device through the bus.

[0156] An embodiment of the present application also provides a computer-readable storage medium storing computer-executable instructions, and the computer-executable instructions are used to execute the message processing method provided in the embodiments of the present application.

[0157] An embodiment of the present application also provides a computer program product, including a computer program or computer instructions. The computer program or computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer program or computer instructions from the computer-readable storage medium, and the processor executes the computer program or computer instructions, so that the computer device executes and implements the message processing method provided in the embodiments of the present application.

[0158] The system architecture and application scenarios described in the embodiments of the present application are for more clearly illustrating the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art know that with the evolution of the system architecture and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are equally applicable to similar technical problems.

[0159] Those of ordinary skill in the art can understand that all or part of the processes in the above-described embodiment methods can be completed by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the above-described method embodiments. Among them, any reference to a memory, storage, database, or other medium used in the various embodiments provided in this application can include non-volatile and / or volatile memories. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or an external cache memory. By way of illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and Rambus dynamic RAM (RDRAM), etc.

[0160] Those of ordinary skill in the art can understand that all or some of the steps and systems in the methods disclosed above can be implemented as software, firmware, hardware, and their appropriate combinations. Some physical components or all physical components can be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or can be implemented as hardware, or can be implemented as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, which can include a computer storage medium (or non-transitory medium) and a communication medium (or transitory medium). As is well known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information, such as computer-readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory, or other memory technologies, CD-ROM, digital versatile disk (DVD), or other optical disk storage, magnetic cassettes, tapes, magnetic disk storage, or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, as is well known to those of ordinary skill in the art, a communication medium typically contains computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transmission mechanism, and can include any information delivery medium.

[0161] Some embodiments of the present application have been described above with reference to the accompanying drawings, which do not limit the scope of the rights of the present invention. Any modifications, equivalent replacements, and improvements made by those skilled in the art without departing from the scope and essence of the present invention shall fall within the scope of the rights of the present application.

Claims

1. A message processing method, the method comprises: when it is determined that a target abnormal event occurs to a received deterministic service message, determining a target abnormal handling strategy; performing a target processing operation on the deterministic service message according to the target abnormal handling strategy.

2. The method according to claim 1, wherein, the target abnormal event is determined according to the following steps: determining a target outgoing time slot corresponding to the deterministic service message; when the first load corresponding to the target outgoing time slot is greater than a preset first load threshold, determining that the target abnormal event occurs to the deterministic service message, where the first load represents the load after the target outgoing time slot joins the deterministic service message.

3. The method according to claim 1, wherein, the target abnormal event is determined according to the following steps: acquiring the legal time of the deterministic service message; when the legal time exceeds a preset constraint time, determining that the target abnormal event occurs to the deterministic service message, where the constraint time is the sum of a preset arrival time and a preset maximum residence time.

4. The method according to claim 1, wherein, the target abnormal handling strategy includes a squeezing handling strategy, and performing the target processing operation on the deterministic service message according to the target abnormal handling strategy includes: determining a target outgoing time slot corresponding to the deterministic service message; when the first load corresponding to the target outgoing time slot is greater than a preset first load threshold and less than a preset second load threshold, adding the deterministic service message to the cache queue of the target outgoing time slot according to the squeezing handling strategy, where the second load threshold is greater than the first load threshold.

5. The method according to claim 1, wherein, the target abnormal handling strategy includes a degradation handling strategy, and performing the target processing operation on the deterministic service message according to the target abnormal handling strategy includes: lowering the service priority of the deterministic service message from a first priority to a second priority according to the degradation handling strategy; adding the deterministic service message to the cache queue corresponding to the second priority.

6. The method according to claim 1, wherein, the target abnormal handling strategy includes a squeezing handling strategy and a degradation handling strategy; performing the target processing operation on the deterministic service message according to the target abnormal handling strategy includes: determining a target outgoing time slot corresponding to the deterministic service message; when the first load corresponding to the target outgoing time slot is greater than a preset first load threshold and less than a preset second load threshold, adding the deterministic service message to the cache queue of the target outgoing time slot according to the squeezing handling strategy, where the second load threshold is greater than the first load threshold; When the first carrying capacity corresponding to the target output time slot is greater than the second carrying threshold, according to the downgrading processing strategy, the service priority of the deterministic service message is reduced from the first priority to the second priority, and the deterministic service message is added to the cache queue corresponding to the second priority.

7. The method according to claim 5 or 6, wherein, the cache queue corresponding to the second priority includes a plurality of sub-cache queues, and each sub-cache queue corresponds to an output time slot. The adding the deterministic service message to the cache queue corresponding to the second priority includes: determining the target output time slot corresponding to the deterministic service message under the second priority; adding the deterministic service message to the sub-cache queue corresponding to the target output time slot.

8. The method according to claim 5 or 6, wherein, the reducing the service priority of the deterministic service message from the first priority to the second priority includes: when a preset downgrading condition is satisfied, reducing the service priority of the deterministic service message from the first priority to the second priority; wherein, the downgrading condition includes at least one of the following: the delay time amount generated after the downgrading of the deterministic service message is less than a preset upper limit value of the delay time; the number of messages currently undergoing downgrading processing is less than a preset upper limit value of the number of downgraded messages.

9. The method according to claim 8, wherein, the method further includes one of the following: when the preset downgrading condition cannot be satisfied, discarding the deterministic service message; or, when the preset downgrading condition cannot be satisfied, adding the deterministic service message to the best effort (BE) queue.

10. The method according to claim 5 or 6, wherein, before adding the deterministic service message to the cache queue corresponding to the second priority, the method further includes at least one of the following: modifying a first field in the deterministic service message to a value corresponding to the second priority, wherein the first field is used to identify the service priority corresponding to the deterministic service message; adding delay time information to a second field in the deterministic service message, wherein the delay time information is used to indicate the delay time amount generated after the downgrading of the deterministic service message.

11. The method according to claim 5 or 6, wherein, the first priority and the second priority are adjacent service priorities, or the first priority and the second priority are non-adjacent service priorities.

12. The method according to claim 4 or 6, wherein, before adding the deterministic service message to the cache queue of the target output time slot, the method further includes: adding squeeze bit information to a third field in the deterministic service message, wherein the squeeze bit information is used to indicate the number of squeeze bits generated by the deterministic service message.

13. The method according to claim 1, wherein, after determining the target exception handling strategy, the method further includes: Add the policy identifier corresponding to the target exception handling policy to the fourth field of the deterministic service message.

14. An electronic device, comprising: one or more processors; a memory having stored thereon one or more programs which, when executed by the one or more processors, cause the one or more processors to implement: the message processing method according to any one of claims 1-13.

15. A computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements: the message processing method according to any one of claims 1-13.

Images