Packet processing method, device, and medium

Abstract

The present application relates to the technical field of communications, and provides a packet processing method, a device, and a medium. The packet processing method comprises: receiving a deterministic service packet, determining a target anomaly processing strategy when it is determined that a target anomaly event occurs in the received deterministic service packet, and then performing a target processing operation on the deterministic service packet on the basis of the target anomaly processing strategy.

Description

Message processing methods, equipment, and media

[0001] Cross-references

[0002] This application claims priority to the Chinese patent application filed with the China Patent Office on December 1, 2023, with application number 202311663641.0 and title “Message Processing Method, Device and Medium”, the entire contents of which are incorporated by reference into this application. Technical Field

[0003] The embodiments of the present application relate to the field of communication technologies, and in particular to a message processing method, device, and medium. Background Art

[0004] The DetNet working group of the Internet Engineering Task Force (IETF) has proposed deterministic networking technology. One of the key technologies of deterministic networking is resource reservation. To avoid resource conflicts at aggregation nodes in the network, the control plane and forwarding plane need to work together. The control plane is responsible for orchestrating service paths to avoid resource conflicts, while the forwarding plane needs to admit service flows based on the orchestration results of the control plane to avoid service congestion at the aggregation point and ensure the service quality of services entering the deterministic network domain.

[0005] Each node on an end-to-end path may be a traffic aggregation node. Aggregated traffic belonging to the same category will share planned resources at the egress. Ideally, each member traffic in the category is planned according to the control plane, thus meeting the requirements of a narrowly defined deterministic network. However, in actual applications, networks may still experience convergence conflicts due to various reasons. In the relevant control plane processing strategy, a large amount of redundant resources are reserved for a certain type of business traffic through the control plane, but this will result in serious resource waste. In the relevant forwarding plane processing strategy, when a convergence conflict occurs in the network, the forwarding plane may choose to directly discard the message or cache the message and wait for resources to become available before sending it. However, the above processing strategies will greatly affect the quality of service. Therefore, for a deterministic forwarding plane, relying solely on the control plane's orchestration or the forwarding plane's ability to only handle normal traffic is insufficient to cope with various abnormal situations in the network.

[0006] Summary of the Invention

[0007] Embodiments of the present application provide a message processing method, device, and medium.

[0008] In a first aspect, an embodiment of the present application provides a message processing method, the method comprising: determining a target exception handling strategy when it is determined that a target exception event occurs in a received deterministic business message; and performing a target processing operation on the deterministic business message according to the target exception handling strategy.

[0009] In a second aspect, an embodiment of the present application provides an electronic device comprising: one or more processors; a memory on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement the message processing method described in the first aspect above.

[0010] In a third aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the message processing method described in the first aspect above. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The accompanying drawings are used to provide a further understanding of the technical solution of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present application and do not constitute a limitation on the technical solution of the present application.

[0012] FIG1 is a diagram of a network system architecture provided by an embodiment of the present application;

[0013] FIG2 is a flow chart of a message processing method provided in an embodiment of the present application;

[0014] FIG3 is a flow chart of a message processing method provided in another embodiment of the present application;

[0015] FIG4 is a flow chart of a message processing method provided in another embodiment of the present application;

[0016] FIG5 is a schematic diagram of the sub-step flow of step S120 in FIG2 ;

[0017] FIG6 is a schematic diagram of the sub-step flow of step S120 in FIG2 ;

[0018] FIG7 is a schematic diagram of the sub-step flow of step S120 in FIG2 ;

[0019] FIG8 is a flow chart of a message processing method provided in another embodiment of the present application;

[0020] FIG9 is a schematic diagram of a flow chart of a message abnormality determination according to an embodiment of the present application;

[0021] FIG10 is a flow chart of a message processing method based on a squeeze processing strategy according to an embodiment of the present application;

[0022] FIG11 is a schematic diagram of a message encapsulation format provided in an embodiment of the present application;

[0023] FIG12 is a schematic diagram of a message encapsulation format provided in an embodiment of the present application;

[0024] FIG13 is a flow chart of a message processing method based on a degradation processing strategy provided in an embodiment of the present application

[0025] 14 is a flow chart of a message processing method based on a degradation processing strategy according to an embodiment of the present application;

[0026] FIG15 is a schematic diagram of a message encapsulation format provided in an embodiment of the present application;

[0027] FIG16 is a flow chart of a method for configuring an exception handling strategy according to an embodiment of the present application;

[0028] FIG17 is a flow chart of a message processing method according to an embodiment of the present application;

[0029] FIG18 is a flow chart of a message processing method provided in an embodiment of the present application

[0030] FIG19 is a flow chart of a message processing method according to an embodiment of the present application;

[0031] FIG20 is a schematic diagram of a message encapsulation format provided in an embodiment of the present application;

[0032] FIG21 is a schematic diagram of a message encapsulation format provided in an embodiment of the present application;

[0033] FIG22 is a flow chart of a message processing method provided in an embodiment of the present application;

[0034] FIG23 is a schematic diagram of a message encapsulation format provided in an embodiment of the present application;

[0035] FIG24 is a schematic diagram of the device structure of the electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0036] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0037] 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 number of the indicated technical features or implicitly indicating the order of the indicated technical features. "At least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of associated objects, indicating that there may be three relationships. For example, A and / or B can indicate the existence of A alone, the existence of A and B at the same time, and the existence of B alone. A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" and similar expressions refer to any group of these items, including any group of single or plural items. For example, at least one of a, b and c can indicate: a, b, c, a and b, a and c, b and c, or a, b and c, where a, b, c can be single or multiple.

[0038] In addition, the technical features involved in each embodiment of the present application described below can be combined with each other as long as they do not conflict with each other.

[0039] 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 at aggregation nodes in the network, the control plane and forwarding plane need to work together. The control plane is responsible for orchestrating service paths to avoid resource conflicts, and the forwarding plane needs to admit service flows based on the orchestration results of the control plane to avoid service congestion at the aggregation point and ensure the service quality of services entering the deterministic network domain.

