WO2024055897A1 - 报文处理方法、传递方法、通信设备、系统、介质及产品 - Google Patents

报文处理方法、传递方法、通信设备、系统、介质及产品 Download PDF

Info

Publication number
WO2024055897A1
WO2024055897A1 PCT/CN2023/117509 CN2023117509W WO2024055897A1 WO 2024055897 A1 WO2024055897 A1 WO 2024055897A1 CN 2023117509 W CN2023117509 W CN 2023117509W WO 2024055897 A1 WO2024055897 A1 WO 2024055897A1
Authority
WO
WIPO (PCT)
Prior art keywords
message
sending
node
period
time
Prior art date
Application number
PCT/CN2023/117509
Other languages
English (en)
French (fr)
Inventor
刘峰
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2024055897A1 publication Critical patent/WO2024055897A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0852—Delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0852—Delays
    • H04L43/087—Jitter
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

Definitions

  • the embodiments of the present application relate to the field of communication technology, and in particular, a message processing method, a transmission method, a communication device, a communication system, a storage medium and a program product.
  • Ethernet's best-effort transmission technology cannot ensure that the delay and jitter of information transmission can meet the needs of relevant application scenarios.
  • TSN Time-Sensitive Network
  • CQF Cyclic Queuing and Forwarding
  • CQF Cycle Specified Queuing and Forwarding
  • CSQF Cycle Specified Queuing and Forwarding
  • 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.
  • embodiments of the present application provide a message processing method, which is applied to a source node.
  • the method includes: configuring a period label and a time offset value for the message, wherein the period label is used to identify the message.
  • the sending cycle corresponding to the message at each downstream node, the time offset value is used to identify the offset value between the starting time of the sending cycle of the message at the source node and the sending time; send the configured message to the downstream node arts.
  • embodiments of the present application provide a message processing method, which is applied to an intermediate node.
  • the method includes: receiving a message, wherein the message carries a period label and a time offset value; the period label is In order to identify the sending cycle corresponding to the message at each downstream node, the time offset value is used to identify the offset value between the starting time of the sending cycle and the sending time of the message at the source node; according to the cycle label, Send message.
  • embodiments of the present application provide a message processing method, which is applied to a sink node.
  • the method includes: receiving the message, wherein the message carries a sending time period tag value and a time offset value;
  • the sending time cycle tag value is used to identify the sending cycle corresponding to the message at the sink node, and the time offset value is used to identify the offset value between the starting time of the sending cycle and the sending time of the message at the source node. ;Send the message according to the sending time period tag value and the time offset value.
  • embodiments of the present application provide a message delivery method.
  • the method includes: the source node configures a period label and a time offset value for the message, wherein the period label is used to identify the message at each time.
  • the sending cycle corresponding to the downstream node, the time offset value is used to identify the offset value between the starting time of the sending cycle of the source node and the sending time of the message; the source node sends the message; the intermediate node receives the message ;
  • the intermediate node obtains the sending period corresponding to the message at the intermediate node according to the period label; the intermediate node sends the message within the corresponding sending period; the sink node receives the message; the sink node
  • the node obtains the sending time corresponding to the message at the sink node based on the period label and time offset value; the sink node sends the message at the sending time.
  • embodiments of the present application provide a communication device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor executes the computer program, the first , the message processing method described in the second aspect or the third aspect.
  • embodiments of the present application provide a communication system, including: at least one processor; at least one memory for storing at least one program; when at least one of the programs is executed by at least one of the processors, the following steps are implemented: The message delivery methods described in the four aspects.
  • embodiments of the present application provide a computer-readable storage medium that stores computer-executable instructions, and the computer-executable instructions are used to perform the first, second, or third aspect.
  • embodiments of the present application provide a computer program product, including a computer program or computer instructions, characterized in that the computer program or the computer instructions are stored in a computer-readable storage medium, and the processor of the computer device is configured to The computer-readable storage medium reads the computer program or the computer instructions, and the processor executes the computer program or the computer instructions, so that the computer device performs the first, second or third aspect.
  • Figure 1 is a schematic flowchart of an Ethernet device using a store-and-forward mode to process messages in related technologies.
  • Figure 2 is a schematic flow chart of using CQF to transmit messages in TSN technology.
  • Figure 3 is a schematic diagram of the time period tag value 4000 being carried in the message.
  • Figure 4 is a schematic flow chart of CSQF message transmission.
  • Figure 5 is a schematic diagram of the correspondence between time period tag values of messages between devices.
  • Figure 6 is a flow chart of a message processing method provided by an embodiment of the present application.
  • Figure 7 is a schematic diagram of a message processing method according to another embodiment of the present application.
  • Figure 8 is a schematic diagram of a message processing method according to an embodiment of the present application.
  • Figure 9 is a flow chart of a message processing method provided by an embodiment of the present application.
  • Figure 10 is a flow chart of a message processing method provided by an embodiment of the present application.
  • Figure 11 is a flow chart of a message processing method provided by an embodiment of the present application.
  • Figure 12 is a schematic diagram of the offset value ⁇ T carried in the message according to an embodiment of the present application.
  • Figure 13 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • the embodiments of this application relate to information transmission/delivery technology in communication networks.
  • Delay and jitter are important performance indicators for information transmission.
  • Different application scenarios have different requirements for information transmission quality, such as transmission delay and jitter.
  • FIG. 1 is a schematic flowchart of an Ethernet device using a store-and-forward mode to process messages in related technologies.
  • packets 1000 are looked up, parsed, rate limited, queued, and cached in each node, such as the first device 100, the second device 200, the third device 300, and the fourth device 400. , scheduling and other functional modules.
  • the messages may or may not be processed after passing through each node.
  • the specific information or content carried by the messages recorded in the embodiments of this application at different nodes may be the same or different.
  • the first device 100 may be a source node
  • the second device 200 and the third device 300 may be intermediate nodes
  • the fourth device 400 may be a sink node.
  • the packets of all physical ports in the device share these functional modules, so the time it takes for each physical port's packets to receive the service of these functional modules is uncertain, and the completion processing time is inconsistent, resulting in inconsistent delay times within each device.
  • Ethernet technology is widely used in industrial production lines and vehicles, higher requirements are placed on the quality of message transmission. The transmission delay and jitter of the message transmission method shown in Figure 1 are difficult to meet the relevant required parameters.
  • Ethernet technology is replacing proprietary fieldbus technology because Ethernet supports higher data rates, lower costs, and is easier to interface with.
  • System integration of existing Ethernet equipment
  • Ethernet technology forwards packets based on the best-effort concept, and is difficult to meet the end-to-end delay, jitter, and zero packet loss characteristics of packet transmission in specific application scenarios.
  • TSN Time-Sensitive Network
  • the Time-Sensitive Network (TSN) task group has developed a standard system for transmission and processing of Ethernet services, which can achieve deterministic delivery of services or packets.
  • TSN is only suitable for local area networks in scenarios such as industrial plants and vehicle-mounted systems with small physical space.
  • CQF Cyclic Queuing and Forwarding
  • TSN technology is used in local area networks to configure a global scheduling schedule and schedule and forward customer messages through fixed time slices to achieve deterministic delay jitter requirements. All network devices in the LAN are located within a small physical range, and the link propagation delay of messages between devices is negligible.
  • Time-sensitive networks require time synchronization between all devices on the network, upstream and downstream devices work synchronously, and messages are transmitted from When the upstream device sends the message, the downstream device receives the message at the same time, and the upstream and downstream devices send and receive customer messages at the same time.
  • CQF is used in TSN technology to achieve deterministic delay forwarding of messages.
  • FIG. 2 is a schematic flow chart of using CQF to transmit messages in TSN technology.
  • two queuing queues such as queue 1 and queue 2 are set up at the output port of each device to form a periodic flow queue.
  • the control gate has "open” (marked open in the figure) or "closed” (marked in the figure) Marked as close) two states.
  • the gate control states of the entry control door and the exit control door of the same queue remain different, that is, when the entry control door of the queue is in the open state, the exit control door of the queue is in the closed state; the entry control door of the queue is in the closed state.
  • the dequeue control door of the queue is in the open state.
  • the port is set up with two queues. At any time, one queue is used to receive packets, and the other queue is used to send packets. Therefore, the control gates of the same type of port (such as the output port of the queue) in the two queues are also different.
  • the CQF mechanism divides transmission time into a series of equal time intervals (or time slices). Each time interval is called a time period T. All time periods T are divided into even periods and odd periods, which are distinguished by T 0 and T 1 .
  • the network system plans in advance what state each control door will be in each time period, such as open or closed. During a cycle, the state of the control gate remains unchanged. When the time period ends, the control gate that was originally in the open state switches to the closed state, the queue stops outputting message information, and the control gate of the other queue switches to the open state, and the control gate of the other queue is switched to the open state. Start outputting message information.
  • CQF can ensure that data packets sent from the upstream node device within one cycle are sent to the downstream node within the same time period.
  • the downstream node device receives it within the same time period and then forwards it within the same time period.
  • the sending cycle recorded in the embodiment of this application is the time period in which the message is sent.
  • the message can be realized from The first device on the network such as the source node/device starts forwarding, and all packets forwarded in the same cycle are forwarded and transmitted within a fixed time period T in each device such as the intermediate node/device. Each device delays forwarding the transmission by a time period T until the last device such as the sink node/device forwards the transmission.
  • the end-to-end delay of a packet on the network only depends on the cycle size T and the number of devices on the network that the packet passes through H. due to the same All packets in a cycle are always forwarded in the same cycle during the forwarding process, so the packets in the same cycle from the source device are output in the same cycle from the sink device.
  • the message can fluctuate at any position in the same time period T.
  • the first position is the starting position in a period T
  • the last position is the end position in a period T.
  • the total forwarding delay time of the packet in the network is the maximum, and the maximum delay time is (H +1)*T;
  • the source device forwards the message at the end of the time period, and the sink device forwards and outputs the message at the beginning of the time period T
  • the total forwarding delay time of the message on the network is the smallest, and the minimum delay time is (H-1)*T. Therefore, the total end-to-end forwarding delay of packets from the source device to the sink device in the entire network fluctuates within the range of ⁇ (H-1)*T, (H+1)*T ⁇ .
  • the CQF method can only be applied to LAN scenarios with a small physical range.
  • CSQF CSQF
  • CSQF technology can further reduce the impact of time synchronization between devices and link transmission delay time between devices. This enables the application of TSN's forwarding mechanism in wide-area deterministic networks.
  • the CSQF forwarding mechanism does not require time synchronization of all devices on the network, only the clock frequency between devices. That is, the devices recover the message clock signal when receiving messages and track the clock frequency of the other device.
  • the CSQF mechanism requires network-wide clock frequency synchronization, egress port multi-queue circular queuing and forwarding, adjacent node egress port periodic label mapping and other functions.
  • CSQF CSQF
  • all packets are required to carry a time period tag value when sent by the source node device.
  • Messages within a time period carry the same time period tag value, which means that the messages are received uniformly and forwarded together within the same time period.
  • the source node device puts a time period tag in the sent message, and the time period tag value can be anywhere in the message.
  • FIG 3 is a schematic diagram of the time period tag value 4000 being carried in the message. As shown in Figure 3, this message carries the time period tag value in the Layer 3 extension field. Messages with the same time period label value are received and forwarded within the same period T on the intermediate node device. The intermediate node device can modify the time period tag value, but all packets with the same time period tag value before the modification must still have the same time period tag value after the modification.
  • the sending time period tag value recorded in the embodiment of this application is used to identify the sending period in which the message is located, that is, to indicate in which time period the message is forwarded.
  • FIG 4 is a schematic flow chart of CSQF message transmission.
  • time synchronization is not required between all devices in the network, only clock frequency synchronization is required.
  • the working status of the queue is switched according to a fixed cycle time.
  • the cycle size is the same for all devices.
  • the time cycles of each device work independently and the time cycle switching times of each device are inconsistent (the starting time and end time of all device cycles are different), when the clock frequency is the same, the switching frequency of the time cycle in each device is the same. , the number of switching time periods per unit time is the same, and the switching frequency is the same.
  • the time tag value carried by the packet determines which queue the packet enters. cache. Messages with the same time period value enter the same queue. All queues are in different states in each cycle, and all queues change working states in turn. In any time period, only one queue is in the sending state, and the queue in the sending state only sends messages but does not receive messages. Other queues are in the receiving state, and the receiving queue only receives packets but does not send packets. All queues switch working status cyclically according to the cycle time. At any time period, one of the queues is in the sending state and the remaining queues are in the receiving state.
  • all node devices determine the period mapping relationship of their respective queues.
  • the message When the message is forwarded in the source node device, it will carry the forwarding time period label value in each device.
  • the label marks the message in the specified device.
  • the specified receive queue After the packet is forwarded by a device, the used timestamp value is stripped off.
  • the first packet 1100 in device 1 carries tag 1, tag 2 and tag 3.
  • the tag 1 is peeled off to obtain the second packet 1200.
  • the third message 1300 is obtained.
  • each device receives a message, it extracts the time period tag value carried on the message.
  • the device puts the data packet into the designated receiving queue according to the period tag value, and waits for the data packet to be forwarded and output to the next when the receiving queue is converted into a sending queue.
  • Jump device The message carries the receiving queue specified in each hop device in advance, so that the message is received in the specified queue and forwarded in the specified time period (it is forwarded when the receiving queue is converted to the sending queue).
  • Each device forwards data within a fixed period, thereby achieving a fixed delay in end-to-end forwarding of customer packets.
  • the network system plans the message delivery path, delay, bandwidth, and queue resources in advance according to the service quality requirements of business delivery, determines the cycle parameters, generates a forwarding cycle label for each node device, and distributes it to the node device. .
  • the service is sent by the source device, it carries the forwarding cycle label value of the message on each node.
  • Each node device determines which queue the message enters for forwarding based on the forwarding cycle label.
  • the clock frequency of all node devices on the network is synchronized, the time period of all nodes changes at the same time, the queue status switching speed is the same, the receiving status and sending status of all queues change according to a fixed frequency, and the message is sent in the fixed queue of the upstream node device, entering In the fixed queue corresponding to the downstream node, the output is sent after the corresponding queue changes to the sending state.
  • Messages are forwarded in each upstream device within a fixed sending cycle, and then forwarded to the downstream device in a new fixed forwarding and sending cycle. Therefore, the total forwarding delay time between the first source device and the last sink device of a packet is fixed, thereby achieving end-to-end deterministic delay forwarding of packets from the network source node device to the sink node device. .
  • the network source node device 1 when the network source node device 1 sends the message 1100, it carries the tag value of the time period for the packet 1100 to be forwarded on each device, such as tag 1, tag 2, and tag 3.
  • each device receives the message, it strips off the used time period tag value.
  • device 2 receives the message, it strips off the used tag value 1 and obtains message 1200.
  • the label value is 1200 for forwarding the packet.
  • device 2 can obtain the time period tag value 2 based on the time period tag value 1 carried in the message and the correspondence between the time period tag value 1 and the time period tag value 2, and convert the message Just change the time period tag value 1 carried in the message to the time period tag value 2, thus obtaining the time period tag value 2 of the packet on device 2.
  • only one sending time period tag value is carried to obtain the sending time period tag value corresponding to each downstream node.
  • FIG. 5 is a schematic diagram of the correspondence between time period tag values of messages between devices.
  • the time period tag value of device 1's message is T0 and the time period tag value of device 2 is T5.
  • the time period tag value of device 1's message is T1 and the time period of device 2.
  • the tag value T6 has a one-to-one correspondence, and so on.
  • the fourth message 1400 on device 1 is forwarded on device 1 according to the T0 cycle, and the time period tag value it carries is T0.
  • device 2 modifies the time period tag value T0 carried in the message to T5 according to the corresponding relationship, and sends it out in device 2 in the T5 cycle.
  • the time period tag value of device 2's message is T5 and the time period tag value of device 2 is T2.
  • the time period tag value of device 2's message is T6 and the time period tag value of device 3 is T3.
  • the fifth message 1500 forwarding process is also similar. No matter which method the packets use to carry the time period label value, all packets carrying the same time period label are forwarded within the same time period, thereby achieving deterministic forwarding of the messages.
  • packets can only fluctuate within one time period, and the fluctuation range of forwarding delay is not greater than the time period T.
  • the forwarding cycle T of all devices on the network can only be reduced.
  • the forwarding period T becomes smaller, it means that the time of one forwarding cycle becomes shorter.
  • the device's physical port transmission bandwidth is small and the packet length is too long, the number of packets that can be forwarded in one forwarding cycle is very small. In a scenario where the message is an extremely long message and the forwarding cycle is very short, it will result in that only one long message can be carried in one cycle, making it difficult to carry more very long messages.
  • the minimum forwarding period T usually has a lower limit. In some cases, the lower limit still cannot meet the needs of some packets.
  • 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.
  • the intermediate node /The device forwards according to the corresponding sending cycle, and the sink node/device forwards according to the time deviation value to achieve a smaller range of delay, jitter or zero jitter, delay, thereby reducing the delay and jitter when forwarding messages, and achieving business optimization. Deterministic delivery.
  • Figure 6 is a flow chart of a message processing method provided by an embodiment of the present application. As shown in Figure 6, this packet processing method can be, but is not limited to, applied to the source node/device. In the embodiment of FIG. 6 , the message processing method may include but is not limited to steps S100 and S200.
  • Step S100 Configure a period label and a time offset value ⁇ T on the message.
  • the cycle label is used to identify the corresponding sending cycle of the message in each downstream node.
  • the time offset value ⁇ T is used to identify the offset value between the starting time of the sending cycle of the message and the sending time of the source node.
  • the period tag includes the sending time period tag value Tn corresponding to each downstream node.
  • the sending time period tag value Tn identifies the corresponding sending period of the message in the corresponding node.
  • Each node/device determines the period in which the message is sent based on Tn.
  • the period label includes a sending time period label value T1 corresponding to the source node.
  • T1 a sending time period label value
  • each downstream node is configured with period corresponding information Xn in advance.
  • the corresponding sending time period tag value Tn and the preconfigured period corresponding information Xn of the current node the corresponding sending time period tag value used to identify the message in the current node is obtained.
  • FIG. 7 the technical solution of this embodiment is illustrated.
  • FIG. 7 is a schematic diagram of a message processing method provided by another embodiment of the present application.
  • device 2 and device 3 have pre-configured cycle corresponding information, which are X2 and X3 respectively.
  • Device 1 source node
  • the period tag carried by message 1000 includes the sending time period tag value T1.
  • Device 1 sends the message to device 2 (intermediate node) in the corresponding sending cycle according to the cycle tag value T1.
  • Device 2 receives message 1000 carrying period tag value T1.
  • Device 2 obtains the period label T2 corresponding to the current node based on the period label value T1 and the preconfigured period corresponding information X2.
  • Device 2 sends the message to device 3 (sink node) in the corresponding sending cycle according to the cycle tag value T2.
  • Device 3 receives message 1000 carrying period tag value T2.
  • Device 3 obtains the period label T3 corresponding to the current node based on the period label value T2 and the configured period corresponding information X3.
  • Device 3 sends the message in the corresponding sending cycle according to the cycle tag value T3.
  • Step S200 Send the configured message to the downstream node.
  • the message processing method may further include steps S111 and S120.
  • Step S111 Obtain the sending period corresponding to the message in each downstream node based on the sending time period tag value Tn corresponding to each downstream node.
  • the corresponding sending period of the message in the source node can be obtained.
  • the sending period T2 corresponding to the intermediate node the sending period corresponding to the message at the intermediate node can be obtained.
  • the corresponding sending period T3 of the sink node the corresponding sending period of the message at the sink node can be obtained.
  • Step S120 According to the time offset value ⁇ T, obtain the sending time of the message within the sending cycle of the sink node.
  • the sink node can obtain the sending time of the message within the corresponding sending cycle of the sink node based on the time offset value ⁇ T. That is, the deviation value between the start time of the sending cycle corresponding to the message at the sink node and the time when the message is sent at the sink node is equal to the time deviation value ⁇ T.
  • packets can be transmitted with zero delay and jitter in the network.
  • the message processing method may further include steps S112 and S120.
  • Step S112 Obtain the corresponding sending cycle of the message in each downstream node based on the sending time cycle tag value Tn of each downstream node and the cycle corresponding information X of each downstream node.
  • the intermediate node can obtain the sending time period corresponding to the current intermediate node based on the sending time period tag value T1 carried in the message sent from the source node and the intermediate node period corresponding information X2 Label T2.
  • the sink node can obtain the sending time period label T3 corresponding to the sink node based on the cycle tag value T2 carried in the message sent from the intermediate node and the sink node cycle corresponding information X3.
  • Step S120 According to the time offset value ⁇ T, obtain the sending time of the message within the sending cycle of the sink node.
  • the sink node can obtain the sending time of the message within the corresponding sending cycle of the sink node based on the time offset value ⁇ T. That is, the deviation value between the start time of the sending cycle corresponding to the message at the sink node and the time when the message is sent at the sink node is equal to the time deviation value ⁇ T.
  • packets can be transmitted with zero delay and jitter in the network.
  • FIG 8 is a schematic diagram of a message processing method according to an embodiment of the present application. As shown in Figure 8, the sixth message 1600 is configured with a period tag.
  • the cycle tag is at least used to identify the corresponding sending cycles of the sixth message 1600 in the second device 200, the third device 300, and the fourth device 400 downstream of the first device 100 respectively.
  • the period tag includes transmission time period tag values T3, T0, and T1.
  • the sending time period tag value T3 identifies the T3 period in which the sixth message 1600 is sent in the second device 200, that is, T3 is the corresponding sending period;
  • the sending time period tag value T0 identifies the T3 period in which the sixth message 1600 is sent in the third device 300.
  • the T0 cycle is sent, that is, T0 is the corresponding sending cycle;
  • the sending time period tag value T1 identifies that the sixth message 1600 is sent in the T1 cycle in the fourth device 400, that is, T1 is the corresponding sending cycle.
  • the second device 200, the third device 300 and the fourth device 400 downstream of the first device 100 are respectively pre-configured with period corresponding information X2, X3 and X4.
  • the cycle tag is used to identify the corresponding sending cycle of the sixth message 1600 in the first device 100 .
  • the period tag includes a transmission time period tag value T0.
  • the second device 200 obtains the sending time period tag value T3 corresponding to the second device 200 based on the sending time period tag value T0 and the period corresponding information X2 of the second device 200 .
  • the third device 300 obtains the sending time period tag value T0 corresponding to the third device 300 based on the sending time period tag value T3 and the period corresponding information X3 of the third device 300 .
  • the fourth device 400 obtains the sending time period tag value T1 corresponding to the fourth device 400 based on the sending time period tag value T0 and the period corresponding information X4 of the fourth device 400 .
  • the corresponding sending period T1 of the message 1600 in the sink node can be obtained.
  • the sending time of the message 1600 determined by the sink node can further be determined based on the time offset value ⁇ T.
  • the time offset value ⁇ T determines the sending time of the sixth message 1600 within the sending period T1. For example, the time that is ⁇ T away from the start time of the T1 cycle is the sending time of the sixth message 1600 in the sending cycle T1.
  • the time that is ⁇ T away from the start time of the T1 cycle is the sending time of the sixth message 1600 in the sending cycle T1.
  • the sink node device is based on the deviation The value is forwarded to achieve delay jitter in a smaller range or zero delay jitter, thereby reducing packet forwarding delay jitter and achieving deterministic delivery of services.
  • Figure 9 is a flow chart of a message processing method provided by an embodiment of the present application. As shown in Figure 9, this packet processing method can be, but is not limited to, applied to intermediate nodes/devices. In the embodiment of FIG. 9 , the message processing method may include but is not limited to steps S300 and S400.
  • Step S300 Receive the message.
  • the message carries a period label and a time offset value ⁇ T.
  • the cycle label is used to identify the corresponding sending cycle of the message at each downstream node.
  • the time offset value ⁇ T is used to identify the offset value between the starting time of the sending cycle of the message and the sending time of the source node.
  • the period label includes the sending time period label value Tn corresponding to each downstream node.
  • the sending time period tag value Tn identifies the corresponding sending period of the message in the corresponding node.
  • Each node/device determines the period in which the message is sent according to Tn.
  • the period tag may include the sending time period tag value corresponding to each downstream node corresponding to the current node, or may also include the sending period tag value corresponding to the current node. If the current node is the source node, the period label also includes the sending period label value corresponding to the source node; if the current node is an intermediate node, the period label includes the sending period label value corresponding to the current intermediate node; if the current node is the sink node, then The period label includes the sending period label value corresponding to the sink node.
  • Step S400 Send the message according to the period label.
  • step S400 may include steps S410 and S420.
  • Step S410 Obtain the corresponding sending period of the message in each downstream node according to the corresponding sending time period tag value of each downstream node.
  • Step S420 The intermediate node sends the message in the corresponding sending cycle.
  • the message processing method may further include steps S430 and S420.
  • Step S430 Obtain the sending period of the message corresponding to each downstream node based on the sending time period tag value corresponding to the intermediate node and the period corresponding information corresponding to each downstream node. Among them, the period information corresponding to each downstream node is pre-configured. If the current node is the next hop node of the source node, the sending cycle corresponding to the current node is obtained based on the sending time cycle tag value corresponding to the source node and the cycle corresponding information corresponding to the current node.
  • Step S420 The intermediate node sends the message in the corresponding sending cycle.
  • the second device 200 corresponds to the sending time period tag value T2.
  • Each downstream node of the second device 200 that is, the third device 300 and the fourth device 400, is pre-configured with period corresponding information X3 and X4.
  • the message 1600 carries the sending time period tag value T3 and is sent from the second device 200 to the third device 300 .
  • the third device 300 obtains the current node sending time period tag value T0 based on the sending time period tag value T3 and the period corresponding information X3.
  • the third device 300 forwards the message in the corresponding sending period, that is, T0, according to the sending time period tag value T0.
  • the fourth device 400 receives the message 1600 carrying the sending time period tag value T0, and obtains the current sending time period tag value T1 based on the sending time period tag value T0 and the period corresponding information X4 preconfigured in the fourth device 400.
  • the fourth device 400 forwards the message in the corresponding sending period according to the sending time period tag value T1.
  • Figure 10 is a flow chart of a message processing method provided by an embodiment of the present application. As shown in Figure 10, this packet processing method can be, but is not limited to, applied to sink nodes/devices. In the embodiment of Figure 10, the message processing method may include but is not limited to steps S500 and S600.
  • Step S500 Receive the message.
  • the message carries the sending time period tag value T and the time offset value ⁇ T.
  • the sending time period tag value is used to identify the sending period corresponding to the message at the sink node.
  • the time offset value ⁇ T is used to identify the offset value between the starting time of the sending cycle of the message and the sending time of the source node.
  • Step S600 Send the message according to the sending time period tag value T and the time offset value ⁇ T.
  • step S600 may also include steps S611 and S620.
  • Step S611 According to the sending time period tag value T, obtain the corresponding sending period of the message in the sink node.
  • Step S620 According to the time offset value ⁇ T, obtain the sending time of the message within the sending cycle of the sink node.
  • the message processing method may further include steps S610 and S620.
  • Step S610 Obtain the corresponding sending cycle of the message in the sink node based on the sending time cycle tag value T and the cycle corresponding information X of the sink node.
  • Step S620 According to the time offset value ⁇ T, obtain the sending time of the message within the sending cycle of the sink node.
  • the sink node can obtain the sending time of the message within the corresponding sending cycle of the sink node based on the time offset value ⁇ T. That is, the deviation value between the start time of the sending cycle corresponding to the message at the sink node and the time when the message is sent at the sink node is equal to the time deviation value ⁇ T.
  • packets can be transmitted with zero delay and jitter in the network.
  • step S600 may also include steps S630 and S640.
  • Step S630 Obtain the corresponding sending cycle of the message in the sink node based on the sending time cycle tag value Tn and the cycle corresponding information X of the sink node.
  • Step S640 According to the time offset value ⁇ T, obtain the sending time of the message in the sending sub-send of the sink node.
  • Figure 11 is a flow chart of a message processing method provided by an embodiment of the present application. As shown in Figure 11, the message transmission method. In the embodiment of Figure 11, the message processing method may include but is not limited to steps S710, S720, S730, S740, S750, S760, S770, and S780.
  • Step S710 The source node configures a period label and a time offset value for the message.
  • Step S720 The source node sends the message.
  • Step S730 The intermediate node receives the message.
  • Step S740 The intermediate node obtains the corresponding sending cycle of the message at the intermediate node based on the cycle label.
  • Step S750 The intermediate node sends the message within the corresponding sending cycle.
  • Step S760 The sink node receives the message.
  • Step S770 The sink node obtains the sending time corresponding to the message at the sink node based on the period label and time offset value.
  • Step S780 The sink node sends the message at the sending time.
  • each message carries the position deviation value ⁇ T between the message and the start time of the current sending cycle.
  • the sixth message 1600 carries the position deviation value ⁇ T of the message.
  • Figure 12 is a schematic diagram of the offset value ⁇ T carried in the message according to an embodiment of the present application.
  • the offset value ⁇ T is carried in the message and can be carried together with the message sending time period tag value.
  • the intermediate device forwards, the intermediate device only forwards according to the sending time period tag value and ignores the offset value ⁇ T carried in the message.
  • the message reaches the sink device of the destination point, when the sink device sends according to the sending time period tag value, after determining the starting time of the sending cycle, it determines the current time based on the message position deviation value ⁇ T carried in the message.
  • the starting time of the sending cycle, and this message is sent at the time position corresponding to the deviation value ⁇ T after the starting time of the sending cycle.
  • the embodiment of this application provides CSQF technology as an example, but it does not Limited to CSQF, it also applies to TSN technology.
  • the client message is forwarded according to the sending time period tag value Tn, and the client message is forwarded at the time position corresponding to the deviation value ⁇ T after the start time of this sending period, which can achieve end-to-end forwarding with zero delay jitter. .
  • Figure 13 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • the communication device 2000 includes a memory 2100 and a processor 2200.
  • the number of memory 2100 and processor 2200 may be one or more
  • Figure 13 A memory 2101 and a processor 2201 are taken as an example; the memory 2101 and the processor 2201 in the network device can be connected through a bus or other means.
  • the connection through a bus is taken as an example.
  • the memory 2101 can be used to store software programs, computer-executable programs and modules, such as program instructions/modules corresponding to the methods provided in any embodiment of this application.
  • the processor 2201 implements the above method by running software programs, instructions and modules stored in the memory 2101.
  • the memory 2101 may mainly include a program storage area and a data storage area, where the program storage area may store an operating system and an application program required for at least one function.
  • the memory 2101 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device.
  • memory 2101 further includes memory located remotely relative to processor 2201, and these remote memories may be connected to the device through a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.
  • An embodiment of the present application also provides a computer-readable storage medium that stores computer-executable instructions.
  • the computer-executable instructions are used to execute the message processing method or message delivery method provided by any embodiment of the present application. method.
  • An embodiment of the present application also provides a computer program product, which includes a computer program or computer instructions.
  • the computer program or computer instructions are stored in a computer-readable storage medium.
  • the processor of the computer device reads the computer program from the computer-readable storage medium.
  • Programs or computer instructions, the processor executes the computer program or computer instructions, so that the computer device performs the message processing method or the message delivery method as provided in any embodiment of the present application.
  • the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may consist of several physical components. Components execute cooperatively. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or 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).
  • computer storage media includes volatile and nonvolatile media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. removable, removable and non-removable media.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disk (DVD) or other optical disk storage, magnetic cassettes, tapes, disk storage or other magnetic storage devices, or may Any other medium used to store the desired information and that can be accessed by a computer.
  • communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media .
  • a component may be, but is not limited to, a process, processor, object, executable file, thread of execution, program or computer running on a processor.
  • applications running on the computing device and the computing device may be components.
  • One or more components can reside in a process or thread of execution, and the component can be localized on one computer or distributed between 2 or more computers. Additionally, these components can execute from various computer-readable media having various data structures stored thereon.
  • a component may, for example, be based on a signal having one or more data packets (e.g., data from two components that interact with another component from a local system, a distributed system, or a network, such as the Internet that interacts with other systems via signals) Communicate through local or remote processes.
  • data packets e.g., data from two components that interact with another component from a local system, a distributed system, or a network, such as the Internet that interacts with other systems via signals

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本申请实施例提供了一种报文处理方法、传递方法、通信设备、通信系统、存储介质及程序产品，通过在信息传递过程中，在报文中携带第一周期标签、时间偏差值(S100)，中间节点依据对应的发送周期进行转发(S200)。

