Data transmission method and device and storage medium

By sending an indication message within the transmission time slot, downstream nodes can determine the transmission time slot range of upstream nodes, solving the problem of data packets not being able to meet time synchronization in large-scale networks and achieving deterministic data transmission without modifying message encapsulation.

CN118945124APending Publication Date: 2024-11-12ZTE CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310526845.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-10
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

In large-scale networks, due to the large number of nodes and the long physical link distances, existing technologies struggle to achieve deterministic data packet transmission within the transmission time slots, resulting in the inability to meet time synchronization requirements. Furthermore, existing solutions require modifications to the message encapsulation format, leading to compatibility issues and increased overhead.

Method used

By sending an indication message to downstream nodes in each transmission time slot, downstream nodes determine the transmission time slot range of upstream nodes based on the indication message, thereby achieving deterministic scheduling transmission without modifying existing message encapsulation.

Benefits of technology

It enables deterministic transmission of data packets in large-scale networks without changing the message encapsulation format, avoiding compatibility issues and increased overhead.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118945124A_ABST
    Figure CN118945124A_ABST
Patent Text Reader

Abstract

The invention discloses a data transmission method and device and a storage medium, relates to the technical field of network communication, and can realize deterministic scheduling transmission under the condition of not modifying message packaging. The method comprises the following steps: sending an Nth first indication message to a second node in an Nth first sending time slot of a first node; n is an integer greater than or equal to 1; sending the (N + 1) th first indication message to the second node in the (N + 1) th first sending time slot of the first node; the Nth first indication message and the (N + 1) th first indication message are used for enabling the second node to determine a deterministic message sent by the first node in the Nth first sending time slot from messages received between the Nth first indication message and the (N + 1) th first indication message.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of network communication technology, and in particular to a data transmission method, device and storage medium. Background Art

[0002] In large-scale networks, due to the large number of nodes and the long distance of the physical links between nodes, the data packets in the multiplexed cyclic queuing and forwarding (CQF) mechanism cannot reach the downstream nodes from the upstream nodes within the sending time slot, making it difficult to meet the time synchronization requirements and thus unable to achieve deterministic transmission services.

[0003] In the related art, a solution for large-scale deterministic transmission based on time slot label mapping between upstream and downstream nodes is proposed. In this solution, the upstream node adds a time slot label when sending a message, so that the downstream node sends the message with the same label value in the same time slot, thereby providing end-to-end deterministic transmission service with bounded delay and jitter for the service. It can be seen that this solution needs to add time slot label information to the existing message, which will change the encapsulation format of the message and lead to the problem of compatibility between different encapsulation formats; at the same time, parsing the message fields in different encapsulations will increase the overhead. Summary of the invention

[0004] The embodiments of the present application provide a data transmission method, device and storage medium, which can realize deterministic scheduled transmission without modifying the message encapsulation.

[0005] In one aspect, a data transmission method is provided, which is applied to a first node, and the method includes:

[0006] Sending an Nth first indication message to the second node in the Nth first sending time slot of the first node; N is an integer greater than or equal to 1;

[0007] An N+1th first indication message is sent to the second node in the N+1th first sending time slot of the first node; the Nth first indication message and the N+1th first indication message are used to enable the second node to determine the deterministic message sent by the first node in the Nth first sending time slot from the messages received between the Nth first indication message and the N+1th first indication message.

[0008] In another aspect, a data transmission method is provided, which is applied to a second node, and the method includes:

[0009] Receiving an Nth first indication message sent by the first node in the Nth first sending time slot;

[0010] Receiving the N+1th first indication message sent by the first node in the N+1th first sending time slot;

[0011] A deterministic message sent by the first node in the Nth first sending time slot is determined from messages received by the second node between the Nth first indication message and the N+1th first indication message.

[0012] On the other hand, a data transmission device is provided, which is applied to a first node, including: a sending module, used to send an Nth first indication message to a second node in the Nth first sending time slot of the first node; N is an integer greater than or equal to 1; sending an N+1th first indication message to the second node in the N+1th first sending time slot of the first node; the Nth first indication message and the N+1th first indication message are used to enable the second node to determine the deterministic message sent by the first node in the Nth first sending time slot from the messages received between the Nth first indication message and the N+1th first indication message.

[0013] On the other hand, a data transmission device is provided, which is applied to a second node, including: a receiving module, used to receive the Nth first indication message sent by the first node in the Nth first sending time slot; receive the N+1th first indication message sent by the first node in the N+1th first sending time slot; and a determination module, which determines the deterministic message sent by the first node in the Nth first sending time slot from the messages received by the second node between the Nth first indication message and the N+1th first indication message.

[0014] On the other hand, a communication node is provided, comprising: a memory and a processor; the memory and the processor are coupled; the memory is used to store a computer program; and the processor implements the data transmission method of any of the above embodiments when executing the computer program.

[0015] On the other hand, a computer-readable storage medium is provided, on which computer program instructions are stored. When the computer program instructions are executed by a processor, the data transmission method of any of the above embodiments is implemented.

[0016] On the other hand, a computer program product is provided. The computer program product includes computer program instructions. When the computer program instructions are executed by a processor, the data transmission method of any of the above embodiments is implemented.

[0017] The data transmission method provided in the embodiment of the present application does not require changing the encapsulation of existing messages. It only requires the upstream node to send an indication message for defining the time slot range to the downstream node in each sending time slot. In this way, the downstream node can determine the deterministic message belonging to the same sending time slot of the upstream node based on the received indication message, thereby realizing deterministic scheduled transmission without modifying the message encapsulation. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solution in the present application, the drawings required for use in some embodiments of the present application will be briefly introduced below. Obviously, the drawings described below are only drawings of some embodiments of the present application. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0019] Figure 1 A schematic diagram of a time slot circular queue template provided for some embodiments of the present application;

[0020] Figure 2 A schematic diagram of a network architecture provided for some embodiments of the present application;

[0021] Figure 3 A data transmission method provided in some embodiments of the present application Figure 1 ;

[0022] Figure 4 A schematic diagram of a message provided in some embodiments of the present application Figure 1 ;

[0023] Figure 5 A schematic diagram of a message provided in some embodiments of the present application Figure 2 ;

[0024] Figure 6 A schematic diagram of a message provided in some embodiments of the present application Figure 3 ;

[0025] Figure 7 A schematic diagram of a message provided in some embodiments of the present application Figure 4 ;

[0026] Figure 8 A schematic diagram of a transmission message provided in some embodiments of the present application Figure 1 ;

[0027] Fig. 9 A data transmission method provided in some embodiments of the present application Figure 2 ;

[0028] Fig.10 A schematic diagram of a transmission message provided in some embodiments of the present application Figure 2 ;

[0029] Fig.11 A data transmission method provided in some embodiments of the present application Figure 3 ;

[0030] Fig.12 A data transmission method provided in some embodiments of the present application Figure 4 ;

[0031] Fig.13 A schematic diagram of a transmission message provided in some embodiments of the present application Figure 3 ;

[0032] Fig.14 A schematic diagram of a transmission message provided in some embodiments of the present application Figure 4 ;

[0033] Fig.15 A schematic diagram of a transmission message provided in some embodiments of the present application Figure 5 ;

[0034] Fig.16 A schematic diagram of a data transmission device provided in some embodiments of the present application Figure 1 ;

[0035] Fig.17 A schematic diagram of a data transmission device provided in some embodiments of the present application Figure 2 ;

[0036] Fig.18 A schematic diagram of a data transmission device provided in some embodiments of the present application Figure 3 . DETAILED DESCRIPTION

[0037] The following will be combined with the drawings in this application to clearly and completely describe the technical solutions in this application. Obviously, the described embodiments are only part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0038] It should be noted that, in this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in this application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0039] In the following, the terms "first" and "second" are used for descriptive purposes only and are not to be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features.