[0040] Each node on an end-to-end path can be a traffic aggregation node. Aggregated traffic belonging to the same category will share planned resources at the egress. Ideally, each member traffic in a category is planned according to the control plane, thus meeting the requirements of a narrowly defined deterministic network. However, in practical applications, networks can still experience aggregation conflicts and anomalies for various reasons. For example, deterministic network traffic includes periodic services, bandwidth-intensive services, and bursty services. Even if the average bandwidth (e.g., 100Mbps) is limited at the edge nodes, bursts in fine-grained time dimensions may still occur. For another example, service packet lengths vary (e.g., 64 to 9000 bytes). If the control plane is always planned according to the maximum packet length, it may result in a significant waste of network resources. If the control plane is planned according to the average length, resource conflicts may occur. For example, network software and hardware can also affect convergence conflicts in deterministic networks. From the perspective of the control plane, there may be loopholes in the control plane algorithm, resulting in unavoidable conflicts in some or extreme scenarios. From the perspective of the forwarding plane, protocol messages with the highest priority may be sent frequently in some cases. For example, the Address Resolution Protocol (ARP) protocol may be frequently triggered under abnormal circumstances, and protocol messages will preempt the sending resources of business messages. Or when the node hardware fails, resource protection and switching may also cause conflicts.

[0041] To address these various anomalies, control plane processing strategies include reserving a significant amount of redundant resources for certain types of traffic, or employing multipath protection technologies such as the Packet Replication Elimination Ordering Function (PREOF) to minimize performance loss. However, this can lead to significant waste of network resources, even to extremely light network loads. For example, in PREOF technology, if multiple paths do not share links, resource utilization does not exceed 50% in the best case. Deterministic networks are packet-based soft pipes, and extremely light loads and resource waste can undermine the advantages of deterministic technology.

[0042] In the relevant forwarding plane processing strategies, when an abnormal convergence conflict occurs in the network, the forwarding plane may choose to directly discard the message or cache the message and wait for resources to become available before sending it. However, the above processing strategies will greatly affect the quality of service. For example, in the Cyclic Queuing and Forwarding (CQF) mechanism, when the convergence conflict exceeds a certain value, if the message is cached and waits for the next round of transmission, it may result in worse latency and jitter performance than the traditional Quality of Service (QoS) mechanism. Therefore, for a deterministic forwarding plane, if it relies solely on the control plane's orchestration or the forwarding plane only has the ability to handle normal traffic, it is not enough to cope with various abnormal situations in the network.

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

[0044] Before introducing the technical solutions of the embodiments of the present application, the network architecture of the embodiments of the present application will be exemplified. Please refer to Figure 1, which is a schematic diagram of a network architecture provided by the embodiments of the present application. The network architecture in Figure 1 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, which can specifically be node devices such as routers and switches and corresponding configuration units.

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

[0046] Step S110 : When it is determined that a target abnormal event occurs in the received deterministic service message, a target abnormality handling strategy is determined.

[0047] 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 business message sent by the previous node. When the deterministic business message reaches the current forwarding node, the forwarding node determines whether a target abnormal event occurs in the deterministic business message based on its own forwarding mechanism, that is, whether a converged traffic conflict occurs in the deterministic network.

[0048] It should be understood that when a target abnormal event occurs in a deterministic service message, that is, when the deterministic service message is judged to be an abnormal message, a target abnormality handling strategy is determined. The abnormality handling strategy of the forwarding plane can be configured through the control plane or CLI command line, so that the forwarding plane can handle abnormal traffic according to the configured abnormality handling strategy. It should be noted that if the deterministic service message does not experience an abnormality, the deterministic service message is processed according to the normal process.

[0049] Step S120: performing a target processing operation on the deterministic service message according to the target exception processing strategy.

[0050] It is understandable that after determining the target exception handling strategy, the target processing operation is performed on the deterministic business message according to the target abnormal state strategy, thereby realizing the abnormal traffic processing of the forwarding surface. Among them, the forwarding node can support multiple exception handling strategies, and there are multiple exception handling strategies that can be turned on at the same time. In addition, different exception handling strategies have their own priorities. When multiple exception handling strategies are turned on at the same time, the node can perform target processing operations on the deterministic business message according to the target exception handling strategy in sequence according to the strategy priority. Exemplarily, when it is detected that the abnormal time of the deterministic business message occurs and the forwarding node turns on the exception handling strategy A and the exception handling strategy B, wherein the priority of the exception handling strategy A is higher than that of B, the forwarding node first performs the target processing operation on the abnormal message according to the exception handling strategy A. If there are still abnormal messages and the forwarding node no longer supports the continued execution of the exception handling strategy A, the abnormal message is subjected to the target processing operation according to the exception handling strategy B.

[0051] The message processing method provided in the embodiment of the present application determines a target exception handling strategy when it is determined that a target exception event occurs in a received deterministic service message, performs a target processing operation on the deterministic service message according to the target exception handling strategy, and realizes abnormal traffic processing on the forwarding plane.

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

[0053] Step S210: Determine the target outgoing time slot corresponding to the deterministic service message.

[0054] Step S220: When the first carrying capacity corresponding to the target outgoing time slot is greater than a preset first carrying threshold, it is determined that a target abnormal event occurs in the deterministic service message, wherein the first carrying capacity represents the carrying capacity after the deterministic service message is added to the target outgoing time slot.

[0055] It should be understood that if the forwarding node adopts a time slot mechanism to forward messages, when a deterministic message is received, the corresponding target outgoing time slot can be determined based on the parameters carried by the message. Each outgoing time slot in the forwarding node is associated with a cache queue, and then the cache depth of the cache queue corresponding to the target outgoing time slot is used to determine whether the target abnormal event has occurred in the message. For example, for the TQF mechanism, the target outgoing time slot of the message on this node can be determined based on the upstream time slot number carried by the message and the time slot mapping relationship of the node itself. For example, if the upstream time slot number carried by the message is 0 and the time slot mapping relationship of the node itself is 0→4, then the target outgoing time slot of the message on this node can be determined to be 4; for the Deadline mechanism, the target outgoing time slot of the message on this node can be determined based on the budget, delay target and other information carried by the message.

