Message processing method, transmission method, communication equipment, system, medium, and product

Abstract

Embodiments of the present application provide a message processing method, a transmission method, a communication device, a communication system, a storage medium, and a program product, which include: setting a periodicity label for a message, the periodicity label including a first time period label and a second transmission time period label value, the first time period label being used to mark a transmission period corresponding to the message in each downstream node, and the second transmission time period label value being used to mark a transmission sub-period of the message in the source node and the sink node (S100); and transmitting the set message to the downstream node (S200).

Description

[Technical Field]

[0001] This application is filed based on a Chinese patent application bearing application number 202211132210.7 and filed on September 16, 2022, and claims priority to that Chinese patent application, the entire contents of which are incorporated herein by reference.

[0002] TECHNICAL FIELD The present application relates to the technical field of communications, and in particular to a message processing method, a transmission method, a communication device, a communication system, a storage medium, and a program product. [Background technology]

[0003] With the use and development of wireless communication technology in scenarios such as connected cars and the industrial Internet of Things, the requirements for the quality of information transmission in wireless networks are becoming higher, and the best-effort transmission technology of Ethernet cannot guarantee that the delay and jitter of information transmission meet the requirements of related application scenarios.

[0004] In conventional technologies, such as Time-Sensitive Network (TSN), Cyclic Queuing and Forwarding (CQF), and Cycle-Specified Queuing and Forwarding (CSQF), delays and jitters can be controlled within a certain range for information transmission. However, due to limitations in equipment capabilities, it is difficult to further reduce the range of delays and jitters in information transmission. Therefore, how to further reduce delays and jitters has become an issue that needs to be urgently discussed and resolved. Summary of the Invention [Problem to be solved by the invention]

[0005] Embodiments of the present application provide a message processing method, a transmission method, a communication device, a communication system, a storage medium, and a program product. [Means for solving the problem]

[0006] According to a first aspect, an embodiment of the present application provides a message processing method applied to a source node, comprising: setting a periodicity label for a message, the periodicity label including a first time period label and a second transmission time period label value, the first time period label being used to mark a transmission period corresponding to the message at each downstream node, and the second transmission time period label value being used to mark a transmission sub-period of the message at a source node and a sink node; sending the configured message to a downstream node.

[0007] According to a second aspect, an embodiment of the present application provides a message processing method applied to an intermediate node, comprising: receiving a message including a periodicity label, the periodicity label including a first time period label and a second transmission time period label value, the first time period label being used to mark a transmission period corresponding to the message at each downstream node, and the second transmission time period label value being used to mark a transmission sub-period of the message at the sink node; and transmitting a message based on the first time period label.

[0008] According to a third aspect, an embodiment of the present application provides a message processing method applied to a sink node, comprising: receiving the message including a periodicity label, the periodicity label including a first transmission time period label value and a second transmission time period label value, the first transmission time period label value being used to mark a transmission period corresponding to the message at the sink node, and the second transmission time period label value being used to mark a transmission sub-period of the message at the sink node; transmitting a message based on the first transmission time period label value and the second transmission time period label value.

[0009] According to a fourth aspect, an embodiment of the present application provides a message processing method applied to a sink node, comprising: storing the message according to a first periodic setting; transmitting the message based on the first transmission time period label value; storing the transmitted messages according to a second periodicity setting and forming a first queue for receiving messages and a second queue for sending messages; determining a transmission sub-period corresponding to the queue based on a second transmission time period label value; transmitting the message within the transmission sub-period.

[0010] According to a fifth aspect, an embodiment of the present application is a method for transmitting a message, comprising: the source node setting a periodicity label for the message, the periodicity label including a first time period label and a second transmission time period label value, the first time period label being used to mark a transmission period corresponding to the message at each downstream node, and the second transmission time period label value being used to mark a transmission sub-period of the message at the source node and the sink node; the source node sending a message; an intermediate node receiving a message; the intermediate node deriving a transmission period corresponding to the message at the intermediate node based on the first time period label; the intermediate node transmitting a message within the corresponding transmission period; a sink node receiving the message; The sink node obtains a transmission sub-period corresponding to the message at the sink node based on the first time period label and the second transmission time period label value; the sink node transmitting a message in the transmission sub-period.

[0011] According to a sixth aspect, an embodiment of the present application provides a communications device including a memory, a processor, and a computer program stored in the memory and operable on the processor, wherein the processor, when executing the computer program, realizes a message processing method according to the first, second, third, or fourth aspect.

[0012] According to a seventh aspect, an embodiment of the present application comprises at least one processor; at least one memory for storing at least one program; At least one of the programs, when executed by at least one of the processors, implements the message transmission method according to the fifth aspect of the present invention.

[0013] According to an eighth aspect, an embodiment of the present application provides a computer-readable storage medium storing computer-executable instructions for performing the message processing method according to the first, second, third or fourth aspect, or the message transmission method according to the fifth aspect.

[0014] According to a ninth aspect, an embodiment of the present application provides a computer program product including a computer program or computer instructions, the computer program or the computer instructions being stored in a computer-readable storage medium, a processor of a computing device reading the computer program or the computer instructions from the computer-readable storage medium, and the processor executing the computer program or the computer instructions to cause the computing device to perform the message processing method according to the first, second, third or fourth aspect, or the message transmission method according to the fifth aspect. [Brief explanation of the drawings]

[0015] [Figure 1] 1 is a schematic diagram of a flow when an Ethernet device processes a message using a store-and-forward mode in the related art; [Figure 2] 1 is a schematic diagram of the flow when CQF is adopted to transmit a message in TSN technology. [Figure 3] This is a schematic diagram showing a case where a time period label value of 4000 is included in a message. [Figure 4] This is a schematic diagram of the message transmission flow using CSQF. [Figure 5] FIG. 10 is a schematic diagram illustrating the correspondence relationship between time period label values ​​of messages between devices. [Figure 6] 2 is a flowchart of a message processing method according to an embodiment of the present application; [Figure 7] FIG. 2 is a schematic diagram of a message processing method according to another embodiment of the present application; [Figure 8] FIG. 2 is a schematic diagram of a message processing method according to an embodiment of the present application; [Figure 9] FIG. 10 is a schematic diagram of a message in a sub-period according to an embodiment of the present application. [Figure 10] 2 is a flowchart of a message processing method according to an embodiment of the present application; [Figure 11]2 is a flowchart of a message processing method according to an embodiment of the present application; [Figure 12] 2 is a flowchart of a message processing method according to an embodiment of the present application; [Figure 13] FIG. 10 is a schematic diagram illustrating a case where a second transmission time period label value is included in a message according to an embodiment of the present application. [Figure 14] FIG. 2 is a schematic diagram of a message transfer according to an embodiment of the present application. [Figure 15] FIG. 2 is a schematic diagram of a message transfer according to an embodiment of the present application. [Figure 16] 1 is a schematic diagram illustrating the configuration of a communication device according to an embodiment of the present application. DETAILED DESCRIPTION OF THE INVENTION

[0016] In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be described in more detail below with reference to the drawings and examples. It should be understood that the examples described herein are for illustrating the present application, but are not for limiting the present application.

[0017] Although the division of functional modules is performed in the schematic diagram of the device and the logical order is shown in the flowchart, in some cases the division of modules in the device may differ, or the steps shown or described may be performed in a different order from that in the flowchart. Terms such as "first," "second," etc. in the specification and claims and the above drawings are used to distinguish between similar objects and are not necessarily used to describe a specific order or priority.

[0018] In the description of the embodiments of the present application, unless otherwise expressly limited, the terms "provide," "attach," "connect," etc. should be understood in a broad sense, and those skilled in the art can reasonably determine the meaning of the above terms in the embodiments of the present application by referring to the content of the technical solutions.

