WO2021013109A1 - 一种报文传输方法、装置及系统 - Google Patents

一种报文传输方法、装置及系统 Download PDF

Info

Publication number
WO2021013109A1
WO2021013109A1 PCT/CN2020/102873 CN2020102873W WO2021013109A1 WO 2021013109 A1 WO2021013109 A1 WO 2021013109A1 CN 2020102873 W CN2020102873 W CN 2020102873W WO 2021013109 A1 WO2021013109 A1 WO 2021013109A1
Authority
WO
WIPO (PCT)
Prior art keywords
period
message
cycle
label
periodic
Prior art date
Application number
PCT/CN2020/102873
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 华为技术有限公司
Priority to EP20844995.9A priority Critical patent/EP3996301A4/en
Publication of WO2021013109A1 publication Critical patent/WO2021013109A1/zh
Priority to US17/580,831 priority patent/US20220150176A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/28—Flow control; Congestion control in relation to timing considerations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
    • H04L1/0017—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy where the mode-switching is based on Quality of Service requirement
    • H04L1/0018—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy where the mode-switching is based on Quality of Service requirement based on latency requirement
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
    • 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]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/36—Flow control; Congestion control by determining packet size, e.g. maximum transfer unit [MTU]

Definitions

  • This application relates to the field of communication technology, and in particular to a method, device and system for message transmission.
  • Deterministic networks are the current hot spot in the industry.
  • the demand for deterministic networks comes from the industrial Internet, smart factories, programmable logic controllers (Programmable Logic Controller, PLC) remoteness and cloudification, etc., and also comes from Augmented Reality (Augmented Reality, AR) or virtual reality (Virtual Reality, VR) real-time interaction, remote surgery, tactile Internet and other remote real-time services.
  • Augmented Reality Augmented Reality, AR
  • virtual reality Virtual Reality
  • Its core is to ensure the end-to-end bandwidth, delay and jitter of the service flow.
  • Deterministic transmission means that the delay and jitter experienced by the message transmission need to meet the preset upper bound under the premise that the message obeys certain burst requirements.
  • the length of the period of the outgoing interface of the upstream device may be different from the length of the period of the outgoing interface of the downstream device.
  • the period of the outbound interface of the upstream device is less than the period of the outbound interface of the downstream device, as time drift accumulates, the delay increases indefinitely, which may cause continuous congestion when the downstream device sends packets.
  • the present application provides a message transmission method, device, and system to solve the congestion problem during message transmission.
  • the present application provides a message transmission method.
  • the method includes: a second device receives at least one first message from a first device, the first message including a first periodic label and a first number, so The first message is a message sent by the first device through the period corresponding to the first period label; when the first number of the first message meets the first condition, the second device Determine a second periodic label corresponding to the first periodic label, and send the first message to a third device through the period corresponding to the second periodic label; when the first number of the first message When the second condition is met, the second device determines a third periodic label corresponding to the first periodic label, and sends the first message to the third device through the period corresponding to the third periodic label, The period corresponding to the second periodic label and the period corresponding to the third periodic label are different periods.
  • the first device determines which method to use to send the first message according to the condition satisfied by the first number carried in the first message.
  • the second device determines the second periodic label corresponding to the first periodic label, and sends the first packet to the third device through the period corresponding to the second periodic label.
  • the second device determines the third periodic label corresponding to the first periodic label, and sends the first report to the third device through the period corresponding to the third periodic label Text.
  • This method can eliminate the problem of increased time delay caused by continuous drift and accumulation of clock errors, thereby helping to avoid the congestion problem when the second device sends a message due to the time delay.
  • the period-based deterministic transmission technology no longer relies on time synchronization, and can be implemented as an update of the period mapping relationship caused by time drift between different devices without packet loss.
  • the second device before the second device sends the first packet to the third device through the period corresponding to the second period tag, the second device includes the first packet
  • the first periodic label is updated to the second periodic label
  • the second device Before the second device sends the first packet to the third device through the period corresponding to the third period label, the second device transfers the first period label included in the first packet to Update to the third cycle label.
  • the second device determines that the first number belongs to a first set, and then determines that the first number of the first message satisfies a first condition; the second device determines If the first number does not belong to the first set, it is determined that the first number of the first message satisfies a second condition; wherein, the first set is used to indicate a periodic mapping manner. Or it can be understood that the first set is used to determine the period mapping mode.
  • the first number is one of N numbers starting from the starting number, the N numbers correspond to N cycles, and N is a positive integer; if the cycle mapping relationship is satisfied After the condition is updated, before the first message is received, the second device does not receive the message carrying the start number, then the first set is an empty set; or, the first set The set includes L consecutive numbers from the start number among the N numbers; wherein, when the number of cycles between the period in which the first message is located and the target period is less than N, the L It is equal to the number of cycles between the period of the first message and the target period plus 1, or, when the number of cycles between the period of the first message and the target period is greater than or equal to When N, the L is equal to N, the target period is the period in which the message carrying the start number appears for the first time after the update condition of the period mapping relationship is satisfied on the first device, and the first message The period of the text is not earlier than the target period.
  • the first number is one of N numbers starting from the start number, the N numbers correspond to N cycles, and N is a positive integer; the first set includes all Among the N numbers, consecutive P numbers starting from the starting number, where P is equal to the number of cycles between the period of the first message and the first period after the period update condition is met plus 1.
  • the first message sent to the third device through the period corresponding to the second period tag further includes the first number or the preset number;
  • the first message sent to the third device in the period corresponding to the period tag further includes the first number.
  • the second device determines that the update condition of the periodic mapping relationship is satisfied.
  • determining that the second device satisfies the update condition of the period mapping relationship includes: if a packet in the current period of the outgoing interface of the first device reaches the outgoing interface of the second device The first period of the second device after the latest time is earlier than the period of the second device corresponding to the current period in the old period mapping relationship, then the second device determines that the period mapping relationship is satisfied Update conditions.
  • the present application provides a message transmission method.
  • the method includes: a first device acquires at least one message of a first data stream, and the total size of the at least one message does not exceed the size of the first data stream.
  • the maximum sending volume of the first device in a period the first device sends at least one message to the second device through the period corresponding to the first period tag, wherein the message sent to the second device
  • Each message in at least one message carries the first cycle label and the first number.
  • the cycle corresponding to the first cycle tag is the current cycle;
  • the current cycle of a device is the idle cycle corresponding to the first data stream, and the cycle corresponding to the first cycle label is the first sending cycle after the current cycle.
  • the cycle corresponding to the first device there are K idle cycles after every N consecutive transmission cycles, and the first number is one of the N numbers starting from the start number ,
  • the N numbers correspond to N consecutive sending cycles, N is a positive integer, and K is a positive integer not greater than N.
  • the present application provides a message transmission method.
  • the method includes: a gateway device obtains at least one message of a first data flow, and the sum of the size of the at least one message does not exceed the size of the first data flow in all locations.
  • the first message sent through the sending period further includes a first number and a period label corresponding to the sending period, and the first number is N starting from the start number.
  • One of the numbers, the N numbers correspond to N sending cycles, and N is a positive integer.
  • the present application provides a message transmission device.
  • the device may be a second device or a chip for the second device.
  • the device has the function of realizing the foregoing first aspect or each embodiment of the first aspect. This function can be realized by hardware, or by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above-mentioned functions.
  • the present application provides a message transmission device.
  • the device may be a first device or a chip for the first device.
  • the device has the function of realizing the above-mentioned second aspect or various embodiments of the second aspect. This function can be realized by hardware, or by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above-mentioned functions.
  • the present application provides a message transmission device.
  • the device may be a gateway device or a chip for the gateway device.
  • the device has the function of realizing the foregoing third aspect or the embodiments of the third aspect. This function can be realized by hardware, or by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above-mentioned functions.
  • the present application provides a message transmission device, including: a processor and a memory; the memory is used to store computer execution instructions, and when the device is running, the processor executes the computer execution instructions stored in the memory to The device is caused to perform the methods described in the above aspects.
  • the present application provides a message transmission device, including: including units or means for executing each step of the foregoing aspects.
  • the present application provides a message transmission device, including a processor and an interface circuit, where the processor is configured to communicate with other devices through the interface circuit and execute the methods described in the foregoing aspects.
  • the processor includes one or more.
  • the present application provides a message transmission device, including a processor, configured to be connected to a memory, and configured to call a program stored in the memory to execute the methods described in the foregoing aspects.
  • the memory can be located inside the device or outside the device.
  • the processor includes one or more.
  • the present application also provides a computer-readable storage medium having instructions stored in the computer-readable storage medium, which when run on a computer, cause a processor to execute the methods described in the foregoing aspects.
  • this application also provides a computer program product including instructions, which when run on a computer, causes the computer to execute the methods described in the above aspects.
  • this application also provides a chip system, including a processor, configured to execute the methods described in the foregoing aspects.
  • the present application also provides a message transmission system, including: a second device for executing any of the methods described in the first aspect and a first device for executing any of the methods described in the second aspect.
  • Figure 1 is a schematic diagram of a possible network architecture provided by this application.
  • Figure 2 is an example diagram of a period-based deterministic transmission method
  • Figure 3 is a schematic diagram of the cycle boundary relationship between devices
  • Figure 4 is an example where the cycle length of the upstream device is greater than the cycle length of the downstream device
  • Figure 5 is an example where the cycle length of the upstream device is smaller than the cycle length of the downstream device
  • FIG. 6 is an example diagram of the message transmission method provided by this application.
  • FIG. 7 is a schematic flowchart of a message transmission method provided by this application.
  • FIG. 25 is a schematic diagram of a message transmission device provided by this application.
  • FIG. 26 is a schematic diagram of another message transmission device provided by this application.
  • the network architecture includes a first device and a second device.
  • the network architecture may also include a third device.
  • the second device may receive the message from the first device and send the received message to the third device.
  • the first device may be a routing device (route), a gateway device (gateway), etc.
  • the second device may be a gateway device, a routing device, etc.
  • the third device may be a routing device, a gateway device, etc.
  • any two devices in an upstream and downstream relationship may be referred to as upstream devices and downstream devices, respectively.
  • the above-mentioned first device may be called an upstream device, and the second device may be called a downstream device.
  • the above-mentioned second device may be called an upstream device, and the third device may be called a downstream device.
  • FIG. 2 it is an example diagram of a period-based deterministic sending method.
  • the devices included in the figure are as follows: sending device (sender), gateway device (gateway device 1 and gateway device 2 as shown in the figure), one or Multiple routing devices and receivers (reveiver). These devices support periodic label switching and can run the clock independently.
  • the gateway device 1, the routing device, and the gateway device 2 in FIG. 2 may be the first device, the second device, and the third device in FIG. 1, respectively.
  • the gateway device 1, the first routing device, and the second routing device in Figure 2 may be the first device, the second device, and the third device in Figure 1, respectively.
  • the device, or, the first routing device, the second routing device, and the gateway device 2 in FIG. 2 may be the first device, the second device, and the third device in FIG. 1, respectively.
  • the time axis of the outbound interface of all devices in the prior art (such as sending device, gateway device 1, routing device, gateway device 2) is divided into periods of length T, that is, in a deterministic sending network,
  • the period of the outbound interface of all devices is the same, that is, the network is a synchronous network.
  • Edge shaping The gateway device 1 shapes the received traffic and sends it in such a way that the number of bytes per T cycle per flow does not exceed Bi*T, where Bi stands for Service-Level Agreement (Service-Level Agreement, SLA) specified bandwidth.
  • Bi stands for Service-Level Agreement (Service-Level Agreement, SLA) specified bandwidth.
  • Periodic label For example, the periodic label can be 0 to 3 cycles, and the message sent in a certain period carries the periodic label corresponding to the current period. As shown in Figure 3, the gateway device 1 has multiple cycles at the outgoing interface. The messages sent in the T6 cycle all carry the cycle label 6, and the messages sent in the T7 cycle all carry the cycle label 7. The messages sent in the T8 cycle all carry cycle tags 8 and so on.
  • mapping relationship between periods For two adjacent devices in the network, a fixed mapping relationship is established between the period of the outbound interface of the upstream device and the period of the outbound interface of the downstream device: X maps to X+delta (delta Is a constant), that is, after the packets in the period X of the outbound interface of the upstream device are sent to the downstream device, they are sent in the period X+delta of the outbound interface of the downstream device.
  • the period T6 on an outgoing interface of gateway device 1 is mapped to the period T7 of an outgoing interface of the routing device, delta is equal to 1, and subsequent periods also follow this mapping relationship.
  • the period T7 on the outgoing interface is mapped to the period T8 of the aforementioned outgoing interface of the routing device
  • the period T8 on the aforementioned outgoing interface of the gateway device 1 is mapped to the period T9 of the aforementioned outgoing interface of the routing device, and so on.
  • the period mapping relationship can be represented by the mapping relationship between period tags.
  • Periodic transmission For an outbound interface of a device (such as the sending device, gateway device 1, routing device, and gateway device 2 in Figure 2 above), there is a queue for each period of the outbound interface, and the queue index is the period Labels, the queue is only opened within the period range and closed during the rest of the time. The messages that need to be sent in this period are enqueued according to the mapped period label.
  • a device such as the sending device, gateway device 1, routing device, and gateway device 2 in Figure 2 above
  • the above solution requires the deployment of 1588v2 on the entire network, that is, the period of the outbound interface of all devices in the network is the same.
  • the period and the period of the outgoing interface of the gateway device 2 are the same.
  • customers hope that deterministic transmission does not depend on 1588v2, that is, it is hoped that the periods of outgoing interfaces of different devices can be different, that is, different devices are in an asynchronous network.
  • the packets on the outbound interface of the upstream device may arrive at the outbound interface of the downstream device too late, thus missing
  • the sending period of the corresponding downstream device in the mapping relationship Its essence is: the sending rate of the upstream device is lower than the sending rate of the downstream device.
  • a possible solution is: when the downstream device detects that the mapping relationship needs to be updated, it can directly update the mapping relationship between the cycle of the upstream device and the cycle of the downstream device, so that the When a packet arrives at the outbound interface of a downstream device too late, the packet skips a sending cycle and sends it in the next cycle of the downstream device.
  • the cycle length of the upstream device is greater than the cycle length of the downstream device.
  • the mapping between the cycle of routing device 1 and the cycle of routing device 2 The relationship is: T0 is mapped to T3, T1 is mapped to T0, T2 is mapped to T1, and T3 is mapped to T2.
  • the mapping relationship is updated, and the mapping relationship is updated to: T0 is mapped to T0, T1 is mapped to T1, T2 is mapped to T2, and T3 is mapped to T3, and the late message is sent through the corresponding period T1 in the new period mapping relationship.
  • the delay increases indefinitely (natural number queue) or the snake problem (limited number queue), causing Continuous congestion. Its essence is: the sending rate of the upstream device is greater than the sending rate of the downstream device.
  • the downstream device detects that the period mapping relationship needs to be updated, it cannot directly update the mapping relationship between the period of the upstream device and the period of the downstream device, because if the period mapping relationship is directly updated, the pending report of the current period may be caused.
  • the ability to send text over a period when the downstream device detects that the period mapping relationship needs to be updated, it cannot directly update the mapping relationship between the period of the upstream device and the period of the downstream device, because if the period mapping relationship is directly updated, the pending report of the current period may be caused.
  • the ability to send text over a period is not be updated, it cannot directly update the mapping relationship between the period of the upstream device and the period of the downstream device, because if the period mapping relationship is directly updated, the pending report of the current period may be caused.
  • the ability to send text over a period when the downstream device detects that the period mapping relationship needs to be updated, it cannot directly update the mapping relationship between the period of the upstream device and the period of the downstream device, because if the period mapping relationship is
  • the cycle length of the upstream device is less than the cycle length of the downstream device.
  • the mapping between the cycle of routing device 1 and the cycle of routing device 2 The relationship is: T0 is mapped to T3, T1 is mapped to T0, T2 is mapped to T1, and T3 is mapped to T2. It can be seen that if the packets in the period T3 of the routing device 1 are sent in advance, the packets in the period T3 and the period T2 of the routing device 1 are sent together.
  • the period T2 of the routing device 1 is mapped
  • the period T1 to the routing device 2 causes the routing device 2 to send more packets in the period T1. If the packet transmission capability of the routing device 2 in one period is exceeded, the packet may be lost.
  • the length of the period of the outgoing interface of the first device is less than the length of the period of the outgoing interface of the second device.
  • the first device is a gateway device that has an upstream and downstream relationship with the sending device (gateway device 1 in Figure 2)
  • the network device when the network device sends a message, it will be empty for K cycles after every N consecutive cycles.
  • Send a message N is a positive integer
  • N is a positive integer not greater than N, that is, there are K idle periods after every N consecutive sending cycles.
  • the sending cycle refers to the period that can be used to send the message (the sending cycle can be sent The message may not send messages), the idle period refers to the period not used to send messages.
  • the gateway device can send packets stream by stream.
  • the gateway device receives the first data stream sent by the sending device and forwards the first data stream.
  • the gateway device forwards the first data stream and divides the uniform period on the outgoing interface.
  • the gateway device acquires at least one packet of the first data stream, and the total size of the at least one packet does not exceed the maximum transmission volume of the first data stream in one period of the gateway device, if the current period of the gateway device is If the current period of the gateway device is the idle period corresponding to the first data stream, the gateway device passes the first packet after the idle period.
  • the first message is sent in the sending cycle.
  • the first message sent through the transmission period further includes a first number and a period label corresponding to the transmission period, the first number is one of N numbers starting from the start number, and the N numbers correspond to N numbers Transmission cycle.
  • the N numbers can be 0 to N-1.
  • it can also be N discrete numbers, which is not limited in this application.
  • Each cycle is numbered, and the number corresponding to each consecutive N cycles is one from 0 to N-1, that is, the cycles for which N consecutive messages need to be sent are sequentially numbered from 0 to N-1, of course, it can also be a number. It is 1 to N, or other numbering methods are also possible.
  • the number of the sending cycle is from 0 to 8, and the cycle is repeated according to the number from 0 to 8.
  • the numbered cycle is the sending cycle, which can send messages, and the unnumbered cycle is the idle cycle. , No message is sent in idle period.
  • each message needs to carry a number and a periodic label.
  • the periodic label is used to indicate the period in which the message needs to be sent, and the number is used to indicate whether the periodic mapping relationship (or called the periodic label mapping relationship) needs to be updated. .
  • One or more data stream packets can be sent simultaneously in one cycle.
  • 4 data stream packets can be sent simultaneously in one cycle, and the packets sent in the same cycle, no matter which data stream they belong to, carry the same cycle label.
  • all messages in the period corresponding to period label 0 carry period label 0, but the number carried by each message in the period may be different, which is one of 0-8.
  • the mapping relationship before the mapping relationship is updated, the mapping relationship is referred to as the old period mapping relationship, after the period mapping relationship is updated, the period mapping relationship is referred to as the new period mapping relationship, and the period of the first device is mapped in the new period.
  • the corresponding period in the relationship is K periods earlier than the period of the first device in the old period mapping relationship.
  • the period label carried by the packet in the previous period at the position of the first arrow is 0, and the period label of the corresponding second device's period in the old period mapping is 2 (the solid line in the figure shows ), the period label of the period of the corresponding second device in the new period mapping relationship is 1 (shown by the dotted line in the figure).
  • the method for the second device to determine that the update condition of the periodic mapping relationship is satisfied includes but is not limited to the following three implementation methods:
  • Implementation method 1 If the first period of the second device after the first target moment is earlier than the period of the second device corresponding to the current period of the outbound interface of the first device in the old period mapping relationship, the second device determines Satisfy the update condition of the period mapping relationship, wherein the first target time is the latest time when a packet in the current period of the outbound interface of the first device reaches the inbound interface of the second device plus the internal processing time of the second device The time at which the maximum value of the extension is located.
  • the first target time mentioned above is recorded as t1
  • the latest time a packet in the current cycle of the outbound interface of the first device reaches the inbound interface of the second device is recorded as t2
  • the internal processing time of the second device is t2.
  • T is the length of the period in which the first device sends a message.
  • Implementation method 2 If the first period of the second device after the second target moment is earlier than the period of the second device corresponding to the current period of the outbound interface of the first device in the old period mapping relationship, the second device determines Satisfy the update condition of the period mapping relationship, wherein the second target time is the latest time when a packet in the current period of the outbound interface of the first device reaches the inbound interface of the second device plus the internal processing time of the second device The time at which the maximum delay is located and the link between the first device and the second device jitter.
  • the above-mentioned second target time is recorded as t4, the latest time a packet in the current cycle of the outbound interface of the first device reaches the inbound interface of the second device is recorded as t2, and the internal processing time of the second device is t2.
  • the maximum value of delay is denoted as D
  • T is the length of the period in which the first device sends the packet.
  • Implementation method 3 If the packets in the current period of the outbound interface of the first device arrive at the first period of the second device after the latest time of the outbound interface of the second device, it is earlier than the current period of the outbound interface of the first device. If the period corresponds to the period of the second device in the old period mapping relationship, the second device determines that the update condition of the period mapping relationship is satisfied.
  • T is the length of the period in which the first device sends the packet.
  • T is the length of the period in which the first device sends packets
  • jitter2 is the outbound interface of the first device.
  • the jitter between the outbound interface of the first device and the outbound interface of the second device is the jitter between the first device and the second device plus the first device. 2. Jitter inside the device.
  • the message transmission method provided in this application will be described in detail below. As shown in FIG. 7, the method includes the following steps:
  • Step 701 The second device receives at least one first message from the first device.
  • the first message includes a first periodic label and a first number.
  • the first message is sent by the first device through a period corresponding to the first periodic label. Message.
  • the message sent by the gateway device 1 can refer to the foregoing description, which will not be repeated here.
  • the first device may send packets stream by stream, such as the first device Obtain at least one packet of the first data stream, and the sum of the size of the at least one packet does not exceed the maximum transmission volume of the first data stream in a period of the first device, and then the first device passes the corresponding label of the first period Periodically, sending the at least one message to the second device, where each message in the at least one message sent to the second device carries a first periodic label and a first number.
  • the sending period can be used to send a message, and the idle period is not used to send a message.
  • the first number is one of N numbers starting from the starting number, N numbers correspond to N consecutive sending cycles, N is a positive integer, and K is a positive integer not greater than N.
  • N 9
  • K 1
  • the first number may be one of 0 to 8
  • the first period label may be one of 0-3.
  • the first number is used to indicate the positional relationship between the idle period before the current period and the current period.
  • the current period refers to the period in which the message carrying the first number is located.
  • the current period may also be referred to as Message cycle, first cycle, etc.
  • the first number it means that the cycle before the current cycle is an idle cycle; when the first number is 1, it means that the position of the two cycles before the current cycle is the idle cycle (that is, the cycle before the current cycle is The period of the message carrying the number 0 is the period before the period of the message carrying the number 0 is the idle period); and so on, and will not be repeated.
  • Step 702 When the first number of the first packet meets the first condition, the second device determines a second periodic label corresponding to the first periodic label, and sends the first report to the third device through the period corresponding to the second periodic label.
  • the second device determines the third periodic label corresponding to the first periodic label, and sends the first message to the third device through the period corresponding to the third periodic label.
  • the period corresponding to the second period label and the period corresponding to the third period label are different periods.
  • the first device determines which way to send the first message according to the condition that the first number carried in the first message satisfies. Wherein, when the first number of the first message meets the first condition, the second device determines the second periodic label corresponding to the first periodic label, and sends the first message to the third device through the period corresponding to the second periodic label ; When the first number of the first message satisfies the second condition, the second device determines the third periodic label corresponding to the first periodic label, and sends the first message to the third device through the period corresponding to the third periodic label.
  • This method can eliminate the problem of increased time delay caused by continuous drift and accumulation of clock errors, thereby helping to avoid the congestion problem when the second device sends a message due to the time delay.
  • the period-based deterministic transmission technology no longer relies on time synchronization, and can be implemented as an update of the period mapping relationship caused by time drift between different devices without packet loss.
  • the second device before sending the first packet to the third device through the period corresponding to the second period label, the second device also updates the first period label included in the first packet to the second period label. That is, the periodic label carried in the first packet sent by the second device to the third device through the period corresponding to the second periodic label is the second periodic label.
  • the period labels carried in the packets in the period received by the second device are all 0 (that is, the first period label), and the data stream 1
  • the message carries the number 6, the message of the data stream 3 carries the number 5, and the message of the data stream 4 carries the number 3.
  • the second device sends a message in this period, it modifies the periodic label in the message to 1 (that is, the second periodic label).
  • the first cycle label and the second cycle label here are the mapping between the cycle labels under the new cycle mapping relationship.
  • the second device Before sending the first message to the third device through the period corresponding to the third periodic label, the second device updates the first periodic label included in the first message to the third periodic label. That is, the periodic label carried in the first packet sent by the second device to the third device through the period corresponding to the third periodic label is the third periodic label.
  • the period labels carried in the packets in the period received by the second device are all 0 (that is, the first period label), and the data stream 1
  • the message carries the number 6, the message of the data stream 3 carries the number 5, and the message of the data stream 4 carries the number 3.
  • the second device sends a message in this period, it modifies the periodic label in the message to 2 (that is, the third periodic label).
  • the first cycle label and the third cycle label here are the mapping between the cycle labels under the old cycle mapping relationship.
  • the second device can only determine the period of sending the message and the corresponding period label through one of the above two mapping relationships (that is, the new period mapping relationship and the old period mapping relationship).
  • the following method can be used to determine which conditions the first number of the first message meets: the second device determines that the first number belongs to the first set, and then determines the first number of the first message. The number meets the first condition; the second device determines that the first number does not belong to the first set, and then determines that the first number of the first message meets the second condition; where the first set is used to indicate a periodic mapping manner.
  • the above-mentioned first set is determined as follows:
  • the second device does not receive the message carrying the start number, then the first set is an empty set; or,
  • the first set includes L consecutive numbers from the start number among the N numbers; among them, when the number of cycles between the period of the first message and the target period is less than N, L is equal to the number of the first message The number of cycles between the period of the first message and the target cycle plus 1, or, when the number of cycles between the period of the first message and the target cycle is greater than or equal to N, L is equal to N, and the target cycle is the first device The period in which the message carrying the start number appears for the first time after the update condition of the period mapping relationship is satisfied, and the period in which the first message is located is not earlier than the target period.
  • the first set when the number of cycles between the period of the first message and the target period is equal to 0, the first set is ⁇ 0 ⁇ ; the period between the first message and the target period When the number of intervals between periods is equal to 1, the first set is ⁇ 0, 1 ⁇ ;..., when the number of periods between the period of the first message and the target period is equal to N-1, the first set is ⁇ 0 ,1,2,...,N-1 ⁇ , when the number of cycles between the period of the first message and the target period is greater than or equal to N, the first set is ⁇ 0,1,2,...,N -1 ⁇ .
  • the above-mentioned first set is determined as follows:
  • the first set includes P consecutive numbers from the start number among the N numbers, and P is equal to the number of cycles between the period of the first message and the first period after the period update condition is met plus one. For example, taking the starting number 0 as an example, when the period between the period of the first message and the first period after the period update condition is met is equal to 0, the first set is ⁇ 0 ⁇ ; When the period between the period of the message and the first period after the period update condition is met is equal to 1, the first set is ⁇ 0, 1 ⁇ ; ...; the period of the first message and the period that meets the period When the number of cycles between the first cycle after the update condition is equal to N-1, the first set is ⁇ 0, 1, 2, ..., N-1 ⁇ .
  • mapping method of indicating or determining the period through the first set.
  • other methods can also be used to indicate the period mapping method, which is described below.
  • the second device determines that the first number belongs to the first set, and then determines that the first number of the first packet satisfies the first condition; further, the second device determines the second period corresponding to the first period label
  • the tag sends the first message to the third device through the cycle corresponding to the second cycle tag.
  • the second device determines that the first number belongs to the second set, and then determines that the first number of the first message meets the second condition; the second device determines the third periodic label corresponding to the first periodic label, and the third periodic label corresponds to the Periodically sending the first message to the third device.
  • the third set, the fourth set, and the fifth set are used for different purposes than the first set and the second set.
  • the third set is used to determine the lost packets
  • the fourth set is used to determine to send the first packet.
  • the period of the text is different from the period corresponding to the second period label and the period corresponding to the third period label.
  • the first message sent to the third device through the period corresponding to the second periodic label further includes the first number or the preset number; the first message sent to the third device through the period corresponding to the third periodic label
  • the message also includes the first number.
  • the preset number here is an arbitrary number different from the first number, as long as it can be distinguished from the first number.
  • the first number is one of 0 to N-1, and the first number is divided by 0 to N- Any symbol other than 1.
  • the first message sent to the third device through the period corresponding to the second period label includes the preset number.
  • the above number set is dynamically changing. Taking N numbers from 0 to N-1 as an example, the dynamic change process of the number set is: empty set, ⁇ 0 ⁇ , ⁇ 0, 1 ⁇ , ...
  • X is an integer from 0 to N-1
  • the Xth cycle is the cycle in which all messages appearing in the entire cycle for the first time are sent according to the new cycle mapping relationship.
  • the second device determines that the update condition of the periodic mapping relationship is satisfied. That is, when the second device determines that the update condition of the periodic mapping relationship is satisfied, the message transmission method shown in FIG. 2 is executed. For the second device to determine that the update condition of the periodic mapping relationship is satisfied, reference may be made to the foregoing description, which will not be repeated here.
  • the solution shown in FIG. 7 may be for one data stream or multiple data streams. Each step executed by the solution shown in FIG. 7 will be described in detail below.
  • the preset number is represented by "F", and the N numbers are respectively 0 to N-1, satisfying the update of the periodic mapping relationship
  • the M-th period after the condition is the target period (that is, the period in which the message carrying the start number 0 appears for the first time after meeting the update condition of the period mapping relationship on the first device).
  • the second device checks whether there is a message carrying number 0 in the current cycle cycle by cycle, until the Mth cycle, the first time it checks a message carrying number 0, M is less than or equal to N Positive integer;
  • the second device modifies the number of the message carrying the number 0 in the M-th cycle to F, and maps it to the corresponding cycle according to the new cycle mapping relationship for transmission, and transfers other messages in the M-th cycle according to The old cycle mapping relationship is mapped to the corresponding cycle for transmission;
  • the second device modifies the number of the message carrying the number 0 or 1 in the M+1 cycle to F, and maps it to the corresponding cycle according to the new cycle mapping relationship, and sends it in the M+1 cycle.
  • the other messages of, are mapped to the corresponding cycle according to the old cycle mapping relationship for transmission;
  • the second device modifies the number of the message carrying the number 0, 1, or 2 in the M+2 cycle to F, and maps it to the corresponding cycle according to the new cycle mapping relationship for transmission, and transfers the M+2 cycle Other messages in the cycle are mapped to the corresponding cycle according to the old cycle mapping relationship for transmission;
  • the relationship is mapped to the corresponding cycle for transmission, and other messages in the M+Xth cycle are mapped to the corresponding cycle for transmission according to the old cycle mapping relationship.
  • X is an integer from 0 to N-1, and the first X cycles are the cycles in which all messages appearing in the entire cycle for the first time are sent according to the new cycle mapping relationship;
  • the second device modifies the numbers of packets carrying numbers 1, 2, ..., X, or X+1 in the M+X+1 cycle to F, and maps them to the corresponding cycles according to the new cycle mapping relationship. send;
  • the second device changes the number of the message carrying the number 2,..., X+1, or X+2 in the M+X+2 cycle to F, and maps it to the corresponding cycle according to the new cycle mapping relationship. send;
  • the second device modifies the number of the message carrying the number NX-1,..., N-2, or N-1 in the M+N-1 cycle to F, and maps it to the corresponding Send periodically;
  • the second device modifies the number of the message carrying the number N-X,..., N-2, or N-1 in the M+Nth cycle to F, and maps it to the corresponding cycle according to the new cycle mapping relationship for transmission;
  • the second device modifies the number of the message carrying the number N-1 in the M+N+X-1 cycle to F, and maps it to the corresponding cycle according to the new cycle mapping relationship for transmission.
  • FIG. 8 to FIG. 24 are schematic diagrams of message sending in each period in the network.
  • the upper part represents the inbound interface of the second device, displaying the cycle of the outbound interface of the previous hop device, and the lower half represents the outbound interface of the second device, displaying the second device’s
  • the period of the outgoing interface, the vertical dotted line represents the boundary of the period.
  • the new period mapping relationship (dashed arrow in the figure) and the old period mapping relationship (solid arrow in the figure) are maintained at the same time. After this period of time, only the solid arrow remains , which means that the old period mapping relationship has been deleted, and the solid arrow represents the new period mapping relationship.
  • the message numbered 0 appears for the first time in this cycle, all messages numbered 0 are forwarded according to the new cycle mapping relationship, and the remaining numbered messages are forwarded according to the old cycle mapping relationship.
  • the numbers of packets in data stream 1 are all 0, the numbers of packets in data stream 2 are all 3, no packets are sent in data stream 3, and the numbers of packets in data stream 4 are all 7.
  • all packets with number 0 ie packets of data stream 1 are sent according to the new cycle mapping relationship, and the number carried in the message is modified to F, and the remaining streams are data streams 2 and 4 mapped according to the old cycle Relationship sent.
  • All packets numbered 0 and 1 in this cycle are forwarded according to the new cycle mapping relationship, and the remaining numbered packets are forwarded according to the old cycle mapping relationship.
  • the numbers of packets in data stream 1 are all 1, the numbers of packets in data stream 2 are all 4, the numbers of packets in data stream 3 are all 0, and the number of packets in data stream 4 All of them are 8.
  • all messages with numbers 0 or 1 that is, messages of data streams 1 and 3) are sent according to the new cycle mapping relationship, and the number carried in the message is modified to F, and the remaining streams (ie Data streams 2, 4) are sent according to the old cycle mapping relationship.
  • All packets numbered 0, 1, and 2 in this period are forwarded according to the new period mapping relationship, and the remaining numbered packets are forwarded according to the old period mapping relationship.
  • the numbers of packets of data stream 1 are all 2, the numbers of packets of data stream 2 are all 5, the numbers of packets of data stream 3 are all 1, and data stream 4 does not send packets.
  • All packets numbered 0, 1, or 2 in this cycle i.e. packets of data flow 1, 3) are sent according to the new cycle mapping relationship, and the number carried in the packet is modified to F, and the remaining flows (ie data flow 2) The message is sent according to the old cycle mapping relationship.
  • All packets numbered 0, 1, 2, and 3 in this period are forwarded according to the new period mapping relationship, and the remaining numbered packets are forwarded according to the old period mapping relationship.
  • the numbers of packets of data stream 1 are all 3, the numbers of packets of data stream 2 are all 6, the numbers of packets of data stream 3 are all 2, and the numbers of packets of data stream 4 All 0, all packets numbered 0, 1, 2, or 3 in this cycle (that is, packets of data streams 1, 3, 4) are sent according to the new cycle mapping relationship, and the numbers carried in the packets are modified to F, the remaining streams (ie data stream 2) are sent according to the old cycle mapping relationship.
  • All packets numbered 0, 1, 2, 3, and 4 in this period are forwarded according to the new period mapping relationship, and the remaining numbered packets are forwarded according to the old period mapping relationship.
  • the numbers of packets of data stream 1 are all 4, the numbers of packets of data stream 2 are all 7, the numbers of packets of data stream 3 are all 3, and the numbers of packets of data stream 4 All are 1, and all packets numbered 0, 1, 2, 3, or 4 in this cycle (that is, packets of data streams 1, 3, 4) are sent according to the new cycle mapping relationship, and the numbers carried by the packets Modified to F, and the remaining streams (ie, data stream 2) are sent according to the old cycle mapping relationship.
  • All packets numbered 0, 1, 2, 3, 4, and 5 in this period are forwarded according to the new period mapping relationship, and the remaining numbered packets are forwarded according to the old period mapping relationship.
  • the numbers of packets of data stream 1 are all 5, the numbers of packets of data stream 2 are all 8, the numbers of packets of data stream 3 are all 4, and the numbers of packets of data stream 4 All are 2.
  • All packets numbered 0, 1, 2, 3, 4, or 5 in this cycle (that is, packets of data streams 1, 3, 4) are sent according to the new cycle mapping relationship, and the packets are carried The number of is modified to F, and the remaining streams (that is, data stream 2) are sent according to the old cycle mapping relationship.
  • All packets numbered 0, 1, 2, 3, 4, 5, and 6 in this period are forwarded according to the new period mapping relationship, and the remaining numbered packets are forwarded according to the old period mapping relationship.
  • the numbers of packets in data stream 1 are all 6, no packets in data stream 2 are sent, the numbers of packets in data stream 3 are all 5, and the numbers of packets in data stream 4 are all 3. All packets numbered 0, 1, 2, 3, 4, 5, or 6 in this cycle (that is, packets of data streams 1, 3, 4) are sent according to the new cycle mapping relationship, and the number carried by the packet Amend to F.
  • All messages exchange cycle labels according to the new mapping relationship, delete the old cycle mapping relationship, and all subsequent messages exchange cycle labels according to the new mapping relationship, and all numbers from 0 to X are numbered 0, 1, 2, 3,
  • the number carried in the 4, 5, 6, or 7 packets (that is, the packets of data streams 1, 2, 3, and 4) is modified to F.
  • Messages are all exchanged cycle labels according to the new mapping relationship, and all numbers are numbered 1 to X+1 (exactly NX-1 to N-1), that is, numbered 1, 2, 3, 4, 5, 6, 7, Or 8 packets (that is, packets of data streams 1, 2, 3, and 4) carry the number modified to F.
  • the messages are all exchanged cycle labels according to the new mapping relationship, and all messages numbered from NX to N-1, namely, numbered 2, 3, 4, 5, 6, 7, or 8 (i.e. data flow 2, 3, 4) The number carried in the message is changed to F.
  • the messages are all exchanged cycle labels according to the new mapping relationship, and all messages numbered from N-X+1 to N-1 that are numbered 3, 4, 5, 6, 7, or 8 (that is, data stream 2, 4) The number carried in the message is changed to F.
  • each network element described above includes hardware structures and/or software modules corresponding to each function.
  • the present invention can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or computer software-driven hardware depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered as going beyond the scope of the present invention.
  • the device 2500 may exist in the form of software or hardware.
  • the apparatus 2500 may include: a processing unit 2502 and a communication unit 2501.
  • the communication unit 2501 may include a receiving unit and a sending unit.
  • the processing unit 2502 is used to control and manage the actions of the device 2500.
  • the communication unit 2501 is used to support communication between the device 2500 and other network entities.
  • the processing unit 2502 may be a processor or a controller, for example, a general-purpose central processing unit (central processing unit, CPU), a general-purpose processor, a digital signal processing (digital signal processing, DSP), and an application specific integrated circuit (application specific integrated circuit). circuits, ASIC), field programmable gate array (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. It can implement or execute various exemplary logical blocks, modules and circuits described in conjunction with the disclosure of this application.
  • the processor may also be a combination for realizing computing functions, for example, including a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and so on.
  • the communication unit 2501 is an interface circuit of the device for receiving signals from other devices.
  • the communication unit 2501 is an interface circuit for the chip to receive signals from other chips or devices, or an interface circuit for the chip to send signals to other chips or devices.
  • the apparatus 2500 may be the second device, gateway device, or first device in any of the foregoing embodiments, and may also be a chip used for the second device, gateway device, or first device.
  • the processing unit 2502 may be a processor, for example, and the communication unit 2501 may be a transceiver, for example.
  • the transceiver may include a radio frequency circuit.
  • the processing unit 2502 may be a processor, for example, and the communication unit 2501 may be an input/output interface, a pin, or a circuit, for example.
  • the processing unit 2502 can execute computer-executable instructions stored in the storage unit.
  • the storage unit is a storage unit in the chip, such as a register, a cache, etc., and the storage unit may also be a storage unit in the second device located on the chip.
  • External storage units such as read-only memory (ROM) or other types of static storage devices that can store static information and instructions, random access memory (RAM), etc.
  • the device 2500 is the above-mentioned second device, and the communication unit 2501 is configured to receive at least one first message from the first device, and the first message includes a first periodic label and a first number.
  • the first message is a message sent by the first device through the period corresponding to the first periodic label;
  • the processing unit 2502 is configured to: when the first number of the first message satisfies In the first condition, determine a second periodic label corresponding to the first periodic label;
  • the communication unit 2501 is further configured to send the first message to a third device through the period corresponding to the second periodic label
  • the processing unit 2502 is further configured to determine a third periodic label corresponding to the first periodic label when the first number of the first message meets a second condition;
  • the communication unit 2501 It is also configured to send the first message to the third device through the period corresponding to the third periodic label, and the period corresponding to the second periodic label and the period corresponding to the third periodic label are different periods .
  • the processing unit 2502 is further configured to: before the communication unit 2501 sends the first packet to the third device through the period corresponding to the second period tag, transfer all The first periodic label included in the first message is updated to the second periodic label; the communication unit 2501 sends the first message to the third device through the period corresponding to the third periodic label. Before the text, update the first periodic label included in the first message to the third periodic label.
  • the processing unit 2502 is further configured to: determine that the first number belongs to a first set, determine that the first number of the first message meets a first condition; determine If the first number does not belong to the first set, it is determined that the first number of the first message satisfies a second condition; wherein, the first set is used to indicate a periodic mapping manner.
  • the first number is one of N numbers starting from the starting number, the N numbers correspond to N cycles, and N is a positive integer; if the cycle mapping relationship is satisfied After the condition is updated, before the first message is received, if the communication unit 2501 does not receive a message carrying the start number, the first set is an empty set; or, the first set The set includes L consecutive numbers from the start number among the N numbers; wherein, when the number of cycles between the period in which the first message is located and the target period is less than N, the L It is equal to the number of cycles between the period of the first message and the target period plus 1, or, when the number of cycles between the period of the first message and the target period is greater than or equal to When N, the L is equal to N, the target period is the period in which the message carrying the start number appears for the first time after the update condition of the period mapping relationship is satisfied on the first device, and the first message The period of the text is not earlier than the target period.
  • the first number is one of N numbers starting from the start number, the N numbers correspond to N cycles, and N is a positive integer; the first set includes all Among the N numbers, consecutive P numbers starting from the starting number, where P is equal to the number of cycles between the period of the first message and the first period after the period update condition is met plus 1.
  • the first message sent to the third device through the period corresponding to the second period tag further includes the first number or the preset number;
  • the first message sent to the third device in the period corresponding to the period tag further includes the first number.
  • the processing unit 2502 is further configured to determine that the update condition of the periodic mapping relationship is satisfied before the communication unit 2501 receives at least one first message from the first device.
  • the apparatus 2500 is the aforementioned first device
  • the communication unit 2501 includes a sending unit and a receiving unit.
  • the receiving unit is configured to obtain at least one packet of the first data stream, and the sum of the size of the at least one packet does not exceed the maximum sending amount of the first data stream in one cycle of the device;
  • the sending unit uses Send at least one message to the second device in the period corresponding to the first period label, wherein each message in the at least one message sent to the second device carries the first period label and The first number.
  • the cycle corresponding to the first cycle tag is the current cycle;
  • the current cycle of a device is the idle cycle corresponding to the first data stream, and the cycle corresponding to the first cycle label is the first sending cycle after the current cycle.
  • the first number is one of the N numbers starting from the start number
  • the N numbers correspond to N consecutive cycles, N is a positive integer, and K is a positive integer not greater than N.
  • the apparatus 2500 is the above-mentioned gateway device, and the communication unit 2501 includes a sending unit and a receiving unit.
  • a receiving unit configured to obtain at least one packet of the first data stream, where the total size of the at least one packet does not exceed the maximum sending amount of the first data stream in one period of the gateway device; the sending unit, If the current cycle of the device is the transmission cycle corresponding to the first data flow, send the first packet through the transmission cycle; if the current cycle of the device is the transmission cycle corresponding to the first data flow The first message is sent through the first sending period after the idle period; wherein, in the period corresponding to the device, there are K idle periods after every N consecutive sending periods, and N is Positive integer, K is a positive integer not greater than N.
  • the first message sent through the sending period further includes a first number and a period label corresponding to the sending period, and the first number is N starting from the start number.
  • One of the numbers, the N numbers correspond to N sending cycles, and N is a positive integer.
  • the apparatus may be the second device, the gateway device, or the first device in the foregoing embodiment.
  • the device 2600 includes a processor 2602, a communication interface 2603, and a memory 2601.
  • the apparatus 2600 may further include a communication line 2604.
  • the communication interface 2603, the processor 2602, and the memory 2601 may be connected to each other through a communication line 2604;
  • the communication line 2604 may be a peripheral component interconnection standard (peripheral component interconnect, PCI for short) bus or an extended industry standard architecture (extended industry standard architecture) , Referred to as EISA) bus and so on.
  • the communication line 2604 can be divided into an address bus, a data bus, a control bus, and so on. For ease of representation, only one thick line is used to represent in FIG. 26, but it does not mean that there is only one bus or one type of bus.
  • the processor 2602 may be a CPU, a microprocessor, an ASIC, or one or more integrated circuits used to control the execution of the program of the present application.
  • Communication interface 2603 using any device such as a transceiver to communicate with other devices or communication networks, such as Ethernet, radio access network (RAN), wireless local area networks (WLAN), Wired access network, etc.
  • RAN radio access network
  • WLAN wireless local area networks
  • Wired access network etc.
  • the memory 2601 can be ROM or other types of static storage devices that can store static information and instructions, RAM or other types of dynamic storage devices that can store information and instructions, or it can be an electrically erasable programmable read-only memory (electrically erasable programmable read-only memory).
  • read-only memory EEPROM
  • compact disc read-only memory, CD-ROM
  • optical disc storage including compact discs, laser discs, optical discs, digital universal discs, Blu-ray discs, etc.
  • magnetic disks A storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program codes in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.
  • the memory can exist independently and is connected to the processor through a communication line 2604. The memory can also be integrated with the processor.
  • the memory 2601 is used to store computer-executed instructions for executing the solution of the present application, and the processor 2602 controls the execution.
  • the processor 2602 is configured to execute computer-executable instructions stored in the memory 2601, so as to implement the message transmission method provided in the foregoing embodiment of the present application.
  • the computer-executable instructions in the embodiments of the present application may also be referred to as application program code, which is not specifically limited in the embodiments of the present application.
  • At least one (piece, species) of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or Multiple.
  • Multiple refers to two or more, and other measure words are similar.
  • "a device” means to one or more such devices.
  • the computer program product includes one or more computer instructions.
  • the computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.
  • the computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website, computer, server, or data center.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or a data center integrated with one or more available media.
  • the usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)), etc.
  • the various illustrative logic units and circuits described in the embodiments of this application can be implemented by general-purpose processors, digital signal processors, application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, Discrete gates or transistor logic, discrete hardware components, or any combination of the above are designed to implement or operate the described functions.
  • the general-purpose processor may be a microprocessor, and optionally, the general-purpose processor may also be any traditional processor, controller, microcontroller, or state machine.
  • the processor can also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors combined with a digital signal processor core, or any other similar configuration achieve.
  • the steps of the method or algorithm described in the embodiments of the present application can be directly embedded in hardware, a software unit executed by a processor, or a combination of the two.
  • the software unit can be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM or any other storage medium in the field.
  • the storage medium may be connected to the processor, so that the processor can read information from the storage medium, and can store and write information to the storage medium.
  • the storage medium may also be integrated into the processor.
  • the processor and the storage medium can be arranged in the ASIC.
  • These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so as to execute on the computer or other programmable equipment.
  • the instructions provide steps for implementing functions specified in a flow or multiple flows in the flowchart and/or a block or multiple blocks in the block diagram.