[0056] When the message arrives at the forwarding node, the corresponding cache queue is determined according to the target outgoing time slot of the message and the message is placed in the cache queue. Please refer to Figure 9, which shows a flow chart of a message abnormality judgment provided by an embodiment of the present application. As shown in Figure 9, for the CQF mechanism, if the currently scheduled outgoing time slot is 1 and the message with the target outgoing time slot is 5, it can enter the corresponding cache queue 5 in advance. The allowed carrying capacity threshold of cache queue 5 is 4 messages, that is, the first carrying capacity threshold of the target outgoing time slot is 4 messages. Then, it is judged whether an abnormal event occurs to the message based on the queue depth after the message enters the cache queue. Specifically, if the queue depth after the message enters the cache queue does not exceed the allowed carrying capacity threshold of the cache queue, the message will be A message is added to the queue. If the queue depth of the message after entering the cache queue exceeds the allowed carrying capacity threshold of the cache queue, it is determined that a target abnormal event has occurred for the message. As shown in Figure 9, messages with sequence numbers 1 to 4 can normally enter the cache queue 5 of the target outgoing time slot. If the message with sequence number 5 is then placed in the cache queue 5, the queue depth of the cache queue 5 will exceed the preset allowed carrying capacity threshold, that is, the carrying capacity (5 messages) of the target outgoing time slot 5 after message 5 is added is greater than the first carrying capacity threshold (4 messages), and the messages with sequence numbers 5 and 6 are treated as abnormal messages.

[0057] In some embodiments, please see Figure 4, which shows a message processing method provided by an embodiment of the present application. As shown in Figure 4, the target abnormal event is determined according to step S310 and step S320.

[0058] Step S310: Acquire the legal time of the deterministic service message.

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

[0060] It should be understood that for the Asynchronous Traffic Shaper (ATS) mechanism, ATS is based on UBS (Urgency-based Scheduler) and provides deterministic delay without strict time synchronization by reshaping the Time Sensitive Network (TSN) flow at each hop. If the forwarding node adopts the ATS mechanism, it can obtain the legal time of the deterministic business message and determine the target abnormal event of sending the deterministic business message when the legal time exceeds the sum of the arrival time and the maximum residence time, that is, the deterministic business message is treated as an abnormal message.

[0061] It should be noted that the above embodiment describes the judgment of whether a target abnormal event occurs in a received deterministic service message based on the allowed carrying capacity threshold of the cache team and the arrival time and residence time constraints of the message. In actual applications, other abnormal judgment methods can also be used to determine whether a target abnormal event occurs in a deterministic service message. The embodiments of the present application do not make specific limitations here.

[0062] In some embodiments, the target exception handling strategy includes a squeeze handling strategy.

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

[0064] Step S410: Determine a target outgoing time slot corresponding to the deterministic service message.

[0065] Step S420: When the first carrying capacity corresponding to the target outgoing time slot is greater than the preset first carrying capacity threshold and less than the preset second carrying capacity threshold, the deterministic service message is added to the cache queue of the target outgoing time slot according to the squeeze processing strategy, wherein the second carrying capacity threshold is greater than the first carrying capacity threshold.

[0066] It is understandable that the target exception handling strategy includes a squeeze handling strategy, which supports multiple queue mechanisms such as TQF and Deadline, allowing messages that are not sent within the specified time to be squeezed into the subsequent time for sending until the queue cache is emptied. The squeeze handling strategy and the specific squeeze threshold can be enabled by configuring the forwarding plane through the control plane. When the forwarding node determines that a target exception event has occurred in a deterministic service message and the squeeze handling strategy is enabled, it first determines the target outgoing time slot corresponding to the deterministic service message, and further determines the cache queue corresponding to the target outgoing time slot. If the queue depth of the deterministic service message after entering the cache queue exceeds the allowed carrying capacity threshold of the cache queue (i.e., the first carrying threshold) and is less than the squeeze threshold (i.e., the second carrying threshold), the deterministic service message is added to the cache queue of the target outgoing time slot according to the squeeze handling strategy. For example, please refer to Figure 19, which shows a message processing method provided by an embodiment of the present application. As shown in Figure 19, the forwarding plane adopts the TQF mechanism to forward messages, the control plane configures the forwarding plane to enable the extrusion processing strategy and configures the extrusion threshold to 15000 bits, the current cache depth of queue 5 is 8000 bits, the allowed carrying capacity threshold is 10000 bits, the size of each message in the service flow is 1000 bits, the periodic template of the messages from sequence number 1 to 10 is A and carries the time slot number 0, when the messages from sequence number 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 bits at this time, since the forwarding plane enables the extrusion processing strategy and the extrusion threshold is 15000 bits, according to the extrusion processing strategy, the messages from sequence number 3 to 7 can be added to the cache queue 5 corresponding to the target outgoing time slot.

[0067] In the case where the forwarding node adopts the TQF mechanism, the time slot number carried by the deterministic service message that has been squeezed is the time slot code corresponding to the current cache queue. Please refer to Figure 10. Figure 10 shows a flow chart of a message processing method based on a squeeze processing strategy provided by an embodiment of the present application. As shown in Figure 10, forwarding node A forwards a message to forwarding node B. The outgoing time slot number corresponding to the cache queue 0 in forwarding node A is x. The abnormal message with the outgoing time slot number x is squeezed according to the squeeze processing strategy. The time slot number carried by the deterministic service message that has been squeezed is x. The downstream forwarding node B receives the message with the time slot number x within three time slots (time slot y-3, time slot y-2, time slot y). Therefore, according to the mapping relationship of time slot x→y, the message with the time slot number x is mapped to the same exit time slot. In the case of sudden non-continuous abnormal traffic squeezing, for the TQF mechanism, the use of the squeeze processing strategy can maintain end-to-end deterministic jitter.

[0068] It should be noted that when the forwarding node adopts the deadline mechanism, if the deterministic service message is squeezed according to the squeeze processing strategy, it is necessary to record the delay extended by the squeeze strategy in the deterministic service message that has been squeezed, so as to support the recalculation of the budget time of the deterministic service message in the subsequent node.

[0069] In some embodiments, the target exception handling policy includes a degradation handling policy.

[0070] Correspondingly, please refer to Figure 6, which shows a sub-step flowchart of step S120 in Figure 2. As shown in Figure 6, target processing operations are performed on the deterministic business message according to the target exception handling strategy, including but not limited to steps S510 and S520.

[0071] Step S510: According to the degradation processing strategy, the service priority of the deterministic service message is reduced from the first priority to the second priority.

[0072] Step S520: Add the deterministic service message to the cache queue corresponding to the second priority.