[0040] In the description of this application, unless otherwise specified, " / " means "or", for example, A / B can mean A or B. "And / or" in this article is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, "at least one" means one or more, and "multiple" means two or more.

[0041] The CQF mechanism proposed by the IEEE Time Sensitive Networking Working Group 802.1Qch draft can provide deterministic forwarding services for time sensitive network (TSN) services.

[0042] In the CQF mechanism, each node egress port maintains a time slot circular queue template, which includes information about the time slot length and the number of time slots (typically, the time slot corresponds to the egress port queue). For example, Figure 1 As shown, the time slot length of the circular queue template is T = 10us, and the number of time slots is N = 5. For the time slot circular queue template, the data buffered in the queue is scheduled for transmission in a manner based on time slot polling.

[0043] As mentioned in the background technology, in a large-scale network, due to the large number of nodes and the long distance of the physical links between each node (which may be more than tens of kilometers), the data packets in the CQF mechanism cannot reach the downstream nodes from the upstream nodes within the sending time slot, making it difficult to meet the time synchronization requirements, and thus unable to achieve deterministic transmission services.

[0044] In the related technology, a large-scale deterministic solution based on time slot label mapping between upstream and downstream nodes is proposed. In this solution, the upstream node adds a time slot label when sending a message, and the downstream node sends the messages with the same label value in the same time slot according to the time slot label mapping relationship maintained locally, thereby providing end-to-end deterministic transmission services with bounded delay and jitter for the service.

[0045] However, this solution needs to carry time slot label information in the message, which requires modifying the encapsulation of existing messages and standardizing them for different networks. Encapsulations for different networks include Internet Protocol version 4 (IPv4), Internet Protocol version 6 (IPv6), multi-protocol label switching (MPLS), segment routing IPv6 (SRv6) based on IPv6 forwarding plane, etc. Among them, IPv4 and MPLS encapsulations are often difficult to expand, which brings compatibility issues. At the same time, parsing message fields in different encapsulations will increase overhead.

[0046] In response to the above technical problems, an embodiment of the present application provides a data transmission method, which does not require changing the encapsulation of existing messages. It only requires the upstream node to send an indication message for defining the time slot range to the downstream node in each sending time slot. In this way, the downstream node can determine the deterministic message belonging to the same sending time slot of the upstream node based on the received indication message, thereby realizing deterministic scheduled transmission without modifying the message encapsulation.

[0047] See also Figure 2 , is a schematic diagram of a network to which the data transmission method provided in the embodiment of the present application is applicable. For example, Figure 2 As shown, the network 100 includes: a first node 110 and a second node 120. The first node 100 and the second node 200 are any two nodes in the network 100.

[0048] Among them, the first node 110 and the second node 120 include an upstream node and a downstream node, and the message of the upstream node can be forwarded to the downstream node, and then forwarded by the downstream node. For example, the first node 110 is an upstream node, and the second node 120 is a downstream node of the first node 110, then the first node 110 can send the message to be sent to the second node 120, and the second node 120 forwards the message. Alternatively, the second node 120 is an upstream node, and the first node 110 is a downstream node of the second node 120, then the second node 120 can send the message to be sent to the first node 110, and the first node 110 forwards the message.

[0049] It is understandable that the embodiment of the present application does not limit the number of nodes included in the network 100 and the upstream and downstream relationships between the nodes. Figure 2The network diagram shown is only an example and cannot limit the protection scope of the present application. For ease of description, the following embodiments are described by taking the first node 110 as an upstream node of the second node 120 as an example.

[0050] Exemplarily, the first node 110 and the second node 120 may be routers or other network devices capable of forwarding packets.

[0051] Exemplarily, the network 100 may be a deterministic network. A deterministic network refers to a network with large bandwidth, low latency, low jitter, and deterministic capabilities built using network resources, which can provide deterministic service experience for different industries.

[0052] In some embodiments, the first node 110 includes an egress port and an ingress port, wherein the egress port is used to send a message from the first node 110 to a downstream node of the first node 110 (such as the second node 120 described above); and the ingress port is used to receive a message sent by an upstream node of the first node 110.

[0053] In some embodiments, the second node 120 includes an egress port and an ingress port, wherein the egress port is used to send a message from the second node 120 to a downstream node of the second node 120, and the ingress port is used to receive a message sent by an upstream node of the second node 120 (e.g., the first node 110 described above).

[0054] In some embodiments, the outbound ports of the first node 110 and the second node 120 both maintain Figure 1 The time slot circular queue template shown is such that the first node 110 and the second node 120 can schedule the transmission of the data buffered in the queue based on the time slot polling method.

[0055] It should be noted that the system architecture and application scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Ordinary technicians in this field can know that with the evolution of the system architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0056] The following is a detailed introduction to a data transmission method provided in an embodiment of the present application.

[0057] For example, Figure 3 As shown, a data transmission method provided in an embodiment of the present application can be implemented as follows:

[0058] S201. A first node sends an Nth indication message to a second node in an Nth sending time slot of the first node.

[0059] Wherein, N is an integer greater than or equal to 1.

[0060] In some embodiments, a time slot is a time slice of time division multiplexing (or a time slot can also be understood as a period of time, such as 30ms). The above-mentioned sending time slot is a time period for the first node to send information (such as a message) to the second node. The above-mentioned sending time slot can also be called a sending window.

[0061] In some embodiments, the above step S201 may be implemented as follows: at the target time of the Nth sending time slot of the first node, the first node sends the Nth indication message to the second node.

[0062] Exemplarily, the target time may be the start time of the transmission time slot.

[0063] Exemplarily, the target time may be a time before the first node sends a deterministic message in a transmission time slot. Exemplarily, a transmission time slot may include multiple symbols, and the target time may be a symbol before the symbol at which the first node sends a deterministic message in the transmission time slot. For example, a transmission time slot may include 14 symbols. If the first node sends a message header of a deterministic message starting from the second symbol of the transmission time slot, the target time may be the first symbol in the transmission time slot.

[0064] In some embodiments, the indication message is used to enable the second node to define a time slot range. Exemplarily, the second node can determine which transmission time slot of the first node the indication message and the deterministic message following the indication message belong to based on the number of indication messages received.

[0065] In some embodiments, the above-mentioned indication message may include: a quantity identifier. The quantity identifier is used to identify the number of deterministic messages following the indication message. Exemplarily, assuming that the first node sends an indication message to the second node at the beginning of the first transmission time slot, and then the first node sends 7 deterministic messages to the second node after the indication message (the 7 deterministic messages are all sent by the first node in the first transmission time slot), the quantity identifier in the indication message is 7.

[0066] It is understandable that the messages sent by the first node in the same sending time slot may include only deterministic messages or other messages except deterministic messages. Therefore, in order to distinguish, the indication message may carry a quantity identifier to identify the number of deterministic messages following the indication message.

[0067] Exemplarily, the messages sent by the first node in the same transmission time slot may include deterministic messages and best-effort (BE) messages. Among them, strict priority scheduling is adopted between deterministic messages and BE messages (the priority of deterministic messages is higher than the priority of BE messages). The second node only needs to perform periodic scheduling on the deterministic messages (that is, the second node only needs to determine the transmission time slot to which the deterministic messages received by the second node belong, and the receiving time slot into which they fall).

[0068] The first node sends a deterministic message after sending the indication message, and sends a BE message after sending the deterministic message. Therefore, in order to distinguish the deterministic message from the BE message, the above quantity identifier may be added to the indication message.

[0069] In some embodiments, when the first node and the second node adopt a multi-cycle template (for example, the first node and the second node both include a first scheduling cycle and a second scheduling cycle), the above-mentioned indication message may also include: an identifier of the scheduling cycle. The identifier of the scheduling cycle is used to identify the identifier of the scheduling cycle to which the sending time slot (the sending time slot of the sending indication message) or the receiving time slot (the receiving time slot of the receiving indication message) belongs. For example, if the sending time slot of the indication message belongs to the first scheduling cycle, the indication message may include the identifier of the first scheduling cycle; if the sending time slot of the indication message belongs to the second scheduling cycle, the indication message may include the identifier of the second scheduling cycle.