Description

报文处理方法、传递方法、通信设备、系统、介质及产品
相关申请的交叉引用
本申请基于申请号为202211131941.X、申请日为2022年9月16日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请实施例涉及通信技术领域，尤其是一种报文处理方法、传递方法、通信设备、通信系统、存储介质及程序产品。
背景技术
随着无线通信技术在车联网、工业物联网等场景的使用和发展，对无线网络中信息传递的质量提出了更高的要求。以太网尽力而为的传递技术，难以确保信息传递的时延和抖动能够满足相关应用场景的需求。
相关技术中，时间敏感网络(Time-Sensitive Network，TSN)、循环队列转发(Cyclic Queuing and Forwarding，CQF)、循环指定队列转发(Cycle Specified Queuing and Forwarding，CSQF)等技术，虽然能够实现信息的传递在一定的范围内延迟抖动。但受限于设备能力，难以进一步减小信息传递的延迟抖动范围。因此，如何进一步减少延迟抖动是一个亟待讨论和解决的问题。
发明内容
本申请实施例提供一种报文处理方法、传递方法、通信设备、通信系统、存储介质及程序产品。
第一方面，本申请实施例提供一种报文处理的方法，应用于源节点，所述方法包括：对所述报文配置周期标签、时间偏差值，其中，所述周期标签用于标识所述报文在各下游节点对应的发送周期，所述时间偏差值用于标识所述报文在源节点的发送周期的起始时刻与发送时刻的偏移值；向下游节点发送配置后的报文。
第二方面，本申请实施例提供一种报文处理的方法，应用于中间节点，所述方法包括：接收报文，其中，所述报文携带周期标签、时间偏差值；所述周期标签用于标识所述报文在各下游节点对应的发送周期，所述时间偏差值用于标识所述报文在源节点的发送周期起始时刻与发送时刻的偏移值；根据所述周期标签，发送报文。
第三方面，本申请实施例提供一种报文处理的方法，应用于宿节点，所述方法包括：接收所述报文，其中，所述报文携带发送时间周期标签值、时间偏差值；所述发送时间周期标签值用于标识所述报文在宿节点对应的发送周期，所述时间偏差值用于标识所述报文在源节点的发送周期起始时刻与发送时刻的偏移值；根据所述发送时间周期标签值和所述时间偏差值，发送报文。
第四方面，本申请实施例提供一种报文传递的方法，所述方法包括：源节点对报文配置周期标签、时间偏差值，其中，所述周期标签用于标识所述报文在各下游节点对应的发送周期，所述时间偏差值用于标识所述报文在源节点的发送周期的起始时刻与发送时刻的偏移值；所述源节点发送报文；中间节点接收报文；所述中间节点根据所述周期标签，得到所述报文在所述中间节点对应的发送周期；所中间节点在所述对应的发送周期内发送报文；宿节点接收报文；所述宿节点根据所述周期标签、时间偏差值，得到所述报文在所述宿节点对应的发送时刻；所述宿节点在所述发送时刻发送报文。
第五方面，本申请实施例提供一种通信设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如第一、第二方面或第三方面所述的报文处理的方法。
第六方面，本申请实施例提供一种通信系统，包括：至少一个处理器；至少一个存储器，用于存储至少一个程序；当至少一个所述程序被至少一个所述处理器执行时实现如第四方面所述的报文传递的方法。
第七方面，本申请实施例提供一种计算机可读存储介质，所述计算机可读存储介质存储有计算机可执行指令，所述计算机可执行指令用于执行如第一、第二方面或第三方面所述的报文处理的方法，或如第四方面所述的报文传递的方法。
第八方面，本申请实施例提供一种机程序产品，包括计算机程序或计算机指令，其特征在于，所述计算机程序或所述计算机指令存储在计算机可读存储介质中，计算机设备的处理器从所述计算机可读存储介质读取所述计算机程序或所述计算机指令，所述处理器执行所述计算机程序或所述计算机指令，使得所述计算机设备执行如第一、第二方面或第三方面所述的报文处理的方法，或如第四方面所述的报文传递的方法。
附图说明
图1为相关技术中以太网设备采用存储转发模式处理报文的流程示意图。
图2为TSN技术中采用CQF传输报文的流程示意图。
图3为时间周期标签值4000在报文中被携带的示意图。
图4为CSQF传输报文的流程示意图。
图5为设备间的报文的时间周期标签值对应关系示意图。
图6为本申请一实施例提供的报文处理的方法流程图。
图7为本申请另一实施例报文处理的方法示意图。
图8为本申请一实施例报文处理的方法示意图。
图9为本申请一实施例提供的报文处理的方法流程图。
图10为本申请一实施例提供的报文处理的方法流程图。
图11为本申请一实施例提供的报文处理的方法流程图。
图12为本申请一实施例偏移值ΔT在报文中被携带的示意图。
图13为本申请一实施例提供的通信设备的结构示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
需要说明的是，虽然在装置示意图中进行了功能模块划分，在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于装置中的模块划分，或流程图中的顺序执行所示出或描述的步骤。说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例的描述中，除非另有明确的限定，设置、安装、连接等词语应做广义理解，所属技术领域技术人员可以结合技术方案的具体内容合理确定上述词语在本申请实施例中的具体含义。
本申请实施例中，“进一步地”、“示例性地”或者“可选地”等词用于表示作为例子、例证或说明，不应被解释为比其它实施例或设计方案更优选或更具有优势。使用“进一步地”、“示例性地”或者“可选地”等词旨在以具体方式呈现相关概念。
本申请实施例涉及通信网络中信息传输/传递技术。时延和抖动是信息传递的重要性能指标。不同的应用场景，对信息的传递质量诸如对传递时延和抖动有不同的要求。信息的传递有多种方式，不同的方式时延和抖动也可能不同。
图1是相关技术中以太网设备采用存储转发模式处理报文的流程示意图。如图1所示，报文1000在每个节点，诸如在第一设备100、第二设备200、第三设备300以及第四设备400内分别进行查表、解析、限速、入队、缓存、调度等多个功能模块。需要说明的是，报文经过每个节点可以被处理或不处理，本申请实施例所记载的报文，在不同节点的具体携带的信息或内容可以相同或不相同。
在一些实施例中，第一设备100可以是源节点，第二设备200、第三设备300可以是中间节点，第四设备400可以是宿节点。设备中所有物理端口的报文共享这些功能模块，因此每个物理端口的报文获得这些功能模块的服务时间是不确定，完成处理时间的不一致，导致报文在每台设备内部的延迟时间不确定。随着以太网技术在工业生产线、车辆内大量使用，对报文的传递质量提出更高的要求，图1所示的报文传输方式的传递时延和抖动难以达到相关要求的参数指标。
在一些网络系统中，例如工业园区中自动化生产线网络、车辆中的车载通讯网络，以太网技术正在取代专有现场总线技术，因为以太网支持更高的数据速率、更低的成本，更容易与现有以太网设备系统集成。然而，相关技术中以太网技术基于尽力而为的思想转发报文，难以满足特定应用场景中报文传输端到端的延迟、抖动和零丢包等特性要求。为了改善以太网转报文传输的延迟和抖动，时间敏感网络(Time-Sensitive Network，TSN)任务组制定了一套以太网业务的传输处理标准体系，可以实现业务或报文的确定性传递，但TSN只适用于物理空间范围小的工业厂房、车载系统等场景的局域网路中。国际互联网工程任务组组织(The Internet Engineering Task Force,IETF)发布的确定网(Deterministic Networking，DetNet)确定性网络工作组通过指定周期的循环队列转发(Cycle Specified Queuing and Forwarding，CSQF) 技术，将TSN技术中循环队列转发机制(Cyclic Queuing and Forwarding，CQF)原理扩展到广域确定性网络中，实现长距离物理场景下确定性业务或报文的传输需求。
为详尽阐述本技术方案，以下对相关技术TSN、CQF、CSQF技术进一步说明。示例性地，下文以客户业务诸如报文在各节设备的传输为例，对本申请实施例信息传输的相关技术进行阐述。TSN技术应用于局域网中，配置全局调度时间表，通过固定时间片进行调度转发客户报文，实现确定性延迟抖动需求。局域网中的所有网络设备位于小物理范围内，设备之间报文的链路传播延迟可忽略不计，时间敏感网络要求网络上的所有设备之间的时间同步，上下游设备同步工作，报文从上游设备发出时，下游设备在同一时刻接收报文，上下游设备之间在同一个时刻发送、接收客户报文。在TSN技术中采用CQF实现报文的确定性时延转发。
图2是TSN技术中采用CQF传输报文的流程示意图。如图2所示，在每台设备的输出端口设置两个排队队列诸如队列1、队列2，组成周期流队列。在每个队列的入队位置和出队位置各设有一个控制门入队门控2000和出队门控3000，控制门具有“打开”(图中标记为open)或“关闭”(图中标记为close)两种状态。
当门控打开时，允许报文输入或输出；当门控关闭时，禁止报文输入或输出。同一个队列的入队控制门和出队控制门的门控状态保持不同，即队列的入队控制门为打开状态时，则该队列的出队控制门为关闭状态；队列的入队控制门为关闭状态时，则该队列的出队控制门为打开状态。端口设置两个队列，在任何时刻一个队列用于接收报文，另外一个队列用于发送报文，因此两个队列中同一类型端口(如队列的输出端口)的控制门也是不同的，如处于互斥状态，即一个队列某个端口(如输出端口)的控制门为打开状态时，另外一个队列同类端口的控制门则为处于关闭状态。同一时间中，同位置端口中只有一个队列的控制门处于打开状态，可以输出报文信息，另外一个队列的控制门则处于关闭状态，不允许输出信息。
CQF机制将传输时间分为一系列相等的时间间隔(或称为时间片)。每个时间间隔称为一个时间周期T，所有时间周期T分成偶数周期和奇数周期，用T0和T1标识区分。网络系统提前规划每个控制门在每个时间周期中处于何种状态，如打开状态或关闭状态。在一个周期内，控制门的状态保持不变。当时间周期结束后，原处于打开状态的控制门则切换为关闭状态，该队列停止输出报文信息，另一个队列的控制门则切换为打开状态，改由该一个队列(即另一个队列)开始输出报文信息。通过两个队列之间交替执行入队操作和出队操作，CQF可以确保在一个周期内从上游节点设备发送的数据报文，并在同一个时间周期内发送到下游节点。下游节点设备在同一个时间周期内接收，然后在同一个时间周期内转发出去。本申请实施例记载的发送周期，即为报文发送时所位于的时间周期。
当网络上所有设备都采用CQF队列，所有设备之间时间同步，所有设备中的所有控制门都提前规划好控制门的工作状态，在同一时刻切换控制门的工作状态，则可以实现报文从网络上第一台设备如源节点/设备开始转发，相同周期内转发的所有报文，在每一台设备如中间节点/设备中都在固定的时间周期T内转发传输。每台设备上都延迟一个时间周期T转发传输，一直到最后一台设备如宿节点/设备上转发传输。
报文在网络上端到端延迟仅取决于周期大小T和网络上报文经过的设备数量H。由于同 一个周期内所有报文在转发过程中始终在同一个周期中进行转发，因此源设备中同周期内的报文在宿设备中同一周期输出。报文可以在同一时间周期T的任何位置波动，最前位置是位于一个周期T中的起始位置，最后位置是位于一个周期T中的结束位置。当报文在源设备上位于时间周期的起始位置转发，但在宿设备中在时间周期T的结束位置才转发输出时，报文在网络中总转发延迟时间最大，最大延迟时间为(H+1)*T；当报文在源设备位于时间周期的结束位置转发，在宿设备中在时间周期T的起始位置转发输出时，报文在网络上总转发延迟时间最小，最小延迟时间为(H-1)*T。因此，报文在整个网络中从源设备到宿设备之间端到端的转发总延迟波动在{(H-1)*T，(H+1)*T}范围内。通过在局域网中采用CQF技术能提供确定性的时延转发，进而实现报文在网络中转发传输时有界时延、抖动。
但是，采用CQF方法需要网络上所有设备时间同步，所有设备在同一时刻切换控制门的工作状态，并且设备之间的传递延迟可视为零。因此，CQF方法只能适用于物理范围较小的局域网场景。
当设备之间相距比较远，链路时延较大，或报文在链路上的时延时间接近周期时间时，即便所有设备在同一时刻切换控制门，也难以确保报文从上游设备发出后，能够在同一个周期内被下游设备接收。因此，即便在TSN技术中采用CQF机制传输报文，仍难以满足较长距离、跨地域报文的确定性传输。
由于TSN技术无法适应物理范围大的网络系统，IETF DetNet确定性网络工作组提出了CSQF机制。通过CSQF技术，能够进一步减小设备之间时间同步和设备之间链路传递延迟时间所带来的影响。从而实现TSN的转发机制在广域确定性网络中的应用。
CSQF转发机制无需网络上所有设备时间同步，仅需设备之间时钟频率。即设备之间在接收报文时恢复出报文时钟信号，跟踪对方设备的时钟频率。CSQF机制需全网时钟频率同步、出端口多队列循环排队转发、相邻节点出端口周期标签映射等功能。
在CSQF技术中，要求所有报文在源节点设备发送时携带时间周期标签值。在一个时间周期内的报文携带相同的时间周期标签值，表示报文在同一个时间周期内统一接收、一起转发。源节点设备在发送报文内打上时间周期标签，时间周期标签值可以在报文中任何位置。
图3是时间周期标签值4000在报文中被携带的示意图。如图3所述，该报文在三层扩展域携带时间周期标签值。在中间节点设备上对时间周期标签值相同的报文在同一个周期T内进行接收和转发。中间节点设备可以对时间周期标签值进行修改，但修改前相同时间周期标签值的所有报文，在修改后前述报文的时间周期标签值仍需保持一致。本申请实施例记载的发送时间周期标签值，用于标识报文所位于的发送周期，即表征报文在哪一个时间周期内被转发。
图4是CSQF传输报文的流程示意图。如图4所示，网络中所有设备之间不要求时间同步，仅需要时钟频率同步。每台设备中按照固定大小的周期时间，切换队列的工作状态。所有设备的周期大小相同。虽然各个设备的时间周期独立工作，各个设备时间周期切换的时刻不一致(所有设备周期的起始时刻、结束时刻不相同)，但是在时钟频率相同的情况，每台设备中时间周期的切换频率相同，单位时间内切换时间周期的次数相同，切换频度相同。
在每台设备中设有多个缓存队列，根据报文携带的时间标签值决定报文进入哪个队列中 缓存。时间周期值相同的报文进入同一个队列。所有队列在每个周期中处于不同状态，所有队列轮流更换工作状态。在任何一个时间周期内，只有一个队列处于发送状态，发送状态的队列只发送报文不接收报文。其他队列处于接收状态，接收队列只接收报文不发送报文。所有队列根据周期时间进行循环切换工作状态。任何时间周期内，其中一个为发送状态，其余队列则为接受状态。
在报文传输前，所有节点设备之间确定各自队列的周期映射关系，报文在源节点设备中转发时会携带在每台设备中转发时间周期标签值，标签标记着报文在指定设备中指定的接收队列。经过一台设备转发报文后则剥离掉已经使用过的时间标签值。
如图4所示，在设备1中的第一报文1100携带标签1、标签2以及标签3，第一报文1100经过设备1到设备2后，则剥离标签1得到第二报文1200，以此类推，得到第三报文1300。每台设备中接收报文时，提取报文上携带的时间周期标签值，设备根据周期标签值将数据包放入指定的接收队列中，等待接收队列转换为发送队列时被转发输出到下一跳设备。报文上提前携带在每一跳设备中指定的接收队列，这样报文在规定的队列中进行接收，在规定的时间周期被转发(当接收队列转为发送队列时被转发)，报文在每台设备内是在固定周期内转发，进而实现客户报文端到端转发时的固定时延。
CSQF机制在工作时，网络系统根据业务传递的服务质量需求，提前规划报文的传递路径、时延、带宽、队列资源，确定周期参数，生成每个节点设备的转发周期标签并分发给节点设备。业务在源设备发送时携带报文在每台节点上的转发周期标签值，每个节点设备根据转发周期标签决定报文进入那个队列进行转发。在网络上所有节点设备时钟频率同步，所有节点的时间周期变换相同，队列状态的切换速度相同，所有队列的接收状态、发送状态按照固定频率变化，报文在上游节点设备的固定队列发送，进入下游节点对应的固定队列中，在对应队列转为发送状态后发送输出。
无论上下游设备之间光纤延迟时间有多大，只需要提前规划好上游设备发送报文的转发周期和下游设备的转发周期关系，上游设备转发的客户报文在下游设备中能进入完整的接收队列，在指定的接收队列转为发送状态之前，能接收完上游设备转发周期内的所有报文即可。下游设备有许多接收队列，适应上下游设备之间各种延迟大小需求，只需要选择合适的接收队列接收上游设备的转发报文，然后等队列转为发送状态后进行转发输出。报文在每个上游设备中，在固定发送周期内转发，到下游设备中又按照新的固定转发发送周期内转发传输。因此，报文从第一台源设备开始到最后一台宿设备之间的总转发延迟时间是固定的，从而实现报文从网络源节点设备到宿节点设备的端到端确定性时延转发。
如图4所示，网络源节点设备1在发送报文1100时，将报文1100在每台设备上转发的时间周期标签值都携带上如标签1、标签2、标签3。每台设备接收到报文时，剥离掉已经使用过的时间周期标签值，如设备2接收到报文时剥离掉已经使用过的标签1，得到报文1200，并根据本台设备的时间周期标签值进行转发报文1200。
通过上述方式，虽然能够实现报文端到端确定性时延转发。但由于报文在设备1上时携带了所有设备转发的时间周期标签值，容易导致报文有效承载效率交低。
由于设备1上报文携带的所有发送时间周期标签值格式一致，且内容已经确定，这些时 间周期标签值之间具备一一对应关系。若时间周期标签值1和时间周期标签值2之间的对应关系下达到设备2，将时间周期标签值2和时间周期标签值3之间的对应关系下达到设备3，以此类推。这样设备在发送报文时只需要携带本台设备的时间周期标签值1。当报文发送设备2时，设备2根据报文携带的时间周期标签值1，以及时间周期标签值1和时间周期标签值2之间的对应关系，可以获得时间周期标签值2，将报文中携带的时间周期标签值1修改为时间周期标签值2即可，这样就获得报文在设备2上的时间周期标签值2。通过上述方式，仅需携带一个发送时间周期标签值，即可得到各下游节点对应的发送时间周期标签值。
图5是设备间的报文的时间周期标签值对应关系示意图。如图5所示，设备1报文的时间周期标签值为T0和设备2的时间周期标签值为T5是一一对应的；设备1报文的时间周期标签值为T1和设备2的时间周期标签值为T6是一一对应的，依次类推。这样设备1上第四报文1400在设备1上按照T0周期进行转发，携带的时间周期标签值为T0。当第四报文1400发送到设备2时，设备2按照对应关系，将报文中携带的时间周期标签值T0修改为T5，在设备2中在T5周期中发送出去。类似，设备2报文的时间周期标签值为T5和设备2的时间周期标签值为T2是一一对应的；设备2报文的时间周期标签值为T6和设备3的时间周期标签值为T3是一一对应的，依次类推。这样设备2上第四报文1400按照T5周期发送到设备3时，设备3按照对应关系，将报文中携带的时间周期标签值T5修改为T2，在设备3中在T2周期中发送出去。第五报文1500转发流程也是类似的。无论报文采用哪种携带时间周期标签值的方式，所有携带相同时间周期标签的报文在同一个时间周期内进行转发，从而实现报文的确定性转发。
无论是TSN技术，还是CSQF技术，报文的只能在一个时间周期内波动，转发时延波动范围不大于时间周期T。当需要减少报文的时延抖动(波动)时，只能减少网络上所有设备的转发周期T的大小。当转发周期T变小时，意味着一个转发周期的时间变短，当设备物理端口发送带宽小、且报文长度超长时，一个转发周期内能够转发的报文数量就很小。在报文是超长报文、转发周期又很短的场景下，会导致一个周期内只能承载一个长报文，难以承载更多的超长报文，网络的承载效率较差，因此难以将转发周期T设定的很小。在许多场景下，网路上因为部分设备转发能力问题，最小转发周期T通常是有下限的，在一些情况，其下限仍无法满足部分报文的需求。
例如在图1中，假设设备1、设备2、设备4的最小转发周期可以达到20us，但设备3的最小转发周期只能是100us，这样报文从设备1转发到设备4时，网路上端到端承载的最小转发周期只能是100us。如果报文要求转发抖动很小，转发周期不能大于20us，网络上承载能力无法满足要求。
为了进一步减少报文的端到端传输时延抖动。本申请实施例提供了一种报文处理方法、传递方法、通信设备、通信系统、存储介质及程序产品，通过在信息传递过程中，诸如在报文中携带周期标签、时间偏差值，中间节点/设备依据对应的发送周期进行转发，宿节点/设备依据时间偏差值转发，实现更小范围内的延迟、抖动或零抖动、延迟，从而减少报文转发时的时延、抖动，实现业务的确定性传递。
下面结合附图，对本申请一实施例作进一步阐述。
图6是本申请一实施例提供的报文处理的方法流程图。如图6所示，该报文处理的方法可以但不限于应用于源节点/设备中。在图6的实施例中，该报文处理的方法可以包括但不限于步骤S100、S200。
步骤S100：对报文配置周期标签、时间偏差值ΔT。其中，周期标签用于标识报文在各下游节点中对应的发送周期。时间偏差值ΔT用于标识报文在源节点的发送周期起始时刻与发送时刻的偏移值。
在一实施例中，周期标签包括各下游节点对应的发送时间周期标签值Tn。发送时间周期标签值Tn标识报文在对应节点中对应的发送周期。各节点/设备根据Tn，确定报文发送时刻所位于的周期。
在另一实施例中，周期标签包括源节点对应的发送时间周期标签值T1。当各下游节点预先配置周期对应信息Xn时。通过对应的发送时间周期标签值Tn和当前节点预先配置的周期对应信息Xn，得到用于标识报文在当前节点中对应的发送时间周期标签值。以图7为例，对本实施例的技术方案做示例性的说明。
图7是本申请另一实施例提供的报文处理的方法示意图。如图7所示，设备2、设备3，预先配置周期对应信息，分别为X2，X3。设备1(源节点)接收到报文1000。报文1000携带的周期标签包括发送时间周期标签值T1。设备1根据周期标签值T1，在对应的发送周期内发送报文至设备2(中间节点)。设备2接收到携带周期标签值T1的报文1000。设备2根据周期标签值T1和预配置的周期对应信息X2，得到当前节点对应的周期标签T2。设备2根据周期标签值T2，在对应的发送周期内发送报文至设备3(宿节点)。设备3接收到携带周期标签值T2的报文1000。设备3根据周期标签值T2和与配置的周期对应信息X3，得到当前节点对应的周期标签T3。设备3根据周期标签值T3，在对应的发送周期内发送报文。
步骤S200：向下游节点发送配置后的报文。
在一实施例中，该报文处理的方法还可以包括步骤S111、S120。
步骤S111：根据各下游节点对应的发送时间周期标签值Tn，得到报文在各下游节点中对应的发送周期。
以图7为例，示例性地说明，根据源节点对应的发送时间周期标签值T1，可以得到报文在源节点中对应的发送周期。根据中间节点对应的发送周期T2，可以得到报文在中间节点对应的发送周期。根据宿节点对应的发送周期T3，可以得到报文在宿节点对应的发送周期。
步骤S120：根据时间偏差值ΔT，得到报文在宿节点的发送周期内的发送时刻。
示例性地，宿节点能够根据时间偏差值ΔT，得到报文在宿节点对应的发送周期内的发送时刻。即报文在宿节点对应的发送周期起始时刻与报文在宿节点发送时刻的偏差值，等于时间偏差值ΔT。通过该示例性的方式，能够实现报文在网络中零时延抖动的传输。
在另一实施例中，该报文处理的方法还可以包括步骤S112、S120。
步骤S112：根据各下游节点发送时间周期标签值Tn和各下游节点的周期对应信息X，得到报文在各下游节点中对应的发送周期。
以图7为例，示例性地说明，中间节点可以根据来自源节点发送的报文中携带的发送时间周期标签值T1，以及中间节点周期对应信息X2，得到当前中间节点对应的发送时间周期 标签T2。宿节点可以根据来自中间节点发送的报文中携带的周期标签值T2，以及宿节点周期对应信息X3，得到宿节点对应的发送时间周期标签T3。步骤S120：根据时间偏差值ΔT，得到报文在宿节点的发送周期内的发送时刻。
示例性地，宿节点能够根据时间偏差值ΔT，得到报文在宿节点对应的发送周期内的发送时刻。即报文在宿节点对应的发送周期起始时刻与报文在宿节点发送时刻的偏差值，等于时间偏差值ΔT。通过该示例性的方式，能够实现报文在网络中零时延抖动的传输。
图8是本申请一实施例报文处理的方法示意图。如图8所示，第六报文1600配置周期标签。
在一实施方式中，周期标签至少用于标识第六报文1600分别在第一设备100下游的第二设备200、第三设备300以及第四设备400中，对应的发送周期。示例性地，周期标签包括发送时间周期标签值T3、T0、T1。发送时间周期标签值T3标识第六报文1600在第二设备200中的T3周期发送，即T3为对应的发送周期；发送时间周期标签值T0标识第六报文1600在第三设备300中的T0周期发送，即T0为对应的发送周期；发送时间周期标签值T1标识第六报文1600在第四设备400中的T1周期发送，即T1为对应的发送周期。
在另一示例性的实施方式中，第一设备100下游的第二设备200、第三设备300以及第四设备400，分别预先配置周期对应信息X2、X3、X4。周期标签用于标识第六报文1600在第一设备100中，对应的发送周期。示例性地，周期标签包括发送时间周期标签值T0。第二设备200根据发送时间周期标签值T0和第二设备200的周期对应信息X2，得到第二设备200对应的发送时间周期标签值T3。第三设备300根据发送时间周期标签值T3和第三设备300的周期对应信息X3，得到第三设备300对应的发送时间周期标签值T0。第四设备400根据发送时间周期标签值T0和第四设备400的周期对应信息X4，得到第四设备400对应的发送时间周期标签值T1。
通过上述不同的方式，均能够获得报文1600在宿节点中对应的发送周期T1。当确定第六报文1600在宿节点确定的发送周期T1，进一步地可以根据时间偏差值ΔT确定报文1600在宿节点确定的发送时刻。
在一实施方式中，时间偏差值ΔT，确定出第六报文1600在发送周期T1内的发送时刻。例如，与T1周期起始时刻相距ΔT的时刻，即为第六报文1600在发送周期T1内的发送时刻。本实施方式，通过在报文中携带发送/转发周期中距离转发周期起始时刻的偏差值，且中间节点设备按转发周期进行转发，满足粗范围延迟抖动指标要求，同时在宿节点设备根据偏差值进行转发，实现更细小范围内的延迟抖动或零延迟抖动，从而减少报文转发时延抖动，实现业务确定性发送。
图9是本申请一实施例提供的报文处理的方法流程图。如图9所示，该报文处理的方法可以但不限于应用于中间节点/设备中。在图9的实施例中，该报文处理的方法可以包括但不限于步骤S300、S400。
步骤S300：接收报文。
报文携带周期标签、时间偏差值ΔT。其中，周期标签用于标识报文在各下游节点对应的发送周期。时间偏差值ΔT用于标识报文在源节点的发送周期起始时刻与发送时刻的偏移值。
在一实施方式中，周期标签包括各下游节点对应的发送时间周期标签值Tn。发送时间周期标签值Tn标识报文在对应节点中对应的发送周期。各节点/设备根据Tn，确定报文发送时刻所位于的周期。
周期标签可以包括当前节点对应的各下游节点对应的发送时间周期标签值，也可以包括当前节点对应的发送周期标签值。若当前节点是源节点，则周期标签也包括源节点对应的发送周期标签值；若当前节点是中间节点，则周期标签包括当前中间节点对应的发送周期标签值；若当前节点是宿节点，则周期标签包括宿节点对应的发送周期标签值。
步骤S400：根据周期标签，发送报文。
在一实施例中，步骤S400可以包括步骤S410、S420。
步骤S410：根据各下游节点分别对应的发送时间周期标签值，得到报文在各下游节点中对应的发送周期。
步骤S420：中间节点在对应的发送周期发送报文。
在另一实施例中，该报文处理的方法还可以包括步骤S430、S420。
步骤S430：根据中间节点对应的发送时间周期标签值、各下游节点对应的周期对应信息，得到报文在各下游对应的发送周期。其中，各下游节点对应的周期信息，为预先配置设置。若当前节点是源节点的下一跳节点，则根据源节点对应的发送时间周期标签值、当前节点对应的周期对应信息，得到当前节点对应的发送周期。
步骤S420：中间节点在对应的发送周期发送报文。
以图8为例，进行示例性地说明。第二设备200(中间节点)对应发送时间周期标签值T2。第二设备200的各下游节点，即第三设备300，第四设备400预先配置周期对应信息X3、X4。报文1600携带发送时间周期标签值T3，从第二设备200发送至第三设备300。第三设备300根据发送时间周期标签值T3和周期对应信息X3，得到当前节点发送时间周期标签值T0。第三设备300根据发送时间周期标签值T0在对应的发送周期，即T0内转发报文。第四设备400接收到携带发送时间周期标签值T0的报文1600，并根据发送时间周期标签值T0和预配置在第四设备400的周期对应信息X4，得到当前发送时间周期标签值T1。第四设备400根据发送时间周期标签值T1在对应的发送周期内转发报文。
图10是本申请一实施例提供的报文处理的方法流程图。如图10所示，该报文处理的方法可以但不限于应用于宿节点/设备中。在图10的实施例中，该报文处理的方法可以包括但不限于步骤S500、S600。
步骤S500：接收报文。其中，报文携带发送时间周期标签值T、时间偏差值ΔT。发送时间周期标签值用于标识报文在宿节节点对应的发送周期。时间偏差值ΔT用于标识报文在源节点的发送周期起始时刻与发送时刻的偏移值。
步骤S600：根据发送时间周期标签值T和时间偏差值ΔT，发送报文。
在一实施例中，步骤S600还可以包括步骤S611、S620。
步骤S611：根据发送时间周期标签值T，得到报文在宿节点中对应的发送周期。
步骤S620：根据时间偏差值ΔT，得到报文在宿节点的发送周期内的发送时刻。
在另一实施例中，该报文处理的方法还可以包括步骤S610、S620。
步骤S610：根据发送时间周期标签值T和宿节点的周期对应信息X，得到报文在宿节点中对应的发送周期。
步骤S620：根据时间偏差值ΔT，得到报文在宿节点的发送周期内的发送时刻。
宿节点可以根据时间偏差值ΔT，得到报文在宿节点对应的发送周期内的发送时刻。即报文在宿节点对应的发送周期起始时刻与报文在宿节点发送时刻的偏差值，等于时间偏差值ΔT。通过该示例性的方式，能够实现报文在网络中零时延抖动的传输。
在另一实施例中，步骤S600还可以包括步骤S630、S640。
步骤S630：根据发送时间周期标签值Tn和宿节点的周期对应信息X，得到报文在宿节点中对应的发送周期。
步骤S640：根据时间偏差值ΔT，得到报文在宿节点的发送子内的发送时刻。
图11是本申请一实施例提供的报文处理的方法流程图。如图11所示，该报文传输的方法。在图11的实施例中，该报文处理的方法可以包括但不限于步骤S710、S720、S730、S740、S750、S760、S770、S780。
步骤S710：源节点对报文配置周期标签、时间偏差值。
步骤S720：源节点发送报文。
步骤S730：中间节点接收报文。
步骤S740：中间节点根据周期标签，得到报文在中间节点对应的发送周期。
步骤S750：中间节点在对应的发送周期内发送报文。
步骤S760：宿节点接收报文。
步骤S770：宿节点根据周期标签、时间偏差值，得到报文在宿节点对应的发送时刻。
步骤S780：宿节点在发送时刻发送报文。
本申请实施例提供的报文处理方法、报文传递方法，进一步减少报文的端到端传输时延抖动。在一些实施例中，通过源设备在发送报文时，在每个报文中携带报文距离本发送周期起始时刻的位置偏差值ΔT，如图8所示，第六报文1600携带本报文距离本发送周期T0起始时刻的偏移值ΔT。
图12是本申请一实施例偏移值ΔT在报文中被携带的示意图。如图12所示，偏移值ΔT在报文中携带，可以和报文发送时间周期标签值放在一起承载。网路上，中间设备进行转发时，中间设备只按照发送时间周期标签值进行转发，忽略报文携带的偏移值ΔT。当报文到达目的点的宿端设备上，宿设备在按照发送时间周期标签值进行发送时，在确定发送周期的起始时刻后，根据报文携带的报文位置偏差值ΔT，确定本次发送周期的起始时刻，并在发送周期的起始时刻之后的偏差值ΔT对应的时刻位置上发送本报文。通过上述方式，消除了报文在一个转发周期内波动的现象，报文的延迟抖动可以为0，从而实现抖动更小的信息确定性传递，本申请实施例提供CSQF技术为示列，但不限于CSQF，其同样适用于TSN技术。
在宿端设备中按照发送时间周期标签值Tn转发客户报文，在本发送周期起始时刻之后偏差值ΔT对应的时刻位置上才转发客户报文，可以实现零时延抖动的端到端转发。
图13是本申请一实施例提供的通信设备的结构示意图。如图13所示，该通信设备2000包括存储器2100、处理器2200。存储器2100、处理器2200的数量可以是一个或多个，图13 中以一个存储器2101和一个处理器2201为例；网络设备中的存储器2101和处理器2201可以通过总线或其他方式连接，图13中以通过总线连接为例。
存储器2101作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块，如本申请任一实施例提供的方法对应的程序指令/模块。处理器2201通过运行存储在存储器2101中的软件程序、指令以及模块实现上述方法。
存储器2101可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序。此外，存储器2101可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件或其他非易失性固态存储器件。在一些实例中，存储器2101进一步包括相对于处理器2201远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
本申请一实施例还提供了一种计算机可读存储介质，存储有计算机可执行指令，该计算机可执行指令用于执行如本申请任一实施例提供的报文处理的方法或报文传递的方法。
本申请一实施例还提供了一种计算机程序产品，包括计算机程序或计算机指令，该计算机程序或计算机指令存储在计算机可读存储介质中，计算机设备的处理器从计算机可读存储介质读取计算机程序或计算机指令，处理器执行计算机程序或计算机指令，使得计算机设备执行如本申请任一实施例提供的报文处理的方法或报文传递的方法。
本申请实施例描述的系统架构以及应用场景是为了更加清楚的说明本申请实施例的技术方案，并不构成对于本申请实施例提供的技术方案的限定，本领域技术人员可知，随着系统架构的演变和新应用场景的出现，本申请实施例提供的技术方案对于类似的技术问题，同样适用。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统、设备中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。
在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
在本说明书中使用的术语“部件”、“模块”、“系统”等用于表示计算机相关的实体、 硬件、固件、硬件和软件的组合、软件、或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、执行线程、程序或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程或执行线程中，部件可位于一个计算机上或分布在2个或更多个计算机之间。此外，这些部件可从在上面存储有各种数据结构的各种计算机可读介质执行。部件可例如根据具有一个或多个数据分组(例如来自于自与本地系统、分布式系统或网络间的另一部件交互的二个部件的数据，例如通过信号与其它系统交互的互联网)的信号通过本地或远程进程来通信。
以上参照附图说明了本申请的一些实施例，并非因此局限本发明的权利范围。本领域技术人员不脱离本发明的范围和实质内所作的任何修改、等同替换和改进，均应在本申请的权利范围之内。