Abstract

本申请提供一种报文传输方法、装置及系统。该方法包括：第一设备在接收到第一报文后，根据第一报文携带的第一编号满足的条件来确定采用何种方式发送该第一报文。当第一报文的第一编号满足第一条件时，第二设备确定与第一周期标签对应的第二周期标签，通过第二周期标签对应的周期向第三设备发送第一报文；当第一报文的第一编号满足第二条件时，第二设备确定与第一周期标签对应的第三周期标签，通过第三周期标签对应的周期向第三设备发送第一报文。该方法可以消除时钟误差持续漂移累积而带来的时延增大的问题，有助于避免因时延带来的第二设备发送报文时的拥塞问题。

Description

一种报文传输方法、装置及系统
相关申请的交叉引用
本申请要求在2019年07月23日提交中国专利局、申请号为201910668100.4、申请名称为“一种报文传输方法、装置及系统”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种报文传输方法、装置及系统。
背景技术
确定性网络是当前的业界热点，确定性网络的需求来自于工业互联网、智能工厂、可编程逻辑控制器(Programmable Logic Controller，PLC)拉远和云化等，也来自于增强现实(Augmented Reality，AR)或虚拟现实(Virtual Reality，VR)中的实时交互、远程手术、触觉互联网等远程实时业务。其核心在于保证业务流的端到端带宽、时延(delay)和抖动(jitter)。确定性传输指的是报文在服从一定突发性要求的前提下，报文传输所经历的时延和抖动需要满足预设的上界。
在确定性网络中，上游设备的周期与下游设备的周期之间具有映射关系，由于上游设备的出接口的周期的长度与下游设备的出接口的周期的长度相同，因而报文传输所经历的时延和抖动始终满足预设的上界。
然而，在有些应用中，上游设备的出接口的周期的长度与下游设备的出接口的周期的长度可以不相同。其中，当上游设备的出接口的周期的长度小于下游设备的出接口的周期的长度时，随着时间漂移的累积，时延无限增加，这将可能造成下游设备发送报文时持续拥塞。
发明内容
本申请提供一种报文传输方法、装置及系统，用以解决报文发送时的拥塞问题。
第一方面，本申请提供一种报文传输方法，该方法包括：第二设备从第一设备接收至少一个第一报文，所述第一报文包括第一周期标签和第一编号，所述第一报文为所述第一设备通过所述第一周期标签对应的周期发送的报文；当所述第一报文的所述第一编号满足第一条件时，所述第二设备确定与所述第一周期标签对应的第二周期标签，通过所述第二周期标签对应的周期向第三设备发送所述第一报文；当所述第一报文的所述第一编号满足第二条件时，所述第二设备确定与所述第一周期标签对应的第三周期标签，通过所述第三周期标签对应的周期向所述第三设备发送所述第一报文，所述第二周期标签对应的周期和所述第三周期标签对应的周期为不同的周期。基于该方案，第一设备在接收到第一报文后，根据第一报文携带的第一编号满足的条件来确定采用何种方式发送该第一报文。其中，当第一报文的第一编号满足第一条件时，第二设备确定与第一周期标签对应的第二周期标签， 并通过第二周期标签对应的周期向第三设备发送第一报文；当第一报文的第一编号满足第二条件时，第二设备确定与第一周期标签对应的第三周期标签，并通过第三周期标签对应的周期向第三设备发送第一报文。该方法可以消除时钟误差持续漂移累积而带来的时延增大的问题，进而有助于避免因时延带来的第二设备发送报文时的拥塞问题。并且，该基于周期的确定性发送技术不再依赖于时间同步，可以在无丢包的前提下，实现为不同设备间的时间漂移导致的周期映射关系更新。
在一种可能的实现方法中，所述第二设备通过所述第二周期标签对应的周期向第三设备发送所述第一报文之前，所述第二设备将所述第一报文包括的所述第一周期标签更新为所述第二周期标签；
所述第二设备通过所述第三周期标签对应的周期向所述第三设备发送所述第一报文之前，所述第二设备将所述第一报文包括的所述第一周期标签更新为所述第三周期标签。
在一种可能的实现方法中，所述第二设备确定所述第一编号属于第一集合，则确定所述第一报文的所述第一编号满足第一条件；所述第二设备确定所述第一编号不属于所述第一集合，则确定所述第一报文的所述第一编号满足第二条件；其中，所述第一集合用于指示周期的映射方式。或者理解为，所述第一集合用于确定周期的映射方式。
在一种可能的实现方法中，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个周期，N为正整数；若在满足周期映射关系的更新条件之后，在接收到所述第一报文之前，所述第二设备未接收到携带有所述起始编号的报文，则所述第一集合为空集；或者，所述第一集合包括所述N个编号中的从所述起始编号开始的连续L个编号；其中，当所述第一报文所在的周期与目标周期之间相隔的周期数量小于N时，所述L等于所述第一报文所在的周期与所述目标周期之间相隔的周期数量加1，或，当所述第一报文所在的周期与所述目标周期之间相隔的周期数量大于或等于N时，所述L等于N，所述目标周期为所述第一设备上的满足周期映射关系的更新条件之后的首次出现携带有所述起始编号的报文的周期，所述第一报文所在的周期不早于所述目标周期。
在一种可能的实现方法中，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个周期，N为正整数；所述第一集合包括所述N个编号中的从所述起始编号开始的连续P个编号，所述P等于所述第一报文所在的周期与满足周期更新条件之后的第一个周期之间相隔的周期数量加1。
在一种可能的实现方法中，通过所述第二周期标签对应的周期向所述第三设备发送的所述第一报文还包括所述第一编号或预设编号；通过所述第三周期标签对应的周期向所述第三设备发送的所述第一报文还包括所述第一编号。
在一种可能的实现方法中，所述第二设备从第一设备接收至少一个第一报文之前，所述第二设备确定满足周期映射关系的更新条件。
在一种可能的实现方法中，所述第二设备确定满足周期映射关系的更新条件，包括：若所述第一设备的出接口的当前周期内的报文到达所述第二设备的出接口的最晚时刻之后的所述第二设备的第一个周期，早于所述当前周期在旧周期映射关系中对应的所述第二设备的周期，则所述第二设备确定满足周期映射关系的更新条件。
第二方面，本申请提供一种报文传输方法，该方法包括：第一设备获取第一数据流的至少一个报文，所述至少一个报文的大小总和不超过所述第一数据流在所述第一设备的一个周期内的最大发送量；所述第一设备通过第一周期标签对应的周期，向第二设备发送至 少一个报文，其中，向所述第二设备发送的所述至少一个报文中的每个报文携带所述第一周期标签和第一编号。
在一种可能的实现方法中，若所述第一设备的当前周期是所述第一数据流对应的发送周期，则所述第一周期标签对应的周期为所述当前周期；若所述第一设备的当前周期是所述第一数据流对应的空闲周期，则所述第一周期标签对应的周期为所述当前周期之后的第一个发送周期。
在一种可能的实现方法中，所述第一设备对应的周期中，每连续N个发送周期之后存在K个空闲周期，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应连续N个发送周期，N为正整数，K为不大于N的正整数。
第三方面，本申请提供一种报文传输方法，该方法包括：网关设备获取第一数据流的至少一个报文，所述至少一个报文的大小总和不超过所述第一数据流在所述网关设备的一个周期内的最大发送量；若所述网关设备的当前周期是所述第一数据流对应的发送周期，则所述网关设备通过所述发送周期发送所述第一报文；若所述网关设备的当前周期是所述第一数据流对应的空闲周期，则所述网关设备通过所述空闲周期之后的第一个发送周期发送所述第一报文；其中，所述网关设备对应的周期中，每连续N个发送周期之后存在K个空闲周期，N为正整数，K为不大于N的正整数。
在一种可能的实现方法中，通过所述发送周期发送的所述第一报文还包括第一编号和所述发送周期对应的周期标签，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个发送周期，N为正整数。
第四方面，本申请提供一种报文传输装置，该装置可以是第二设备，还可以是用于第二设备的芯片。该装置具有实现上述第一方面或第一方面的各实施例的功能。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。该硬件或软件包括一个或多个与上述功能相对应的模块。
第五方面，本申请提供一种报文传输装置，该装置可以是第一设备，还可以是用于第一设备的芯片。该装置具有实现上述第二方面或第二方面的各实施例的功能。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。该硬件或软件包括一个或多个与上述功能相对应的模块。
第六方面，本申请提供一种报文传输装置，该装置可以是网关设备，还可以是用于网关设备的芯片。该装置具有实现上述第三方面或第三方面的各实施例的功能。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。该硬件或软件包括一个或多个与上述功能相对应的模块。
第七方面，本申请提供一种报文传输装置，包括：处理器和存储器；该存储器用于存储计算机执行指令，当该装置运行时，该处理器执行该存储器存储的该计算机执行指令，以使该装置执行如上述各方面所述的方法。
第八方面，本申请提供一种报文传输装置，包括：包括用于执行上述各方面的各个步骤的单元或手段(means)。
第九方面，本申请提供一种报文传输装置，包括处理器和接口电路，所述处理器用于通过接口电路与其它装置通信，并执行上述各方面所述的方法。该处理器包括一个或多个。
第十方面，本申请提供一种报文传输装置，包括处理器，用于与存储器相连，用于调用所述存储器中存储的程序，以执行上述各方面所述的方法。该存储器可以位于该装置之 内，也可以位于该装置之外。且该处理器包括一个或多个。
第十一方面，本申请还提供一种计算机可读存储介质，所述计算机可读存储介质中存储有指令，当其在计算机上运行时，使得处理器执行上述各方面所述的方法。
第十二方面，本申请还提供一种包括指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
第十三方面，本申请还提供一种芯片系统，包括：处理器，用于执行上述各方面所述的方法。
第十四方面，本申请还提供一种报文传输系统，包括：用于执行上述第一方面任意所述方法的第二设备和用于执行上述第二方面任意所述方法的第一设备。
附图说明
图1为本申请提供的一种可能的网络架构示意图；
图2为基于周期的确定性发送方法示例图；
图3为设备之间的周期边界关系示意图；
图4为上游设备的周期长度大于下游设备的周期长度的一个示例；
图5为上游设备的周期长度小于下游设备的周期长度的一个示例；
图6为本申请提供的报文传输方法示例图；
图7为本申请提供的一种报文传输方法流程示意图；
图8至图24分别为本申请提供的各个周期内的报文发送示意图；
图25为本申请提供的一种报文传输装置示意图；
图26为本申请提供的又一种报文传输装置示意图。
具体实施方式
为了使本申请的目的、技术方案和优点更加清楚，下面将结合附图对本申请作进一步地详细描述。方法实施例中的具体操作方法也可以应用于装置实施例或系统实施例中。其中，在本申请的描述中，除非另有说明，“多个”的含义是两个或两个以上。
如图1所示，为本申请适用的一种网络架构，该网络架构包括第一设备和第二设备，可选的，该网络架构还可以包括第三设备。其中，第二设备可以从第一设备接收报文，并将接收到的报文发送到第三设备。该第一设备可以是路由设备(route)、网关设备(gateway)等，该第二设备可以是网关设备、路由设备等，该第三设备可以是路由设备、网关设备等。
其中，任意两个处于上下游关系中的设备可以分别称为上游设备和下游设备。比如上述第一设备可以称为上游设备，第二设备可以称为下游设备。再比如上述第二设备可以称为上游设备，第三设备可以称为下游设备。
如图2所示，为基于周期的确定性发送方法示例图，图中包括的设备如下：发送设备(sender)、网关设备(如图中所示的网关设备1和网关设备2)、一个或多个路由设备和接收设备(reveiver)。这些设备支持周期标签交换，且可以独立运行时钟。
其中，当图2中仅有一个路由设备时，则图2中的网关设备1、路由设备和网关设备2分别可以是图1中的第一设备、第二设备和第三设备。
或者，当图2中有两个路由设备时，则图2中的网关设备1、第一个路由设备和第二 个路由设备分别可以是图1中的第一设备、第二设备和第三设备，或，图2中的第一个路由设备、第二个路由设备和网关设备2分别可以是图1中的第一设备、第二设备和第三设备。
以此类推到三个或三个以上的路由设备的情形，不再赘述。
参考图2，现有技术中的所有设备(如发送设备、网关设备1、路由设备、网关设备2)的出接口的时间轴划分成长度为T的周期，即在确定性发送的网络中，所有设备的出接口的周期是相同的，即所述网络是同步网络。
针对任意两个相邻的设备(即处于上下游关系的两个设备)，该两个设备的相近周期的边界之间的距离可以长期保持(微秒(us)级精度)不变，即在时间轴上任意两个位置|D′-D|<＝1us。如图3所示，为设备之间的周期边界关系示意图，其中，包括以下关键点：
1)、边缘整形：网关设备1对接收到的流量进行整形，按照每流每T周期字节数不超过Bi*T的方式发送，其中Bi代表每条流服务等级协议(Service-Level Agreement，SLA)规定的带宽。
2)、周期标签：比如周期标签可以是0至3循环，某个周期发送的报文中携带当前周期对应的周期标签。如图3所示，网关设备1在出接口处存在多个周期，其中，在T6周期内发送的报文中均携带周期标签6，在T7周期内发送的报文中均携带周期标签7，在T8周期内发送的报文中均携带周期标签8等等。
3)、周期之间的映射关系：网络中的两个相邻设备，上游设备的出接口的周期和下游设备的出接口的周期之间建立固定的映射关系：X映射至X+delta(delta为常数)，即上游设备的出接口的周期X内的报文发送至下游设备后，在下游设备的出接口的周期X+delta内发送。如图3所示：网关设备1的一个出接口上的周期T6映射到路由设备的一个出接口的周期T7，delta等于1，并且后续的周期也遵循这个映射关系，因此，网关设备1的上述出接口上的周期T7映射到路由设备的上述出接口的周期T8，网关设备1的上述出接口上的周期T8映射到路由设备的上述出接口的周期T9，以此类推。
其中，周期映射关系可以通过周期标签之间的映射关系来表示。
4)、周期发送：对于设备(如上述图2中的发送设备、网关设备1、路由设备、网关设备2)的一个出接口，该出接口的每个周期都有一个队列，队列索引为周期标签，队列只在周期范围内打开，其余时间关闭，需要在这个周期发送的报文根据映射后的周期标签入队。
上述方案要求全网部署1588v2，即网络中的所有设备的出接口的周期相同，以图2为例，发送设备的出接口的周期、网关设备1的出接口的周期、路由设备的出接口的周期、网关设备2的出接口的周期均相同。然而，在以后的需求中，客户希望确定性发送不依赖于1588v2，即希望不同的设备的出接口的周期可以不相同，即不同的设备是处于异步网络中的。
如果不部署1588v2，则无论用本地晶振确定各设备的周期长度，还是全网部署频率同步技术，不同设备的周期长度都会存在一定的误差，持续一段时间后有可能会出现一些问题，下面分情形说明。
情形一，上游设备的周期长度大于下游设备的周期长度
在保持上游设备的周期与下游设备的周期之间的映射关系不变的条件下，随着时间漂移的累积，上游设备的出接口的报文可能会过晚到达下游设备的出接口，从而错过映射关 系中对应的下游设备的发送周期。其本质是：上游设备的发送速率小于下游设备的发送速率。
针对该情形，一种可能的解决方案是：当下游设备检测到映射关系需要更新后，可以直接更新上游设备的周期与下游设备的周期之间的映射关系，从而可以使得上游设备的出接口的报文过晚到达下游设备的出接口时，将该报文跳过一个发送周期，在下游设备的下一个周期内发送即可。
如图4所示，为上游设备的周期长度大于下游设备的周期长度的一个示例，其中以周期的标签循环为0至3为例，路由设备1的周期与路由设备2的周期之间的映射关系为：T0映射至T3，T1映射至T0，T2映射至T1，T3映射至T2。可以看出，路由设备1的周期T1内的报文过晚到达路由设备2，因此错过了路由设备2中相应的发送周期T0，因此更新映射关系，将映射关系更新为：T0映射至T0，T1映射至T1，T2映射至T2，T3映射至T3，并且该晚到的报文通过新周期映射关系中相应的周期T1进行发送。
情形二，上游设备的周期长度小于下游设备的周期长度
在保持上游设备的周期与下游设备的周期之间的映射关系不变的条件下，随着时间漂移的累积，时延无限增加(自然数队列)或贪吃蛇问题(有限个数队列)，造成持续拥塞。其本质是：上游设备的发送速率大于下游设备的发送速率。
针对该情形，当下游设备检测到周期映射关系需要更新后，不能直接更新上游设备的周期与下游设备的周期之间的映射关系，因为如果直接更新周期映射关系，可能导致当前周期的待发送报文超过周期的发送能力。
如图5所示，为上游设备的周期长度小于下游设备的周期长度的一个示例，其中以周期的标签循环为0至3为例，路由设备1的周期与路由设备2的周期之间的映射关系为：T0映射至T3，T1映射至T0，T2映射至T1，T3映射至T2。可以看出，若将路由设备1的周期T3内的报文提前发送，即将路由设备1周期T3和周期T2内的报文一起发送，具体的，根据周期映射关系，路由设备1的周期T2映射至路由设备2的周期T1，则造成路由设备2的周期T1发送的报文较多，如果超出了路由设备2在一个周期内的报文发送能力，则可能造成报文丢失。
针对上述情形二，如何实现报文的确定性发送，以解决不同设备的时钟误差持续漂移累积的问题，则是本申请要解决的。
下面对本申请提供的报文传输方法进行说明。参考图1所示的架构，本申请方法的关键点包括：
1)、第一设备的出接口的周期的长度，小于第二设备的出接口的周期的长度。
2)、当第一设备是与发送设备存在上下游关系的网关设备(如图2中的网关设备1)，则该网络设备在发送报文时，每连续N个周期后空K个周期不发送报文，N为正整数，N为不大于N的正整数，即每连续N个发送周期后的存在K个空闲周期，发送周期指的是可用于发送报文的周期(发送周期可以发送报文也可以不发送报文)，空闲周期指的是不用于发送报文的周期。
网关设备可以逐流的发送报文，比如网关设备接收到发送设备发出的第一数据流，并转发该第一数据流，网关设备转发该第一数据流的出接口上划分出均匀周期，规定了每周期中第一数据流的发送字节数上限。例如，网关设备获取第一数据流的至少一个报文，该至少一个报文的大小总和不超过所述第一数据流在网关设备的一个周期内的最大发送量， 若网关设备的当前周期是第一数据流对应的发送周期，则网关设备通过发送周期发送所述第一报文；若网关设备的当前周期是第一数据流对应的空闲周期，则网关设备通过空闲周期之后的第一个发送周期发送第一报文。
进一步的，通过发送周期发送的第一报文还包括第一编号和发送周期对应的周期标签，该第一编号为从起始编号开始的N个编号中的一个，该N个编号对应N个发送周期。比如，起始编号为0，则N个编号可以是0至N-1。当然，也可以是不连续的N个编号，本申请不做限定。
如图6所示，为本申请提供的报文传输方法示例图，其中，每隔N(图中以N＝9为例)个周期空K(图中以K＝1为例)个周期不发送报文。每个周期都有编号，每连续N个周期对应的编号依次为0至N-1中的一个，即连续N个需要发送报文的周期依次编号为0至N-1，当然也可以是编号为1至N，或者还可以是其它编号方式。
如图6所示，发送周期的编号依次为0至8，且按照0至8的编号进行循环往复，有编号的周期即为发送周期，是可以发送报文的，没有编号的周期为空闲周期，空闲周期不发报文。
本申请中，每个报文需要携带编号和周期标签，周期标签用于指示该报文需要在哪个周期内发送出去，编号用于指示是否需要更新周期映射关系(或称为周期标签映射关系)。
3)、一个周期内可以有一个或多个数据流的报文同时发送。
以图6为例，一个周期内可以同时发送4个数据流的报文，且在同一个周期内发送的报文，不管是属于哪个数据流，携带的周期标签均相同。比如，参考图6，周期标签0对应的周期内的所有报文均携带周期标签0，但该周期内的各个报文携带的编号可以不同，分别为0-8中的一个。
4)、第一设备(包括前述的网关设备1)的周期与第二设备的周期之间具有周期映射关系。
本申请中，在映射关系更新之前，将该映射关系称为旧周期映射关系，在周期映射关系更新之后，将该周期映射关系称为新周期映射关系，并且第一设备的周期在新周期映射关系中对应的周期比该第一设备的周期在旧周期映射关系中对应的周期早K个周期。
比如参考图6，第一个箭头位置的前一个周期中的报文携带的周期标签为0，在旧周期映射关系中对应的第二设备的周期的周期标签为2(图中实线所示)，在新周期映射关系中对应的第二设备的周期的周期标签为1(图中虚线所示)。
5)、第二设备确定满足周期映射关系的更新条件的方法包括但不限于以下三种实现方法：
实现方法1、若第一目标时刻之后的第二设备的第一个周期，早于第一设备的出接口的当前周期在旧周期映射关系中对应的第二设备的周期，则第二设备确定满足周期映射关系的更新条件，其中，所述第一目标时刻为第一设备的出接口的当前周期内的报文到达第二设备的入接口的最晚时刻加上第二设备的内部处理时延的最大值所在的时刻。
作为一种实现方式，上述第一目标时刻记为t1，第一设备的出接口的当前周期内的报文到达第二设备的入接口的最晚时刻记为t2，第二设备的内部处理时延的最大值记为D，则t1＝t2+D，其中，t2＝t3+T，t3为第一设备的出接口的当前周期内的第一个报文的第一比特到达第二设备的入接口的时刻，T为第一设备发送报文的周期的长度。
实现方法2、若第二目标时刻之后的第二设备的第一个周期，早于第一设备的出接口的当前周期在旧周期映射关系中对应的第二设备的周期，则第二设备确定满足周期映射关系的更新条件，其中，所述第二目标时刻为第一设备的出接口的当前周期内的报文到达第二设备的入接口的最晚时刻加上第二设备的内部处理时延的最大值所在的时刻和第一设备与第二设备之间的链路抖动。
作为一种实现方式，上述第二目标时刻记为t4，第一设备的出接口的当前周期内的报文到达第二设备的入接口的最晚时刻记为t2，第二设备的内部处理时延的最大值记为D，第一设备与第二设备之间的链路抖动记为jitter1，则t4＝t2+D+jitter1，其中，t2＝t3+T，t3为第一设备的出接口的当前周期内的第一个报文的第一比特到达第二设备的入接口的时刻，T为第一设备发送报文的周期的长度。
实现方法3、若第一设备的出接口的当前周期内的报文到达第二设备的出接口的最晚时刻之后的第二设备的第一个周期，早于第一设备的出接口的当前周期在旧周期映射关系中对应的第二设备的周期，则第二设备确定满足周期映射关系的更新条件。
在一种实现方法中，上述第一设备的出接口的当前周期内的报文到达第二设备的出接口的最晚时刻记为t5，t5＝t6+T，其中，t6为第一设备的出接口的当前周期内的第一个报文的第一比特到达第二设备的出接口的时刻，T为第一设备发送报文的周期的长度。
在又一种实现方法中，上述第一设备的出接口的当前周期内的报文到达第二设备的出接口的最晚时刻记为t7，t7＝t6+T+jitter2，其中，t6为第一设备的出接口的当前周期内的第一个报文的第一比特到达第二设备的出接口的时刻，T为第一设备发送报文的周期的长度，jitter2为第一设备的出接口与第二设备的出接口之间的抖动，可选的，第一设备的出接口与第二设备的出接口之间的抖动为第一设备与第二设备之间的链路抖动加上第二设备内部的抖动。
下面对本申请提供的报文传输方法进行具体说明，如图7所示，该方法包括以下步骤：
步骤701，第二设备从第一设备接收至少一个第一报文，第一报文包括第一周期标签和第一编号，第一报文为第一设备通过第一周期标签对应的周期发送的报文。
需要说明的是，若这里的第一设备为图2所示的网关设备1，则该网关设备1发送报文的报文可以参考前述描述，这里不再赘述。
若这里的第一设备是除上述网关设备1之外的其它设备，如图2所示的路由设备、或网关设备2，则该第一设备可以是逐流地发送报文，比如第一设备获取第一数据流的至少一个报文，至少一个报文的大小总和不超过所述第一数据流在第一设备的一个周期内的最大发送量，然后第一设备通过第一周期标签对应的周期，向第二设备发送所述至少一个报文，其中，向第二设备发送的至少一个报文中的每个报文携带第一周期标签和第一编号。其中，第一设备对应的周期中，每连续N个发送周期之后存在K个空闲周期，发送周期可用于发送报文，空闲周期不用于发送报文。
第一编号为从起始编号开始的N个编号中的一个，N个编号对应连续N个发送周期，N为正整数，K为不大于N的正整数。比如，参考图6，N＝9，K＝1，第一编号可以是0至8中的一个，第一周期标签可以是0-3中的一个。
第一编号用于指示当前周期之前的空闲周期与所述当前周期之间的位置关系，所述当前周期指的是携带所述第一编号的报文所在的周期，该当前周期也可以称为报文周期、第 一周期等。
以N＝9，K＝1，第一编号是0至8中的一个为。当第一编号为0时，表示当前周期之前的一个周期为空闲周期；当第一编号为1时，表示当前周期往前两个周期长度的位置为空闲周期(即当前周期之前的一个周期是携带编号0的报文所在周期，携带编号0的报文所在周期之前的一个周期为空闲周期)；以此类推，不再赘述。
步骤702，当第一报文的第一编号满足第一条件时，第二设备确定与第一周期标签对应的第二周期标签，通过第二周期标签对应的周期向第三设备发送第一报文；
当第一报文的第一编号满足第二条件时，第二设备确定与第一周期标签对应的第三周期标签，通过第三周期标签对应的周期向第三设备发送第一报文，第二周期标签对应的周期和第三周期标签对应的周期为不同的周期。
基于上述实现方法，第一设备在接收到第一报文后，根据第一报文携带的第一编号满足的条件来确定采用何种方式发送该第一报文。其中，当第一报文的第一编号满足第一条件时，第二设备确定与第一周期标签对应的第二周期标签，通过第二周期标签对应的周期向第三设备发送第一报文；当第一报文的第一编号满足第二条件时，第二设备确定与第一周期标签对应的第三周期标签，通过第三周期标签对应的周期向第三设备发送第一报文。该方法可以消除时钟误差持续漂移累积而带来的时延增大的问题，进而有助于避免因时延带来的第二设备发送报文时的拥塞问题。并且，该基于周期的确定性发送技术不再依赖于时间同步，可以在无丢包的前提下，实现为不同设备间的时间漂移导致的周期映射关系更新。
在一种可能的实现方法中，第二设备通过第二周期标签对应的周期向第三设备发送第一报文之前，还将第一报文包括的第一周期标签更新为第二周期标签。即第二设备通过第二周期标签对应的周期向第三设备发送的第一报文中携带的周期标签为第二周期标签。比如，参考图6，以第二个箭头指示的位置为例，第二设备接收到的该周期内的报文中携带的周期标签均为0(即第一周期标签)，并且数据流1的报文携带编号6，数据流3的报文携带编号5，数据流4的报文携带编号3。第二设备在发送该周期内的报文中，将报文中的周期标签均修改为1(即第二周期标签)。其中，这里的第一周期标签与第二周期标签是新周期映射关系下的周期标签之间的映射。
第二设备通过第三周期标签对应的周期向第三设备发送第一报文之前，将第一报文包括的第一周期标签更新为第三周期标签。即第二设备通过第三周期标签对应的周期向第三设备发送的第一报文中携带的周期标签为第三周期标签。比如，参考图6，以第二个箭头指示的位置为例，第二设备接收到的该周期内的报文中携带的周期标签均为0(即第一周期标签)，并且数据流1的报文携带编号6，数据流3的报文携带编号5，数据流4的报文携带编号3。第二设备在发送该周期内的报文中，将报文中的周期标签均修改为2(即第三周期标签)。其中，这里的第一周期标签与第三周期标签是旧周期映射关系下的周期标签之间的映射。
需要说明的是，第二设备只会通过上述两种映射关系(即新周期映射关系和旧周期映射关系)中的一种，来确定发送报文的周期及相应的周期标签。
作为一种实现方法，上述步骤702中，可以通过以下方法判断第一报文的第一编号满足何种条件：第二设备确定第一编号属于第一集合，则确定第一报文的第一编号满足第一条件；第二设备确定第一编号不属于第一集合，则确定第一报文的第一编号满足第二条件； 其中，第一集合用于指示周期的映射方式。
在一种实现方法中，上述第一集合的确定方式如下：
若在满足周期映射关系的更新条件之后，在接收到第一报文之前，第二设备未接收到携带有起始编号的报文，则第一集合为空集；或者，
第一集合包括N个编号中的从起始编号开始的连续L个编号；其中，当第一报文所在的周期与目标周期之间相隔的周期数量小于N时，L等于第一报文所在的周期与目标周期之间相隔的周期数量加1，或，当第一报文所在的周期与目标周期之间相隔的周期数量大于或等于N时，L等于N，目标周期为第一设备上的满足周期映射关系的更新条件之后的首次出现携带有起始编号的报文的周期，所述第一报文所在的周期不早于所述目标周期。比如，以起始编号为0为例，第一报文所在的周期与目标周期之间相隔的周期数量等于0时，第一集合为{0}；第一报文所在的周期与目标周期之间相隔的周期数量等于1时，第一集合为{0、1}；……，第一报文所在的周期与目标周期之间相隔的周期数量等于N-1时，第一集合为{0、1、2、……、N-1}，第一报文所在的周期与目标周期之间相隔的周期数量大于或等于N时，第一集合为{0、1、2、……、N-1}。
在又一种实现方法中，上述第一集合的确定方式如下：
第一集合包括N个编号中的从起始编号开始的连续P个编号，P等于第一报文所在的周期与满足周期更新条件之后的第一个周期之间相隔的周期数量加1。比如，以起始编号为0为例，第一报文所在的周期与满足周期更新条件之后的第一个周期之间相隔的周期数量等于0时，则第一集合为{0}；第一报文所在的周期与满足周期更新条件之后的第一个周期之间相隔的周期数量等于1时，则第一集合为{0、1}；……；第一报文所在的周期与满足周期更新条件之后的第一个周期之间相隔的周期数量等于N-1时，则第一集合为{0、1、2，……、N-1}。
以上是通过第一集合来指示或确定周期的映射方式。当然，也可以使用其他方式来指示周期的映射方式，下面介绍说明。
在一种实现方法中，第二设备确定第一编号属于第一集合，则确定第一报文的第一编号满足第一条件；进而，第二设备确定与第一周期标签对应的第二周期标签，通过第二周期标签对应的周期向第三设备发送第一报文。第二设备确定第一编号属于第二集合，则确定第一报文的第一编号满足第二条件；第二设备确定与第一周期标签对应的第三周期标签，通过第三周期标签对应的周期向第三设备发送所述第一报文。
需要说明的是，还可以包括其他集合，比如第三集合、第四集合、第五集合等。所述第三集合、第四集合、第五集合等，与上述第一集合、第二集合的用途不同，比如第三集合用于确定丢失的报文、第四集合用于确定发送第一报文的周期，该周期与上述第二周期标签对应的周期、第三周期标签对应的周期均不同。
作为一种实现方法，通过第二周期标签对应的周期向第三设备发送的第一报文还包括第一编号或预设编号；通过第三周期标签对应的周期向第三设备发送的第一报文还包括第一编号。这里的预设编号是与第一编号不同的任意编号，只要能够与第一编号加以区别即可，比如第一编号为0至N-1中的一个，则第一编号为除0至N-1之外的任意符号。
作为一种实现方法，当第一报文属于编号集合时，则通过第二周期标签对应的周期向第三设备发送的第一报文包括预设编号。上述编号集合是动态变化的。以N个编号分别为0至N-1为例，则所述编号集合的动态变化过程为：空集、{0}、{0、1}、……{0、1、……、 X}、{1、……、X+1}、{2、……、X+2}、……、{N-X-1、……、N-2、N-1}、{N-X、……、N-2、N-1}、{N-X+2、……、N-2、N-1}、……、{N-2、N-1}、{N-1}、空集。其中，X为0至N-1中的一个整数，第X个周期是第一次出现整个周期的全部报文均按照新周期映射关系进行发送的周期。
作为一种实现方法，上述步骤701之前，第二设备确定满足周期映射关系的更新条件。即当第二设备确定满足周期映射关系的更新条件时，执行图2所示的报文传输方法。其中，第二设备确定满足周期映射关系的更新条件可以参考前述描述，这里不再赘述。
图7所示的方案可以是针对一条数据流或多条数据流。下面对图7所示的方案执行的每个步骤进行具体说明。其中，第一设备的每N个连续发送周期之后空闲一个(即上述K＝1)周期，上述预设编号用“F”表示，N个编号分别为0至N-1，满足周期映射关系更新条件后的第M个周期为目标周期(即第一设备上的满足周期映射关系的更新条件之后的首次出现携带有起始编号0的报文的周期)。
上述图7所示的方法在具体实现中，可以参照如下流程执行：
第二设备从第1个周期开始，逐周期检查当前周期中是否有携带编号0的报文，直到第M个周期，第一次检查到携带编号0的报文，M为小于或等于N的正整数；
第二设备将第M个周期内的携带编号0的报文的编号修改为F，并按照新周期映射关系映射至相应的周期进行发送，以及，将第M个周期内的其他报文，按照旧周期映射关系映射至相应的周期进行发送；
第二设备将第M+1个周期内的携带编号0或1的报文的编号修改为F，并按照新周期映射关系映射至相应的周期进行发送，以及，将第M+1个周期内的其他报文，按照旧周期映射关系映射至相应的周期进行发送；
第二设备将第M+2个周期内的携带编号0、1或2的报文的编号修改为F，并按照新周期映射关系映射至相应的周期进行发送，以及，将第M+2个周期内的其他报文，按照旧周期映射关系映射至相应的周期进行发送；
……
第二设备将第M+X(0<＝X<＝N-1)个周期内的携带编号0、1、2、……、或X的报文的编号修改为F，并按照新周期映射关系映射至相应的周期进行发送，以及，将第M+X个周期内的其他报文，按照旧周期映射关系映射至相应的周期进行发送，X为0至N-1中的一个整数，第X个周期是第一次出现整个周期的全部报文均按照新周期映射关系进行发送的周期；
第二设备将第M+X+1个周期内的携带编号1、2、……、X、或X+1的报文的编号修改为F，并按照新周期映射关系映射至相应的周期进行发送；
第二设备将第M+X+2个周期内的携带编号2、……、X+1、或X+2的报文的编号修改为F，并按照新周期映射关系映射至相应的周期进行发送；
……
第二设备将第M+N-1个周期内的携带编号N-X-1、……、N-2、或N-1的报文的编号修改为F，并按照新周期映射关系映射至相应的周期进行发送；
第二设备将第M+N个周期内的携带编号N-X、……、N-2、或N-1的报文的编号修改为F，并按照新周期映射关系映射至相应的周期进行发送；
……
第二设备将第M+N+X-1个周期内的携带编号N-1的报文的编号修改为F，并按照新周期映射关系映射至相应的周期进行发送。
需要说明的是，本申请中也可以不需要在报文中携带上述预设编号，如果不在报文中携带预设编号，则最迟在N-1个周期之后，所有的报文必然会通过新周期映射关系转发。
下面结合一个具体示例对本申请上述方案进行说明。其中，第一设备向第二设备同时发送4条数据流的报文，该4条数据流分别表示为数据流1、数据流2、数据流3、数据流4。上述预设编号用“F”表示。其中，图8至图24分别为网络中的各个周期的报文发送示意图。
如图8所示，上半部分代表第二设备的入接口，显示的是上一跳设备的出接口的周期，下半部分代表该第二设备的出接口，显示的是该第二设备的出接口的周期，垂直的虚线代表周期的边界。
在检测到需要更新映射关系后的一段时间内，同时维护了新周期映射关系(图中虚线箭头)和旧周期映射关系(图中实线箭头)，这段时间过后，只剩下实线箭头，代表旧周期映射关系被删除了，此时实线箭头代表新周期映射关系。
周期映射关系刷新步骤如下所示：
1)、在检测到需要更新周期映射关系后，第1个周期如图9所示：
这个周期中数据流1没有发送报文，数据流2的报文的编号全部为2，数据流3的报文的编号全部为8，数据流4的报文的编号全部为6，这个周期中没有收到任何一个编号为0的报文，因此全部按照旧周期映射关系发送。
2)、第2个周期(即上述第M个周期，也即首次出现的携带编号0的报文对应的周期)如图10所示：
这个周期第一次出现了编号为0的报文，所有编号为0的报文按照新周期映射关系转发，其余编号的报文按照旧周期映射关系转发。
具体的，这个周期中数据流1的报文的编号全部为0，数据流2的报文的编号全部为3，数据流3没有发送报文，数据流4的报文的编号全部为7，这个周期中所有编号为0的报文(即数据流1的报文)按照新周期映射关系发送，并把报文携带的编号修改为F，其余流也就是数据流2、4按照旧周期映射关系发送。
3)、第3个周期如图11所示：
这个周期所有编号为0、1的报文按照新周期映射关系转发，其余编号的报文按照旧周期映射关系转发。
具体的，这个周期中数据流1的报文的编号全部为1，数据流2的报文的编号全部为4，数据流3的报文的编号全部为0，数据流4的报文的编号全部为8，这个周期中所有编号为0、或1的报文(即数据流1、3的报文)按照新周期映射关系发送，并把报文携带的编号修改为F，其余流(即数据流2、4)按照旧周期映射关系发送。
4)、第4个周期如图12所示：
这个周期所有编号为0、1、2的报文按照新周期映射关系转发，其余编号的报文按照旧周期映射关系转发。
具体的，这个周期中数据流1的报文的编号全部为2，数据流2的报文的编号全部为 5，数据流3的报文的编号全部为1，数据流4没有发送报文，这个周期中所有编号为0、1、或2的报文(即数据流1、3的报文)按照新周期映射关系发送，并把报文携带的编号修改为F，其余流(即数据流2)的报文按照旧周期映射关系发送。
5)、第5个周期如图13所示：
这个周期所有编号为0、1、2、3的报文按照新周期映射关系转发，其余编号的报文按照旧周期映射关系转发。
具体的，这个周期中数据流1的报文的编号全部为3，数据流2的报文的编号全部为6，数据流3的报文的编号全部为2，数据流4的报文的编号全部为0，这个周期中所有编号为0、1、2、或3的报文(即数据流1、3、4的报文)按照新周期映射关系发送，并把报文携带的编号修改为F，其余流(即数据流2)按照旧周期映射关系发送。
6)、第6个周期如图14所示：
这个周期所有编号为0、1、2、3、4的报文按照新周期映射关系转发，其余编号的报文按照旧周期映射关系转发。
具体的，这个周期中数据流1的报文的编号全部为4，数据流2的报文的编号全部为7，数据流3的报文的编号全部为3，数据流4的报文的编号全部为1，这个周期中所有编号为0、1、2、3、或4的报文(即数据流1、3、4的报文)按照新周期映射关系发送，并把报文携带的编号修改为F，其余流(即数据流2)按照旧周期映射关系发送。
7)、第7个周期如图15所示：
这个周期所有编号为0、1、2、3、4、5的报文按照新周期映射关系转发，其余编号的报文按照旧周期映射关系转发。
具体的，这个周期中数据流1的报文的编号全部为5，数据流2的报文的编号全部为8，数据流3的报文的编号全部为4，数据流4的报文的编号全部为2，这个周期中所有编号为0、1、2、3、4、或5的报文(即数据流1、3、4的报文)按照新周期映射关系发送，并把报文携带的编号修改为F，其余流(即数据流2)按照旧周期映射关系发送。
8)、第8个周期如图16所示：
这个周期所有编号为0、1、2、3、4、5、6的报文按照新周期映射关系转发，其余编号的报文按照旧周期映射关系转发。
具体的，这个周期中数据流1的报文的编号全部为6，数据流2没有发送报文，数据流3的报文的编号全部为5，数据流4的报文的编号全部为3，这个周期中所有编号为0、1、2、3、4、5、或6的报文(即数据流1、3、4的报文)按照新周期映射关系发送，并把报文携带的编号修改为F。
9)、第9(也就是第M+X，X为7)个周期如图17所示：
所有报文按照新的映射关系交换周期标签，删除旧周期映射关系，后续报文全部按照新的映射关系交换周期标签，并把所有编号为0至X即编号为0、1、2、3、4、5、6、或7的报文(即数据流1、2、3、4的报文)携带的编号修改为F。
10)、第10个周期如图18所示：
报文全部按照新的映射关系交换周期标签，并把所有编号为1至X+1(正好是N-X-1至N-1)即编号为1、2、3、4、5、6、7、或8报文(即数据流1、2、3、4的报文)携带的编号修改为F。
11)、第11个周期如图19所示：
报文全部按照新的映射关系交换周期标签，并把所有编号为N-X至N-1即编号为2、3、4、5、6、7、或8的报文(即数据流2、3、4的报文)携带的编号修改为F。
12)、第12个周期如图20所示：
报文全部按照新的映射关系交换周期标签，并把所有编号为N-X+1至N-1即编号为3、4、5、6、7、或8的报文(即数据流2、4的报文)携带的编号修改为F。
13)、后续若干周期(即第13至第15个周期)和上述操作类似，不再赘述。
14)、第16个周期如图21所示：
报文全部按照新的映射关系交换周期标签，并把所有编号为N-X+5至N-1即编号为7、或8的报文(即数据流2的报文)携带的编号修改为F。
15)、第17个(M+N+X-1)周期如图22所示：
报文全部按照新的映射关系交换周期标签，并把所有编号为N-X+6至N-1即编号为8的报文(即数据流2的报文)携带的编号修改为F。自此整个映射关系刷新过程结束。
16)、第18个周期如图23所示：
报文全部按照新的映射关系交换周期标签。
17)、后续第19个周期以及之后的周期如图24所示：
报文全部按照新的映射关系交换周期标签。
上述主要从各个网元之间交互的角度对本申请提供的方案进行了介绍。可以理解的是，上述实现各网元为了实现上述功能，其包含了执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该很容易意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，本发明能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本发明的范围。
如图25所示，为本申请所涉及的报文传输装置的一种可能的示例性框图，该装置2500可以以软件或硬件的形式存在。装置2500可以包括：处理单元2502和通信单元2501。作为一种实现方式，该通信单元2501可以包括接收单元和发送单元。处理单元2502用于对装置2500的动作进行控制管理。通信单元2501用于支持装置2500与其他网络实体的通信。
其中，处理单元2502可以是处理器或控制器，例如可以是通用中央处理器(central processing unit，CPU)，通用处理器，数字信号处理(digital signal processing，DSP)，专用集成电路(application specific integrated circuits，ASIC)，现场可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件、晶体管逻辑器件、硬件部件或者其任意组合。其可以实现或执行结合本申请公开内容所描述的各种示例性的逻辑方框，模块和电路。所述处理器也可以是实现计算功能的组合，例如包括一个或多个微处理器组合，DSP和微处理器的组合等等。通信单元2501是一种该装置的接口电路，用于从其它装置接收信号。例如，当该装置以芯片的方式实现时，该通信单元2501是该芯片用于从其它芯片或装置接收信号的接口电路，或者是该芯片用于向其它芯片或装置发送信号的接口电路。
该装置2500可以为上述任一实施例中的第二设备、网关设备、或第一设备，还可以 为用于第二设备、网关设备、或第一设备的芯片。例如，当装置2500为第二设备时，该处理单元2502例如可以是处理器，该通信单元2501例如可以是收发器。可选的，该收发器可以包括射频电路。例如，当装置2500为用于第二设备的芯片时，该处理单元2502例如可以是处理器，该通信单元2501例如可以是输入/输出接口、管脚或电路等。该处理单元2502可执行存储单元存储的计算机执行指令，可选地，该存储单元为该芯片内的存储单元，如寄存器、缓存等，该存储单元还可以是该第二设备内的位于该芯片外部的存储单元，如只读存储器(read-only memory，ROM)或可存储静态信息和指令的其他类型的静态存储设备，随机存取存储器(random access memory，RAM)等。
在一个实施例中，该装置2500为上述第二设备，所述通信单元2501，用于从第一设备接收至少一个第一报文，所述第一报文包括第一周期标签和第一编号，所述第一报文为所述第一设备通过所述第一周期标签对应的周期发送的报文；所述处理单元2502，用于当所述第一报文的所述第一编号满足第一条件时，确定与所述第一周期标签对应的第二周期标签；所述通信单元2501还用于，通过所述第二周期标签对应的周期向第三设备发送所述第一报文；所述处理单元2502，还用于当所述第一报文的所述第一编号满足第二条件时，确定与所述第一周期标签对应的第三周期标签；所述通信单元2501，还用于通过所述第三周期标签对应的周期向所述第三设备发送所述第一报文，所述第二周期标签对应的周期和所述第三周期标签对应的周期为不同的周期。
在一种可能的实现方法中，所述处理单元2502，还用于：在所述通信单元2501通过所述第二周期标签对应的周期向第三设备发送所述第一报文之前，将所述第一报文包括的所述第一周期标签更新为所述第二周期标签；在所述通信单元2501通过所述第三周期标签对应的周期向所述第三设备发送所述第一报文之前，将所述第一报文包括的所述第一周期标签更新为所述第三周期标签。
在一种可能的实现方法中，所述处理单元2502，还用于：确定所述第一编号属于第一集合，则确定所述第一报文的所述第一编号满足第一条件；确定所述第一编号不属于所述第一集合，则确定所述第一报文的所述第一编号满足第二条件；其中，所述第一集合用于指示周期的映射方式。
在一种可能的实现方法中，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个周期，N为正整数；若在满足周期映射关系的更新条件之后，在接收到所述第一报文之前，所述通信单元2501未接收到携带有所述起始编号的报文，则所述第一集合为空集；或者，所述第一集合包括所述N个编号中的从所述起始编号开始的连续L个编号；其中，当所述第一报文所在的周期与目标周期之间相隔的周期数量小于N时，所述L等于所述第一报文所在的周期与所述目标周期之间相隔的周期数量加1，或，当所述第一报文所在的周期与所述目标周期之间相隔的周期数量大于或等于N时，所述L等于N，所述目标周期为所述第一设备上的满足周期映射关系的更新条件之后的首次出现携带有所述起始编号的报文的周期，所述第一报文所在的周期不早于所述目标周期。
在一种可能的实现方法中，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个周期，N为正整数；所述第一集合包括所述N个编号中的从所述起始编号开始的连续P个编号，所述P等于所述第一报文所在的周期与满足周期更新条件之后的第一个周期之间相隔的周期数量加1。
在一种可能的实现方法中，通过所述第二周期标签对应的周期向所述第三设备发送的 所述第一报文还包括所述第一编号或预设编号；通过所述第三周期标签对应的周期向所述第三设备发送的所述第一报文还包括所述第一编号。
在一种可能的实现方法中，所述处理单元2502，还用于在所述通信单元2501从第一设备接收至少一个第一报文之前，确定满足周期映射关系的更新条件。
在一种可能的实现方法中，所述处理单元2502，具体用于若所述第一设备的出接口的当前周期内的报文到达所述装置的出接口的最晚时刻之后的所述装置的第一个周期，早于所述当前周期在旧周期映射关系中对应的所述装置的周期，则确定满足周期映射关系的更新条件；其中，所述第一设备的出接口的当前周期内的报文到达所述装置的出接口的最晚时刻用t1表示，且t1＝t0+T+D，t0为所述当前周期内的第一个报文的第一比特到达所述装置的入接口的时刻，T为所述第一设备发送报文的周期的长度，D为所述装置的内部处理时延的最大值。
在又一个实施例中，该装置2500为上述第一设备，通信单元2501包括发送单元和接收单元。接收单元，用于获取第一数据流的至少一个报文，所述至少一个报文的大小总和不超过所述第一数据流在所述装置的一个周期内的最大发送量；发送单元，用于通过第一周期标签对应的周期，向第二设备发送至少一个报文，其中，向所述第二设备发送的所述至少一个报文中的每个报文携带所述第一周期标签和第一编号。
在一种可能的实现方法中，若所述第一设备的当前周期是所述第一数据流对应的发送周期，则所述第一周期标签对应的周期为所述当前周期；若所述第一设备的当前周期是所述第一数据流对应的空闲周期，则所述第一周期标签对应的周期为所述当前周期之后的第一个发送周期。
在一种可能的实现方法中，所述第一装置对应的周期中，每连续N个发送周期之后存在K个空闲周期，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应连续N个周期，N为正整数，K为不大于N的正整数。
在又一个实施例中，该装置2500为上述网关设备，通信单元2501包括发送单元和接收单元。接收单元，用于获取第一数据流的至少一个报文，所述至少一个报文的大小总和不超过所述第一数据流在所述网关设备的一个周期内的最大发送量；发送单元，用于若所述装置的当前周期是所述第一数据流对应的发送周期，则通过所述发送周期发送所述第一报文；若所述装置的当前周期是所述第一数据流对应的空闲周期，则通过所述空闲周期之后的第一个发送周期发送所述第一报文；其中，所述装置对应的周期中，每连续N个发送周期之后存在K个空闲周期，N为正整数，K为不大于N的正整数。
在一种可能的实现方法中，通过所述发送周期发送的所述第一报文还包括第一编号和所述发送周期对应的周期标签，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个发送周期，N为正整数。
可以理解的是，该装置用于上述报文传输方法时的具体实现过程以及相应的有益效果，可以参考前述方法实施例中的相关描述，这里不再赘述。
如图26所示，为本申请提供的一种报文传输装置示意图，该装置可以是上述实施例中的第二设备、网关设备、或第一设备。该装置2600包括：处理器2602、通信接口2603、存储器2601。可选的，装置2600还可以包括通信线路2604。其中，通信接口2603、处理器2602以及存储器2601可以通过通信线路2604相互连接；通信线路2604可以是外设部 件互连标准(peripheral component interconnect，简称PCI)总线或扩展工业标准结构(extended industry standard architecture，简称EISA)总线等。所述通信线路2604可以分为地址总线、数据总线、控制总线等。为便于表示，图26中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
处理器2602可以是一个CPU，微处理器，ASIC，或一个或多个用于控制本申请方案程序执行的集成电路。
通信接口2603，使用任何收发器一类的装置，用于与其他设备或通信网络通信，如以太网，无线接入网(radio access network，RAN)，无线局域网(wireless local area networks，WLAN)，有线接入网等。
存储器2601可以是ROM或可存储静态信息和指令的其他类型的静态存储设备，RAM或者可存储信息和指令的其他类型的动态存储设备，也可以是电可擦可编程只读存储器(electrically erasable programmable read-only memory，EEPROM)、只读光盘(compact disc read-only memory，CD-ROM)或其他光盘存储、光碟存储(包括压缩光碟、激光碟、光碟、数字通用光碟、蓝光光碟等)、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。存储器可以是独立存在，通过通信线路2604与处理器相连接。存储器也可以和处理器集成在一起。
其中，存储器2601用于存储执行本申请方案的计算机执行指令，并由处理器2602来控制执行。处理器2602用于执行存储器2601中存储的计算机执行指令，从而实现本申请上述实施例提供的报文传输方法。
可选的，本申请实施例中的计算机执行指令也可以称之为应用程序代码，本申请实施例对此不作具体限定。
本领域普通技术人员可以理解：本申请中涉及的第一、第二等各种数字编号仅为描述方便进行的区分，并不用来限制本申请实施例的范围，也表示先后顺序。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。字符“/”一般表示前后关联对象是一种“或”的关系。“至少一个”是指一个或者多个。至少两个是指两个或者多个。“至少一个”、“任意一个”或其类似表达，是指的这些项中的任意组合，包括单项(个)或复数项(个)的任意组合。例如，a,b,或c中的至少一项(个、种)，可以表示：a,b,c,a-b,a-c,b-c,或a-b-c，其中a,b,c可以是单个，也可以是多个。“多个”是指两个或两个以上，其它量词与之类似。此外，对于单数形式“a”，“an”和“the”出现的元素(element)，除非上下文另有明确规定，否则其不意味着“一个或仅一个”，而是意味着“一个或多于一个”。例如，“a device”意味着对一个或多个这样的device。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、 数字用户线(DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包括一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，DVD)、或者半导体介质(例如固态硬盘(Solid State Disk，SSD))等。
本申请实施例中所描述的各种说明性的逻辑单元和电路可以通过通用处理器，数字信号处理器，专用集成电路(ASIC)，现场可编程门阵列(FPGA)或其它可编程逻辑装置，离散门或晶体管逻辑，离散硬件部件，或上述任何组合的设计来实现或操作所描述的功能。通用处理器可以为微处理器，可选地，该通用处理器也可以为任何传统的处理器、控制器、微控制器或状态机。处理器也可以通过计算装置的组合来实现，例如数字信号处理器和微处理器，多个微处理器，一个或多个微处理器联合一个数字信号处理器核，或任何其它类似的配置来实现。
本申请实施例中所描述的方法或算法的步骤可以直接嵌入硬件、处理器执行的软件单元、或者这两者的结合。软件单元可以存储于RAM存储器、闪存、ROM存储器、EPROM存储器、EEPROM存储器、寄存器、硬盘、可移动磁盘、CD-ROM或本领域中其它任意形式的存储媒介中。示例性地，存储媒介可以与处理器连接，以使得处理器可以从存储媒介中读取信息，并可以向存储媒介存写信息。可选地，存储媒介还可以集成到处理器中。处理器和存储媒介可以设置于ASIC中。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管结合具体特征及其实施例对本申请进行了描述，显而易见的，在不脱离本申请的精神和范围的情况下，可对其进行各种修改和组合。相应地，本说明书和附图仅仅是所附权利要求所界定的本申请的示例性说明，且视为已覆盖本申请范围内的任意和所有修改、变化、组合或等同物。显然，本领域的技术人员可以对本申请进行各种改动和变型而不脱离本申请的范围。这样，倘若本申请的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包括这些改动和变型在内。