[0070] In some embodiments, the indication message may be a physical coding sublayer (PCS) of the Ethernet standard.

[0071] For example, Figure 4 As shown in (a) of FIG. 1 , the PCS code block sequence includes: a start block (S block), multiple data blocks (D blocks) and an end block (T block). The structure of the S block is: "0b100x78" + 7 "0x55".

[0072] As a possible implementation, the S block in the PCS code block sequence can be expanded to obtain an indication message. For example, the "0x78" in the S block can be modified to indicate that the message is an indication message; the seven "0x55" can be modified to be a quantity identifier and a scheduling period identifier.

[0073] For example, Figure 4 As shown in (b), the "0x78" in the S block can be changed to "0x79" to indicate that the message is an indication message; the last 4 "0x55" in the S block can be changed to the quantity identifier and the scheduling period identifier.

[0074] As another possible implementation, the D block in the PCS code block sequence may be expanded to obtain the indication message. For example, the number of D blocks in the PCS code block sequence is made less than 4, so as to indicate that the message is an indication message. The D block or T block carries the number identifier and the scheduling period identifier.

[0075] Exemplarily, the format of the PCS code block sequence is defined as: S+n*D (n is any one of 0, 1, 2, and 3)+T. For example, the PCS code block sequence may be any one of the following: S+T code block sequence, S+D+T code block sequence, S+D+D+T code block sequence, and S+D+D+D+T code block sequence.

[0076] It should be understood that, since the shortest message length defined by the Ethernet standard is 64 bytes, the number of D blocks in the PCS code block sequence is not less than 4, and less than 4 D blocks are illegal message blocks. The receiving end discards the code block sequence after receiving it, so the number of D blocks in the PCS message can be adjusted (even if the number of D blocks is less than 4) to indicate that the message is an indication message. In this way, after receiving the message, the receiving end (such as the second node) can determine that the message is an indication message by judging the number of D blocks, and then extract the extended information on the D block or T block (such as the quantity identifier and the scheduling period identifier), and then discard the indication message.

[0077] In some embodiments, the above-mentioned indication message may be a PAUSE frame. In the Ethernet standard, the PAUSE frame is used to notify the opposite device to suspend sending messages. Thus, after receiving the PAUSE frame, the receiving device starts the flow control operation, stops sending the data stream, and then discards the PAUSE frame message.

[0078] For example, Figure 5 As shown in (a) in FIG. 1 , the format of the PAUSE frame message may include fields as shown in Table 1 below:

[0079] Table 1

[0080]

[0081] The operation parameter yy-yy of the PAUSE_TIMING field is the time at which the sender of the PAUSE frame requests the receiver of the PAUSE frame to stop sending data frames.

[0082] As a possible implementation, the operation parameter yy-yy of the PAUSE_TIMING field in the PAUSE frame may be modified to indicate that the message is an indication message. The quantity identifier and the scheduling period identifier may be carried in the PAD reserved field.

[0083] For example, Figure 5As shown in (b), the operation parameter yy-yy of the PAUSE_TIMING field can be modified to "0x0000" to indicate that the message is an indication message. In which, the operation parameter is set to 0, and the message sending of the other end will not be suspended. The PAD reserved field carries the quantity identifier and the scheduling period identifier.

[0084] In some embodiments, the above indication message may be a standard Ethernet message.

[0085] For example, Figure 6 As shown in (a) in FIG. 1 , the format of a standard Ethernet message may include fields as shown in Table 2 below:

[0086] Table 2

[0087] Fields byte illustrate Operation parameters DA 6 Destination MAC address 01-80-c2-00-00-01 SA 6 Source MAC address xx-xx-xx-xx-xx-xx EtherType 2 EtherType Field 0×8808 DATA n Data Fields xxxx FCS 4 Frame Check Field CRC

[0088] As a possible implementation, the operation parameters of the destination MAC address in the standard Ethernet message may be modified to indicate that the message is an indication message. The quantity identifier and the scheduling period identifier may be carried in the DATA field.

[0089] For example, Figure 6 As shown in (b), the operation parameter of the destination MAC address can be modified to "01-80-c2-00-00-10" to indicate that the message is an indication message, and the quantity identifier and the scheduling period identifier are carried in the DATA field.

[0090] As another possible implementation, the operation parameter of the EtherType field in the standard Ethernet message may be modified to indicate that the message is an indication message. The quantity identifier and the scheduling period identifier may be carried in the DATA field.

[0091] For example, Figure 6 As shown in (c), the operation parameter of the EtherType field can be modified to "0x9999" to indicate that the message is an indication message, and the quantity identifier and the scheduling period identifier are carried in the DATA field.

[0092] In some embodiments, the above indication message may be an Ethernet Y.1731 OAM message.

[0093] For example, Figure 7As shown, the Y.1731 OAM message includes: a maintenance domain level (MD level) field, a protocol version number (Version) field, a message code (OpCode) field, a Flag field (Flags) field, a TLV (Type, Lenght, Value) compensation (TLV offset) field, a data (DATA) field, and an end TLV (End TLV) field.

[0094] Among them, different values ​​of the operation parameter of the OpCode field represent different types of connectivity fault management (CFM) protocol data units (PDUs). Among them, when the operation parameter of the OpCode field is 0x01, the CFM PDU is a CCM PDU; when the operation parameter of the OpCode field is 0x02, the CFM PDU is an LBR PDU; when the operation parameter of the OpCode field is 0x03, the CFM PDU is an LBM PDU, etc.