Claims (19)

  1. 一种报文处理的方法，应用于源节点，所述方法包括：
    对所述报文配置周期标签、时间偏差值，其中，所述周期标签用于标识所述报文在各下游节点对应的发送周期，所述时间偏差值用于标识所述报文在源节点的发送周期的起始时刻与发送时刻的偏移值；
    向下游节点发送配置后的报文。
  2. 根据权利要求1所述的方法，其中，所述周期标签包括以下任意之一：
    所述各下游节点对应的发送时间周期标签值；或
    所述源节点对应的发送时间周期标签值。
  3. 根据权利要求2所述的方法，还包括：
    根据所述发送时间周期标签值，得到所述报文在各下游节点中对应的发送周期；
    根据所述时间偏差值，得到所述报文在宿节点的所述发送周期内的发送时刻。
  4. 根据权利要求2所述的方法，其中，
    所述各下游节点分别预配置周期对应信息；
    所述方法还包括：
    根据所述发送时间周期标签值和所述各下游节点的周期对应信息，得到所述报文在各下游节点中对应的发送周期；
    根据所述时间偏差值，得到所述报文在宿节点的所述发送周期内的发送时刻。
  5. 一种报文处理的方法，应用于中间节点，所述方法包括：
    接收报文，其中，所述报文携带周期标签、时间偏差值；所述周期标签用于标识所述报文在各下游节点对应的发送周期，所述时间偏差值用于标识所述报文在源节点的发送周期起始时刻与发送时刻的偏移值；
    根据所述周期标签，发送报文。
  6. 根据权利要求5所述的方法，其中，所述周期标签包括以下任意之一：
    所述各下游节点分别对应的发送时间周期标签值；或
    所述中间节点对应的发送时间周期标签值。
  7. 根据权利要求6所述的方法，其中，所述根据所述周期标签，发送报文，包括：
    根据所述各下游节点分别对应的发送时间周期标签值，得到所述报文在各下游节点中对应的发送周期；
    在所述发送周期发送报文。
  8. 根据权利要求6所述的方法，其中，
    所述各下游节点分别预配置周期对应信息；
    所述根据所述周期标签，发送报文，包括：
    根据所述中间节点对应的发送时间周期标签值和所述各下游节点的周期对应信息，得到所述报文在各下游节点中对应的发送周期；
    在所述发送周期发送报文。
  9. 一种报文处理的方法，应用于宿节点，所述方法包括：
    接收所述报文，其中，所述报文携带发送时间周期标签值、时间偏差值；所述发送时间周期标签值用于标识所述报文在宿节点对应的发送周期，所述时间偏差值用于标识所述报文在源节点的发送周期起始时刻与发送时刻的偏移值；
    根据所述发送时间周期标签值和所述时间偏差值，发送报文。
  10. 根据权利要求9所述的方法，其中，所述根据所述发送时间周期标签值和所述时间偏差值，发送报文，包括：
    根据所述发送时间周期标签值，得到所述报文在所述宿节点对应的发送周期；
    根据所述时间偏差值，得到所述报文在所述宿节点的所述发送周期内的发送时刻；
    在所述发送时刻发送报文。
  11. 根据权利要求9所述的方法，其中，
    所述宿节点预配置周期对应信息；
    所述根据所述发送时间周期标签值和所述时间偏差值，发送报文，包括：
    根据所述发送时间周期标签值和所述宿节点预配置周期对应信息，得到所述报文在所述宿节点对应的发送周期；
    根据所述时间偏差值，得到所述报文在所述宿节点的所述发送周期内的发送时刻；
    在所述发送时刻发送报文。
  12. 一种报文传递的方法，包括：
    源节点对报文配置周期标签、时间偏差值，其中，所述周期标签用于标识所述报文在各下游节点对应的发送周期，所述时间偏差值用于标识所述报文在源节点的发送周期的起始时刻与发送时刻的偏移值；
    所述源节点发送报文；
    中间节点接收报文；
    所述中间节点根据所述周期标签，得到所述报文在所述中间节点对应的发送周期；
    所中间节点在所述对应的发送周期内发送报文；
    宿节点接收报文；
    所述宿节点根据所述周期标签、时间偏差值，得到所述报文在所述宿节点对应的发送时刻；
    所述宿节点在所述发送时刻发送报文。
  13. 根据权利要求12项所述的方法，其中，所述周期标签包括以下任意之一：
    所述中间节点和所述宿节点分别对应的发送时间周期标签值；或
    所述源节点对应的发送时间周期标签值。
  14. 根据权利要求13所述的方法，其中，所述中间节点根据所述周期标签，得到所述报文在所述中间节点对应的发送周期，包括：
    所述中间节点根据所述中间节点对应的发送时间周期标签值，得到所述报文在所述中间节点对应的发送周期；
    所述宿节点根据所述周期标签、时间偏差值，得到所述报文在所述宿节点对应的发送时刻，包括：
    所述宿节点根据所述宿节点对应的发送时间周期标签值，得到所述报文在所述宿节点对应的发送周期；
    所述宿节点根据所述时间偏差值，得到所述报文在所述宿节点对应的发送时刻。
  15. 根据权利要求13所述的方法，其中，
    所述中间节点和所述宿节点预配置周期对应信息；
    所述中间节点根据所述周期标签，得到所述报文在所述中间节点对应的发送周期，包括：
    所述中间节点根据所述源节点对应的发送时间周期标签值和所述中间节点对应的周期对应信息，得到所述报文在所述中间节点对应的发送周期；
    所述宿节点根据所述周期标签、时间偏差值，得到所述报文在所述宿节点对应的发送时刻，包括：
    所述宿节点根据所述中间点对应的发送时间周期标签值和所述宿节点对应的周期对应信息，得到所述报文在所述宿节点对应的发送周期；
    所述宿节点根据所述时间偏差值，得到所述报文在宿节点的发送时刻，其中所述发送时刻位于所述宿节点对应的发送周期内。
  16. 一种通信设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如权利要求1至11中任意一项所述报文处理的方法。
  17. 一种通信系统，包括：
    至少一个处理器；
    至少一个存储器，用于存储至少一个程序；
    当至少一个所述程序被至少一个所述处理器执行时实现如权利要求12至15任意一项所述报文传递的方法。
  18. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行如权利要求1至11中任意一项所述报文处理的方法，或如权利要求12至15中任意一项所述报文传递的方法。
  19. 一种计算机程序产品，包括计算机程序或计算机指令，所述计算机程序或所述计算机指令存储在计算机可读存储介质中，计算机设备的处理器从所述计算机可读存储介质读取所述计算机程序或所述计算机指令，所述处理器执行所述计算机程序或所述计算机指令，使得所述计算机设备执行如权利要求1至11中任意一项所述报文处理的方法，或如权利要求12至15中任意一项所述报文传递的方法。