[0073] It should be understood that the target exception handling policy includes a downgrade handling policy. This downgrade handling policy can be enabled and the corresponding downgrade parameters configured on the forwarding plane through the control plane configuration. Specifically, if a target exception event occurs in a deterministic service message, the service priority of the deterministic service message is reduced from the first priority to the second priority according to the downgrade handling policy, and the deterministic service message is added to the cache queue corresponding to the second priority.

[0074] Taking TQF as an example, if the forwarding plane supports a multi-template mechanism (for example, template A, template B, and template C according to time slots from large to small), for deterministic service packets with target abnormal time, the degradation processing 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 downgraded to template B. If the current deterministic service packet belongs to template B, it can be downgraded to target C. If the current deterministic service packet belongs to template C, the packet priority can be modified and downgraded to CS6 (Class Selector 6) to the best effort BE (Best Effort) queue and adopt traditional QoS (Quality of 13, which shows a flow chart of a message processing method based on a downgrade processing strategy provided by an embodiment of the present application. As shown in FIG13, messages with sequence numbers 1 to 6 correspond to target out-queue 5. After messages with sequence numbers 1 to 4 enter queue 5 of template A, the cache depth of queue 5 reaches the allowed carrying capacity threshold, and the messages with sequence numbers 5 and 6 are judged to be abnormal messages. According to the downgrade processing strategy, the messages with sequence numbers 5 and 6 are downgraded from template A to template B, and the messages with sequence numbers 5 and 6 are added to the cache queue corresponding to template B.

[0075] Taking the Deadline mechanism as an example, a degradation processing strategy is adopted, which increases the residence time of abnormal messages at this node, and postpones the message transmission for a certain time budget based on the target transmission time slot. 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 time 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 input and output clock deviation. For abnormal messages, when the legal time is greater than the sum of the message arrival time, the maximum residence time, and the relaxation time, the abnormal message is subsequently processed according to the legal time and the relaxation time.

[0076] In some embodiments, the target exception handling strategy includes a squeeze handling strategy and a degradation handling strategy.

[0077] Correspondingly, please refer to Figure 7, which shows a sub-step flowchart of step S120 in Figure 2. As shown in Figure 7, target processing operations are performed on deterministic business messages according to the target exception handling strategy, including steps S610, S620 and S630.

[0078] Step S610: Determine the target outgoing time slot corresponding to the deterministic service message.

[0079] Step S620: When the first carrying capacity corresponding to the target outgoing time slot is greater than the preset first carrying capacity threshold and less than the preset second carrying capacity threshold, the deterministic service message is added to the cache queue of the target outgoing time slot according to the squeeze processing strategy, wherein the second carrying capacity threshold is greater than the first carrying capacity threshold.

[0080] In step S630, when the first carrying capacity corresponding to the target outgoing time slot is greater than the second carrying threshold, the service priority of the deterministic service message is reduced from the first priority to the second priority according to the degradation processing strategy, and the deterministic service message is added to the cache queue corresponding to the second priority.

[0081] It should be understood that the target exception handling strategy includes a squeeze handling strategy and a downgrade handling strategy, and the squeeze handling strategy and the downgrade handling strategy can be enabled by configuring the forwarding plane through the control plane, and the corresponding squeeze threshold and downgrade parameters can be configured. When the forwarding node determines that the deterministic service message sends a target exception event and the squeeze handling strategy and the downgrade handling strategy are enabled at the same time, it first determines the target outgoing time slot corresponding to the deterministic service message, and further determines the cache queue corresponding to the target outgoing time slot. If the queue depth of the deterministic service message after entering the cache queue exceeds the allowed carrying capacity threshold (i.e., the first carrying capacity threshold) of the cache queue and is less than the squeeze threshold (i.e., the second carrying capacity threshold), according to the squeeze handling strategy, the deterministic service message is added to the cache queue of the target outgoing time slot. When the first carrying capacity corresponding to the target outgoing time slot is greater than the second carrying capacity threshold, the service priority of the deterministic service message is reduced from the first priority to the second priority according to the downgrade handling strategy, and the deterministic service message is added to the cache queue corresponding to the second priority. Please refer to Figure 19, which shows a message processing method provided by an embodiment of the present application. As shown in Figure 19, the control plane configures the forwarding plane to open the squeeze processing strategy and configures the squeeze threshold to 15000bit. The current cache depth of queue 5 is 8000bit, the allowed carrying capacity threshold is 10000bit, the size of each message of the service flow is 1000bit, the periodic template of the messages from sequence number 1 to 10 is A and carries the time slot number 0. When the messages from sequence number 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 10000bit at this time. Since the forwarding plane is opened If a squeeze processing strategy is adopted and the squeeze threshold is 15000 bits, according to the squeeze processing strategy, the messages with sequence numbers 3 to 7 can be added to the cache queue 5 corresponding to the target outgoing time slot. At this time, for the messages with sequence numbers 8 to 10, if the messages with sequence numbers 8 to 10 are added to the cache queue 5 corresponding to the target outgoing time slot, the first carrying capacity of 18000 bits corresponding to the target outgoing time slot will be greater than the second carrying threshold of 15000 bits. Therefore, according to the downgrade processing strategy, the service priority of the deterministic service message is reduced from the first priority to the second priority. Specifically, the messages with sequence numbers 8 to 10 are downgraded from template A to template B for processing.

[0082] In an embodiment of the present application, the forwarding node simultaneously turns on the squeeze processing strategy and the downgrade 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 squeeze processing strategy is executed on the abnormal message. When the first carrying capacity corresponding to the target outgoing time slot is greater than the second carrying threshold, the downgrade processing strategy is executed. That is to say, when an abnormal message occurs, the squeeze processing strategy is executed first. If there are still abnormal messages after the squeeze processing strategy is executed and the first carrying capacity corresponding to the target outgoing time slot is greater than the second carrying threshold, then the abnormal message is processed according to the downgrade processing strategy. In addition, in the case of an abnormal message, the downgrade processing strategy can be executed on the abnormal message first. If there are still abnormal messages after the downgrade processing strategy is executed, then the abnormal message is processed according to the squeeze processing strategy. For example, if it is determined that the messages with sequence numbers 5 to 10 are abnormal messages, the messages with sequence numbers 5 to 10 are first downgraded from template A to template B for processing. Assuming that after the messages with sequence numbers 5 to 9 enter the cache queue corresponding to template B, the queue depth of the cache queue reaches the allowed carrying capacity threshold, the squeezing processing strategy is then executed on the message with sequence number 10, and the message with sequence number 10 is squeezed into the cache queue corresponding to template B.

[0083] 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.

[0084] Correspondingly, please refer to Figure 8, which shows a message processing method provided by an embodiment of the present application. As shown in Figure 8, the deterministic service message is added to the cache queue corresponding to the second priority, including but not limited to step S710 and step S720.

[0085] Step S710: Determine a target outgoing time slot corresponding to the deterministic service message at the second priority level.

[0086] Step S720: Add the deterministic service message to the sub-buffer queue corresponding to the target outgoing time slot.

[0087] 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 output time slot. When the service priority of the deterministic service message is downgraded to the second priority, the target output time slot corresponding to the deterministic service message under the second priority is first determined, and then the deterministic service message is added to the sub-cache queue corresponding to the target output time slot.

[0088] For example, please refer to Figure 19, which shows a flow chart of a message processing method provided by an embodiment of the present application. As shown in Figure 19, the time slot mapping relationship of template A is 0→5, and the time slot mapping relationship of template B is 0→3. The cache queue corresponding to template B includes 4 sub-cache queues, and each sub-cache queue corresponds to time slots 0 to 3 in sequence. Assuming that the periodic template of the messages numbered 1 to 10 is A and carries the time slot number 0, when the service priority of the messages numbered 8 to 10 is downgraded to using template B, it can be determined that the target output time slot corresponding to the messages numbered 8 to 10 under template B is 3, so the messages numbered 8 to 10 are added to the sub-cache queue corresponding to the target output time slot 3.

[0089] In some embodiments, lowering the service priority of the deterministic service message from a first priority to a second priority includes:

[0090] When a preset degradation condition is met, the service priority of the deterministic service message is reduced from the first priority to the second priority.

[0091] Among them, the downgrade conditions include at least one of the following:

[0092] The delay caused by the degradation of the deterministic service message is less than the preset delay upper limit.

[0093] The number of downgraded packets currently being processed is less than the preset upper limit for downgraded packets.

[0094] It should be understood that before downgrading the service priority of a deterministic service message, whether to downgrade the deterministic service message is determined based on the amount of delay generated after the downgrade. As shown in Figure 22, the Deadline mechanism of the outbound port of the forwarding node consists of 10 time slot queues, each time slot is 10us long, numbered 0 to 9, the service flow message size is a fixed length of 1000bit, the target outbound time slot of messages numbered 1 to 10 is 3, the depth of cache queue 3 is 5000bit, and after the messages numbered 1 to 5 are added to queue 3 in sequence, the depth of queue 3 reaches the allowed carrying capacity threshold of 10000bit. When the messages numbered 6 to 10 arrive, since the queue corresponding to the outbound time slot 3 is full, the messages numbered 6 to 10 are judged as abnormal messages. At this time, the messages numbered 6 to 10 are downgraded according to the downgrade processing strategy. For downgrading, assuming that the upper limit of the delay is 50us, the messages with sequence numbers 6 to 10 can only be added to the queue before time slot queue 7. If the messages with sequence numbers 6 to 10 are added to the queue after time slot queue 7, the delay caused by the downgrading of the messages will be greater than the upper limit of the delay. Alternatively, whether to downgrade the deterministic service messages is determined based on the number of messages that currently need to be downgraded. Referring to the above example, the messages with sequence numbers 6 to 10 are the messages currently downgraded, and their number is 5. At this time, the depth of queue 4 is 2000 bits. If it is stipulated that no abnormal messages can be entered after the queue depth reaches 5000 bits, it can be determined that the upper limit of the number of downgraded messages is 3. Therefore, the messages with sequence numbers 6 to 8 can only be added to queue 4, and the service priority of the messages with sequence numbers 9 and 10 is further reduced.

[0095] In some embodiments, the message processing method further includes one of the following:

[0096] If the preset degradation conditions cannot be met, the deterministic service message will be discarded;

[0097] or,

[0098] If the preset degradation conditions cannot be met, the deterministic service message is added to the best effort BE queue.

[0099] It should be understood that when the preset degradation conditions cannot be met, that is, the delay generated after the deterministic service message is downgraded is less than the preset delay upper limit, or the number of messages currently being downgraded is less than the preset upper limit of the number of downgraded messages, you can choose to discard the deterministic service message, or choose to add the deterministic service message to the best effort BE queue.

[0100] For example, as shown in Figure 13, the forwarding node supports a multi-template mechanism, including template A, template B, template C, and port queues CS6 to BE. When the preset degradation conditions cannot be met, you can choose to directly add the deterministic service message to the best-effort BE queue; as shown in Figure 22, the forwarding node uses the Deadline mechanism to forward messages. The Deadline mechanism consists of 10 time slot queues. If the preset degradation conditions cannot be met and the deterministic service message cannot be added to any time slot queue, you can choose to discard the deterministic service message.

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

[0102] 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;

[0103] Adding delay information to the second field of the deterministic service message, wherein the delay information is used to indicate the delay amount generated after the deterministic service message is degraded.

[0104] In step S810, taking the TQF mechanism as an example, if the forwarding plane supports a multi-template mechanism (for example, template A, template B, template C from large to small according to time slots), please refer to Figure 11. Figure 11 shows a schematic diagram of a message encapsulation format provided by an embodiment of the present application. As shown in Figure 11, taking SRv6 encapsulation as an example, for deterministic service messages at the target abnormal time, the downgrade processing strategy is set to downgrade successively according to the cycle template, and the service priority of the deterministic service message is reduced from template A to template B. At this time, the first field cycle-template in the deterministic service message used to identify the service priority corresponding to the deterministic service message is modified to a value corresponding to the second priority, that is, changed from template A to template B, and the target out time slot is recalculated and the out-slot field of the message is modified accordingly. Please refer to Figure 12, which shows a schematic diagram of a message encapsulation format provided in an embodiment of the present application. As shown in Figure 12, taking IPv6 encapsulation as an example, if the deterministic service message is downgraded to BE processing, it is necessary to set the first field in the deterministic service message used to identify the service priority corresponding to the deterministic service message to 0, that is, the priority (PCP / DSCP / EXP) field is set to 0.

[0105] In step S820, taking the Deadline mechanism as an example, a degradation processing strategy is adopted, that is, the residence time of the abnormal message in this node is increased, and the message is postponed for a certain time budget on the basis of the target sending time slot before being sent. The postponed time budget can be flexibly adjusted according to the busy and idle program of the current node port, and before the message is added to the corresponding cache queue, the postponed event budget is added as the postponement delay information to the second field used to indicate the postponement delay amount generated after the degradation, so as to support the recalculation of the budget time of the deterministic business message in the subsequent node.

[0106] Please refer to Figure 14, which shows a flow chart of a message processing method based on a degradation processing strategy provided by an embodiment of the present application. As shown in Figure 14, messages with sequence numbers 1 to 6 correspond to the target out-queue 5, and messages with sequence numbers 7 to 9 correspond to the target out-queue 6. After the messages with sequence numbers 1 to 4 enter queue 5 of template A, the cache depth of queue 5 reaches the allowed carrying capacity threshold. Therefore, the messages with sequence numbers 5 and 6 are processed accordingly according to the degradation processing strategy. By increasing the residence time 3T of the messages with sequence numbers 5 and 6 at this node on the basis of the target sending time slot, T is the queue scheduling period, and then adding the delay information in the second field of the message used to indicate the delay amount generated after the deterministic service message is downgraded. At this time, the delay information is the residence time 3T. Finally, the messages with sequence numbers 5 and 6 are added to queue 8 for sending.

[0107] It should also be noted that in the downgrade processing strategy, the standard protocol 802.1CB and 802.1Qci PSFP mechanism can be used to identify specific business flow messages and perform modification of the priority field. BGP-FS, ACL and other technologies can be used to match message header fields and perform corresponding actions on the messages, including adjusting the internal scheduling parameters of the message, modifying the existing fields of the message, and inserting new fields into the message. The embodiments of the present application do not impose specific restrictions on the method of identifying and modifying the message header fields.

[0108] 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.

[0109] 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 downgraded successively or non-successively. As shown in Figure 13, the messages with sequence numbers 1 to 6 correspond to the target out-queue 5, and the messages with sequence numbers 7 to 9 correspond to the target out-queue 6. After the messages with sequence numbers 1 to 4 enter the queue 5 of template A, the cache depth of queue 5 reaches the allowed carrying capacity threshold. Therefore, the messages with sequence numbers 5 and 6 are processed accordingly according to the degradation processing strategy. The messages with sequence numbers 5 and 6 can be downgraded to template B for processing by successive downgrade, or the messages with sequence numbers 5 and 6 can be downgraded to the BE queue for processing by non-successive downgrade.

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

[0111] In some embodiments, before adding the deterministic service message to the cache queue of the target outgoing time slot, the message processing method also includes adding squeeze bit information in the third field of the deterministic service message, wherein the squeeze bit information is used to indicate the number of squeeze bits generated by the deterministic service message.

[0112] It can be understood that, please refer to Figure 15, which shows a schematic diagram of a message encapsulation format provided by an embodiment of the present application. As shown in Figure 15, taking the SRv6 service message as an example, the third field jiya-bit is extended in the message header to indicate the number of squeezed bits generated by the deterministic service message, and before the deterministic service message is added to the cache queue of the target outgoing time slot, the squeezed bit information is added to the third field to facilitate the scheduling and processing of the message in subsequent nodes.

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

[0114] It should be understood that, as shown in Figure 15, taking the SRv6 service message as an example, the fourth fields jiya-flag and jiangji-flag used to indicate the exception handling strategy adopted by the deterministic service message are extended in the message header, and before determining the target exception handling strategy, the policy identifier corresponding to the target exception handling strategy is added to the fourth field. For example, the value of the fourth field jiangji-flag is set to 1, indicating that the current message has been downgraded.

[0115] In a specific embodiment, please refer to Figure 16, which shows a flow chart of an exception handling policy configuration method provided in an embodiment of the present application. As shown in Figure 16, if the forwarding plane supports multiple exception handling policies, the exception handling policies and related parameters enabled for the forwarding node can be configured through the control plane, CLI command line, and other methods. For example, for the squeeze processing policy, the squeeze threshold can be configured; for the degradation processing policy, the upper limit of the delay can be configured; or degradation parameters such as degradation 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.

[0116] In a specific embodiment, please refer to Figure 17, which shows a flow chart of a message processing method provided by an embodiment of the present application. As shown in Figure 17, after the forwarding plane automatically responds to abnormal traffic according to the squeezing or degradation processing strategy, it reports the abnormal situation to the controller so that the controller can perceive the specific abnormal situation in the network and make relevant responses, such as re-arrangement, table reconfiguration or resource expansion, etc. 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 message information, abnormal processing strategy information and parameter information. Among them, the basic information includes node ID, port ID, etc., the abnormal flow and message information includes flow ID, message sequence number range, etc., the abnormal processing strategy information and parameter information include the adopted processing strategy (squeezing, degradation or natural processing), strategy-related parameters (including squeezing amount, number of messages, etc., or including postponement delay amount, cycle template before and after degradation, number of messages, etc., or including the number of messages discarded, downgraded to BE, etc.).

[0117] In a specific embodiment, refer to FIG. 18 , which shows a flow chart of a message processing method provided in an embodiment of the present application. As shown in FIG. 18 , when a forwarding node receives a deterministic service message, its processing flow includes the following steps:

[0118] 1) Start by receiving a deterministic service message;

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