[0095] The DATA field includes: sequence number (Sequence Number), sequence number service (Sequence NumberTransation) identity (Identification, ID, maintenance endpoint (Maintenance association EndPoint, MEP) ID, maintenance set (Maintenance Association, MA) ID, Y.1731, Qptional TLVs, etc.

[0096] As a possible implementation, Figure 7 As shown, the value of the operation parameter of the OpCode field can be modified to indicate that the message is an indication message. The operation parameter of the DATA field can be defined to carry the quantity identifier and the scheduling period identifier.

[0097] In some embodiments, the second node receives the Nth indication message sent by the first node in the Nth transmission time slot. Furthermore, when the indication message includes a quantity identifier, the second node can extract the quantity identifier from the indication message and mark the deterministic message following the indication message according to the quantity identifier.

[0098] Exemplarily, if the quantity identifier extracted by the second node from the indication message is 7, the second node identifies 7 messages following the indication message as deterministic messages.

[0099] It should be understood that in a path including a first node and a second node, the first node may be an upstream node of the second node, and the second node may also forward a message received from the first node to a downstream node of the second node.

[0100] S202: The first node sends an N+1th indication message to the second node in the N+1th sending time slot of the first node.

[0101] In some embodiments, the above step S202 may be implemented as: sending the N+1th indication message to the second node at the target time of the N+1th sending time slot of the first node.

[0102] For example, Figure 8 As shown, the first node sends the first indication message SP-1 at the start time of the first transmission time slot, sends the second indication message SP-2 at the start time of the second transmission time slot, and sends the third indication message SP-3 at the start time of the third transmission time slot. Then the messages between SP-1 and SP-2 belong to the first transmission time slot, and the messages between SP-2 and SP-3 belong to the second transmission time slot. The transmission time slots marked by SP-1 and SP-2 are marked as<SP-1,SP-2> ; Mark the transmission time slots marked by SP-2 and SP-3 as<SP-2,SP-3> .

[0103] In some embodiments, the second node receives the N+1th indication message sent by the first node in the N+1th sending time slot.

[0104] S203: The second node determines the deterministic message sent by the first node in the Nth sending time slot from the messages received by the second node between the Nth indication message and the N+1th indication message.

[0105] Exemplarily, if the first node sends the first indication message to the second node at the beginning of the first node's first sending time slot; the first node sends the second indication message to the second node at the beginning of the first node's second sending time slot; then the second node can determine the deterministic message sent by the first node in the first sending time slot of the first node from the messages received between the first indication message and the second indication message.

[0106] It can be understood that compared with the method in the related art that needs to modify the encapsulation of the existing message to carry the time slot label information in the message, the method provided in the embodiment of the present application does not need to change the encapsulation of the existing message. It only requires the upstream node to send an indication message for defining the time slot range to the downstream node in each sending time slot. In this way, the downstream node can determine the deterministic message belonging to the same sending time slot of the upstream node based on the received indication message, and thus can achieve deterministic scheduling transmission without modifying the message encapsulation.

[0107] In some embodiments, Fig. 9 As shown, the above method further includes the following step S204:

[0108] S204: The second node determines a receiving time slot to which a deterministic message received by the second node between the Nth indication message and the N+1th indication message belongs.

[0109] In some embodiments, the second node may construct an association relationship between a deterministic message received by the second node and a receiving time slot of the second node.

[0110] As a possible implementation manner, an association relationship may be established based on the receiving time slots to which the deterministic messages between the first indication message and the second indication message received by the second node belong, and the number of time slots in the circular queue of the second node.

[0111] Exemplarily, it is assumed that the receiving time slot to which the deterministic message of the second node between SP-1 (the first indication message) and SP-2 (the second indication message) belongs is the receiving time slot a, that is: {SP-1, SP-2}-a; then according to the number of time slots of the circular queue of the second node, it can be determined that the association relationship satisfies the following formula (1):

[0112] {SP-x, SP-x+1}——REM(a+x-1,N) formula (1)

[0113] Among them, SP represents the indication message, x represents the number of indication messages, {SP-x, SP-x+1} represents the deterministic message between SP-x and SP-x+1; REM is the remainder function; a represents the number of the receiving time slot to which the deterministic message between SP-1 and SP-2 received by the second node belongs; N represents the number of the circular queue time slots of the second node.

[0114] Thus, the above step S204 can be implemented as follows: according to the association relationship (such as the association relationship shown in the above formula (1)), determine the receiving time slot to which the deterministic message received by the second node between the Nth indication message and the N+1th indication message belongs.

[0115] For example, Figure 8 As shown, when the second node receives the three indication messages SP-1, SP-2 and SP-3, the second node can determine that the deterministic messages (including SP-1) received by the second node between SP-1 and SP-2 belong to the same sending time slot of the first node (further, the second node can determine that the deterministic messages (including SP-1) received by the second node between SP-1 and SP-2 belong to the first sending time slot of the first node), and fall into the first first receiving time slot and the second first receiving time slot of the second node (or, it can be considered to fall into the second first receiving time slot of the second node).

[0116] The second node can determine that the deterministic message (including SP-2) received by the second node between SP-2 and SP-3 belongs to the same transmission time slot of the first node (further, the second node can determine that the deterministic message (including SP-1) received by the second node between SP-1 and SP-2 belongs to the second transmission time slot of the first node). In addition, the second node can also determine the order of receiving time slots according to the order of receiving SP-1, SP-2 and SP-3, for example<SP-2,SP-3> The receiving time slot that falls into is<SP-1,SP-2> The next receiving time slot, so it is determined<SP-2,SP-3> The deterministic message between them falls into the third first receiving time slot.

[0117] For example, Fig.10 As shown in FIG. 1 , if the message sent by the first node in the same sending time slot includes a deterministic message and a BE message, and the indication message sent by the first node includes a quantity identifier, after receiving the SP-1 and SP-2 messages, the second node first extracts the quantity identifier m (indicating that the number of deterministic messages is m) carried in SP-1, and then extracts the quantity identifier m from the SP-1.<SP-1,SP-2> Mark m deterministic messages in the messages received between the two, and use the BE scheduling method by default for all the remaining messages; after receiving the SP-2 message, extract the number identifier n carried in the SP-2 message (the number of deterministic messages is n), and<SP-2,SP-3> Among the messages received, n deterministic messages are marked in sequence, and the BE scheduling method is adopted by default for all the remaining messages.

[0118] In some embodiments, after step S204, the method further includes: the second node discards the indication message. It can be understood that the main function of the indication message is to enable the second node to determine which transmission time slot of the first node the deterministic message received by the second node belongs to, and which reception time slot of the second node it falls into. Therefore, after the above step S204, the mission of the indication message has been completed, and the second node can discard the indication message to avoid redundancy.

[0119] In some embodiments, after step S204, the method further includes: the second node marking the time slot number of the receiving time slot to which the deterministic message belongs in the internal message header of the deterministic message; and sending the marked deterministic message to the egress port of the second node.

[0120] It can be understood that the second node can mark the time slot number of the receiving time slot to which the deterministic message belongs in the internal message header of the deterministic message, and then send the marked deterministic message to the egress port of the second node. In this way, the egress port of the second node can forward the received deterministic message to the downstream node of the second node according to the data transmission method provided in the embodiment of the present application to realize deterministic transmission.

[0121] For ease of understanding, the data transmission method provided in the above steps S201 - S204 is described below in the form of an example.

[0122] For example, Fig.11 As shown, for the received message, the overall processing flow of the second node may include the following steps:

[0123] Sa1. The ingress port of the second node receives the indication message and the service message.

[0124] Exemplarily, the second node identifies the indication message from the received messages, and maintains a counter to record the number of received indication messages. For example, the xth indication message is recorded as: SP-x.

[0125] Sa2. The second node determines whether the currently received indication message is the first indication message.

[0126] If yes, return to step Sa1; if no, execute the following step Sa3.

[0127] Sa3. The second node determines whether the currently received indication message is the second indication message.

[0128] If yes, execute the following step Sa4; if no, execute the following step Sa5.

[0129] Sa4, the second node determines that the second node is<SP-1,SP-2> The message received between the two nodes falls into the time slot number a of the receiving time slot, and an association relationship between the deterministic message received by the second node and the receiving time slot of the second node is established.

[0130] Exemplarily, the above association relationship satisfies the above formula (1).

[0131] Sa5. The second node determines the second node according to the association relationship.<SP-x,SP-x+1> The time slot number of the receiving time slot into which the message received during the period falls.

[0132] For example, the second node is<SP-x,SP-x+1> The receiving time slot into which the message received during this period falls is: MOD(a+x-1,N).

[0133] Sa6, the second node extracts the quantity identifier y from the indication message, and then<SP-x,SP-x+1> Among the messages received during the period, y deterministic messages are marked in sequence, and the rest of the messages are marked as BE messages.

[0134] Sa7: The second node discards the indication message, and marks the time slot number of the receiving time slot to which the deterministic message belongs in the internal message header of the deterministic message, and then sends the deterministic message to the egress port of the second node.

[0135] It can be seen that based on the data transmission method provided in the embodiment of the present application, the second node can determine the sending time slot to which the deterministic message received by the second node belongs and the receiving time slot to which it falls based on the received indication message (the number of indication messages and the information carried by the indication message), thereby realizing deterministic scheduled transmission.

[0136] In some embodiments, the method provided in the above steps S201-S204 may be a data transmission method in a single-cycle template scenario (eg, the first node and the second node only use the first scheduling cycle).

[0137] In other embodiments, the method provided by the above steps S201-S204 may be a data transmission method for any scheduling period in a multi-period template scenario (for example, the first node and the second node may use a first scheduling period and a second scheduling period). For example, the method provided by the above steps S201-S204 may be a data transmission method for the first scheduling period in a multi-period template scenario.

[0138] In some embodiments, Fig.12 As shown, in a scenario of a multi-period template (for example, a first node and a second node may use a first scheduling period and a second scheduling period), the data transmission method provided in an embodiment of the present application may include the following steps:

[0139] S301. A first node sends an Nth first indication message to a second node in an Nth first sending time slot of the first node.

[0140] In some embodiments, the first node may use a first scheduling period to send a message, wherein the first scheduling period includes a plurality of first sending time slots (ie, the first sending time slots belong to the first scheduling period).

[0141] The first indication message is an indication message sent by the first node to the second node in the first sending time slot.

[0142] In some embodiments, the first indication message includes an identifier of a first scheduling period to which the first transmission time slot belongs.

[0143] In some embodiments, the first indication message further includes a quantity identifier, which is used to identify the quantity of first deterministic messages following the first indication message, wherein the first deterministic message is a deterministic message scheduled by the first node in the first scheduling period.

[0144] In some embodiments, the above step S301 may be implemented as follows: at the start time of the Nth first sending time slot of the first node, the first node sends the Nth first indication message to the second node.

[0145] In some embodiments, the above step S301 may be implemented as follows: before the first node sends the first deterministic message in the Nth first sending time slot of the first node, the first node sends the Nth first indication message to the second node.

[0146] The first indication message is used to enable the second node to define the first transmission time slot range. Exemplarily, the second node can determine which first transmission time slot of the first node the first indication message and the first deterministic message following the first indication message belong to based on the number of first indication messages received.

[0147] In some embodiments, the second node may receive the Nth first indication message sent by the first node in the Nth first transmission time slot. In the case where the first indication message includes a quantity identifier, the second node may extract the quantity identifier from the first indication message, and mark the first deterministic message following the first indication message according to the quantity identifier. In the case where the first indication message includes an identifier of a scheduling period, the second node may extract the identifier of the first scheduling period from the first indication message, and further determine that the first deterministic message following the first indication message belongs to the first scheduling period.

[0148] S302: The first node sends a Pth second indication message to the second node in a Pth second sending time slot of the first node.

[0149] Wherein, P is an integer greater than or equal to 1.

[0150] In some embodiments, the first node may also use a second scheduling period to send the message, wherein the second scheduling period includes a plurality of second sending time slots (ie, the second sending time slots belong to the second scheduling period).

[0151] The second indication message is an indication message sent by the first node to the second node in the second sending time slot.

[0152] In some embodiments, the second indication message includes an identifier of a second scheduling period to which the second transmission time slot belongs, wherein the priority of the first scheduling period is higher than the priority of the second scheduling period.

[0153] In some embodiments, the second indication message further includes a quantity identifier, which is used to identify the quantity of second deterministic messages following the second indication message, wherein the second deterministic message is a deterministic message scheduled by the first node in the second scheduling period.

[0154] In some embodiments, the above step S302 may be implemented as follows: at the start time of the Pth second sending time slot of the first node, the first node sends the Pth second indication message to the second node.

[0155] In some embodiments, the above step S302 may be implemented as follows: before the first node sends the second deterministic message in the Pth second sending time slot of the first node, the first node sends the Pth second indication message to the second node.

[0156] In some embodiments, the second indication message is used to enable the second node to define the second transmission time slot range. Exemplarily, the second node can determine which second transmission time slot of the first node the second indication message and the second deterministic message following the second indication message belong to based on the number of second indication messages received.

[0157] In some embodiments, the second node may receive the Pth second indication message sent by the first node in the Pth second transmission time slot. In the case where the second indication message includes a quantity identifier, the second node may extract the quantity identifier from the second indication message, and mark the second deterministic message following the second indication message according to the quantity identifier. In the case where the second indication message includes an identifier of a scheduling period, in some embodiments, the second node may extract the identifier of the second scheduling period from the second indication message, and then determine to which scheduling period the second deterministic message following the second indication message belongs.

[0158] Exemplarily, if the identifier of the scheduling period extracted by the second node from the second indication message is the identifier of the second scheduling period, the second node determines that the second deterministic message following the second indication message belongs to the second scheduling period.

[0159] S303: The first node sends an N+1th first indication message to the second node in the N+1th first sending time slot of the first node.

[0160] In some embodiments, the specific implementation of the above step S303 can refer to the specific implementation of the above step S301, which will not be repeated here.

[0161] In some embodiments, the second node may receive the N+1th first indication message sent by the first node in the N+1th first sending time slot.

[0162] S304: The second node determines the first deterministic message sent by the first node in the Nth first sending time slot from the messages received by the second node between the Nth first indication message and the N+1th first indication message.

[0163] Exemplarily, if the first node sends the first first indication message to the second node at the starting time of the first first sending time slot of the first node; the first node sends the second first indication message to the second node at the starting time of the second first sending time slot of the first node; then the second node can determine the first deterministic message sent by the first node in the first first sending time slot of the first node from the messages received between the first first indication message and the second first indication message.

[0164] S305. The first node sends a P+1th second indication message to the second node in the P+1th second sending time slot of the first node.

[0165] In some embodiments, the specific implementation of the above step S305 can refer to the specific implementation of the above step S302, which will not be repeated here.

[0166] In some embodiments, the Pth second transmission time slot is located between the Nth first transmission time slot and the N+1th first transmission time slot in the time domain, and the P+1th second transmission time slot is located after the N+1th first transmission time slot in the time domain.

[0167] In some embodiments, the second node may receive the P+1th second indication message sent by the first node in the P+1th second sending time slot.

[0168] S306: The second node determines the second deterministic message sent by the first node in the Pth second sending time slot from the messages received by the second node between the Pth second indication message and the P+1th second indication message.

[0169] Exemplarily, if the first node sends the first second indication message to the second node at the starting time of the first node's first second sending time slot; the first node sends the second second indication message to the second node at the starting time of the first node's second second sending time slot; then the second node can determine the second deterministic message sent by the first node in the first second sending time slot of the first node from the messages received between the first second indication message and the second second indication message.

[0170] In some embodiments, a portion of the X second deterministic messages indicated by the Pth second indication message is located before the Y first deterministic messages indicated by the N+1th first indication message, and another portion is located after the Y first deterministic messages. Wherein, X is the number identifier of the second deterministic messages indicated by the P second indication messages; and Y is the number identifier of the first deterministic messages indicated by the N+1th first indication message.

[0171] It is understandable that, since the priority of the first scheduling period is higher than the priority of the second scheduling period, when the first node receives the first deterministic message to be sent during the process of sending the second deterministic message, the first node interrupts sending the second deterministic message and starts sending the first deterministic message to be sent. After the first deterministic message to be sent is sent, the first node restarts sending the second deterministic message.

[0172] In some embodiments, after the above step S304, the above method further includes: the second node determines the receiving time slot to which the deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs.

[0173] In some embodiments, the receiving time slot of the second node may include a first receiving time slot, wherein the first receiving time slot belongs to the first scheduling period. In this way, the second node can determine that the first deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs to the first receiving time slot.

[0174] As a possible implementation manner, the second node may determine, according to the above formula (1), to which first receiving time slot of the second node the first deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs.

[0175] In some embodiments, after the above step S306, the above method further includes: the second node determines the receiving time slot to which the deterministic message received by the second node between the Pth second indication message and the P+1th second indication message belongs.

[0176] In some embodiments, the receiving time slot of the second node may include a second receiving time slot, wherein the second receiving time slot belongs to the second scheduling period. In this way, the second node can determine that the second deterministic message received by the second node between the Pth second indication message and the P+1th second indication message belongs to the second receiving time slot.

[0177] As a possible implementation, the second node may determine, according to the above formula (1), which second receiving time slot among the second receiving time slots of the second node the second deterministic message received by the second node between the P-th second indication message and the (P + 1)-th second indication message belongs to.

[0178] For ease of understanding, the data transmission method in the multi-cycle template scenario will be described below by way of example.

[0179] Exemplarily, it is assumed that the multi-cycle template includes scheduling cycle A and scheduling cycle B; among them, the priority of scheduling cycle A is higher than that of scheduling cycle B. Scheduling cycle A transmits deterministic message A; scheduling cycle B transmits deterministic message B. The priority of deterministic message A is higher than that of deterministic message B, and the priority of deterministic message B is higher than that of the BE message.

[0180] Exemplarily, as Fig.13 shown, the second node extracts the quantity identifier m and the identifier A of the scheduling cycle from SP-1; then marks m messages after SP-1 as deterministic message A. The second node extracts the quantity identifier n and the identifier B of the scheduling cycle from SP-2; then marks n messages after SP-2 as deterministic message B; however, after the second node has marked i (i < n) deterministic messages B and receives SP-3 (at this time there are still n - i deterministic messages B unmarked), extracts the quantity identifier h and the identifier A of the scheduling cycle from SP-3; since the priority of deterministic message A is higher than that of deterministic message B, the second node first marks h messages after SP-3 as deterministic message A in sequence, and then marks the following n - i messages as deterministic message B according to the priority scheduling rule. After both deterministic message A and deterministic message B are marked, the remaining messages are marked as BE messages.

[0181] For scheduling cycle A and scheduling cycle B, the second node determines the receiving time slots to which the received deterministic message A and deterministic message B belong according to the association relationship shown in the above formula (1), thereby realizing the scheduling and forwarding of deterministic messages.

[0182] It can be seen that the data transmission method provided by the embodiments of the present application can carry the identifier of the scheduling cycle in the indication message, thereby realizing data transmission in the multi-cycle template scenario. In this way, compared with the method in the related art that needs to modify the encapsulation of the existing message to make the message carry the time slot label information, the embodiments of the present application can realize deterministic scheduling transmission without modifying the message encapsulation.

[0183] Next, taking the indication message as the Y.1731 OAM message as an example, the data transmission method in the single-cycle template scenario will be described.

[0184] For example, Fig.14 As shown in (a), the operation parameter of the OpCode field in the Y.1731 OAM message is defined as: OpCode = 0x08, to indicate that the message is an indication message in a single-cycle template scenario. The number identifier is defined in the DATA field as: DetNet Packets Number, which occupies 24 bits; the rest of the DATA field is reserved for extension.

[0185] When the second node receives the above message, it first determines that the message is a Y.1731 OAM message according to EtherType=0x8902; and further identifies that the message is an indication message in a single-cycle template scenario according to OpCode=0x08.

[0186] For example, Fig.14 As shown in (b), the first node sends an indication message SP-1 at the starting time of the first sending time slot, and the quantity carried in SP-1 is identified as 3; sends an indication message SP-1 at the starting time of the second sending time slot, and the quantity carried in SP-2 is identified as 4; and sends an indication message SP-3 at the starting time of the third sending time slot.

[0187] When the message arrives at the second node, the second node identifies the indication messages SP-1, SP-2, and SP-3. It identifies the messages belonging to the same transmission time slot based on SP-1 and SP-2, and identifies the messages belonging to the same transmission time slot based on SP-2 and SP-3. It determines the receiving time slots that SP-1, SP-2, and SP-3 fall into.<SP-1,SP-2> The message between falls into receiving time slot 1 and receiving time slot 2 (or is considered to fall into receiving time slot 2), and then the association relationship between the message and the receiving time slot is {SP-1, SP-2}-2.

[0188] The second node can be based on<SP-1,SP-2> The time slot number of the receiving time slot into which the message between falls (ie, receiving time slot 2) is constructed to establish an association relationship between the deterministic message received by the second node and the receiving time slot of the second node.

[0189] For example, the association relationship can be expressed as: {SP-x, SP-x+1}——REM(2+x-1, 5), where 5 is the number of time slots in the circular queue.

[0190] For the second node<SP-1,SP-2> The second node marks the message received between<SP-1,SP-2> The first three messages between are deterministic messages. Then, according to the association relationship {SP-1, SP-2}-2, the receiving time slot 2 is marked in the internal message header of the deterministic message, and then the marked deterministic message is sent to the egress port of the second node.

[0191] <SP-1,SP-2> The remaining four messages are marked as BE messages and are processed according to the scheduling method of BE messages.

[0192] For the second node<SP-2,SP-3> The second node marks the message received between<SP-2,SP-3> The first four messages between are deterministic messages. Then, according to the association relationship {SP-2, SP-3}-3, the receiving time slot 3 is marked in the internal message header of the deterministic message, and then the marked deterministic message is sent to the egress port of the second node.<SP-2,SP-3> The remaining three messages are marked as BE messages and are processed according to the scheduling method of BE messages.

[0193] The second node is<SP-3,SP-4> The messages in the time slots between and after are processed in the same way as

[0194] <SP-2,SP-3> The same is not repeated here.

[0195] It should be noted that Fig.14 The "D" in the message stands for DetNet, indicating that the message is a deterministic message. The "BE" in the message stands for a BE message.

[0196] The following describes a data transmission method in a single-cycle template scenario by taking the indication message being a Y.1731 OAM message as an example.

[0197] For example, Fig.15 As shown in (a), the operation parameter of the OpCode field in the Y.1731OAM message is defined as: OpCode = 0x09, to indicate that the message is an indication message in a multi-cycle template scenario. The number identifier is defined in the DATA field as: DetNet Packets Number, which occupies 24 bits; the cycle template information Cycle Template is defined, which occupies 3 bits. The rest of the DATA field is reserved for extension.

[0198] When the second node receives the above message, it first determines that the message is a Y.1731 OAM message according to EtherType=0x8902, and further identifies that the message is an indication message in a multi-period template scenario according to OpCode=0x09. At this time, the quantity identifier and the scheduling period identifier can also be extracted from the indication message.

[0199] For example, Fig.15 As shown in (b) in FIG. 1 , the multi-cycle template includes a scheduling cycle A and a scheduling cycle B; wherein, the priority of scheduling cycle A is higher than that of scheduling cycle B. Scheduling cycle A transmits deterministic message A ( Fig.15 In the above example, "AD" indicates deterministic message A); scheduling period B transmits deterministic message B ( Fig.15 In the figure, "BD" represents deterministic message B). The priority of deterministic message A is higher than that of deterministic message B, and the priority of deterministic message B is higher than that of BE message.

[0200] The first node sends an indication message SP-1 at the starting moment of the first sending time slot of the scheduling cycle A, SP-1 carries the identifier A of the scheduling cycle and the quantity identifier 3; sends an indication message SP-3 at the starting moment of the second sending time slot of the scheduling cycle A, SP-3 carries the identifier A of the scheduling cycle and the quantity identifier 4; sends an indication message SP-4 at the starting moment of the third sending time slot of the scheduling cycle A, SP-4 carries the identifier A of the scheduling cycle and the quantity identifier 0.

[0201] The first node sends an indication message SP-2 before the moment when the first node sends the head of the deterministic message B in the first sending time slot of the scheduling cycle B, and SP-2 carries the identifier B of the scheduling cycle and the quantity identifier 7; the first node sends an indication message SP-5 before the moment when the first node sends the head of the deterministic message B in the second sending time slot of the scheduling cycle B, and SP-5 carries the identifier B of the scheduling cycle and the quantity identifier 0.

[0202] When the message arrives at the second node, the second node identifies the indication messages SP-1, SP-2, SP-3, SP-4 and SP-5. The second node identifies the message belonging to the same transmission time slot of scheduling period A according to SP-1 and SP-3; and identifies the message belonging to the same transmission time slot of scheduling period A according to SP-3 and SP-4. The second node identifies the message belonging to the same transmission time slot of scheduling period B according to SP-2 and SP-5.

[0203] According to the receiving time slots where SP-1, SP-3 and SP-4 fall, it is determined that<SP-1,SP-3> The message between falls into the receiving time slot 1 and the receiving time slot 2 of the scheduling period A (or is considered to fall into the receiving time slot 2); determine<SP-3,SP-4> The message between SP-2 and SP-5 falls into the receiving time slot 2 and receiving time slot 3 of the scheduling cycle A (or is considered to fall into the receiving time slot 3). The second node determines the receiving time slots that SP-2 and SP-5 fall into.<SP-2,SP-5> The messages between fall into the receiving time slot 1 and the receiving time slot 2 of the scheduling period B (or are considered to fall into the receiving time slot 2).

[0204] For the second node<SP-1,SP-3> The second node marks the message received between<SP-1,SP-3> The first three messages between are deterministic messages A.

[0205] For the second node<SP-3,SP-4> The second node marks the message received between<SP-3,SP-4> The first four messages between are deterministic messages A.

[0206] For the second node<SP-2,SP-5> The second node marks the message received between<SP-2,SP-5> The first 7 messages between are deterministic messages B.

[0207] During this process, if a high-priority deterministic message (for example, deterministic message A) is received, the marking of deterministic message B is suspended, and the high-priority deterministic message is marked first. After the high-priority deterministic message is marked, the deterministic message B is marked. The remaining messages that have not been marked are all BE messages.

[0208] After identifying the receiving time slot to which the deterministic message belongs, the time slot number of the receiving time slot is marked in the internal message header of the deterministic message, and then the marked deterministic message is sent to the egress port of the second node.

[0209] It is understandable that, in order to realize the above functions, the data transmission device includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should easily realize that, in conjunction with the algorithm steps of each example described in the embodiments of the present application, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present application.

[0210] The embodiment of the present application can divide the data transmission device into functional modules according to the above method embodiment. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one functional module. The above integrated module can be implemented in the form of hardware or software. It should be noted that the division of modules in the embodiment of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation. The following is an example of dividing each functional module corresponding to each function.

[0211] Fig.16 is a schematic diagram of the structure of a data transmission device provided in an embodiment of the present application, and the data transmission device is applied to a first node. Fig.16 As shown, the data transmission device 400 includes: a sending module 401.

[0212] A sending module 401 is used to send the Nth first indication message to the second node in the Nth first sending time slot of the first node; N is an integer greater than or equal to 1; and to send the N+1th first indication message to the second node in the N+1th first sending time slot of the first node; the Nth first indication message and the N+1th first indication message are used to enable the second node to determine the deterministic message sent by the first node in the Nth first sending time slot from the messages received between the Nth first indication message and the N+1th first indication message.

[0213] In some embodiments, the sending module 401 is specifically used to send the Nth first indication message to the second node at the target time of the Nth first sending time slot of the first node; and to send the N+1th first indication message to the second node at the target time of the N+1th first sending time slot of the first node; wherein the target time is the starting time of the first sending time slot; or, the target time is the time before the first node sends a deterministic message in the first sending time slot.

[0214] In some embodiments, the first indication message includes a quantity identifier; the quantity identifier is used to identify the quantity of deterministic messages following the first indication message.

[0215] In some embodiments, the sending module 401 is also used to send the Pth second indication message to the second node in the Pth second sending time slot of the first node; to send the P+1th second indication message to the second node in the P+1th second sending time slot of the first node; the Pth second indication message and the P+1th second indication message are used to enable the second node to determine the deterministic message sent by the first node in the Pth second sending time slot from the messages received between the Pth second indication message and the P+1th second indication message.

[0216] In some embodiments, the first indication message includes an identifier of a first scheduling period to which the first transmission time slot belongs, and the second indication message includes an identifier of a second scheduling period to which the second transmission time slot belongs; the priority of the first scheduling period is higher than the priority of the second scheduling period.

[0217] In some embodiments, the Pth second transmission time slot is located between the Nth first transmission time slot and the N+1th first transmission time slot in the time domain, and the P+1th second transmission time slot is located after the N+1th first transmission time slot in the time domain; a part of the X second deterministic messages indicated by the Pth second indication message is located before the Y first deterministic messages indicated by the N+1th first indication message, and the other part is located after the Y first deterministic messages; wherein, the first deterministic message is a deterministic message scheduled within the first scheduling period; the second deterministic message is a deterministic message scheduled within the second scheduling period; X is the number identifier of the second deterministic messages indicated by the P second indication messages; and Y is the number identifier of the first deterministic messages indicated by the N+1th first indication message.

[0218] In some embodiments, the indication message is one of the following: PCS; PAUSE frame; standard Ethernet message; Ethernet Y.1731 OAM message.

[0219] Fig.17 is a schematic diagram of a data transmission device provided in an embodiment of the present application, and the data transmission device is applied to a second node. Fig.17 As shown, the data transmission device 500 includes: a receiving module 501 and a determining module 502. In some other embodiments, the data transmission device 500 further includes a constructing module 503, a marking module 504 and a sending module 505.

[0220] The receiving module 501 is configured to receive the Nth first indication message sent by the first node in the Nth first sending time slot; and receive the N+1th first indication message sent by the first node in the N+1th first sending time slot.

[0221] The determination module 502 is configured to determine the deterministic message sent by the first node in the Nth first sending time slot from the messages received by the second node between the Nth first indication message and the N+1th first indication message.

[0222] In some embodiments, the determination module 502 is further configured to determine a receiving time slot to which a deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs.

[0223] In some embodiments, the construction module 503 is used to construct an association relationship between the deterministic message received by the second node and the receiving time slot of the second node; the determination module 502 is specifically used to determine the receiving time slot to which the deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs based on the association relationship.

[0224] In some embodiments, the construction module 503 is specifically used to construct an association relationship based on the receiving time slots to which the deterministic messages between the first first indication message and the second first indication message received by the second node belong, and the number of circular queue time slots of the second node.

[0225] In some embodiments, the marking module 504 is used to mark the time slot number of the receiving time slot to which the deterministic message belongs in the internal message header of the deterministic message; the sending module 505 is used to send the marked deterministic message to the egress port of the second node.

[0226] In some embodiments, the first indication message includes a quantity identifier, which is used to identify the number of deterministic messages following the first indication message; the marking module 504 is also used to extract the quantity identifier from the first indication message and mark the deterministic message following the first indication message according to the quantity identifier.

[0227] In some embodiments, after receiving the Nth first indication message sent by the first node in the Nth first sending time slot, the receiving module 501 is further used to receive the Pth second indication message sent by the first node in the Pth second sending time slot; receive the P+1th second indication message sent by the first node in the P+1th second sending time slot; and the determination module 502 is further used to determine the deterministic message sent by the first node in the Pth second sending time slot from the messages received by the second node between the Pth second indication message and the P+1th second indication message.

[0228] In some embodiments, the first indication message includes an identifier of a first scheduling period to which the first transmission time slot belongs, and the second indication message includes an identifier of a second scheduling period to which the second transmission time slot belongs; the priority of the first scheduling period is higher than the priority of the second scheduling period.

[0229] In some embodiments, the Pth second transmission time slot is located between the Nth first transmission time slot and the N+1th first transmission time slot in the time domain, and the P+1th second transmission time slot is located after the N+1th first transmission time slot in the time domain; a part of the X second deterministic messages indicated by the Pth second indication message is located before the Y first deterministic messages indicated by the N+1th first indication message, and the other part is located after the Y first deterministic messages; wherein, the first deterministic message is a deterministic message scheduled within the first scheduling period; the second deterministic message is a deterministic message scheduled within the second scheduling period; X is the number identifier of the second deterministic messages indicated by the P second indication messages; and Y is the number identifier of the first deterministic messages indicated by the N+1th first indication message.

[0230] In some embodiments, the receiving time slot of the second node includes a first receiving time slot and a second receiving time slot; the first receiving time slot belongs to the first scheduling period; the second receiving time slot belongs to the second scheduling period; the first deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs to the first receiving time slot; the second deterministic message received by the second node between the Pth second indication message and the P+1th second indication message belongs to the second receiving time slot.

[0231] In some embodiments, the indication message is one of the following: PCS; PAUSE frame; standard Ethernet message; Ethernet Y.1731 OAM message.

[0232] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, the embodiment of the present application provides another possible structure of the data transmission device involved in the above-mentioned embodiment. Fig.18 As shown, the data transmission device 600 includes: a processor 602 and a bus 604. Optionally, the data transmission device 600 may further include a memory 601; optionally, the data transmission device 600 may further include a communication interface 603.

[0233] The processor 602 may be a processor that implements or executes various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of the present application. The processor 602 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of the present application. The processor 602 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0234] The communication interface 603 is used to connect with other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0235] The memory 601 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk 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 can be accessed by a computer, but is not limited thereto.

