WO2022078297A1 - 报文转发方法、报文发送方法、设备和计算机可读介质 - Google Patents

报文转发方法、报文发送方法、设备和计算机可读介质 Download PDF

Info

Publication number
WO2022078297A1
WO2022078297A1 PCT/CN2021/123105 CN2021123105W WO2022078297A1 WO 2022078297 A1 WO2022078297 A1 WO 2022078297A1 CN 2021123105 W CN2021123105 W CN 2021123105W WO 2022078297 A1 WO2022078297 A1 WO 2022078297A1
Authority
WO
WIPO (PCT)
Prior art keywords
period
cycle
forwarding
length
identifier
Prior art date
Application number
PCT/CN2021/123105
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 US18/031,582 priority Critical patent/US20230379245A1/en
Priority to EP21879341.2A priority patent/EP4250607A1/en
Publication of WO2022078297A1 publication Critical patent/WO2022078297A1/zh

Links

Images

Classifications

    • 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/56—Routing software
    • H04L45/566—Routing instructions carried by the data packet, e.g. active networks
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • 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/34—Source routing
    • 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/74—Address processing for routing
    • 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/74—Address processing for routing
    • H04L45/741—Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6
    • 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/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling

Definitions

  • the present disclosure relates to the field of communication technologies, and in particular, to a packet forwarding method, a packet sending method, a forwarding device, a source device, and a computer-readable medium.
  • an embodiment of the present disclosure provides a packet forwarding method, which is applied to a forwarding device, including:
  • the target message carries source period information, the source period information including: a predetermined period length and a source period identifier;
  • an embodiment of the present disclosure also provides a method for sending a message, which is applied to a source device, including:
  • the target packet carries source period information used to indicate the sending period, and the source period
  • the information includes: the predetermined period length and the source period identifier of the transmission period.
  • an embodiment of the present disclosure further provides a forwarding device, including:
  • a storage device for storing one or more programs
  • the one or more processors When the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the packet forwarding method described in the foregoing embodiment.
  • an embodiment of the present disclosure further provides a source device, including:
  • a storage device for storing one or more programs
  • the one or more processors When the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the message sending method described in the foregoing embodiment.
  • an embodiment of the present disclosure further provides a computer-readable medium on which a computer program is stored, and when the computer program is executed by a processor, implements the packet forwarding method or the packet transmission described in the foregoing embodiments steps in the method.
  • FIG. 1 is a flowchart of a packet forwarding method provided by an embodiment of the present disclosure
  • FIG. 2 is another flowchart of a packet forwarding method provided by an embodiment of the present disclosure
  • FIG. 3 is another flowchart of a packet forwarding method provided by an embodiment of the present disclosure
  • FIG. 4 is a flowchart of a specific implementation method of step S01 in an embodiment of the disclosure.
  • FIG. 5 is a flowchart of a method for sending a message according to an embodiment of the present disclosure
  • FIG. 6 is a schematic diagram of an encapsulation format of a time slot information element according to an embodiment of the present disclosure
  • Fig. 7 is the format schematic diagram of the extension D block in the encapsulation format shown in Fig. 6;
  • FIG. 8 is a schematic diagram of a network structure provided by an embodiment of the present disclosure.
  • FIG. 9 is a schematic structural diagram of a forwarding device according to an embodiment of the present disclosure.
  • FIG. 10 is a schematic structural diagram of a source device according to an embodiment of the present disclosure.
  • FIG. 11 is a schematic structural diagram of a computer-readable medium according to an embodiment of the present disclosure.
  • the packet forwarding method, the packet sending method, the forwarding device, the source end device and the computer-readable medium provided by the present disclosure determine the corresponding forwarding cycle identifier according to the predetermined cycle length and the source cycle identifier carried in the target message, and use the The forwarding period identifies the forwarding period corresponding to the forwarding period, so that devices in the network can select the forwarding period according to the source period information indicated in the packet, avoiding the problem of inter-period forwarding, and accurately obtaining the delay jitter.
  • the corresponding methods and devices provided by the present disclosure are suitable for Time-sensitive Network (TSN for short), Deterministic Networking (DetNet for short), networks using the IEEE 802.1Qbv standard and the IEEE 802.1Qch standard, and other Networks using the Circular Queue Forwarding (CQF) mechanism.
  • TSN Time-sensitive Network
  • DetNet Deterministic Networking
  • CQF Circular Queue Forwarding
  • FIG. 1 is a flowchart of a packet forwarding method provided by an embodiment of the present disclosure. As shown in FIG. 1 , the packet forwarding method is applied to forwarding devices (such as routers and switches, etc.), and the method includes the following steps S1 to S3.
  • forwarding devices such as routers and switches, etc.
  • Step S1 receiving the target message.
  • the target packet carries source period information, and the source period information includes a predetermined period length and a source period identifier; specifically, the source period information is used to indicate the upstream device of the forwarding device (the position in the current link is before the forwarding device).
  • the device can be a forwarding device or a user-side device) corresponding to the sending period when the target message is sent.
  • the source period identifier is used to identify the sending period, and the source period identifier includes various forms such as period number and period label.
  • the source period information further includes a unit of a predetermined period length, specifically, the unit of the predetermined period length is a time unit, which can be set to nanoseconds, microseconds, milliseconds, seconds, and the like.
  • step S1 the source cycle information, source cycle identifier and similar concepts hereinafter described in step S1 do not mean that the cycle information and cycle identifier are set by the source device and placed in the target message. It is only used to indicate the direct source of the target packet and the previous node in the communication link, that is, the upstream device of the forwarding device. These concepts refer to the source device only when the upstream device is the source device.
  • Step S2 Determine the corresponding forwarding period identifier according to the predetermined period length and the source period identifier.
  • the forwarding device for the network to which the forwarding device belongs, its entire network time is divided into multiple consecutive cycles with the same length. The division process is based on the corresponding unit cycle length. If there are multiple unit cycle lengths, there should be Various division methods; the forwarding device is preconfigured with a corresponding cycle identifier for each cycle, and a packet forwarding policy for each cycle is configured, or the forwarding device receives the cycle identifier and packet forwarding policy assigned by the network control plane.
  • the corresponding packet forwarding strategy may be: receiving the packet and forwarding the packet in a specific period after the sending period of the upstream device, the specific period may be determined by presetting a waiting period or specifying a period identifier, etc., The specific moment of packet forwarding in the specific period may be determined by random selection or calculation based on the packet size.
  • the network-wide time of the network to which the forwarding device belongs has multiple division methods, and the forwarding device is pre-configured with corresponding period identifiers and packet forwarding policies for various division methods according to network conditions, and all the division methods are pre-stored locally.
  • the step S2 of determining the corresponding forwarding period identifier according to the predetermined period length and the source period identifier may include: If the predetermined cycle length is equal to one of the unit cycle lengths, in the corresponding division mode, the nth cycle identifier located after the source cycle identifier is used as the forwarding cycle identifier, that is, the nth cycle after the cycle corresponding to the source cycle identifier is determined.
  • n is an integer; or, if the predetermined cycle length is one of the unit cycle length and a common multiple of 2, then in the unit cycle length, the next cycle identifier with the same parity relationship as the source cycle identifier is used as the forwarding Cycle ID.
  • Step S3 Forward the target packet within the forwarding period corresponding to the forwarding period identifier.
  • the length of the forwarding cycle is the same as the predetermined cycle length in the source cycle information carried in the target packet.
  • the packet forwarding method It also includes: replacing the source cycle identifier in the source cycle information carried by the target message with a forwarding cycle identifier, so that the downstream device of the forwarding device (the device whose position in the current link is behind the forwarding device can be forwarding device or user side device) to perform corresponding identification and processing according to the replaced source period information.
  • the packet forwarding method determines the corresponding forwarding period identifier according to the predetermined period length and the source period identifier carried in the target packet, and forwards the target packet within the forwarding period corresponding to the forwarding period identifier, so that the network
  • the device can select the forwarding period according to the source period information indicated in the packet, so as to avoid the problem of inter-period forwarding and accurately obtain the delay jitter.
  • FIG. 2 is another flowchart of a packet forwarding method provided by an embodiment of the present disclosure.
  • the packet forwarding method is a specific implementation based on the method shown in FIG. 1 .
  • the packet forwarding method not only includes steps S1 to S3, but the step S2 of determining the corresponding forwarding cycle identifier according to the predetermined cycle length and the source cycle identifier also includes: step S201.
  • Step S201 matching a corresponding candidate cycle length from a plurality of candidate cycle lengths according to a predetermined cycle length as the matching cycle length, using the source cycle identifier as the inbound interface cycle identifier, and looking up the corresponding outgoing interface cycle from the multi-cycle mapping table ID, and use the outbound interface cycle ID as the forwarding cycle ID.
  • the multi-period mapping table records the mapping relationship between the period ID of the incoming interface and the period ID of the outgoing interface under each candidate period length.
  • Outbound interface multiple candidate cycle lengths are pre-stored in the forwarding device, that is, the multiple unit cycle lengths described above.
  • the matching cycle length is the length of all candidate cycles that is equal to the predetermined cycle length in the source cycle information.
  • FIG. 3 is another flowchart of a packet forwarding method provided by an embodiment of the present disclosure.
  • the packet forwarding method is a specific implementation based on the method shown in FIG. 2 .
  • the message forwarding method not only includes steps S1 to S3, but also includes step S01 before the step S1 of receiving the target message.
  • Step S01 Determine multiple candidate cycle lengths according to a preset cycle selection strategy, establish a mapping relationship between an inbound interface cycle identifier and an outbound interface cycle identifier for each candidate cycle length, and generate a multi-cycle mapping table.
  • FIG. 4 is a flowchart of a specific implementation method of step S01 in an embodiment of the disclosure.
  • a plurality of candidate period lengths are determined according to a preset period selection policy, and step S01 of establishing a mapping relationship between an inbound interface period identifier and an outgoing interface period identifier for each candidate period length includes: step S011 .
  • Step S011 Generate at least one candidate period length set according to the preset default period length, and establish a mapping relationship between the inbound interface period identifier and the outgoing interface period identifier for each candidate period length in all the candidate period length sets.
  • the generated set of all candidate period lengths includes at least one of the following: the first set, which consists of default period lengths; the second set, where all candidate period lengths in the set form an arithmetic sequence whose first item is the default period length; Three sets, all candidate period lengths in this set constitute a proportional sequence whose first item is the default period length.
  • step S2 a corresponding candidate period length is matched from a plurality of candidate period lengths according to the predetermined period length, that is, the candidate period length set to which the predetermined period length belongs is determined.
  • the default period length may be one or more.
  • the first set includes all default period lengths, or there may be such that the first item is each default period length, etc.
  • the predetermined period length in can match the candidate period lengths in multiple different sets, and the source device carries the corresponding flag information when sending the target packet to indicate the candidate period length set to which the predetermined period length belongs.
  • the packet forwarding method provided by the embodiments of the present disclosure determines the corresponding mapping relationship according to the predetermined period length and the source period identifier carried in the target packet, and determines the forwarding period identifier, so as to realize multi-period mapping in the network and increase the number of times for packet forwarding. Flexibility to enhance the applicability of the network.
  • FIG. 5 is a flowchart of a method for sending a packet according to an embodiment of the present disclosure. As shown in Figure 5, the method for sending a message is applied to a source device (such as a personal computer, a mobile terminal, a tablet device, etc.), and the method includes:
  • Step S4 Select a predetermined period length and send the target message to the forwarding device in a sending period corresponding to the predetermined period length.
  • the target packet carries source period information used to indicate the sending period, where the source period information includes a predetermined period length and a source period identifier of the sending period.
  • the predetermined period length may be selected through local policy or real-time system configuration.
  • the source period information may be carried by slotted cells, Layer 2 Ethernet frames, IPv4 headers, or IPv6 headers.
  • FIG. 6 is a schematic diagram of an encapsulation format of a time slot information element according to an embodiment of the present disclosure.
  • the time slot cell has a fixed length and is composed of one S block, multiple D blocks and one T block.
  • the cell includes an overhead area (Header) and a payload area (Payload), and the encoded customer service is mapped in the payload area for bearing.
  • the overhead area includes the following bytes: tag value, time slice information, serial number, check value (Cyclic Redundancy Check algorithm), management channel byte, multiframe number, and operation and maintenance management (Operation Administration and Maintenance, referred to as OAM) function fields, etc.
  • one D block of the overhead area may be used to carry the predetermined period length and the source period identifier.
  • FIG. 7 is a schematic diagram of the format of the extended D block in the encapsulation format shown in FIG. 6 .
  • a D block corresponds to 8 bytes.
  • the lower 3 bytes can be used to carry the predetermined cycle length and source cycle identifier. For example, the first 2 bytes are used as the predetermined cycle length, and the last 1 byte is used as Source cycle ID.
  • the first 14 bits are used as the absolute value of the predetermined cycle length
  • the last 2 bits are used as the unit of the predetermined period length.
  • 00, 01, 10, and 11 correspond to nanoseconds, microseconds, milliseconds, and seconds, respectively. This example corresponds to the case where the forwarding device generates the first set consisting of the default period length.
  • the predetermined cycle length in the example is one of its all default cycle lengths; specifically, as shown in Figure 7b), in the first 2 bytes, the first 14 bits are 00000000101101, and the last 2 bits are 01, Then the predetermined cycle length is 45 microseconds, and the last byte is 100, indicating that the source cycle number (identification) is 4.
  • the predetermined period length in this example is an element in the arithmetic sequence whose first item is composed of all candidate period lengths and which is the default period length.
  • the predetermined period length is the product of the corresponding default period length and the m-th root of 2, and m is an integer
  • this example corresponds to the case where the forwarding device generates a third set
  • the source cycle information further includes flag information, where the flag information is used to indicate the candidate cycle length set to which the predetermined cycle length belongs, which includes flag bits, etc. form, specifically, as shown in Figure 7f), in the first 2 bytes of the lower 3 bytes, the first 2 bits are the flag bits, and the last 14 bits are used to represent the predetermined period length in the corresponding form, and the flag bit 00 It can indicate that the last 14 bits are the absolute value of the predetermined period length, the flag bit 01 can indicate that the last 14 bits are the quotient of the predetermined period length and the corresponding default period length, and the flag bit 10 can indicate that the last 14 bits are m, the predetermined period length is the product of the corresponding default period length and the m-th root of 2, where m is an integer.
  • time slot information element carrying the source period information is only an implementation manner in the present disclosure, which will not limit the technical solutions of the present disclosure.
  • the arrangement and sequence can be adjusted and configured accordingly, and other packaging formats and representations are also applicable to the technical solutions of the present disclosure.
  • the source cycle information can be carried by the 2-byte Ether type field;
  • the IPv4 header includes version, IP header length, service type, packet length, packet identification, fragmentation, fragmentation displacement, survival Time, upper-layer protocol number, header checksum, source IPv4 address, destination IPv4 address, options and complements, source cycle information can be carried by a 1-byte service type or optional field;
  • IPv6 header includes version, traffic Class, flow label, payload length, next header, hop limit, source address and destination address, source cycle information can be carried by a 1-byte traffic class field.
  • the packet sending method provided by the embodiment of the present disclosure can be used to carry a predetermined period length and a source period identifier when a source device sends a packet, so that the forwarding device and the receiving device can determine the corresponding forwarding period identifier accordingly, and the forwarding period identifier corresponds to the forwarding period identifier.
  • the device in the network can select the forwarding period according to the source period information indicated in the packet, so as to avoid the problem of inter-period forwarding and accurately obtain the delay jitter.
  • FIG. 8 is a schematic diagram of a network structure provided by an embodiment of the present disclosure.
  • the network includes a first forwarding device R1, a second forwarding device R2, a first user equipment H1, a second user equipment H2, a third user equipment H3 and a fourth user equipment H4;
  • H1 serves as the source device Send the first target packet to H2, and H3, as the source device, sends the second target packet to H4;
  • the default period lengths are 10 ⁇ s and 25 ⁇ s, and the period identifier is expressed in the form of a period number.
  • Table 1 and Table 2 There are corresponding multi-period mapping tables for information generation, see Table 1 and Table 2.
  • Both R1 and R2 generate two candidate cycle length sets.
  • the first candidate cycle length set is composed of default cycle lengths of 10 ⁇ s and 25 ⁇ s
  • the second candidate cycle length set is obtained according to the default cycle length of 10 ⁇ s.
  • the elements in it are The product of 10 and 2 to the mth power, m ⁇ 0,1,2 ⁇ , that is, the length of all candidate periods in it constitutes a proportional sequence whose first term is the default period length of 10 ⁇ s, R2 is similar to it, the difference is that each candidate period
  • the mapping relationship between the period number (identification) of the incoming interface and the period number (identification) of the outgoing interface is different.
  • H1 selects a predetermined period length of 10 ⁇ s, and sends the first target packet to H2 in a period with the period number of 3 and the predetermined period length of 10 ⁇ s.
  • the target message carries the source cycle information including the flag bit (information) 01, the predetermined cycle length of 10 ⁇ s, and the source cycle number 3 of the transmission cycle; after R1 receives the first target message, it matches the flag bit and the predetermined cycle length to find the source cycle information.
  • the matching cycle length in the first candidate cycle length set is 10 ⁇ s, and the source cycle number 3 is used as the cycle number of the incoming interface to look up the table, and the cycle number of the outgoing interface is 0.
  • the forwarding cycle number is 0.
  • the source cycle number 3 is replaced with 0, and the first target packet is forwarded in the cycle with the cycle number 0; after receiving the first target packet, R2 determines the forwarding cycle number 1 from the source cycle number 0 according to the same steps.
  • H3 selects a predetermined period length of 10 ⁇ s, and sends the second target message to H4 in the period with the period number of 2 and the predetermined period length of 10 ⁇ s. It carries the source cycle information including the flag bit 10, the predetermined cycle length of 10 ⁇ s and the source cycle number 2 of the transmission cycle; after R1 receives the second target message, it matches the second candidate cycle length set according to the flag bit and the predetermined cycle length
  • the matching period length is 10 ⁇ s, and the source period number 2 is used as the inbound interface period number to look up the table, and the outbound interface period number 10 is obtained.
  • the forwarding period number is 10, and R1 replaces the source period number 3 with the forwarding period number 10 as 10, and forwards the second target message in the cycle with the cycle number 10; after R2 receives the second target message, according to the same steps, the source cycle number 10 determines the forwarding cycle number 7, and according to the forwarding cycle number 7, the forwarding cycle number 7 is determined. The source cycle number 10 is replaced with 7, and the second target message is forwarded in the cycle with the cycle number 7; H4 receives the second target message.
  • FIG. 9 is a schematic structural diagram of a forwarding device according to an embodiment of the present disclosure. As shown in Figure 9, the forwarding device includes:
  • processors 101 one or more processors 101;
  • a memory (device) 102 having stored thereon one or more programs that, when executed by the one or more processors 101, cause the one or more processors 101 to implement any of the implementations described above the message forwarding method in the example;
  • One or more I/O interfaces 103 are connected between the processor 101 and the memory 102 and are configured to realize information exchange between the processor 101 and the memory 102 .
  • the processor 101 is a device with data processing capabilities, including but not limited to a central processing unit (CPU), etc.; the memory 102 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically SDRAM) , DDR, etc.), read-only memory (ROM), electrified erasable programmable read-only memory (EEPROM), flash memory (FLASH); I/O interface (read-write interface) 103 is connected between the processor 101 and the memory 102, The information exchange between the processor 101 and the memory 102 can be implemented, including but not limited to a data bus (Bus) and the like.
  • Buss data bus
  • processor 101, memory 102, and I/O interface 103 are interconnected by bus 104, and in turn are connected to other components of the computing device.
  • FIG. 10 is a schematic structural diagram of a source device according to an embodiment of the present disclosure. As shown in Figure 10, the source device includes:
  • processors 201 one or more processors 201;
  • the memory 202 on which one or more programs are stored, when the one or more programs are executed by the one or more processors 201, causes the one or more processors 201 to implement as in any of the above-mentioned embodiments the method of sending the message;
  • One or more I/O interfaces 203 are connected between the processor 201 and the memory 202 and are configured to realize information exchange between the processor 201 and the memory 202 .
  • the processor 201 is a device with data processing capabilities, including but not limited to a central processing unit (CPU), etc.; the memory 202 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically SDRAM) , DDR, etc.), read-only memory (ROM), electrified erasable programmable read-only memory (EEPROM), flash memory (FLASH); I/O interface (read-write interface) 203 is connected between the processor 201 and the memory 202, Information exchange between the processor 201 and the memory 202 can be implemented, including but not limited to a data bus (Bus) and the like.
  • Buss data bus
  • processor 201, memory 202, and I/O interface 203 are interconnected by bus 204, and in turn are connected to other components of the computing device.
  • FIG. 11 is a schematic structural diagram of a computer-readable medium according to an embodiment of the present disclosure.
  • the computer readable medium stores a computer program, and when the computer program is executed by the processor, implements the steps in the packet forwarding method or the packet sending method in any of the foregoing embodiments.
  • Computer storage media includes both volatile and nonvolatile implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules or other data flexible, removable and non-removable media.
  • Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cartridges, magnetic tape, magnetic disk storage or other magnetic storage devices, or may Any other medium used to store desired information and which can be accessed by a computer.
  • communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and can include any information delivery media, as is well known to those of ordinary skill in the art .
  • Example embodiments have been disclosed herein, and although specific terms are employed, they are used and should only be construed in a general descriptive sense and not for purposes of limitation. In some instances, it will be apparent to those skilled in the art that features, characteristics and/or elements described in connection with a particular embodiment may be used alone or in combination with features, characteristics described in connection with other embodiments unless expressly stated otherwise and/or components used in combination. Accordingly, it will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the scope of the present disclosure as set forth in the appended claims.