[0120] 3) Determine which exception handling policies the forwarding plane supports. If no exception handling policy is enabled, go to 4). If both squeeze and downgrade handling policies are enabled, go to 5). If only squeeze handling policy is enabled, go to 6). If only downgrade handling policy is enabled, go to 7).

[0121] 4) Process the abnormal message according to the existing process and go to 9);

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

[0123] 6) Process the abnormal message according to the squeeze processing strategy, and go to 9);

[0124] 7) Use the downgrade processing strategy to handle the abnormal message, and go to 9);

[0125] 8) Process normal messages according to existing procedures;

[0126] 9) End.

[0127] The message processing method provided by this application is described below through specific examples.

[0128] Example 1

[0129] Example 1 describes the anomaly detection method and handling strategy for the forwarding plane when using the TQF mechanism. As shown in Figure 19, the TQF mechanism on the egress port of a forwarding node supports three periodic templates: Template A, Template B, and Template C. The time slot lengths of Templates A through C increase in powers of two, and the number of time slots decreases in powers of two. The time slot mapping for Template A is 0→5 and 2→7, while the time slot mapping for Template B is 0→3. Assume that the allowed payload threshold for each TQF time slot in Template A is 10,000 bits, the allowed payload threshold for Template B is 20,000 bits, and the allowed payload threshold for Template C is 40,000 bits. When the queue buffer depth corresponding to Template A exceeds 10,000 bits, an anomaly is detected.