[0236] As a possible implementation, the memory 601 may exist independently of the processor 602, and the memory 601 may be connected to the processor 602 via a bus 604 for storing instructions or program codes. When the processor 602 calls and executes the instructions or program codes stored in the memory 601, the data transmission method provided in the embodiment of the present application can be implemented.

[0237] In another possible implementation, the memory 601 may also be integrated with the processor 602 .

[0238] The bus 604 may be an extended industry standard architecture (EISA) bus, etc. The bus 604 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.18 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0239] Some embodiments of the present application provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium), which stores computer program instructions. When the computer program instructions are executed on a computer, the computer executes the data transmission method described in any of the above embodiments.

[0240] Exemplarily, the above-mentioned computer-readable storage media may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks or magnetic tapes, etc.), optical disks (e.g., compact disks (CD), digital versatile disks (DVD), etc.), smart cards and flash memory devices (e.g., erasable programmable read-only memory (EPROM), cards, sticks or key drives, etc.). The various computer-readable storage media described in this application may represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing and / or carrying instructions and / or data.

[0241] An embodiment of the present application provides a computer program product including instructions. When the computer program product is run on a computer, the computer is enabled to execute the data transmission method described in any one of the above embodiments.

[0242] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A data transmission method, characterized in that: Applied to a first node; the method comprises: Sending an Nth first indication message to the second node in an Nth first sending time slot of the first node, where N is an integer greater than or equal to 1; An N+1th first indication message is sent to the second node in the N+1th first sending time slot of the first node; the Nth first indication message and the N+1th first indication message are used to enable the second node to determine the deterministic message sent by the first node in the Nth first sending time slot from the messages received between the Nth first indication message and the N+1th first indication message.