[0019] In the embodiments of the present application, terms such as "further," "exemplary," or "optionally" are used as examples, illustrations, or explanations and should not be construed as preferred or advantageous over other embodiments or designs. The use of terms such as "further," "exemplary," or "optionally" is intended to present related concepts.

[0020] The embodiments of the present application relate to information transmission / transmission technology in communication networks. Delay and jitter are important performance indicators of information transmission. Different application scenarios have different requirements for information transmission quality, such as transmission delay and jitter. There are various methods for transmitting information, and the delay and jitter may vary depending on the method.

[0021] 1 is a schematic diagram of a related art technique for processing a message in store-and-forward mode using Ethernet devices. As shown in FIG. 1, a message 1000 is processed by multiple functional modules, such as table lookup, analysis, rate limiting, queuing, caching, and scheduling, at each node, e.g., first device 100, second device 200, third device 300, and fourth device 400. Note that the message may or may not be processed through each node. The messages described in the present application may contain the same or different information and content at different nodes.

[0022] In some embodiments, the first device 100 may be a source node, the second device 200 and the third device 300 may be intermediate nodes, and the fourth device 400 may be a sink node. Because messages from all physical ports of the devices share these functional modules, the time it takes for messages from each physical port to obtain the services of these functional modules is uncertain. Since the processing completion times do not match, the message delay time in each device is uncertain. As Ethernet technology is widely used in industrial production lines and vehicles, the requirements for message transmission quality are becoming higher. The transmission delay and jitter in the message transmission method shown in FIG. 1 are difficult to meet the relevant requirements for parameter indicators.

[0023] Ethernet technology has replaced proprietary fieldbus technologies in some network systems, such as automated production line networks in industrial parks and in-vehicle communication networks. This is because Ethernet supports faster data rates, lower costs, and is easier to integrate with existing Ethernet equipment systems. However, because Ethernet transmits messages based on a best-effort concept, it is difficult to meet the requirements for message transmission characteristics such as end-to-end delay, jitter, and zero packet loss in certain application scenarios. To improve the transmission delay and jitter of Ethernet-transmitted messages, the Time-Sensitive Network (TSN) Task Group has established a standard system for Ethernet traffic transmission processing to ensure reliable transmission of traffic or messages. However, TSN is only applicable to local area networks in applications with small physical space areas, such as industrial plants and in-vehicle systems. The Deterministic Networking (DetNet) group of the Internet Engineering Task Force (IETF) has extended the Cyclic Queuing and Forwarding (CQF) principle in TSN technology to wide-area deterministic networks through Cycle Specified Queuing and Forwarding (CSQF) technology, thereby realizing the demand for deterministic traffic or message transmission in long-distance physical scenarios.

[0024] To explain the present technical solution in detail, the following provides a further description of the related technologies, TSN, CQF, and CSQF. For illustrative purposes, the following describes the information transmission technology of the embodiments of the present application, taking client traffic, such as message transmission in each node device, as an example. TSN technology is applied to local area networks and achieves deterministic latency and jitter requirements by setting up a global scheduling table and scheduling and forwarding client messages through fixed time slices. All network devices in a local area network are within a small physical range, and link propagation delays of messages between devices are negligible. A time-sensitive network requires that all devices in the network be time-synchronized, that upstream and downstream devices operate synchronously, that when a message is sent from an upstream device, the downstream device receives the message at the same time, and that upstream and downstream devices send and receive client messages at the same time. TSN technology employs CQF to achieve deterministic latency transmission of messages.

[0025] Figure 2 is a schematic diagram of the flow when transmitting messages using CQF in TSN technology. As shown in Figure 2, two queuing queues, such as queue 1 and queue 2, are set at the output port of each device, forming a periodic flow queue. One control gate, queue-in gate 2000 and queue-out gate 3000, is provided at the queue-in position and queue-out position of each queue, respectively, and the control gate can be in two states: "open" (marked as "open" in the figure) or "closed" (marked as "close" in the figure).

[0026] When a gate is open, message input or output is permitted; when the gate is closed, message input or output is prohibited. The gate states of the queue-in control gate and the queue-out control gate of the same queue remain different; that is, when the queue-in control gate of a queue is open, the queue-out control gate of the queue is closed. When the queue-in control gate of a queue is closed, the queue-out control gate of the queue is open. Since two queues are configured in a port, and at any time one of the queues is used to receive messages and the other is used to send messages, the control gates of the same type of ports (e.g., the output port of the queue) of the two queues are also different; for example, they are in mutually exclusive states; that is, when the control gate of a port (e.g., the output port) of one of the queues is open, the control gate of the same type of port of the other queue is closed. At the same time, only the control gate of one queue of ports at the same location is open and can output message information, while the control gate of the other queue is closed and cannot output message information.

[0027] The CQF mechanism divides transmission time into a series of equal time intervals (also called time slices). Each time interval is called a time period T. Every time period T is divided into even and odd periods, marked T0 and T1, and distinguished by these periods. The network system pre-plans the state of each control gate, such as open or closed, during each time period. During each period, the state of the control gate remains constant. When a time period ends, the open control gate switches to a closed state, and the queue stops outputting message information. The control gate of another queue switches to an open state, and the queue (i.e., the other queue) starts outputting message information. By alternately performing queue-in and queue-out operations between two queues, CQF ensures that a message sent from an upstream node device within a period is sent to a downstream node within the same time period. The downstream node device receives the message within the same time period and then forwards it within the same time period. The transmission period described in the present embodiment is the time period during which a message is transmitted.

[0028] When all devices in a network adopt the CQF queue, the time between all devices is synchronized, and all control gates of all devices plan the operation state of the control gate in advance and switch the operation state of the control gate at the same time, so that the first device, such as the source node / device of the network, starts forwarding a message, and all messages forwarded within the same period can be forwarded by each device, such as the intermediate node / device, within a certain time period T. Each device will delay the forwarding by the time period T until the last device, such as the sink node / device, forwards the message.

[0029] The end-to-end delay of a message in the network depends only on the length of the period T and the number H of devices through which the message passes in the network. All messages within the same period are always forwarded within the same period in the forwarding process, so a message within the same period at the source device is output in the same period at the sink device. A message may vary at any position within the same time period T, with the first position being the start position within one period T and the last position being the end position within one period T. If a message is forwarded at the start position of a time period at the source device but is forwarded and output only at the end position of time period T at the sink device, the total forwarding delay of the message in the network is maximum, and the maximum delay is (H+1)*T. If a message is forwarded at the end position of a time period at the source device and is forwarded and output at the start position of time period T at the sink device, the total forwarding delay of the message in the network is minimum, and the minimum delay is (H-1)*T. Therefore, the total end-to-end forwarding delay of a message from a source device to a sink device across the entire network varies within the range of {(H-1)*T, (H+1)*T}. Employing CQF techniques in local area networks can provide deterministic delay forwarding, as well as bounded delay and jitter as messages are transported and transmitted across the network.

[0030] However, the CQF method requires that all devices in the network are synchronized, all devices switch the operating state of the control gate at the same time, and the transmission delay between devices can be considered zero. Therefore, the CQF method can only be applied to LAN scenarios with small physical areas.

[0031] When the distance between devices is relatively long and the link delay is large, or when the message delay time on the link is close to the cycle time, even if all devices switch their control gates at the same time, it is difficult to ensure that the message sent from the upstream device is received by the downstream device within the same cycle. Therefore, even if TSN technology uses the CQF mechanism to transmit messages, it is difficult to achieve deterministic message transmission over long distances and across regions.