Landscapes

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

Abstract

本公开提供了一种报文转发方法，应用于转发设备，包括：接收目标报文，该目标报文中携带有源周期信息，源周期信息包括预定周期长度和源周期标识；根据预定周期长度和源周期标识确定对应的转发周期标识，并在转发周期标识对应的转发周期内转发目标报文。本公开还提供了一种报文发送方法、一种转发设备、一种源端设备和一种计算机可读介质。

Description

报文转发方法、报文发送方法、设备和计算机可读介质
相关申请的交叉引用
本申请要求于2020年10月14日提交的中国专利申请NO.202011099241.8的优先权，该中国专利申请的内容通过引用的方式整体合并于此。
技术领域
本公开涉及通信技术领域，特别涉及报文转发方法、报文发送方法、转发设备、源端设备和计算机可读介质。
背景技术
相关技术中，针对网络中各设备的时间同步问题，存在两种解决模式：同步模式下，网络中所有设备需要严格的时间同步，设备接收端口确定每个报文的接收时间，确定报文落入的具体接收时间周期，并在此后的规定时间周期内发送出去；异步模式下，网络中不同设备只需要保持频率同步且时间片大小相同即可，其各自的相位不同，报文转发过程中，发送的报文携带周期标签，各设备根据周期标签确定将此报文转发出去的周期。
异步模式下，由于需要保证网络中各网络设备的时间片大小相同，当面对实际中存在的部分网络设备设置的周期与其他设备不一致的情况时，例如，网络中不同数据源发送的数据包大小不同，其各自选择的周期也不同时，会导致下游设备无法将上游设备发送的报文在一个周期内转发完成，从而使得报文转发跨周期，时延抖动也无法确定。
公开内容
第一方面，本公开实施例提供了一种报文转发方法，应用于转 发设备，包括：
接收目标报文，所述目标报文中携带有源周期信息，所述源周期信息包括：预定周期长度和源周期标识；以及
根据所述预定周期长度和所述源周期标识确定对应的转发周期标识，并在所述转发周期标识对应的转发周期内转发所述目标报文，所述转发周期的长度与所述预定周期长度相同。
第二方面，本公开实施例还提供了一种报文发送方法，应用于源端设备，包括：
选定一个预定周期长度并在所述预定周期长度对应的一个发送周期中向转发设备发送目标报文，所述目标报文中携带有用于指示所述发送周期的源周期信息，所述源周期信息包括：所述预定周期长度和所述发送周期的源周期标识。
第三方面，本公开实施例还提供了一种转发设备，包括：
一个或多个处理器；以及
存储装置，用于存储一个或多个程序；
当所述一个或多个程序被所述一个或多个处理器执行时，使得所述一个或多个处理器实现如上述实施例所述的报文转发方法。
第四方面，本公开实施例还提供了一种源端设备，包括：
一个或多个处理器；以及
存储装置，用于存储一个或多个程序；
当所述一个或多个程序被所述一个或多个处理器执行时，使得所述一个或多个处理器实现如上述实施例所述的报文发送方法。
第五方面，本公开实施例还提供了一种计算机可读介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现如上述实施例所述的报文转发方法或报文发送方法中的步骤。
附图说明
图1为本公开实施例提供的报文转发方法的一种流程图；
图2为本公开实施例提供的报文转发方法的另一种流程图；
图3为本公开实施例提供的报文转发方法的又一种流程图；
图4为本公开实施例中步骤S01的一种具体实施方法流程图；
图5为本公开实施例提供的一种报文发送方法的流程图；
图6为本公开实施例提供的一种时隙信元的封装格式示意图；
图7为图6中示出的封装格式中的扩展D块的格式示意图；
图8为本公开实施例提供的一种网络结构示意图；
图9为本公开实施例提供的一种转发设备的结构示意图；
图10为本公开实施例提供的一种源端设备的结构示意图；以及
图11为本公开实施例提供的一种计算机可读介质的结构示意图。
具体实施方式
为使本领域的技术人员更好地理解本公开的技术方案，下面结合附图对本公开提供的报文转发方法、报文发送方法、转发设备、源端设备和计算机可读介质进行详细描述。
在下文中将参考附图更充分地描述示例实施例，但是所述示例实施例可以以不同形式来体现且不应当被解释为限于本文阐述的实施例。提供这些实施例的目的在于使本公开更加透彻和完整，并将使本领域技术人员充分理解本公开的范围。
本文所使用的术语仅用于描述特定实施例，且不意欲限制本公开。如本文所使用的，单数形式“一个”和“该”也意欲包括复数形式，除非上下文另外清楚指出。还将理解的是，当本说明书中使用术语“包括”和/或“由……制成”时，指定存在特定特征、整体、步骤、操作、元件和/或组件，但不排除存在或可添加一个或多个其他特征、整体、步骤、操作、元件、组件和/或其群组。
将理解的是，虽然本文可以使用术语第一、第二等来描述各种元件，但这些元件不应当受限于这些术语。这些术语仅用于区分一个元件和另一元件。因此，在不背离本公开的指教的情况下，下文讨论的第一元件、第一组件或第一模块可称为第二元件、第二组件或第二模块。
除非另外限定，否则本文所用的所有术语(包括技术和科学术语)的含义与本领域普通技术人员通常理解的含义相同。还将理解，诸如 那些在常用字典中限定的那些术语应当被解释为具有与其在相关技术以及本公开的背景下的含义一致的含义，且将不解释为具有理想化或过度形式上的含义，除非本文明确如此限定。
本公开所提供的报文转发方法、报文发送方法、转发设备、源端设备和计算机可读介质通过根据目标报文中携带的预定周期长度和源周期标识确定对应的转发周期标识，并在转发周期标识对应的转发周期内转发目标报文，使得网络中设备可以根据报文中指示的源周期信息选定转发周期，避免出现跨周期转发的问题，从而精确获知时延抖动。本公开所提供的相应方法及设备适用于时间敏感型网络(Time-sensitive Network，简称TSN)、确定性网络(Deterministic Networking，简称DetNet)、采用IEEE 802.1Qbv标准和IEEE 802.1Qch标准的网络以及其他采用循环队列转发(Circular Queue Forwarding，简称CQF)机制的网络等。
图1为本公开实施例提供的报文转发方法的一种流程图。如图1所示，所述报文转发方法应用于转发设备(例如路由器和交换机等)，该方法包括如下步骤S1至S3。
步骤S1、接收目标报文。
该目标报文中携带有源周期信息，源周期信息包括预定周期长度和源周期标识；具体地，源周期信息用于指示转发设备的上游设备(在当前链路中的位置处于该转发设备前的设备，可以为转发设备或为用户侧设备)发出目标报文时对应的发送周期，源周期标识用于标识该发送周期，源周期标识包括周期号和周期标签等多种形式。
在一些实施方式中，源周期信息还包括预定周期长度的单位，具体地，预定周期长度的单位为时间单位，可设为纳秒、微秒、毫秒和秒等。
需要说明的是，步骤S1中所描述的源周期信息、源周期标识以及下文中类似的概念，其并不代表该周期信息和周期标识为源端设备设置并置于目标报文中的，其仅用于指示该目标报文的直接来源以及该通信链路中的上一节点，即该转发设备的上游设备，仅在该上游设备为源端设备时，这些概念才指向源端设备。
步骤S2、根据预定周期长度和源周期标识确定对应的转发周期标识。
在一些实施方式中，对于转发设备所属的网络，其全网时间被划分为多个连续且长度相同的周期，该划分过程依据相应的单位周期长度，若存在多个单位周期长度，则应存在多种划分方式；转发设备中预先对各个周期配置有相应的周期标识，并配置有针对各个周期的报文转发策略，或者，转发设备接收网络控制面分配的周期标识以及报文转发策略。
具体地，相应的报文转发策略可为：接收报文并在上游设备的发送周期之后的某个特定周期转发该报文，该特定周期可通过预先设置等待周期或指定周期标识等方式确定，该特定周期中具体进行报文转发的时刻可通过随机选择或基于报文大小进行计算等方式确定。示例性地，转发设备所属网络的全网时间具有多种划分方式，转发设备根据网络状况针对各种划分方式均预先配置有相应的周期标识和报文转发策略，其本地预存有全部划分方式各自对应的单位周期长度，由此，在接收到目标报文、获取到其中携带的预定周期长度和源周期标识后，根据预定周期长度和源周期标识确定对应的转发周期标识的步骤S2可包括：若预定周期长度等于其中一个单位周期长度，则在对应的划分方式下，将位于源周期标识之后的第n个周期标识作为转发周期标识，即确定源周期标识对应的周期之后的第n个周期为转发周期，n为整数；或者，若预定周期长度为各单位周期长度和2的公倍数中的一者，则在该单位周期长度，将与源周期标识奇偶关系相同的下一个周期标识作为转发周期标识。
需要说明的是，上述对根据预定周期长度和源周期标识确定对应的转发周期标识的描述，仅为本公开中的一种实现方式，其不会对本公开的技术方案产生限制，其他根据周期长度和源周期标识确定转发周期标识的方式同样适用于本公开的技术方案。
步骤S3、在转发周期标识对应的转发周期内转发目标报文。
转发周期的长度与目标报文携带的源周期信息中的预定周期长度相同。
在一些实施方式中，在根据预定周期长度和源周期标识确定对应的转发周期标识的步骤S2与在转发周期标识对应的转发周期内转发目标报文的步骤S3之间，所述报文转发方法还包括：将目标报文携带的源周期信息中的源周期标识替换为转发周期标识，以供该转发设备的下游设备(在当前链路中的位置处于该转发设备后的设备，可以为转发设备或用户侧设备)根据替换后的源周期信息进行相应的识别和处理。
本公开实施例提供的报文转发方法通过根据目标报文中携带的预定周期长度和源周期标识确定对应的转发周期标识，并在转发周期标识对应的转发周期内转发目标报文，使得网络中设备可以根据报文中指示的源周期信息选定转发周期，避免出现跨周期转发的问题，从而精确获知时延抖动。
图2为本公开实施例提供的报文转发方法的另一种流程图。如图2所示，该报文转发方法为基于图1所示方法的一种具体化实施方案。具体地，该报文转发方法不仅包括步骤S1至步骤S3，根据预定周期长度和源周期标识确定对应的转发周期标识的步骤S2还包括：步骤S201。
步骤S201、根据预定周期长度从多个候选周期长度中匹配出对应的一个候选周期长度作为匹配周期长度，将源周期标识作为入接口周期标识，从多周期映射表中查找出对应的出接口周期标识，并将该出接口周期标识作为转发周期标识。
多周期映射表中记载有在各候选周期长度下入接口周期标识和出接口周期标识的映射关系，入接口周期标识和出接口周期标识分别对应转发设备上针对报文转发而配置的入接口和出接口；转发设备中预存有多个候选周期长度，即上文中所描述的多个单位周期长度，一般来说，匹配周期长度即全部候选周期长度中与源周期信息中的预定周期长度相等的候选周期长度。
图3为本公开实施例提供的报文转发方法的又一种流程图。如图3所示，该报文转发方法为基于图2所示方法的一种具体化实施方案。具体地，该报文转发方法不仅包括步骤S1至步骤S3，在接收目 标报文的步骤S1之前，还包括：步骤S01。
步骤S01、根据预先设置的周期选择策略确定多个候选周期长度，针对各候选周期长度分别建立入接口周期标识和出接口周期标识的映射关系，并生成多周期映射表。
图4为本公开实施例中步骤S01的一种具体实施方法流程图。如图4所示，根据预先设置的周期选择策略确定多个候选周期长度，针对各候选周期长度分别建立入接口周期标识和出接口周期标识的映射关系的步骤S01包括：步骤S011。
步骤S011、根据预先设置的默认周期长度生成至少一个候选周期长度集合，并针对全部候选周期长度集合中的各候选周期长度分别建立入接口周期标识和出接口周期标识的映射关系。
生成的全部候选周期长度集合至少包括以下一种：第一集合，该集合由默认周期长度组成；第二集合，该集合中的全部候选周期长度构成首项为默认周期长度的等差数列；第三集合，该集合中的全部候选周期长度构成首项为默认周期长度的等比数列。相应地，步骤S2中，根据预定周期长度从多个候选周期长度中匹配出对应的一个候选周期长度，即确定预定周期长度所属的候选周期长度集合。
具体地，默认周期长度可为一个或多个，当默认周期长度为多个时，则相应地，第一集合中包括全部默认周期长度，或者可存在构成首项分别为各默认周期长度的等差数列的多个第二集合，或者可存在构成首项分别为各默认周期长度的等比数列的多个第三集合；同时，由于存在各候选周期长度集合间包括相同元素，即目标报文中的预定周期长度可匹配多个不同集合中的候选周期长度的情况，源端设备在发出目标报文时携带相应的标志信息用于指示预定周期长度所属的候选周期长度集合。
本公开实施例提供的报文转发方法通过根据目标报文中携带的预定周期长度和源周期标识确定对应的映射关系，并确定转发周期标识，实现网络中的多周期映射，增加报文转发的灵活性，增强网络的适用性。
图5为本公开实施例提供的一种报文发送方法的流程图。如图5 所示，所述报文发送方法应用于源端设备(例如个人电脑、移动终端和平板设备等)，该方法包括：
步骤S4、选定一个预定周期长度并在预定周期长度对应的一个发送周期中向转发设备发送目标报文。
该目标报文中携带有用于指示该发送周期的源周期信息，源周期信息包括预定周期长度和该发送周期的源周期标识。具体地，可通过本地策略或者实时系统配置选定预定周期长度。
在一些实施方式中，源周期信息可通过时隙信元、二层以太帧、IPv4包头或IPv6包头进行携带。
图6为本公开实施例提供的一种时隙信元的封装格式示意图。如图6所示，时隙信元长度固定，由一个S块、多个D块和一个T块构成。信元中包括开销区(Header)和净荷区(Payload)，经过编码后的客户业务映射在净荷区进行承载。开销区包括如下字节内容：标签值、时间片信息、序列号、检验值(循环冗余校验算法)、管理通道字节、复帧号和操作维护管理(Operation Administration and Maintenance，简称OAM)功能字段等。
具体地，可使用开销区的一个D块，即扩展D块来携带预定周期长度和源周期标识。
图7为图6中示出的封装格式中的扩展D块的格式示意图。一个D块对应8个字节，在该D块中，可使用低3字节来携带预定周期长度和源周期标识，例如，将前2个字节作为预定周期长度，后1个字节作为源周期标识。
对应于转发设备中生成有候选周期长度集合的多种情况，例如，如图7a)所示，在低3字节的前2个字节中，前14个比特作为预定周期长度的绝对值，后2个比特作为预定周期长度的单位，00、01、10、11分别对应纳秒、微秒、毫秒和秒，本例对应转发设备生成有由默认周期长度组成的第一集合的情况，本例中的预定周期长度即为其全部默认周期长度中的一者；具体地，如图7b)所示，在前2个字节中，前14个比特为00000000101101，后2个比特为01，则预定周期长度为45微秒，后一个字节为100，表示源周期号(标识)为4。
或者，如图7c)所示，在低3字节的前2个字节中，前16个比特作为预定周期长度与对应默认周期长度的商，即默认周期长度的倍数值，本例对应转发设备生成有第二集合的情况，本例中的预定周期长度即为由全部候选周期长度构成的首项为默认周期长度的等差数列中的一个元素。
或者，如图7d)所示，在低3字节的前2个字节中，前16个比特表示m，预定周期长度为对应默认周期长度与2的m次方根的乘积，m为整数，本例对应转发设备生成有第三集合的情况，本例中的预定周期长度即为由全部候选周期长度构成的首项为默认周期长度的等比数列中的一个元素；具体地，如图7e)所示，预定周期长度对应的默认周期长度为10微秒，在前2个字节中的16个比特表示m，为10，则预定周期长度为10*2 2＝40微秒，后一个字节为100，表示源周期号(标识)为4。
在一些实施方式中，转发设备中生成有多个候选周期长度集合，相应地，源周期信息还包括标志信息，该标志信息用于指示预定周期长度所属的候选周期长度集合，其包括标志位等形式，具体地，如图7f)所示，在低3字节的前2个字节中，前2个比特为标志位，后14个比特用于以对应形式表示预定周期长度，标志位00可表示后14个比特为预定周期长度的绝对值，标志位01可表示后14个比特为预定周期长度与对应默认周期长度的商，标志位10可表示后14个比特为m，预定周期长度为对应默认周期长度与2的m次方根的乘积，m为整数。
需要说明的是，上述对时隙信元携带源周期信息的描述，仅为本公开中的一种实现方式，其不会对本公开的技术方案产生限制，具体各字节指代的内容及其排布和顺序可以相应地进行调整和配置，其他封装格式和表示方式同样适用于本公开的技术方案。
对于源周期信息通过二层以太帧、IPv4包头或IPv6包头进行携带的情况，二层以太帧包括前导码、帧开始符、目标物理地址(MAC)、源物理地址、802.1Q标签、以太类型、负载和冗余校验部分，源周期信息可以由2字节的以太类型字段携带；IPv4包头包括版本、IP 头长、服务类型、数据包长度、数据包标识、分片、分片位移、生存时间、上层协议号、头部校验和、源IPv4地址、目的IPv4地址、可选项以及补齐部分，源周期信息可以由1字节的服务类型或可选项字段携带；IPv6包头包括版本、流量等级、流标签、载荷长度、下一报头、跳数限制、源地址和目的地址，源周期信息可以由1字节的流量等级字段携带。
需要说明的是，上述对各协议报文携带源周期信息的描述，仅为本公开中的一种实现方式，其不会对本公开的技术方案产生限制，其他可扩展的协议报文同样适用于本公开的技术方案。
本公开实施例提供的报文发送方法可用于在源端设备发送报文时携带预定周期长度和源周期标识，使得转发设备和接收设备由此确定对应的转发周期标识，并在转发周期标识对应的转发周期内转发目标报文，网络中设备可以根据报文中指示的源周期信息选定转发周期，避免出现跨周期转发的问题，从而精确获知时延抖动。
下面结合实际应用对本公开提供的报文发送方法和报文转发方法进行详细描述。
图8为本公开实施例提供的一种网络结构示意图。如图8所示，网络中包括第一转发设备R1、第二转发设备R2、第一用户设备H1、第二用户设备H2、第三用户设备H3和第四用户设备H4；H1作为源端设备向H2发送第一目标报文，H3作为源端设备向H4发送第二目标报文；默认周期长度为10μs和25μs，周期标识以周期号的形式表示，R1和R2根据控制面下发的相关信息生成有各自对应的多周期映射表，见表1和表2。
表1 R1多周期映射表
Figure PCTCN2021123105-appb-000001
Figure PCTCN2021123105-appb-000002
Figure PCTCN2021123105-appb-000003
表2 R2多周期映射表
Figure PCTCN2021123105-appb-000004
Figure PCTCN2021123105-appb-000005
R1和R2均生成有两个候选周期长度集合，在R1中，第一候选周期长度集合由默认周期长度10μs和25μs组成，第二候选周期长度集合根据默认周期长度10μs得到，其内元素均为10与2的m次方的乘积，m∈{0,1,2}，即其内全部候选周期长度构成首项为默认周期长度10μs的等比数列，R2与其相类似，区别在于各候选周期长度下入接口周期号(标识)和出接口周期号(标识)的映射关系不同。
具体地，H1向H2发送第一目标报文的过程中，H1选定预定周期长度为10μs，并在周期号为3且预定周期长度为10μs的周期向H2发送第一目标报文，第一目标报文携带有包括标志位(信息)01、预定周期长度10μs和发送周期的源周期号3的源周期信息；R1接收到第一目标报文后，根据标志位和预定周期长度匹配出其第一候选周期长度集合中的匹配周期长度10μs，并将源周期号3作为入接口周期号进行查表，得到出接口周期号0，由此转发周期号为0，R1根据 转发周期号0将源周期号3替换为0，并在周期号为0的周期转发第一目标报文；R2接收到第一目标报文后，根据相同的步骤，由源周期号0确定出转发周期号1，根据转发周期号1将源周期号0替换为1，并在周期号为1的周期转发第一目标报文；H2接收到第一目标报文。
H3向H4发送第二目标报文的过程中，H3选定预定周期长度为10μs，并在周期号为2且预定周期长度为10μs的周期向H4发送第二目标报文，第二目标报文携带有包括标志位10、预定周期长度10μs和发送周期的源周期号2的源周期信息；R1接收到第二目标报文后，根据标志位和预定周期长度匹配出其第二候选周期长度集合中的匹配周期长度10μs，并将源周期号2作为入接口周期号进行查表，得到出接口周期号10，由此转发周期号为10，R1根据转发周期号10将源周期号3替换为10，并在周期号为10的周期转发第二目标报文；R2接收到第二目标报文后，根据相同的步骤，由源周期号10确定出转发周期号7，根据转发周期号7将源周期号10替换为7，并在周期号为7的周期转发第二目标报文；H4接收到第二目标报文。
图9为本公开实施例提供的一种转发设备的结构示意图。如图9所示，该转发设备包括：
一个或多个处理器101；
存储器(装置)102，其上存储有一个或多个程序，当该一个或多个程序被该一个或多个处理器101执行时，使得该一个或多个处理器101实现如上述任一实施例中的报文转发方法；以及
一个或多个I/O接口103，连接在处理器101与存储器102之间，配置为实现处理器101与存储器102之间的信息交互。
处理器101为具有数据处理能力的器件，其包括但不限于中央处理器(CPU)等；存储器102为具有数据存储能力的器件，其包括但不限于随机存取存储器(RAM，更具体如SDRAM、DDR等)、只读存储器(ROM)、带电可擦可编程只读存储器(EEPROM)、闪存(FLASH)；I/O接口(读写接口)103连接在处理器101与存储器102之间，能实现处理器101与存储器102之间的信息交互，其包括但不限于数据 总线(Bus)等。
在一些实施方式中，处理器101、存储器102和I/O接口103通过总线104相互连接，进而与计算设备的其它组件连接。
图10为本公开实施例提供的一种源端设备的结构示意图。如图10所示，该源端设备包括：
一个或多个处理器201；
存储器202，其上存储有一个或多个程序，当该一个或多个程序被该一个或多个处理器201执行时，使得该一个或多个处理器201实现如上述任一实施例中的报文发送方法；以及
一个或多个I/O接口203，连接在处理器201与存储器202之间，配置为实现处理器201与存储器202之间的信息交互。
处理器201为具有数据处理能力的器件，其包括但不限于中央处理器(CPU)等；存储器202为具有数据存储能力的器件，其包括但不限于随机存取存储器(RAM，更具体如SDRAM、DDR等)、只读存储器(ROM)、带电可擦可编程只读存储器(EEPROM)、闪存(FLASH)；I/O接口(读写接口)203连接在处理器201与存储器202之间，能实现处理器201与存储器202之间的信息交互，其包括但不限于数据总线(Bus)等。
在一些实施方式中，处理器201、存储器202和I/O接口203通过总线204相互连接，进而与计算设备的其它组件连接。
图11为本公开实施例提供的一种计算机可读介质的结构示意图。该计算机可读介质上存储有计算机程序，该计算机程序被处理器执行时实现如上述任一实施例中的报文转发方法或报文发送方法中的步骤。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、装置中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器(如中央 处理器、数字信号处理器或微处理器)执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
本文已经公开了示例实施例，并且虽然采用了具体术语，但它们仅用于并仅应当被解释为一般说明性含义，并且不用于限制的目的。在一些实例中，对本领域技术人员显而易见的是，除非另外明确指出，否则与特定实施例相结合描述的特征、特性和/或元素可单独使用，或可与结合其他实施例描述的特征、特性和/或元件组合使用。因此，本领域技术人员将理解，在不脱离由所附的权利要求阐明的本公开的范围的情况下，可进行各种形式和细节上的改变。