Claims (27)

  1. 一种报文传输方法，其特征在于，包括：
    第二设备从第一设备接收至少一个第一报文，所述第一报文包括第一周期标签和第一编号，所述第一报文为所述第一设备通过所述第一周期标签对应的周期发送的报文；
    当所述第一报文的所述第一编号满足第一条件时，所述第二设备确定与所述第一周期标签对应的第二周期标签，通过所述第二周期标签对应的周期向第三设备发送所述第一报文；
    当所述第一报文的所述第一编号满足第二条件时，所述第二设备确定与所述第一周期标签对应的第三周期标签，通过所述第三周期标签对应的周期向所述第三设备发送所述第一报文，所述第二周期标签对应的周期和所述第三周期标签对应的周期为不同的周期。
  2. 如权利要求1所述的方法，其特征在于，所述第二设备通过所述第二周期标签对应的周期向第三设备发送所述第一报文之前，还包括：
    所述第二设备将所述第一报文包括的所述第一周期标签更新为所述第二周期标签；
    所述第二设备通过所述第三周期标签对应的周期向所述第三设备发送所述第一报文之前，还包括：
    所述第二设备将所述第一报文包括的所述第一周期标签更新为所述第三周期标签。
  3. 如权利要求1或2所述的方法，其特征在于，所述方法还包括：
    所述第二设备确定所述第一编号属于第一集合，则确定所述第一报文的所述第一编号满足第一条件；
    所述第二设备确定所述第一编号不属于所述第一集合，则确定所述第一报文的所述第一编号满足第二条件。
  4. 如权利要求3所述的方法，其特征在于，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个周期，N为正整数；
    若在满足周期映射关系的更新条件之后，在接收到所述第一报文之前，所述第二设备未接收到携带有所述起始编号的报文，则所述第一集合为空集；或者，
    所述第一集合包括所述N个编号中的从所述起始编号开始的连续L个编号；其中，当所述第一报文所在的周期与目标周期之间相隔的周期数量小于N时，所述L等于所述第一报文所在的周期与所述目标周期之间相隔的周期数量加1，或，当所述第一报文所在的周期与所述目标周期之间相隔的周期数量大于或等于N时，所述L等于N，所述目标周期为所述第一设备上的满足周期映射关系的更新条件之后的首次出现携带有所述起始编号的报文的周期，所述第一报文所在的周期不早于所述目标周期。
  5. 如权利要求3所述的方法，其特征在于，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个周期，N为正整数；
    所述第一集合包括所述N个编号中的从所述起始编号开始的连续P个编号，所述P等于所述第一报文所在的周期与满足周期更新条件之后的第一个周期之间相隔的周期数量加1。
  6. 如权利要求3-5任一所述的方法，其特征在于，通过所述第二周期标签对应的周期向所述第三设备发送的所述第一报文还包括所述第一编号或预设编号；
    通过所述第三周期标签对应的周期向所述第三设备发送的所述第一报文还包括所述 第一编号。
  7. 如权利要求1-6任一所述的方法，其特征在于，所述第二设备从第一设备接收至少一个第一报文之前，还包括：
    所述第二设备确定满足周期映射关系的更新条件。
  8. 如权利要求7所述的方法，其特征在于，所述第二设备确定满足周期映射关系的更新条件，包括：
    若所述第一设备的出接口的当前周期内的报文到达所述第二设备的出接口的最晚时刻之后的所述第二设备的第一个周期，早于所述当前周期在旧周期映射关系中对应的所述第二设备的周期，则所述第二设备确定满足周期映射关系的更新条件。
  9. 一种报文传输方法，其特征在于，包括：
    第一设备获取第一数据流的至少一个报文，所述至少一个报文的大小总和不超过所述第一数据流在所述第一设备的一个周期内的最大发送量；
    所述第一设备通过第一周期标签对应的周期，向第二设备发送至少一个报文，其中，向所述第二设备发送的所述至少一个报文中的每个报文携带所述第一周期标签和第一编号。
  10. 如权利要求9所述的方法，其特征在于，若所述第一设备的当前周期是所述第一数据流对应的发送周期，则所述第一周期标签对应的周期为所述当前周期；
    若所述第一设备的当前周期是所述第一数据流对应的空闲周期，则所述第一周期标签对应的周期为所述当前周期之后的第一个发送周期。
  11. 如权利要求10所述的方法，其特征在于，所述第一设备对应的周期中，每连续N个发送周期之后存在K个空闲周期，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应连续N个发送周期，N为正整数，K为不大于N的正整数。
  12. 一种报文传输装置，其特征在于，包括处理单元和通信单元；
    所述通信单元，用于从第一设备接收至少一个第一报文，所述第一报文包括第一周期标签和第一编号，所述第一报文为所述第一设备通过所述第一周期标签对应的周期发送的报文；
    所述处理单元，用于当所述第一报文的所述第一编号满足第一条件时，确定与所述第一周期标签对应的第二周期标签；所述通信单元还用于，通过所述第二周期标签对应的周期向第三设备发送所述第一报文；
    所述处理单元，还用于当所述第一报文的所述第一编号满足第二条件时，确定与所述第一周期标签对应的第三周期标签；所述通信单元，还用于通过所述第三周期标签对应的周期向所述第三设备发送所述第一报文，所述第二周期标签对应的周期和所述第三周期标签对应的周期为不同的周期。
  13. 如权利要求12所述的装置，其特征在于，所述处理单元，还用于：
    在所述通信单元通过所述第二周期标签对应的周期向第三设备发送所述第一报文之前，将所述第一报文包括的所述第一周期标签更新为所述第二周期标签；
    在所述通信单元通过所述第三周期标签对应的周期向所述第三设备发送所述第一报文之前，将所述第一报文包括的所述第一周期标签更新为所述第三周期标签。
  14. 如权利要求12或13所述的装置，其特征在于，所述处理单元，还用于：
    确定所述第一编号属于第一集合，则确定所述第一报文的所述第一编号满足第一条件；
    确定所述第一编号不属于所述第一集合，则确定所述第一报文的所述第一编号满足第二条件。
  15. 如权利要求14所述的装置，其特征在于，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个周期，N为正整数；
    若在满足周期映射关系的更新条件之后，在接收到所述第一报文之前，所述通信单元未接收到携带有所述起始编号的报文，则所述第一集合为空集；或者，
    所述第一集合包括所述N个编号中的从所述起始编号开始的连续L个编号；其中，当所述第一报文所在的周期与目标周期之间相隔的周期数量小于N时，所述L等于所述第一报文所在的周期与所述目标周期之间相隔的周期数量加1，或，当所述第一报文所在的周期与所述目标周期之间相隔的周期数量大于或等于N时，所述L等于N，所述目标周期为所述第一设备上的满足周期映射关系的更新条件之后的首次出现携带有所述起始编号的报文的周期，所述第一报文所在的周期不早于所述目标周期。
  16. 如权利要求14所述的装置，其特征在于，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应N个周期，N为正整数；
    所述第一集合包括所述N个编号中的从所述起始编号开始的连续P个编号，所述P等于所述第一报文所在的周期与满足周期更新条件之后的第一个周期之间相隔的周期数量加1。
  17. 如权利要求14-16任一所述的装置，其特征在于，通过所述第二周期标签对应的周期向所述第三设备发送的所述第一报文还包括所述第一编号或预设编号；
    通过所述第三周期标签对应的周期向所述第三设备发送的所述第一报文还包括所述第一编号。
  18. 如权利要求12-17任一所述的装置，其特征在于，所述处理单元，还用于在所述通信单元从第一设备接收至少一个第一报文之前，确定满足周期映射关系的更新条件。
  19. 如权利要求18所述的装置，其特征在于，所述处理单元，具体用于若所述第一设备的出接口的当前周期内的报文到达所述装置的出接口的最晚时刻之后的所述装置的第一个周期，早于所述当前周期在旧周期映射关系中对应的所述装置的周期，则确定满足周期映射关系的更新条件。
  20. 一种报文传输装置，其特征在于，包括：
    接收单元，用于获取第一数据流的至少一个报文，所述至少一个报文的大小总和不超过所述第一数据流在所述装置的一个周期内的最大发送量；
    发送单元，用于通过第一周期标签对应的周期，向第二设备发送至少一个报文，其中，向所述第二设备发送的所述至少一个报文中的每个报文携带所述第一周期标签和第一编号。
  21. 如权利要求20所述的装置，其特征在于，若第一设备的当前周期是所述第一数据流对应的发送周期，则所述第一周期标签对应的周期为所述当前周期；
    若第一设备的当前周期是所述第一数据流对应的空闲周期，则所述第一周期标签对应的周期为所述当前周期之后的第一个发送周期。
  22. 如权利要求21所述的装置，其特征在于，所述第一装置对应的周期中，每连续N个发送周期之后存在K个空闲周期，所述第一编号为从起始编号开始的N个编号中的一个，所述N个编号对应连续N个发送周期，N为正整数，K为不大于N的正整数。
  23. 一种报文传输装置，其特征在于，包括处理器和存储器，所述处理器调用所述存储器中存储的程序，以使得所述装置执行如权利要求1-8任一所述的方法。
  24. 一种报文传输装置，其特征在于，包括处理器和存储器，所述处理器调用所述存储器中存储的程序，以使得所述装置执行如权利要求9-11任一所述的方法。
  25. 一种计算机可读存储介质，其特征在于，包括指令，当其在计算机上运行时，使得计算机执行如权利要求1-11任一所述的方法。
  26. 一种包含指令的计算机程序产品，其特征在于，当其在计算机上运行时，使得计算机执行上述权利要求1-11任一所述的方法。
  27. 一种报文传输系统，其特征在于，包括：用于执行如权利要求1-8任一所述方法的第二设备和用于执行如权利要求9-11任一所述方法的第一设备。