[0032] Because TSN technology cannot accommodate large-scale network systems, the IETF DetNet Deterministic Network Working Group proposed the CSQF mechanism, which can synchronize time between devices and further reduce the impact of link transmission delays between devices, thereby enabling the application of TSN forwarding mechanisms in wide-area deterministic networks.

[0033] The CSQF forwarding mechanism does not require time synchronization among all devices in the network, but only clock frequency synchronization among devices. That is, when receiving messages between devices, the message clock signal is restored and the clock frequency of the other device is tracked. The CSQF mechanism requires functions such as clock frequency synchronization across the network, cyclic queuing / forwarding of multi-queues on outports, and cyclic label mapping on outports of adjacent nodes.

[0034] The CSQF technique requires that all messages have a transmission time period label value when they are sent by a source node device. Messages within a time period having the same transmission time period label value indicate that the messages were received and forwarded together within the same time period. The source node device attaches a time period label to the messages it sends, and the transmission time period label value may be located anywhere in the message.

[0035] FIG. 3 is a schematic diagram illustrating a case where a message includes a transmission time period label value of 4000. As shown in FIG. 3, this message includes a transmission time period label value in the Layer 3 extended domain. An intermediate node device receives and forwards messages with the same transmission time period label value within the same period T. The intermediate node device may change the transmission time period label value, but all messages that have the same transmission time period label value before the change must still have the same transmission time period label value after the change. The first transmission time period label value described in the embodiment of the present application is used to mark the transmission period in which the message exists, i.e., indicates in which period the message will be forwarded.

[0036] Figure 4 is a schematic diagram of the message transmission flow using CSQF. As shown in Figure 4, time synchronization is not required between all devices in the network, only clock frequency synchronization is required. Each device switches the queue operation state according to a fixed cycle time. The cycle length is the same for all devices. The time cycle of each device is independent, and the time cycle switching times of each device do not match (the start and end times of the cycle for all devices are different), but if the clock frequency is the same, the time cycle switching frequency for each device is the same, and the number of time cycle switching times per unit time is the same, so the switching frequency is the same.

[0037] Each device has multiple cache queues, and which queue a message is cached in is determined based on the time label value included in the message. Messages with the same time period value are placed in the same queue. All queues are in a different state for each period, and all queues change their operating state in sequence. In any time period, only one queue is in the sending state, and a queue in the sending state only sends messages and does not receive messages. The other queues are in the receiving state, and a receiving queue only receives messages and does not send messages. All queues cyclically switch their operating state according to the period time. In any time period, one queue is in the sending state, and the remaining queues are in the receiving state.

[0038] Before a message is transmitted, the period mapping relationship of each queue is determined among all node devices, and when the message is forwarded by the source node device, it contains the sending time period label value at each device, and the label marks the designated receiving queue for the message at the designated device. When a message is forwarded through one device, the already used time label value is deleted.

[0039] As shown in FIG. 4, a first message 1100 at device 1 includes labels 1, 2, and 3. When the first message 1100 passes through device 1 and reaches device 2, label 1 is deleted to obtain a second message 1200, thus obtaining a third message 1300. When each device receives a message, it extracts the transmission time period label value included in the message, places the packet in a designated receiving queue based on the period label value, and forwards it to the next hop device when the receiving queue is changed to a sending queue. By including the receiving queue designated by each hop device in the message in advance, the message is received in a designated queue and forwarded in a designated time period (when the receiving queue is changed to a sending queue), and the message is forwarded within a fixed period within each device, thereby achieving a fixed delay during end-to-end forwarding of client messages.

[0040] When the CSQF mechanism is in operation, the network system pre-plans message transmission paths, delays, bandwidth, and queue resources according to the quality of service demands of traffic transmission, determines periodicity parameters, generates and distributes transmission periodicity labels for each node device to the node devices. When traffic is transmitted by a source device, the transmission periodicity label value of the message is included in each node, and each node device determines which queue the message will be placed in and forwarded based on the transmission periodicity label. The clock frequencies of all node devices in the network are synchronized, the time period conversion of all nodes is the same, the queue state switching speed is the same, and the receiving and sending states of all queues change at a fixed frequency. A message is transmitted through a predetermined queue of an upstream node device, enters a corresponding predetermined queue of a downstream node, and is converted to a sending state by the corresponding queue before being transmitted.

[0041] Regardless of the optical fiber delay between the upstream and downstream devices, simply by planning in advance the relationship between the transmission period of the message sent by the upstream device and the transmission period of the downstream device, the client messages forwarded by the upstream device can be queued in a complete receive queue at the downstream device, and all messages within the upstream device's transmission period can be received before the specified receive queue enters the send state. The downstream device has multiple receive queues to accommodate various delay needs between the upstream and downstream devices. Simply select an appropriate receive queue to receive the upstream device's forwarded message and forward it after the queue enters the send state. Each upstream device forwards the message within a predetermined send period, and each downstream device forwards it within a new predetermined send send period. Therefore, the total message transmission delay from the first source device to the last sink device is fixed, thereby enabling end-to-end deterministic delay transmission of messages from the source node device to the sink node device in the network.

[0042] As shown in FIG. 4, when source node device 1 of the network transmits message 1100, it includes all of the transmission time period label values ​​of message 1100 in each device, for example, label 1, label 2, and label 3, in message 1100. When each device receives the message, it deletes the transmission time period labels that have already been used. For example, when device 2 receives the message, it deletes label 1 that has already been used, obtains message 1200, and forwards message 1200 based on its own transmission time period label value.

[0043] Although the above method can realize end-to-end deterministic delay transmission of messages, when the message is on device 1, the effective bearing efficiency of the message is likely to decrease because the message contains a transmission time period label value that is transmitted by all devices.

[0044] In device 1, all transmission time period label values ​​included in the message have the same format and their contents have already been determined, so there is a one-to-one correspondence between these transmission time period label values. When the correspondence between transmission time period label value 1 and transmission time period label value 2 is distributed to device 2, the correspondence between transmission time period label value 2 and transmission time period label value 3 is distributed to device 3, and so on. In this way, when a device sends a message, it may include only its own transmission time period label value 1 in the message. When device 2 sends a message, it can obtain transmission time period label value 2 based on transmission time period label value 1 included in the message and the correspondence between transmission time period label value 1 and transmission time period label value 2. By changing transmission time period label value 1 included in the message to transmission time period label value 2, device 2 can obtain transmission time period label value 2 of the message. Using the above method, it is possible to obtain transmission time period label values ​​corresponding to each downstream node by including only one transmission time period label value.

[0045] FIG. 5 is a schematic diagram showing the correspondence relationship between the transmission time period label values ​​of messages between devices. As shown in FIG. 5, there is a one-to-one correspondence between the transmission time period label value T0 of the message from device 1 and the transmission time period label value T5 of device 2. There is a one-to-one correspondence between the transmission time period label value T1 of the message from device 1 and the transmission time period label value T6 of device 2. Thus, in device 1, the fourth message 1400 is transferred in accordance with the T0 period, and the transmission time period label value included therein is T0. When the fourth message 1400 is sent to device 2, device 2 changes the transmission time period label value T0 included in the message to T5 in accordance with the correspondence relationship, and device 2 transmits it within the T5 period. Similarly, there is a one-to-one correspondence between the transmission time period label value T5 of the message from device 2 and the transmission time period label value T2 of device 3. For example, the transmission time period label value T6 of the message from device 2 corresponds one-to-one to the transmission time period label value T3 of device 3. In this way, when device 2 transmits fourth message 1400 to device 3 in a period of T5, device 3 changes the transmission time period label value T5 included in the message to T2 in accordance with the correspondence, and this message is transmitted by device 3 within a period of T2. The same applies to the transmission flow of fifth message 1500. Regardless of the method used for messages containing a transmission time period label value, all messages containing the same time period label are transmitted within the same time period, thereby achieving deterministic transmission of messages.