PCT/CN2023/117509 2022-09-16 2023-09-07 报文处理方法、传递方法、通信设备、系统、介质及产品 WO2024055897A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211131941.XA CN117768386A (zh) 2022-09-16 2022-09-16 报文处理方法、传递方法、通信设备、系统、介质及产品
CN202211131941.X 2022-09-16

Publications (1)

Publication Number Publication Date
WO2024055897A1 true WO2024055897A1 (zh) 2024-03-21

Family

ID=90274243

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/117509 WO2024055897A1 (zh) 2022-09-16 2023-09-07 报文处理方法、传递方法、通信设备、系统、介质及产品

Country Status (2)

Country Link
CN (1) CN117768386A (zh)
WO (1) WO2024055897A1 (zh)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112311494A (zh) * 2019-07-23 2021-02-02 华为技术有限公司 一种报文传输方法、装置及系统
CN112825510A (zh) * 2019-11-21 2021-05-21 华为技术有限公司 一种更新映射关系的方法以及装置
CN114143378A (zh) * 2021-11-24 2022-03-04 新华三技术有限公司 一种网络优化方法、装置、网关设备及存储介质
CN114679418A (zh) * 2020-12-24 2022-06-28 中兴通讯股份有限公司 数据传输方法、电子设备和存储介质
CN114827014A (zh) * 2018-05-28 2022-07-29 华为技术有限公司 一种报文处理方法和装置
WO2022170944A1 (zh) * 2021-02-10 2022-08-18 华为技术有限公司 报文转发方法、装置及系统

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114827014A (zh) * 2018-05-28 2022-07-29 华为技术有限公司 一种报文处理方法和装置
CN112311494A (zh) * 2019-07-23 2021-02-02 华为技术有限公司 一种报文传输方法、装置及系统
CN112825510A (zh) * 2019-11-21 2021-05-21 华为技术有限公司 一种更新映射关系的方法以及装置
CN114679418A (zh) * 2020-12-24 2022-06-28 中兴通讯股份有限公司 数据传输方法、电子设备和存储介质
WO2022170944A1 (zh) * 2021-02-10 2022-08-18 华为技术有限公司 报文转发方法、装置及系统
CN114143378A (zh) * 2021-11-24 2022-03-04 新华三技术有限公司 一种网络优化方法、装置、网关设备及存储介质