2. The method according to claim 1, characterized in that: The sending the Nth first indication message to the second node in the Nth first sending time slot of the first node includes: Sending an Nth first indication message to the second node at a target time of the Nth first sending time slot of the first node; The sending the N+1th first indication message to the second node in the N+1th first sending time slot of the first node includes: Sending an N+1th first indication message to the second node at a target time of the N+1th first sending time slot of the first node; The target time is the start time of the first sending time slot; or the target time is the time before the first node sends the deterministic message in the first sending time slot.

3. The method according to claim 1, characterized in that The first indication message includes a quantity identifier; the quantity identifier is used to identify the quantity of the deterministic messages following the first indication message.

4. The method according to claim 3, characterized in that After sending the Nth first indication message to the second node in the Nth first sending time slot of the first node, the method further includes: Sending a P-th second indication message to the second node in a P-th second sending time slot of the first node; A P+1th second indication message is sent to the second node in the P+1th second sending time slot of the first node; the Pth second indication message and the P+1th second indication message are used to enable the second node to determine the deterministic message sent by the first node in the Pth second sending time slot from the messages received between the Pth second indication message and the P+1th second indication message.

5. The method according to claim 4, characterized in that The first indication message includes an identifier of a first scheduling period to which the first sending time slot belongs, and the second indication message includes an identifier of a second scheduling period to which the second sending time slot belongs; a priority of the first scheduling period is higher than a priority of the second scheduling period.