[0046] Whether using TSN or CSQF technology, message fluctuations can only occur within a single time period, and the transmission delay fluctuation range is less than the time period T. To reduce message delay and jitter (fluctuation), the only way is to reduce the transmission period T of all devices in the network. A smaller transmission period T means a shorter transmission period. If the transmission bandwidth of the device's physical port is small and the message length is very long, the number of messages that can be transmitted within one transmission period will be very small. In scenarios where messages are very long and the transmission period is very short, only one long message can be transmitted within one period, making it difficult to transmit more very long messages and reducing the network's transmission efficiency. In many scenarios, due to the transmission capacity issues of some devices in the network, there is usually a lower limit to the minimum transmission period T. In some cases, this lower limit still cannot meet the demand for some messages.

[0047] For example, in Figure 1, assume that the minimum transmission period of Device 1, Device 2, and Device 4 is 20 us, but the minimum transmission period of Device 3 is only 100 us. When a message is transmitted from Device 1 to Device 4, the minimum transmission period of the end-to-end bearer in the network is only 100 us. If the message requires a smaller transmission jitter and the transmission period must not exceed 20 us, the bearer capacity in the network cannot meet the requirements.

[0048] To further reduce delay and jitter in the end-to-end transmission of messages, embodiments of the present application provide a message processing method, a transmission method, a communication device, a communication system, a storage medium, and a program product. In the information transmission process, for example, a periodic label including a first time period label and a second transmission time period label value is included in a message, and an intermediate node / device performs forwarding based on the first time period label, and a sink node / device performs forwarding based on the first time period label and the second transmission time period label value, thereby achieving a delay and jitter range smaller than or zero jitter and delay, thereby reducing delay and jitter during message forwarding and enabling deterministic transmission of traffic.

[0049] Hereinafter, an embodiment of the present invention will be further described with reference to the drawings.

[0050] 6 is a flowchart of a message processing method according to an embodiment of the present application. As shown in FIG. 6, the message processing method may be applied to, but is not limited to, a source node / device. In the embodiment of FIG. 6, the message processing method may include, but is not limited to, steps S100 and S200.

[0051] Step S100: Set a periodicity label for a message, where the periodicity label includes a first time period label and a second transmission time period label value, where the first time period label is used to mark a transmission period corresponding to the message in each downstream node, and the second transmission time period label value is used to mark a transmission sub-period of the message in the source node and the sink node, where the transmission sub-period of the sink node is within the transmission period of the sink node.

[0052] In one embodiment, the first time period label includes a first transmission time period label value Tn corresponding to each downstream node. The first transmission time period label value Tn marks the transmission period corresponding to the message at the corresponding node. Each node / device determines the period in which the message transmission time falls based on Tn.

[0053] In another embodiment, the first time period label includes a first transmission time period label value T1 corresponding to the source node. If each downstream node presets period correspondence information Xn, the current node obtains the first transmission time period label value corresponding to the message according to the corresponding first transmission time period label value Tn and the period correspondence information Xn preset by the current node. Taking FIG. 7 as an example, the technical solution of this embodiment will be illustratively described.

[0054] In this embodiment, the first time period label and the second transmission time period label value are used to determine that the transmission time of the message is within a transmission sub-period of the transmission period of the source node, and to determine that the transmission time of the message is within a transmission sub-period of the transmission period of the sink node. Since the message transmission modes of the source node / device and the sink node / device are the same, it is possible to ensure that the message transmission at the source device and the message transmission at the sink device are within the same sub-period, and to avoid the influence of delays and jitters in message transmission caused by intermediate devices.

[0055] FIG. 7 is a schematic diagram of a message processing method according to another embodiment of the present application. As shown in FIG. 7, device 2 and device 3 have preset period correspondence information, designated X2 and X3, respectively. Device 1 (source node) receives message 1000. The period label included in message 1000 includes a transmission time period label value T1. Based on the period label value T1, device 1 transmits a message to device 2 (intermediate node) within the corresponding transmission period. Device 2 receives message 1000 including period label value T1. Based on the period label value T1 and the preset period correspondence information X2, device 2 obtains period label T2 corresponding to the current node. Based on the period label value T2, device 2 transmits a message to device 3 (sink node) within the corresponding transmission period. Device 3 receives message 1000 including period label value T2. Based on the period label value T2 and the preset period correspondence information X3, device 3 obtains period label T3 corresponding to the current node. Device 3 transmits a message within the corresponding transmission period based on the period label value T3.

[0056] Step S200: The configured message is sent to the downstream node.

[0057] In one embodiment, the message processing method may further include steps S111 and S120.

[0058] Step S111: Obtain a transmission period corresponding to the message in each downstream node according to the first transmission time period label value Tn corresponding to each downstream node.

[0059] 7 shows that the source node can obtain a transmission period corresponding to a message based on the transmission time period label value T1 corresponding to the source node. The intermediate node can obtain a transmission period corresponding to a message based on the transmission period T2 corresponding to the intermediate node. The sink node can obtain a transmission period corresponding to a message based on the transmission period T3 corresponding to the sink node.

[0060] Step S120: obtain a sending sub-period corresponding to the message at the sink node according to the second sending time period label value tn, where the sending sub-period corresponding to the sink node is within the sending period corresponding to the sink node.

[0061] Exemplarily, the sink node may derive a transmission period corresponding to the message at the sink node based on the corresponding first transmission time period label value Tn, and derive a transmission sub-period of the message within the transmission period corresponding to the sink node based on the corresponding second transmission time period label value tn. This exemplary scheme can achieve message transmission with smaller delay and jitter than in the network.

[0062] In another embodiment, the message processing method may further include steps S112 and S120.

[0063] Step S112: According to the first transmission time period label value Tn of each downstream node and the period correspondence information X of each downstream node, a transmission period corresponding to the message is obtained in each downstream node.

[0064] 7 as an example, it will be exemplarily described that an intermediate node can obtain a transmission time period label value T2 corresponding to the current intermediate node based on the transmission time period label value T1 included in the message transmitted from the source node and the period correspondence information X2 of the intermediate node. The sink node may obtain a transmission time period label value T3 corresponding to the sink node based on the period label value T2 included in the message transmitted from the intermediate node and the period correspondence information X3 of the sink node. Step S120: Obtain a sending sub-period corresponding to the message at the sink node according to the second sending time period label value tn.

[0065] For example, the sink node may obtain a transmission period corresponding to the message at the sink node based on the corresponding first transmission time period label value Tn and the corresponding period correspondence information Xn, and obtain a transmission sub-period of the message within the transmission period corresponding to the sink node based on the corresponding second transmission time period label value tn.

[0066] The message transmission period at the source node may be determined by a first transmission time period label value. The message transmission subperiod within the source node's transmission period may be determined by a second transmission time period label value. By adopting the above method, the time at which a client message is received at the sink node and the time at which it is received at the source side can be controlled and is not affected by delays or jitters in intermediate devices.

[0067] 8 is a schematic diagram of a message processing method according to an embodiment of the present application. As shown in FIG. 8, a periodicity label is set for a sixth message 1600. The periodicity label includes a first time period label and a second transmission time period label value.