PCT/CN2020/102873 2019-07-23 2020-07-17 一种报文传输方法、装置及系统 WO2021013109A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP20844995.9A EP3996301A4 (en) 2019-07-23 2020-07-17 METHOD, APPARATUS AND MESSAGE TRANSMISSION SYSTEM
US17/580,831 US20220150176A1 (en) 2019-07-23 2022-01-21 Packet transmission method and apparatus, and system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910668100.4A CN112311494B (zh) 2019-07-23 2019-07-23 一种报文传输方法、装置及系统
CN201910668100.4 2019-07-23

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/580,831 Continuation US20220150176A1 (en) 2019-07-23 2022-01-21 Packet transmission method and apparatus, and system

Publications (1)

Publication Number Publication Date
WO2021013109A1 true WO2021013109A1 (zh) 2021-01-28

Family

ID=74193157

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/102873 WO2021013109A1 (zh) 2019-07-23 2020-07-17 一种报文传输方法、装置及系统

Country Status (4)

Country Link
US (1) US20220150176A1 (zh)
EP (1) EP3996301A4 (zh)
CN (1) CN112311494B (zh)
WO (1) WO2021013109A1 (zh)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115334007A (zh) * 2021-04-27 2022-11-11 华为技术有限公司 通信方法及装置
CN115348216A (zh) * 2021-05-14 2022-11-15 华为技术有限公司 报文转发的方法和相关装置
CN115378532A (zh) * 2021-05-17 2022-11-22 华为技术有限公司 报文传输的方法和装置
CN115589384A (zh) * 2021-07-05 2023-01-10 华为技术有限公司 一种报文传输方法及装置
CN114401228B (zh) * 2021-12-30 2024-04-26 网络通信与安全紫金山实验室 一种端到端的跨广域确定性传输网络架构和方法
CN117768386A (zh) * 2022-09-16 2024-03-26 中兴通讯股份有限公司 报文处理方法、传递方法、通信设备、系统、介质及产品
CN117768387A (zh) * 2022-09-16 2024-03-26 中兴通讯股份有限公司 报文处理方法、传递方法、通信设备、系统、介质及产品

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101855841A (zh) * 2007-11-14 2010-10-06 索尼株式会社 改进的Alamouti编码和解码
US20110091211A1 (en) * 2007-05-09 2011-04-21 Hitachi, Ltd. Optical line terminal capable of active bandwidth allocation for passive optical network system
CN104221424A (zh) * 2012-11-02 2014-12-17 华为技术有限公司 传输数据包的方法和设备
CN108738080A (zh) * 2017-04-20 2018-11-02 华为技术有限公司 数据传输的方法和装置

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6496481B1 (en) * 1998-07-16 2002-12-17 Industrial Technology Research Institute Data transfer method for wire real-time communications
EP1325597A2 (en) * 2000-10-04 2003-07-09 Vitesse Semiconductor Corporation A data communication network switching unit having a systolic ring structure
DE50113534D1 (de) * 2001-05-04 2008-03-13 Nokia Siemens Networks Gmbh Verfahren zur Flusskontrolle bei mehreren Sendern mit unbekannter und/oder verschiedener Sendeleistung
KR100459557B1 (ko) * 2001-08-23 2004-12-03 삼성전자주식회사 고속 순방향 패킷 접속 통신 시스템에서 데이터 상태정보를 나타내기 위한 혼화 자동 재전송 요구 채널 번호할당 방법
KR100537499B1 (ko) * 2002-07-26 2005-12-19 삼성전자주식회사 전송제어 파라미터 생성방법 및 프레임 특성에 따른선택적 자동 재전송 방법
CN102932278B (zh) * 2006-04-13 2016-03-02 杜比实验室特许公司 在无线网络中估计无线处理设备队列长度的方法和设备
FR2924546A1 (fr) * 2007-11-30 2009-06-05 Canon Kk Procede et dispositif de determination de l'instant de prise en compte d'une modification d'au moins une condition de reception de signaux dans un systeme de communication
CN101640594B (zh) * 2008-07-31 2013-01-23 北京启明星辰信息技术股份有限公司 一种在网络设备上提取流量攻击报文特征的方法和单元
US8885533B2 (en) * 2011-07-13 2014-11-11 Zte Corporation Enhancement of slotted mode operation for wireless communication
CN103297291A (zh) * 2013-05-08 2013-09-11 携程计算机技术（上海）有限公司 网站实时状态监控方法及系统
US20210064432A1 (en) * 2018-02-05 2021-03-04 Telefonaktiebolaget Lm Ericsson (Publ) Resource needs prediction in virtualized systems: generic proactive and self-adaptive solution
CN110324242B (zh) * 2018-03-29 2021-10-15 华为技术有限公司 一种报文发送的方法、网络节点和系统
US11552878B1 (en) * 2021-07-15 2023-01-10 Vmware, Inc. Managing replay windows in multipath connections between gateways

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110091211A1 (en) * 2007-05-09 2011-04-21 Hitachi, Ltd. Optical line terminal capable of active bandwidth allocation for passive optical network system
CN101855841A (zh) * 2007-11-14 2010-10-06 索尼株式会社 改进的Alamouti编码和解码
CN104221424A (zh) * 2012-11-02 2014-12-17 华为技术有限公司 传输数据包的方法和设备
CN108738080A (zh) * 2017-04-20 2018-11-02 华为技术有限公司 数据传输的方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3996301A4 *