6. The method according to claim 5, characterized in that The Pth second transmission time slot is located between the Nth first transmission time slot and the N+1th first transmission time slot in the time domain, and the P+1th second transmission time slot is located after the N+1th first transmission time slot in the time domain; A part of the X second deterministic messages indicated by the Pth second indication message is located before the Y first deterministic messages indicated by the N+1th first indication message, and the other part is located after the Y first deterministic messages; wherein, the first deterministic message is a deterministic message scheduled within the first scheduling period; the second deterministic message is a deterministic message scheduled within the second scheduling period; the X is the quantity identifier of the second deterministic messages indicated by the P second indication messages; and the Y is the quantity identifier of the first deterministic messages indicated by the N+1th first indication message.

7. A data transmission method, characterized in that: Applied to the second node, the method comprises: Receiving an Nth first indication message sent by the first node in the Nth first sending time slot; Receiving the N+1th first indication message sent by the first node in the N+1th first sending time slot; A deterministic message sent by the first node in the Nth first sending time slot is determined from messages received by the second node between the Nth first indication message and the N+1th first indication message.

8. The method according to claim 7, characterized in that The method further comprises: Determine a receiving time slot to which the deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs.

9. The method according to claim 8, characterized in that The method further comprises: Establishing an association relationship between the deterministic message received by the second node and the receiving time slot of the second node; The determining the receiving time slot to which the deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs includes: According to the association relationship, determine the receiving time slot to which the deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs.