Also Published As

Publication number Publication date
CN117768386A (zh) 2024-03-26

Similar Documents

Publication Publication Date Title
Gavriluţ et al. Scheduling in time sensitive networks (TSN) for mixed-criticality industrial applications
Gavriluţ et al. AVB-aware routing and scheduling of time-triggered traffic for TSN
CN110024339B (zh) 报文转发方法、转发设备和网络设备
EP3205058B1 (en) System, device, and method for low-jitter communication over a packet-switched network
Alderisi et al. Introducing support for scheduled traffic over IEEE audio video bridging networks
US11088962B2 (en) Method for performant data transmission in a data network with, in part, real-time requirements and apparatus for carrying out the method
US20220124020A1 (en) Method of routing in time-sensitive networks
EP4319055A1 (en) Message transmission method and apparatus
CN113366805A (zh) 报文调度方法、调度器、网络设备和网络系统
US20230328002A1 (en) Cyclic Queuing and Forwarding (CQF) Segmentation
TWI756666B (zh) 在封包交換網路中藉由通訊實體之電腦手段實施之方法、及其電腦程式及電腦可讀取之非暫時性記錄媒體、以及封包交換網路之通訊實體
CN108282416B (zh) 一种基于数据帧的调度方法和装置
WO2024055897A1 (zh) 报文处理方法、传递方法、通信设备、系统、介质及产品
WO2024055898A1 (zh) 报文处理方法、传递方法、通信设备、系统、介质及产品
CN111434079B (zh) 一种数据通信方法及装置
Teener IEEE 802 Time-Sensitive Networking: Extending Beyond AVB
WO2023246471A1 (zh) 业务数据的传输方法和设备、电子设备和存储介质
WO2024016327A1 (zh) 报文传输
WO2023040650A1 (zh) 一种报文周期的确定方法及其相关装置
CN115396371A (zh) 一种报文传输方法及系统
CN115987910A (zh) 基于动态运算的队列门控调度方法、系统和存储介质
CN115733808A (zh) 一种基于循环队列集群转发的数据传输方法、装置及设备
Li et al. Enhanced Switch Design Supporting Dual Preemption Under Real-Time Ethernet
Eckert et al. High Precision Latency Forwarding for Wide Area Networks Through Intelligent In-Packet Header Processing (gLBF)
CN116545947A (zh) 多链路速率组网下的数据流传输方法及其相关设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23864629

Country of ref document: EP

Kind code of ref document: A1