[0068] In one embodiment, the first time period label is used to at least mark the transmission period of the sixth message 1600 in each of the second device 200, the third device 300, and the fourth device 400 downstream of the first device 100. Illustratively, the first time period label includes first transmission time period label values ​​T3, T0, and T1, respectively. The first transmission time period label value T3 marks that the sixth message 1600 is transmitted in the T3 period of the second device 200, i.e., T3 is the corresponding transmission period. The first transmission time period label value T0 marks that the sixth message 1600 is transmitted in the T0 period of the third device 300, i.e., T0 is the corresponding transmission period. The first transmission time period label value T1 marks that the sixth message 1600 is transmitted in the T1 period of the fourth device 400, i.e., T1 is the corresponding transmission period.

[0069] In another exemplary embodiment, periodicity correspondence information X2, X3, and X4 are preset in the second device 200, the third device 300, and the fourth device 400 downstream of the first device 100, respectively. The first time period label is used to mark the transmission period corresponding to the sixth message 1600 in the first device 100. Illustratively, the first time period label includes a first transmission time period label value T0. The second device 200 obtains a first transmission time period label value T3 corresponding to the second device 200 based on the first transmission time period label value T0 and the periodicity correspondence information X2 of the second device 200. The third device 300 obtains a first transmission time period label value T0 corresponding to the third device 300 based on the first transmission time period label value T3 and the periodicity correspondence information X3 of the third device 300. The fourth device 400 obtains the first transmission time period label value T1 corresponding to the fourth device 400 based on the first transmission time period label value T0 and the period correspondence information X4 of the fourth device 400.

[0070] Through the above various methods, the sink node can obtain the transmission period T1 corresponding to the message 1600. After the transmission period T1 determined for the sixth message 1600 is determined in the sink node, the sink node may further determine the transmission sub-period determined for the message 1600 based on the second transmission time period label value tn.

[0071] In this embodiment, the message includes a periodic label, and the intermediate node device performs forwarding based on the first time period label, thereby meeting the delay and jitter metric requirements in a coarse range; and the sink node device performs forwarding based on the first time period label and the second transmission time period label value, thereby achieving a finer range of delay and jitter, thereby reducing the delay and jitter of message forwarding and realizing deterministic transmission of traffic.

[0072] 9 is a schematic diagram of a message in a sub-period in one embodiment of the present application. As shown in FIG. 9, the first transmission time period label value is T1. The period T1 is further divided into eight sub-periods. The second transmission time period label value is t4. Based on the first transmission time period label value being T1, it is determined that the sixth message 1600 is within the transmission period T1, and then, based on the second transmission period label t4, the transmission sub-period t4 of the sixth message 1600 within the transmission period T1 is determined.

[0073] In this embodiment, a message includes a period label including a first transmission time period label value and a second transmission time period label value, and an intermediate node device performs forwarding based on the first transmission time period label value, thereby meeting the requirements of delay and jitter metrics in a coarse range; and a sink node device performs forwarding based on the first transmission time period label value and the second transmission time period label value, thereby achieving a narrower range of delay and jitter, thereby reducing the delay and jitter of message forwarding and realizing deterministic transmission of traffic.

[0074] 10 is a flowchart of a message processing method according to an embodiment of the present application. As shown in FIG. 10, the message processing method may be applied to, but is not limited to, an intermediate node / device. In the embodiment of FIG. 10, the message processing method may include, but is not limited to, steps S300 and S400.

[0075] Step S300: A message is received.

[0076] The message includes a period label, where the period label includes a first time period label and a second transmission time period label value, where the first time period label is used to mark a transmission period corresponding to the message at each downstream node, and the second transmission time period label value is used to mark a transmission sub-period corresponding to the message at a sink node, where the transmission sub-period of the sink node is within the transmission period of the sink node.

[0077] In one embodiment, the first time period label includes a first transmission time period label value Tn corresponding to each downstream node. The first transmission time period label value Tn marks the transmission period corresponding to the message at each downstream node. Each node / device determines the period in which the message transmission time falls based on Tn.

[0078] The first time period label may include a first transmission time period label value corresponding to each downstream node corresponding to the current node, or may include a first transmission time period label value corresponding to the current node. If the current node is a source node, the first time period label also includes a first transmission time period label value corresponding to the source node, if the current node is an intermediate node, the first time period label includes a first transmission time period label value corresponding to the current intermediate node, and if the current node is a sink node, the first time period label includes a first transmission time period label value corresponding to the sink node.

[0079] Step S400: Send a message based on a first time period label.

[0080] In one embodiment, step S400 may include steps S410 and S420.

[0081] Step S410: Obtain a sending period corresponding to the message in each downstream node according to the first sending time period label value respectively corresponding to each downstream node.

[0082] Step S420: The intermediate node transmits the message in the corresponding transmission period.

[0083] In another embodiment, the message processing method may further include steps S430 and S420.

[0084] Step S430: Based on the first transmission time period label value corresponding to the intermediate node and the period correspondence information corresponding to each downstream node, obtain a transmission period corresponding to the message at each downstream node. Here, the period information corresponding to each downstream node is preset. If the current node is the next hop node of the source node, obtain a transmission period corresponding to the current node based on the first transmission time period label value corresponding to the source node and the period correspondence information corresponding to the current node.

[0085] Step S420: The intermediate node transmits the message in the corresponding transmission period.

[0086] An illustrative explanation will be given using FIG. 8 as an example. The second device 200 (intermediate node) corresponds to the first transmission time period label value T2. Period correspondence information X3 and X4 are preset in each downstream node of the second device 200, i.e., the third device 300 and the fourth device 400. A message 1600 includes the first transmission time period label value T3 and is transmitted from the second device 200 to the third device 300. The third device 300 obtains a current node period label value T0 based on the first transmission time period label value T3 and the period correspondence information X3. The third device 300 forwards the message within the corresponding transmission period, i.e., T0, based on the first transmission time period label value T0. The fourth device 400 receives the message 1600 including the period label value T0 and obtains a current first transmission time period label value T1 based on the first transmission time period label value T0 and the period correspondence information X4 preset in the fourth device 400. The fourth device 400 transfers the message within the corresponding transmission period based on the first transmission time period label value T1.

[0087] 11 is a flowchart of a message processing method according to an embodiment of the present application. As shown in FIG. 11, the message processing method may be applied to, but is not limited to, a sink node / device. In the embodiment of FIG. 11, the message processing method may include, but is not limited to, steps S500 and S600.

[0088] Step S500: Receive a message, where the message includes a periodicity label. The periodicity label includes a first transmission time period label value and a second transmission time period label value. The first transmission time period label value is used to mark a transmission period corresponding to the message at a sink node, and the second transmission time period label value is used to mark a transmission sub-period corresponding to the message at the sink node. The transmission sub-period of the sink node is within the transmission period of the sink node. Step S600: Send a message based on a first sending time period label value and a second sending time period label value.

[0089] In one embodiment, step S600 may further include steps S611 and S620.

[0090] Step S611: According to the first sending time period label value T, the sink node obtains a sending period corresponding to the message.

[0091] Step S620: Obtain a sending sub-period corresponding to the message at the sink node according to the second sending time period label value t.

[0092] In another embodiment, the message processing method may further include steps S612 and S620.

[0093] Step S612: According to the first transmission time period label value T and the period correspondence information X of the sink node, the transmission period corresponding to the message is obtained in the sink node.

[0094] Step S620: According to the second sending time period label value t, obtain a sending sub-period in the sending period corresponding to the message at the sink node.

[0095] The sink node can obtain a transmission period corresponding to the message at the sink node based on the first transmission time period label value T, and can obtain a transmission sub-period corresponding to the message at the sink node based on the second transmission time period label value t, where the transmission sub-period is within the transmission period. This exemplary scheme can achieve lower delay and jitter transmission of the message in the network.