10. The method according to claim 9, characterized in that The constructing an association relationship between the deterministic message received by the second node and the receiving time slot of the second node includes: The association relationship is established based on the receiving time slots to which the deterministic messages between the first and second first indication messages received by the second node belong, and the number of time slots in the circular queue of the second node.

11. The method according to claim 10, characterized in that The method further comprises: Marking the time slot number of the receiving time slot to which the deterministic message belongs in the internal message header of the deterministic message; The marked deterministic message is sent to the egress port of the second node.

12. The method according to claim 7, characterized in that The first indication message includes a quantity identifier, and the quantity identifier is used to identify the quantity of deterministic messages following the first indication message; the method further includes: The quantity identifier is extracted from the first indication message, and the deterministic message following the first indication message is marked according to the quantity identifier.

13. The method according to claim 12, characterized in that After receiving the Nth first indication message sent by the first node in the Nth first sending time slot, the method further includes: Receiving a P-th second indication message sent by the first node in a P-th second sending time slot; Receiving the P+1th second indication message sent by the first node in the P+1th second sending time slot; A deterministic message sent by the first node in the Pth second sending time slot is determined from messages received by the second node between the Pth second indication message and the P+1th second indication message.

14. The method according to claim 13, characterized in that The first indication message includes an identifier of a first scheduling period to which the first sending time slot belongs, and the second indication message includes an identifier of a second scheduling period to which the second sending time slot belongs; a priority of the first scheduling period is higher than a priority of the second scheduling period.

15. The method according to claim 14, characterized in that The Pth second transmission time slot is located between the Nth first transmission time slot and the N+1th first transmission time slot in the time domain, and the P+1th second transmission time slot is located after the N+1th first transmission time slot in the time domain; A part of the X second deterministic messages indicated by the Pth second indication message is located before the Y first deterministic messages indicated by the N+1th first indication message, and the other part is located after the Y first deterministic messages; wherein, the first deterministic message is a deterministic message scheduled within the first scheduling period; the second deterministic message is a deterministic message scheduled within the second scheduling period; the X is the quantity identifier of the second deterministic messages indicated by the P second indication messages; and the Y is the quantity identifier of the first deterministic messages indicated by the N+1th first indication message.

16. The method according to claim 15, characterized in that The receiving time slot of the second node includes a first receiving time slot and a second receiving time slot; the first receiving time slot belongs to the first scheduling period; the second receiving time slot belongs to the second scheduling period; The first deterministic message received by the second node between the Nth first indication message and the N+1th first indication message belongs to the first receiving time slot; The second deterministic message received by the second node between the Pth second indication message and the P+1th second indication message belongs to the second receiving time slot.

17. A communication device, characterized in that: include: a processor and a memory for storing instructions executable by the processor; The processor is configured to execute the instructions so that the communication device performs the data transmission method according to any one of claims 1 to 16.

18. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on an electronic device, the electronic device executes the data transmission method according to any one of claims 1 to 16.