Also Published As

Publication number Publication date
US20220150176A1 (en) 2022-05-12
EP3996301A4 (en) 2022-08-24
CN112311494A (zh) 2021-02-02
CN112311494B (zh) 2023-12-08
EP3996301A1 (en) 2022-05-11

Similar Documents

Publication Publication Date Title
WO2021013109A1 (zh) 一种报文传输方法、装置及系统
CN109412964B (zh) 报文控制方法及网络装置
CN107113246A (zh) 用于网络中数据帧的流量整形的方法及其装置和计算机程序产品
US11616586B2 (en) Period mapping method and network device
WO2023283902A1 (zh) 一种报文传输方法及装置
EP3605975B1 (en) Client service transmission method and device
JP5304813B2 (ja) 通信ノード装置
WO2018219100A1 (zh) 数据传输的方法和设备
US10367743B2 (en) Method for traffic management at network node, and network node in packet-switched network
JP2020507245A (ja) 通信信号フレームを送信する方法、エンティティ及びプログラム
JP2014042237A (ja) ハードウェア回路、クレジットに基づくトラフィックシェイパー、装置、およびハードウェアによる実現方法
JP2018500851A5 (zh)
Jiang Relationship between guaranteed rate server and latency rate server
JPWO2009016692A1 (ja) パケット処理装置
CN108282416B (zh) 一种基于数据帧的调度方法和装置
JP2014204403A (ja) スイッチ装置、パケット制御方法及びデータ通信システム
JP5492709B2 (ja) 帯域制御方法及び帯域制御装置
US10079769B1 (en) Methods and apparatus for implementing dynamic rate controllers using linked list of rate programs
CN114666809A (zh) 数据发送的方法和装置
CN113691459A (zh) 基于标识报文的数据传输方法及装置
WO2024082616A1 (zh) 确定节点时延的方法、存储介质和电子设备
JP6206105B2 (ja) 通信システム、通信方法および通信プログラム
US20230122404A1 (en) Electronic device and frame transmission method of electronic device
JP6148546B2 (ja) パケット転送装置及びプログラム
JP6075053B2 (ja) 情報処理方法、情報処理回路、及び情報処理装置

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: 20844995

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020844995

Country of ref document: EP

Effective date: 20220204