[0096] In another embodiment, step S600 may further include steps S630 and S640.

[0097] Step S630: According to the first sending time period label value Tn corresponding to the sink node and the period correspondence information X of the sink node, obtain a sending period corresponding to the message in the sink node.

[0098] Step S640: According to the second sending time period label value t, the sink node obtains a sending sub-period within the sending period corresponding to the message.

[0099] 12 is a flowchart of a message processing method according to one embodiment of the present application. This message transmission method is shown in FIG. 12. In the embodiment of FIG. 12, this message processing method may include, but is not limited to, steps S710, S720, S730, S740, S750, S760, S770, and S780.

[0100] Step S710: The source node sets a periodicity label for the message, where the periodicity label includes a first time period label and a second sending time period label value.

[0101] Step S720: The source node sends the message.

[0102] Step S730: The intermediate node receives the message.

[0103] Step S740: The intermediate node obtains a sending period corresponding to the message at the intermediate node according to the first time period label.

[0104] Step S750: The intermediate node transmits a message within the corresponding transmission period.

[0105] Step S760: The sink node receives the message.

[0106] Step S770: The sink node obtains a sending sub-period corresponding to the message at the sink node according to the first time period label and the second sending time period label value.

[0107] Step S780: The sink node transmits a message within a transmission sub-period.

[0108] FIG. 13 is a schematic diagram illustrating a case where a second transmission time period label value is included in a message according to an embodiment of the present application. As shown in FIG. 13, the second transmission time period label value may be included in the message and may be bearered together with the first transmission time period label value of the message. In a network, when an intermediate device performs forwarding, the intermediate device performs forwarding based only on the first transmission time period label value and ignores the second transmission time period label value included in the message. When the message reaches the destination sink device and the sink device transmits based on the second transmission time period label value, it determines the transmission period and then determines the current transmission sub-period based on the second transmission time period label value. This method reduces message fluctuations within one transmission period, making it possible to reduce message delay and jitter to a smaller value t, thereby achieving deterministic transmission of information with less jitter. While the embodiment of the present application provides CSQF technology as an example, it is not limited to CSQF and can also be applied to TSN technology.

[0109] By forwarding a client message at a sink device based on the second transmission time period label value, an end-to-end transmission with less delay and jitter than that of the previous one can be achieved. The end-to-end transmission delay effect with less delay and jitter than that of the previous one does not require the sink node device to achieve accurate transmission at all times. Note that the transmission period of a message at a source node may be determined by the first transmission time period label value. The transmission subperiod of a message within the transmission period of the source node may be determined by the second transmission time period label value. By adopting the above method, the time at which a client message is received at the sink node and the time at which it is received at the source side can be controlled and is not affected by the delay and jitter of intermediate devices.

[0110] In some scenarios, delay and jitter must be less than a target value. If the end-to-end transmission period value T of the network is 40 us, and it is necessary to achieve the effect of an end-to-end transmission period value t of 5 us in the client message, this corresponds to dividing the network transmission period into eight equal parts, and the smallest unit of the transmission period label value is 5 us, i.e., 1 / 8 T. The aforementioned transmission period value T is the basic transmission period of all devices. The transmission period value t that needs to be realized is the desired smaller transmission period. The transmission period value T (i.e., the basic transmission period) at which the message transmission time is located is the transmission period, and the smaller transmission period value t (i.e., the smaller transmission period that is desired to be realized) at which the message transmission time is located is the transmission subperiod. In some scenarios, the transmission subperiod is within the transmission period. In this application, the transmission period value T (i.e., the basic transmission period) at which the message is transmitted at the current node is determined by the first transmission time period label value Tn included in the message. That is, the transmission period can be obtained by the first transmission time period label value Tn. The second transmission time period label value included in the message determines the smaller transmission period value t (i.e., the smaller transmission period that is desirable to achieve) at which the transmission time of the message at the current node is determined, i.e., the second transmission time period label value tn can be used to obtain the transmission sub-period.

[0111] In one embodiment, the first transmission time period label value Tn and the second transmission time period label value tn may be set in advance. For example, the first transmission time period label value Tn and the second transmission time period label value tn for each node device may be generated by planning the message transmission path, delay, bandwidth, and queue resource in advance, determining period parameters, etc., and then distributed to the corresponding node devices.

[0112] In another embodiment, the second transmission time period label value tn may be determined by the difference between the transmission time of the message at the source device and the start time of the transmission period.

[0113] For ease of understanding, the following will be described by way of example. The difference between the transmission time of a message in the source device and the start time of the transmission period is ΔT, and the value of the difference ΔT is converted into an integer value in units of 1 / 8T, i.e., an integer multiple of 1 / 8 of the basic transmission period unit. The value 1 / 8 in this example is merely an example, and different values ​​can be set according to different scenarios. When ΔT is greater than 0 and less than 1*1 / 8T, the second transmission time period label value tn is 0. When ΔT is greater than 1 / 8T and less than 2 / 8T, the second transmission time period label value tn is 1. When ΔT is greater than 2 / 8T and less than 3 / 8T, the second transmission time period label value tn is 2. Similarly, when ΔT is greater than 7 / 8T and less than T, the second transmission time period label value tn is 7. The second transmission time period label value tn may be part of the content of the period label. That is, the first transmission time period label value Tn may be the upper part of the new time period label, and the second transmission time period label value tn may be the lower part of the new time period label. The new time label value is composed of the first transmission time period label value Tn and the second transmission time period label value tn, and the new time label value is included in the message when the source device transmits it.

[0114] For example, the source device generates a time label value with a transmission period of 5 us, and the upper part of the generated time label value is the result when transmitted with a transmission period T=40 us, and the lower part of the generated time label value is the result generated with a second transmission time period label value, i.e., a sub-period 1 / 8T.

[0115] When forwarding, an intermediate device in the network focuses only on the upper part of the time period label value, i.e., the first transmission time period label value Tn part, treats the upper part of the time period label value as the original time period label value, ignores and retains the lower part of the transmission time period label value, i.e., the second transmission time period label value tn part, and transmits the lower part of the time period label value as the message content. An intermediate device in the network can change the transmission period label value part of the time period label, but does not change the sub-period label value part of the time period label value.

[0116] An embodiment of the present application provides a message processing method applied to a sink node, the message processing method including the steps of: storing a message according to a first period setting; transmitting the message based on a first transmission time period label value; storing the transmitted message according to the second period setting and forming a first queue for receiving the message and a second queue for transmitting the message; determining a transmission sub-period corresponding to the queue based on the second transmission time period label value; and transmitting the message within the transmission sub-period.

[0117] FIG. 14 is a schematic diagram of message forwarding in one embodiment of the present application. As shown in FIG. 14, when a message is sent to a sink node device, the sink node device forwards the message according to all first time period labels, i.e., forwards and queues the message based on the transmission period label value determined by the first transmission time period label value. Then, the message in the same queue is subdivided twice based on the sub-period label values ​​of the time period label value and queued. The transmission period label value of the time period label value has a total of eight three-digit time window values, and therefore, the message must be queued into eight queues. The transmission sub-period label value of the time period label value further has a total of eight three-digit time window values. Therefore, each original queue is further divided into eight new queues, resulting in a total of 64 queues.