Claims (12)

  1. 一种报文转发方法，应用于转发设备，包括：
    接收目标报文，所述目标报文中携带有源周期信息，所述源周期信息包括预定周期长度和源周期标识；
    根据所述预定周期长度和所述源周期标识确定对应的转发周期标识；以及
    在所述转发周期标识对应的转发周期内转发所述目标报文，所述转发周期的长度与所述预定周期长度相同。
  2. 根据权利要求1所述的报文转发方法，其中，所述根据所述预定周期长度和所述源周期标识确定对应的转发周期标识的步骤包括：
    根据所述预定周期长度从多个候选周期长度中匹配出对应的一个候选周期长度作为匹配周期长度，将所述源周期标识作为入接口周期标识，从多周期映射表中查找出对应的出接口周期标识，并将该出接口周期标识作为所述转发周期标识；其中，所述多周期映射表中记载有在各所述候选周期长度下入接口周期标识和出接口周期标识的映射关系。
  3. 根据权利要求2所述的报文转发方法，其中，在所述接收目标报文的步骤之前，还包括：
    根据预先设置的周期选择策略确定多个所述候选周期长度，针对各所述候选周期长度分别建立入接口周期标识和出接口周期标识的映射关系，并生成所述多周期映射表。
  4. 根据权利要求3所述的报文转发方法，其中，所述根据预先设置的周期选择策略确定多个所述候选周期长度，针对各所述候选周期长度分别建立入接口周期标识和出接口周期标识的映射关系的步骤包括：
    根据预先设置的默认周期长度生成至少一个候选周期长度集合，并针对全部所述候选周期长度集合中的各所述候选周期长度分别建立入接口周期标识和出接口周期标识的映射关系；
    其中，生成的全部所述候选周期长度集合至少包括以下一种：第一集合，所述第一集合由所述默认周期长度组成；第二集合，所述第二集合中的全部所述候选周期长度构成首项为所述默认周期长度的等差数列；第三集合，所述第三集合中的全部所述候选周期长度构成首项为所述默认周期长度的等比数列。
  5. 根据权利要求1所述的报文转发方法，其中，在所述根据所述预定周期长度和所述源周期标识确定对应的转发周期标识的步骤与所述在所述转发周期标识对应的转发周期内转发所述目标报文的步骤之间，还包括：
    将所述目标报文携带的源周期信息中的源周期标识替换为所述转发周期标识。
  6. 一种报文发送方法，应用于源端设备，包括：
    选定一个预定周期长度并在所述预定周期长度对应的一个发送周期中向转发设备发送目标报文，所述目标报文中携带有用于指示所述发送周期的源周期信息，所述源周期信息包括所述预定周期长度和所述发送周期的源周期标识。
  7. 根据权利要求6所述的报文发送方法，其中，所述源周期信息通过时隙信元、二层以太帧、IPv4包头、IPv6包头中的任意一者进行携带。
  8. 根据权利要求6所述的报文发送方法，其中，所述转发设备中生成有多个候选周期长度集合；所述源周期信息还包括标志信息，所述标志信息用于指示所述预定周期长度所属的候选周期长度集合。
  9. 一种转发设备，包括：
    一个或多个处理器；以及
    存储装置，用于存储一个或多个程序；
    当所述一个或多个程序被所述一个或多个处理器执行时，使得所述一个或多个处理器实现如权利要求1至5中任一项所述的报文转发方法。
  10. 一种源端设备，包括：
    一个或多个处理器；以及
    存储装置，用于存储一个或多个程序；
    当所述一个或多个程序被所述一个或多个处理器执行时，使得所述一个或多个处理器实现如权利要求6至8中任一项所述的报文发送方法。
  11. 一种计算机可读介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现如权利要求1至5中任一项所述的报文转发方法中的步骤。
  12. 一种计算机可读介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现如权利要求6至8中任一项所述的报文发送方法中的步骤。