[0130] The control plane configures the forwarding plane to enable the squeeze policy, with the squeeze threshold set to 15000 bits. The control plane also configures the forwarding plane to enable the progressive degradation policy. Each packet in the service flow is 1000 bits in size. The periodic template for packets numbered 1 to 10 is A and carries timeslot number 0. The periodic template for packets numbered 11 to 15 is A and carries timeslot number 2. When packet numbered 1 arrives at the relay node, the current buffer depth in queue 5 is 8000 bits, and the current buffer depth in queue 7 is 0 bits.

[0131] Figure 19 shows the processing of service flow message sequences 1 to 15. When messages with sequence numbers 1 and 2 enter queue 5 according to the time slot mapping 0→5 in template A, the buffer depth of queue 5 has reached 10,000 bits. When message number 3 arrives and also enters queue 5 according to the time slot mapping 0→5 in template A, the buffer depth of queue 5 exceeds the allowed carrying capacity threshold, indicating abnormal traffic.

[0132] The forwarding node currently has squeeze processing enabled, with a squeeze threshold of 15,000 bits. Among the packets with outgoing time slot 0, packets with sequence numbers 3 through 7 are eligible for squeeze processing and enter queue 5. After squeeze processing, packets with sequence numbers 3 through 7 still carry outgoing time slot 5. When packet 8 arrives, if it enters queue 5 according to the time slot mapping 0 → 5 in template A, the buffer depth of queue 5 exceeds the squeeze threshold of 15,000 bits.