[0118] In one embodiment, when queuing a message, device 4 may directly queue according to the contents of all parts of the time period label value, queuing and caching in 64 queues. If the transmission period label value of the time period label value is three digits, eight sets of different time window values ​​can be represented. In this case, eight queues are required when queuing based on the transmission period label value of the time period label value. If the sub-period label value part of the time period label value is also a three-digit value, eight queues are also required when queuing based on the sub-period label value part of the time period label value. Thus, a total of 64 queues are required. When the above method is adopted, if the transmission period label value of the time period label value, i.e., the portion of the first transmission time period label value, is three digits (eight time window values), and the transmission sub-period label value of the time period label value, i.e., the portion of the second transmission time period label value, is also three digits (eight time window values), then for the bearer network of Figure 1, the devices 200 and 300 forward messages according to the fact that the portion of the first transmission time period label value is three digits (eight time window values), and when the devices 200 and 300 forward messages, they need to temporarily store upstream client messages in only eight queues. If the forwarding period T of the devices 200 and 300 is equal to 40 us (one time window value represents a time unit of 40 us), the delay variation range of the client messages when the devices 200 and 300 forward the client messages is within 40 us. Sink node device 400 performs forwarding based on all the contents of the time period label value, i.e., the first transmission time period label value and the second transmission time period label value (6 digits, 64 time window values), queues and caches messages in 64 queues, and forwards them at a 5 us transmission period. The transmission time period is one-eighth of the transmission period of devices 200 and 300, and the delay variation range during message forwarding at device 400 is only 5 us, which is one-eighth of the delay variation range of client messages at devices 2 and 3. This is the role played by the second transmission time period label value portion of the time period label value for the sink device.

[0119] In end-to-end transmission in a network system, by including in a message the difference in the position of the message from the time window boundary, intermediate network devices in the network system can forward messages based on a transmission periodicity value T (i.e., a basic transmission periodicity). By determining the transmission periodicity based on the first transmission time period label value Tn, delay variations during message forwarding in intermediate network devices are large, but the final sink node device forwards the message based on a smaller transmission periodicity value t (i.e., a smaller transmission periodicity that is desirable to achieve). By determining the transmission sub-period based on the second transmission time period label value tn, it is possible to achieve a result in which delay variations of messages are small.

[0120] Taking the technology of FIG. 1 as an example, to achieve the effect of small message delay variation, all intermediate devices in the network, such as device 200 and device 300, need to forward messages based on a transmission period (T), and the transmission period (T) of device 200 and device 300 is relatively long. Even if device 200 and device 300 have a message forwarding capability that supports the transmission subperiod value (t), client messages in device 200 and device 300 must be queued and cached according to 64 queues, occupying a large amount of queue resources in device 200 and device 300. That is, in the above example, the sink node sets queuing queues based on all time window values, and if all time window numbers are 3 + 3 = 6 bits, a total of 64 different time window values ​​represent the results. Therefore, the sink device needs 64 queues to temporarily store client messages corresponding to each time window value, resulting in an enormous number of queues.

[0121] In one embodiment, client messages in device 200 and device 300 are simply queued and cached according to eight queues corresponding to the first transmission time period label value, thereby effectively reducing queue resources in device 200 and device 300.

[0122] FIG. 15 is a schematic diagram of message transfer in one embodiment of the present application. As shown in FIG. 15, in a two-level queueing mode, the first-level queue manages queueing according to the number of queues in the device 200 and device 300 and manages queueing based on the first transmission time period label value Tn portion of the time period label value. In this embodiment, the device 200 and device 300 only need eight queues to cache client messages. The first-level queue outputs client messages in units represented by the first transmission time period label value portion of the time period label value (i.e., T period), and outputs client messages to the second-level queue in the previous time period. The second-level queue configures two groups of queues: group A queues and group B queues. The queues in each group are configured based on the time window value of the second transmission time period label value portion. In this embodiment, the central sub-period label value portion has a three-digit number representing eight types of time window label values, and eight queues are configured in each group. At the same time, one of the two groups of queues is in a ready state to receive output messages from the first-level queue, and the other group is in a sending state and outputs client messages cached in the queue. The total operating time (transmitting or receiving state) of the queues in each group is still one sending period T (the period corresponding to the upper part of the time window value), and the start and end times of the queues in each group exactly match the start and end times of the sending period of the first-level queue. At the same time, in the second level, one group of queues is in a receiving state and the other group is in a sending state. When one sending period T (the period corresponding to the upper part of the time window value) ends, one group of queues is converted from a ready state to a sending state, and the other group of queues is converted from a sending state to a ready state. When one group of queues is in a ready state, the first-level queue always outputs one sending period T early, and the second-level queue in a receiving state receives client messages from the first-level queue and enqueues them to the second-level queue based on the sub-period label value part of the second sending time period label value.After one transfer time period T, the first-level queue transfers all client messages in this queue to the second-level queue, and in the next transfer period T, the queue in the ready state is converted to the sending state. In this embodiment, the second-level queue in the sending state performs transfer output according to a transfer period of sub-period 1 / 8 T, completes the transfer of messages in one second-level queue in each sub-period, and after completing the transfer of client messages in all queues in this group of queues within one transfer period T, it converts to the receiving state within the next transfer time period T and receives output messages from the first-level queue. Two levels of queues are set, and in the first level, queues are set based on the transmission period label value portion of the first transmission time period label value, requiring only eight queues. In the second level, queues are set based on the sub-period label value portion of the second transmission time period label value, requiring eight queues in one group, for a total of 16 queues in two groups. In this way, the sink node device only requires a total of 8 + 16 = 24 queues (the number of queues corresponding to the transmission period label value portion of the time period label value and the number of queues corresponding to the sub-period label value portion of the double time period label value), which reduces the total number of queues compared to the previous example where only one level of queues was required, requiring 64 queues.

[0123] Fig. 16 is a schematic diagram of a configuration of a communication device according to an embodiment of the present application. As shown in Fig. 16, this communication device 2000 includes a memory 2100 and a processor 2200. The number of memories 2100 and processors 2200 may be one or more, and Fig. 16 illustrates one memory 2101 and one processor 2201. The memory 2101 and processor 2201 in the network device may be connected via a bus, and Fig. 16 illustrates an example in which they are connected via a bus.

[0124] The memory 2101 can be used as a computer-readable storage medium to store software programs, computer-executable programs, and modules such as program instructions / modules corresponding to the methods according to any embodiment of the present application. The processor 2201 realizes the above methods by operating the software programs, instructions, and modules stored in the memory 2101.

[0125] The memory 2101 may primarily include a program storage area and a data storage area, of which the program storage area may store an operating system and / or application programs required for at least one function. The memory 2101 may also include high-speed random access memory and / or non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, the memory 2101 may further include memory located remotely from the processor 2201, and these remote memories may be connected to the device via a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0126] An embodiment of the present application further provides a computer-readable storage medium having stored thereon computer-executable instructions for performing a message processing method or a message transmission method according to any embodiment of the present application.

[0127] One embodiment of the present application further provides a computer program product including a computer program or computer instructions stored in a computer-readable storage medium, wherein 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 to cause the computer device to perform a message processing method or a message transmission method according to any embodiment of the present application.

[0128] The system architecture and application scenarios described in the embodiments of the present application are intended to more clearly explain the technical solutions of the embodiments of the present application, and are not intended to limit the technical solutions of the embodiments of the present application. The technical solutions of the embodiments of the present application can also be applied to similar technical challenges as the system architecture evolves and new application scenarios emerge.

[0129] All or some of the steps of the methods, systems, and functional modules / units of the devices disclosed above can be implemented as software, firmware, hardware, or a suitable combination thereof.