PCT/CN2021/123105 2020-10-14 2021-10-11 报文转发方法、报文发送方法、设备和计算机可读介质 WO2022078297A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US18/031,582 US20230379245A1 (en) 2020-10-14 2021-10-11 Packet forwarding method, packet sending method, device, and computer-readable medium
EP21879341.2A EP4250607A1 (en) 2020-10-14 2021-10-11 Packet forwarding method, packet sending method, device, and computer-readable medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011099241.8 2020-10-14
CN202011099241.8A CN114363955A (zh) 2020-10-14 2020-10-14 报文转发方法、报文发送方法、设备和计算机可读介质

Publications (1)

Publication Number Publication Date
WO2022078297A1 true WO2022078297A1 (zh) 2022-04-21

Family

ID=81089477

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/123105 WO2022078297A1 (zh) 2020-10-14 2021-10-11 报文转发方法、报文发送方法、设备和计算机可读介质

Country Status (4)

Country Link
US (1) US20230379245A1 (zh)
EP (1) EP4250607A1 (zh)
CN (1) CN114363955A (zh)
WO (1) WO2022078297A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2024055898A1 (zh) * 2022-09-16 2024-03-21 中兴通讯股份有限公司 报文处理方法、传递方法、通信设备、系统、介质及产品

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115208837B (zh) * 2022-07-26 2023-12-01 烽火通信科技股份有限公司 一种报文调度方法和系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019084970A1 (zh) * 2017-11-06 2019-05-09 华为技术有限公司 报文转发方法、转发设备和网络设备
CN110502584A (zh) * 2019-08-28 2019-11-26 北京三快在线科技有限公司 数据同步的方法和装置
CN110708755A (zh) * 2019-09-27 2020-01-17 浙江三维通信科技有限公司 同步时序的屏蔽方法及屏蔽系统
CN110868363A (zh) * 2018-08-27 2020-03-06 华为技术有限公司 周期映射的方法及网络设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019084970A1 (zh) * 2017-11-06 2019-05-09 华为技术有限公司 报文转发方法、转发设备和网络设备
CN110868363A (zh) * 2018-08-27 2020-03-06 华为技术有限公司 周期映射的方法及网络设备
CN110502584A (zh) * 2019-08-28 2019-11-26 北京三快在线科技有限公司 数据同步的方法和装置
CN110708755A (zh) * 2019-09-27 2020-01-17 浙江三维通信科技有限公司 同步时序的屏蔽方法及屏蔽系统

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2024055898A1 (zh) * 2022-09-16 2024-03-21 中兴通讯股份有限公司 报文处理方法、传递方法、通信设备、系统、介质及产品