[0133] The forwarding node currently has the downgrade policy enabled, which performs downgrades in sequence. Therefore, packets with sequence numbers 8 to 10 are downgraded from template A to template B for processing. Based on the outgoing slot number 0 corresponding to template A carried in the packets, they are converted to outgoing slot code 0 of template B. Consequently, packets with sequence numbers 8 to 10 are processed according to template B's time slot mapping relationship 0→3. Packets with sequence numbers 11 to 15 enter template A's cache queue 7 according to template A's time slot mapping relationship 2→7. After all packets enter queue 7, the cache depth of queue 7 is 10,000 bits, which does not exceed the allowed carrying capacity threshold.

[0134] As shown in Figures 20 and 21, 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 exception handling strategy and related parameters used by the packet.

[0135] Taking abnormal message 3 as an example, abnormal message 3 adopts the squeezing processing strategy and the squeezing amount is 1000 bits, belongs to template A and the corresponding outgoing time slot is 5. The corresponding field values ​​of abnormal message 3 are shown in Figure 20: the jiya-flag field value is true, indicating that the message adopts the squeezing processing strategy; the jiya-bit field value is 1000, indicating that the squeezing amount is 1000 bits; the cycle-tmp field value is A, indicating that the message is forwarded using template A; the out-slot field value is 5, indicating that the outgoing time slot of the message is 5.

[0136] Taking abnormal message 8 as an example, abnormal message 4 adopts the downgrade processing strategy and is downgraded from template A to template B. The corresponding outgoing time slot before the downgrade is 5, and the corresponding outgoing time slot after the downgrade is 3. The corresponding field values ​​of abnormal message 3 are shown in Figure 20: the jiangji-flag field value is true, indicating that the message adopts the downgrade processing strategy; the cycle-tmp field value is B, indicating that the message is forwarded using template B after downgrade; the old-cycle-tmp field value is A, indicating that the message is forwarded using template A before downgrade; the out-slot field value is 3, indicating that the corresponding outgoing time slot after the message is downgraded is 3; the old-out-slot field value is 5, indicating that the corresponding outgoing time slot before the message is downgraded is 5.

[0137] Example 2

[0138] Example 2 describes the anomaly detection method and anomaly handling strategy for the forwarding plane when the Deadline mechanism is adopted. Please refer to Figure 22, which shows a flow chart of the message processing method provided by the embodiment of the present application. As shown in Figure 22, the Deadline mechanism of the outbound port of the forwarding node consists of 10 time slot queues, each time slot is 10us long, numbered from 0 to 9, and the allowed carrying capacity threshold of each time slot is 10,000 bits. Assuming that there is converged traffic, the depth of cache queue 3 is 5,000 bits, the depth of cache queue 4 is 2,000 bits, the depth of cache queue 5 is 5,000 bits, the depth of cache queue 6 is 1,000 bits, and the depths of cache queues 7, 8, and 9 are 10,000 bits.

[0139] The forwarding plane is configured to enable a degradation policy with a maximum allowable degradation of 50 μs, allowing the forwarding plane to flexibly degrade within 50 μs. The service flow packet size is fixed at 1000 bits. Based on the delay budget, the forwarding plane sets the target outgoing time slot 3 for packets with sequence numbers 1 to 10 and the target outgoing time slot 4 for packets with sequence numbers 11 to 16. As shown in Figure 22, packets with sequence numbers 1 to 5 are sequentially added to queue 3. At this point, the depth of queue 3 reaches the allowed carrying capacity threshold of 10,000 bits. When packets with sequence numbers 6 to 10 arrive, the queue corresponding to outgoing time slot 3 is full, so the packets after packet 5 are considered abnormal.

[0140] The forwarding plane has a downgrade policy enabled, allowing flexible configuration of downgrade levels based on the egress queue situation. Assuming the queue depth does not exceed 5000 bits, abnormal packets are deferred in the manner that minimizes latency. Therefore, packets with sequence numbers 6 through 8 enter queue 4. At this point, queue 4's buffer depth has reached 5000 bits, and no further abnormal packets can enter. Queue 5 has already reached 5000 bits, while queue 6 has a depth of 1000 bits. The maximum delay is within the specified range of 40µs < 50µs. Therefore, packets with sequence numbers 9 and 10 enter queue 6, which now has a depth of 3000 bits.