[0130] In hardware embodiments, the division between functional modules / units described above does not necessarily correspond to the division of physical components. For example, one physical component may have multiple functions, and one function or step may be performed by multiple physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processor, digital signal processor, or microprocessor, as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on computer-readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). As known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable, and non-removable media implemented in any method or technology for storing information (e.g., computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cartridges, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and that can be accessed by a computer. Additionally, it is well known to those skilled in the art that communication media typically include 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 media.

[0131] As used herein, terms such as "component," "module," and "system" are used to refer to computer-related entities, hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to, a process running on a processor, a processor, an object, an executable file, a thread of execution, a program, or a computer. By way of illustration, both an application running on a computing device and the computing device may be a component. One or more components may reside within a process or thread of execution, and components may be located on one computer or distributed among two or more computers. Furthermore, these components may execute from various computer-readable media having various data structures stored thereon. Components may communicate, for example, via local or remote processes, according to signals carrying one or more data packets (e.g., data from two components interacting with other components across a local system, a distributed system, or a network, e.g., the Internet interacting with other systems via signals).

[0132] Although some embodiments of the present application have been described above with reference to the drawings, they are not intended to 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 substance of the present application should fall within the scope of the present application.

Claims

1. A message processing method applied to a source node, comprising: setting a periodicity label for a message, the periodicity label including a first time period label and a second transmission time period label value, the first time period label being used to mark a transmission period corresponding to the message at each downstream node, and the second transmission time period label value being used to mark a transmission sub-period of the message at the source node and the sink node; sending the configured message to a downstream node.

2. The first time period label is a first transmission time period label value corresponding to each of said downstream nodes; or The method of claim 1 , including any of the first transmission time period label values ​​corresponding to the source node.

3. deriving a transmission period corresponding to the message at each downstream node based on the first transmission time period label value; 3. The method of claim 2, further comprising: obtaining a transmission sub-period corresponding to the message at the source node and sink node based on the second transmission time period label value, the transmission sub-period being within the transmission period.

4. Each of the downstream nodes has periodicity correspondence information preset therein, The method further comprises: obtaining a transmission period corresponding to the message at each downstream node based on the first transmission time period label value and period correspondence information of each downstream node; 3. The method of claim 2, further comprising: obtaining a transmission sub-period corresponding to the message at the source node and sink node based on the second transmission time period label value, the transmission sub-period being within the transmission period.

5. A message processing method applied to an intermediate node, comprising: receiving a message including a periodicity label, the periodicity label including a first time period label and a second transmission time period label value, the first time period label being used to mark a transmission period corresponding to the message at each downstream node, and the second transmission time period label value being used to mark a transmission sub-period of the message at a sink node; and transmitting a message based on the first time period label.

6. The first time period label is a first transmission time period label value corresponding to each of said downstream nodes; or The method of claim 5 , including any of the first transmission time period label values ​​corresponding to the intermediate node.

7. The step of transmitting a message based on the first time period label comprises: obtaining a transmission period corresponding to the message at each downstream node based on a first transmission time period label value corresponding to each downstream node; and transmitting a message in said transmission period.

8. Each of the downstream nodes has periodicity correspondence information preset therein, The step of transmitting a message based on the first time period label comprises: obtaining a transmission period corresponding to the message at each of the downstream nodes based on a first transmission time period label value corresponding to the intermediate node and period correspondence information of each of the downstream nodes; and transmitting a message in said transmission period.

9. A message processing method applied to a sink node, comprising: receiving a message including a periodicity label, the periodicity label including a first transmission time period label value and a second transmission time period label value, the first transmission time period label value being used to mark a transmission period corresponding to the message at a sink node, and the second transmission time period label value being used to mark a transmission sub-period of the message at the sink node; transmitting a message based on the first transmission time period label value and the second transmission time period label value.

10. transmitting a message based on the first transmission time period label value and the second transmission time period label value, obtaining a transmission period corresponding to the message at the sink node based on the first transmission time period label value; deriving a transmission sub-period corresponding to the message at the sink node based on the second transmission time period label value; and transmitting a message in the transmission sub-period within the transmission period.

11. The sink node has periodicity correspondence information preset therein, transmitting a message based on the first transmission time period label value and the second transmission time period label value, obtaining a transmission period corresponding to the message in the sink node according to the first transmission time period label value and period correspondence information preset in the sink node; obtaining a transmission sub-period of the message within the transmission period of the sink node based on the second transmission time period label value; and transmitting a message in the transmission sub-period within the transmission period.

12. A message processing method applied to a sink node, comprising: storing the message according to a first periodic setting; transmitting the message based on a first transmission time period label value; storing the transmitted messages according to a second periodicity setting and forming a first queue for receiving messages and a second queue for sending messages; determining a transmission sub-period corresponding to the queue based on a second transmission time period label value; transmitting the message within the transmission subperiod.

13. 1. A method for transmitting a message, comprising: a source node setting a periodicity label for a message, the periodicity label including a first time period label and a second transmission time period label value, the first time period label being used to mark a transmission period corresponding to the message at each downstream node, and the second transmission time period label value being used to mark a transmission sub-period of the message at the source node and the sink node; the source node sending a message; an intermediate node receiving a message; the intermediate node deriving a transmission period corresponding to the message at the intermediate node based on the first time period label; the intermediate node transmitting a message within the corresponding transmission period; a sink node receiving the message; The sink node obtains a transmission sub-period corresponding to the message at the sink node based on the first time period label and the second transmission time period label value; the sink node transmitting a message in the transmission sub-period within the transmission period.

14. The first time period label is a first transmission time period label value corresponding to the intermediate node and the sink node, respectively; or The method of claim 13 , including any of the transmit time period label values ​​corresponding to the source node.

15. the step of obtaining a transmission period corresponding to the message at the intermediate node based on the first time period label, the intermediate node deriving a transmission period corresponding to the message at the intermediate node based on a first transmission time period label value corresponding to the intermediate node; The step of the sink node obtaining a transmission sub-period corresponding to the message at the sink node based on the first time period label and the second transmission time period label value includes: the sink node deriving a transmission period corresponding to the message at the sink node based on a first transmission time period label value corresponding to the sink node; The method of claim 14, further comprising: the sink node deriving a transmission sub-period corresponding to the message at the sink node based on the second transmission time period label value.

16. The intermediate node and the sink node have periodicity correspondence information set in advance, the step of obtaining a transmission period corresponding to the message at the intermediate node based on the first time period label, the intermediate node includes obtaining a transmission period corresponding to the message at the intermediate node based on a first transmission time period label value corresponding to the intermediate node and period correspondence information corresponding to the intermediate node; The step of the sink node obtaining a transmission sub-period corresponding to the message at the sink node based on the first time period label and the second transmission time period label value includes: The sink node obtains a transmission period corresponding to the message at the sink node according to a first transmission time period label value corresponding to the sink node and period correspondence information corresponding to the sink node; The method of claim 14, further comprising: the sink node obtaining a transmission sub-period for the message at the sink node based on the second transmission time period label value, the transmission sub-period being within a transmission period corresponding to the sink node.

17. A communication device comprising a memory, a processor, and a computer program stored in the memory and operable by the processor, wherein the processor, when executing the computer program, realizes a message processing method according to any one of claims 1 to 12.

18. at least one processor; at least one memory for storing at least one program; A communication system, wherein at least one of the programs, when executed by at least one of the processors, implements the message transmission method according to any one of claims 13 to 16.

19. A computer-readable storage medium storing computer-executable instructions for carrying out the message processing method according to any one of claims 1 to 12 or the message transmission method according to any one of claims 13 to 16.

20. A computer program product comprising a computer program or computer instructions, the computer program or the computer instructions being stored in a computer-readable storage medium, a processor of a computer device reading the computer program or the computer instructions from the computer-readable storage medium, and the processor executing the computer program or the computer instructions to cause the computer device to perform the message processing method of any one of claims 1 to 12 or the message transmission method of any one of claims 13 to 16.

Images