Also Published As

Publication number Publication date
CN114363955A (zh) 2022-04-15
EP4250607A1 (en) 2023-09-27
US20230379245A1 (en) 2023-11-23

Similar Documents

Publication Publication Date Title
WO2020164473A1 (zh) 一种路径计算方法、装置及设备
US20200358698A1 (en) Segment routing in mpls network
EP3461082B1 (en) Network congestion control method and device
US9215093B2 (en) Encoding packets for transport over SDN networks
US8792497B2 (en) Method and apparatus for performing link aggregation
US8792506B2 (en) Inter-domain routing in an n-ary-tree and source-routing based communication framework
WO2022078297A1 (zh) 报文转发方法、报文发送方法、设备和计算机可读介质
US7486674B2 (en) Data mirroring in a service
CN112368980B (zh) 用于将一个或多个在网业务添加到mpls网络中的方法
US20220278919A1 (en) Mapping relationship updating method and apparatus
US11888734B2 (en) MPLS extension headers in mixed networks
EP3657742A1 (en) Method and apparatus for processing modified packet
WO2020156090A1 (zh) 一种建立跨域转发路径的方法、装置及系统
WO2016124049A1 (zh) 用于获取端口路径的方法及装置
WO2021043232A1 (zh) 主机网络性能需求可编程化的方法、设备和系统
JP2022537296A (ja) Ｅｖｐｎメッセージ転送方法、システム、記憶媒体及び端末
CN112583718B (zh) 一种SRoU场景下SRv6报文传递方法、系统、设备及介质
WO2022068436A1 (zh) 业务处理方法以及相关设备
US20230379244A1 (en) Ultra reliable segment routing
US20150222531A1 (en) Prefix-based Entropy Detection in MPLS Label Stacks
US20220200820A1 (en) Packet Sending Method and Apparatus
WO2018090980A1 (zh) 报文转发
US8848716B2 (en) Termination of a pseudowires on multiple line cards
EP4325800A1 (en) Packet forwarding method and apparatus
JP7278431B2 (ja) 非イーサネットサービスを確立する方法およびネットワークデバイス

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2021879341

Country of ref document: EP

Effective date: 20230515