[0141] Packets from sequence numbers 11 to 15 enter queue 4 as normal. At this point, the depth of queue 4 reaches the allowed carrying capacity threshold of 10,000 bits. Packet 16 is marked as an abnormal service packet and delayed by 20 μs before entering queue 6. At this point, the depth of queue 6 is 4,000 bits.

[0142] Among them, please refer to Figure 23, which shows a schematic diagram of a message encapsulation format provided by an embodiment of the present application. As shown in Figure 23, taking the abnormal message with sequence number 6 being downgraded to queue 4 for processing as an example, the maximum possible delay time is 20us, based on the encapsulation method of the deadline encapsulation draft 6man IPv6 Option type, the downgrade delay time (delayed time) information is extended.

[0143] The embodiment of the present application further provides an electronic device, as shown in FIG15 , wherein the electronic device 1400 includes:

[0144] one or more processors 1410;

[0145] The memory 1420 stores one or more programs. When the one or more programs are executed by the one or more processors 1410, the one or more processors 1410 implement the message processing method.

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

[0147] The memory 1420 can 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). The memory 1420 can store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 1420 and is called by the processor 1410 to execute the methods of the embodiments of this application.

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

[0149] In some embodiments, the electronic device further comprises:

[0150] Input / output interface, used to realize information input and output;

[0151] Communication interface, used to realize communication interaction between this device and other devices, which can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, Wi-Fi, Bluetooth, etc.);

[0152] A bus that transmits information between various components of the device (e.g., the processor 1410, memory 1420, input / output interfaces, and communication interfaces);

[0153] The processor 1410 , the memory 1420 , the input / output interface, and the communication interface can be communicatively connected to each other within the device via a bus.

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

[0155] An embodiment of the present application also provides a computer program product, including a computer program or computer instructions, which are stored in a computer-readable storage medium. A processor of a 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 the message processing method provided in the embodiment of the present application.

[0156] The system architecture and application scenarios described in the embodiments of the present application are intended to more clearly illustrate 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 will appreciate 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.

[0157] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the 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 embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. 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 external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0158] Those skilled in the art will appreciate that all or some of the steps and systems in the method disclosed above can be implemented as software, firmware, hardware, and appropriate combinations thereof. 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 implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, and the computer-readable medium can include computer storage media (or non-transitory media) and communication media (or temporary media). As known to those skilled in the art, the term computer storage media is included in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data) and is volatile and non-volatile, removable, and non-removable. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory, or other memory technology, CD-ROM, digital versatile disks (DVD), or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage, or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, as is well known to those skilled in the art, communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0159] The above description of some embodiments of the present application with reference to the accompanying drawings does not limit the scope of the present application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and essence of the present application shall be within the scope of the present application.

Claims

1. A message processing method, the method comprising: When it is determined that a target abnormal event occurs in the received deterministic service message, a target abnormality handling strategy is determined; Perform a target processing operation on the deterministic service message according to the target exception processing 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 a first carrying capacity corresponding to the target outgoing time slot is greater than a preset first carrying threshold, it is determined that a target abnormal event occurs in the deterministic service message, wherein the first carrying capacity represents the carrying capacity of the target outgoing time slot after the deterministic service message is added.

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

4. The method according to claim 1, wherein: The target exception handling strategy includes a squeeze handling strategy, and the target handling operation on the deterministic service message according to the target exception handling strategy includes: Determining a target outgoing time slot corresponding to the deterministic service message; When the first carrying capacity corresponding to the target outgoing time slot is greater than a preset first carrying capacity threshold and less than a preset second carrying capacity threshold, the deterministic service message is added to the cache queue of the target outgoing time slot according to the squeeze processing strategy, wherein the second carrying capacity threshold is greater than the first carrying capacity threshold.

5. The method according to claim 1, wherein: The target exception handling strategy includes a downgrade handling strategy, and the target processing operation on the deterministic service message according to the target exception handling strategy includes: According to the degradation processing strategy, reducing the service priority of the deterministic service message from the first priority to the second priority; Add the deterministic service message to the cache queue corresponding to the second priority.

6. The method according to claim 1, wherein: The target exception handling strategy includes a squeeze handling strategy and a downgrade handling strategy; The performing a target processing operation on the deterministic service message according to the target exception processing strategy includes: Determining a target outgoing time slot corresponding to the deterministic service message; When the first carrying capacity corresponding to the target outgoing time slot is greater than a preset first carrying capacity threshold and less than a preset second carrying capacity threshold, according to the squeeze processing strategy, the deterministic service message is added to the cache queue of the target outgoing time slot, wherein the second carrying capacity threshold is greater than the first carrying capacity threshold; When the first carrying capacity corresponding to the target outgoing time slot is greater than the second carrying threshold, according to the downgrade 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, each sub-cache queue corresponds to an outgoing time slot, and adding the deterministic service message to the cache queue corresponding to the second priority includes: Determining a target outgoing time slot corresponding to the deterministic service message at the second priority level; The deterministic service message is added to the sub-cache queue corresponding to the target outgoing 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 downgrade condition is met, reducing the service priority of the deterministic service message from the first priority to the second priority; The downgrade condition includes at least one of the following: The delay amount generated after the deterministic service message is downgraded is less than a preset delay upper limit value; The number of messages currently being downgraded is less than the preset upper limit of the number of downgraded messages.

9. The method according to claim 8, wherein: The method further comprises one of the following: If the preset degradation condition cannot be met, discarding the deterministic service message; or, When the preset degradation condition cannot be met, the deterministic service message is added 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: Modify 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 postponement delay information in the second field of the deterministic service message, wherein the postponement delay information is used to indicate the postponement delay amount generated after the deterministic service message is downgraded.

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 outgoing time slot, the method further includes: Squeezing bit information is added to the third field of the deterministic service message, wherein the squeezing bit information is used to indicate the number of squeezed 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: A policy identifier corresponding to the target exception handling policy is added to the fourth field of the deterministic service message.

14. An electronic device comprising: one or more processors; A memory having one or more programs stored thereon, when the one or more programs are executed by the one or more processors, the one or more processors implement: A message processing method as described in any one of claims 1 to 13.

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

Images