Data transmission method and apparatus, and storage medium
By sending instructions messages in a large-scale network to determine the transmission time slot of the data packet, the problem that the data packet cannot arrive in the transmission time slot is solved, deterministic data transmission and time synchronization are achieved, and transmission efficiency is improved.
Patent Information
- Application Number
- PCT/CN2024/079321
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-10
- Filing Date
- 2024-02-29
- Publication Date
- 2024-11-14
AI Technical Summary
In large-scale networks, due to the large number of nodes and the physical link distance is too long, the data packets in the multiplexed cyclic queue forwarding mechanism cannot reach the downstream node from the upstream node within the transmission time slot, which is difficult to meet the requirements of time synchronization, so it is impossible to Implement deterministic transmission services.
By sending an indication message to the downstream node in each transmission slot to the downstream node to define the slot range, the downstream node can determine the deterministic report of the same transmission slot belonging to the upstream node based on the received indication message. , realizes deterministic scheduling transmission without changing the encapsulation of existing packets.
Without modifying the packet encapsulation, deterministic data transmission is realized, which solves the problem that data packets cannot arrive in the transmission time slot in large-scale networks, meets the time synchronization requirements, and improves the certainty and efficiency of transmission. .
Smart Images

Figure CN2024079321_14112024_PF_FP_ABST
Abstract
Description
Data transmission method, device, and storage medium
[0001] This disclosure claims priority to Chinese patent application No. 202310526845.3, filed on May 10, 2023, the entire contents of which are incorporated herein by reference. Technical Field
[0002] The present disclosure relates to the field of network communication technology, and in particular to a data transmission method, device, and storage medium. Background Art
[0003] In large-scale networks, due to the large number of nodes and the long distances between physical links, packets in the cyclic queuing and forwarding (CQF) mechanism cannot reach downstream nodes from upstream nodes within the transmission time slot, making it difficult to meet time synchronization requirements and thus unable to achieve deterministic transmission services.
[0004] Summary of the Invention
[0005] In one aspect, a data transmission method is provided, which is applied to a first node. The data transmission 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] The 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. The data transmission method includes:
[0009] receiving an Nth first indication message sent by the first node in the Nth first sending time slot;
[0010] receiving an N+1th first indication message sent by the first node in the N+1th first sending time slot;
[0011] The deterministic message sent by the first node in the Nth first sending time slot is determined from the messages received by the second node between the Nth first indication message and the N+1th first indication message.
[0012] In another aspect, a data transmission device is provided, applied to a first node. The data transmission device includes: a sending module, configured to send an Nth first indication message to a second node in the Nth first sending time slot of the first node, where N is an integer greater than or equal to 1; and to send 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 messages received between the Nth first indication message and the N+1th first indication message.
[0013] In another aspect, a data transmission device is provided, applied to a second node. The data transmission device includes: a receiving module configured to receive an Nth first indication message sent by a first node in an Nth first transmission time slot; receive an N+1th first indication message sent by the first node in an N+1th first transmission time slot; and a determining module configured to determine a deterministic message sent by the first node in the Nth first transmission time slot from messages received by the second node between the Nth first indication message and the N+1th first indication message.
[0014] In yet another aspect, a communication device is provided, comprising: a processor and a memory for storing processor-executable instructions; the processor is configured to execute the instructions so that the communication device performs the data transmission method described in any one of the above aspects.
[0015] In another aspect, 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 described in any one of the above aspects when executing the computer program.
[0016] In another aspect, a computer-readable storage medium is provided, wherein computer program instructions are stored on the computer-readable storage medium, and when the computer program instructions are executed by a processor, the data transmission method described in any one of the above aspects is implemented.
[0017] On the other hand, a computer program product is provided, which includes computer program instructions, and when the computer program instructions are executed by a processor, the data transmission method described in any one of the above aspects is implemented. BRIEF DESCRIPTION OF THE DRAWINGS
[0018] To more clearly illustrate the technical solutions of the present disclosure, the following briefly introduces the drawings required for use in some embodiments of the present disclosure. Obviously, the drawings described below are only drawings of some embodiments of the present disclosure, and those skilled in the art can also derive other drawings based on these drawings.
[0019] FIG1 is a schematic diagram of a slotted circular queue template according to some embodiments.
[0020] FIG2 is a schematic diagram of a network architecture according to some embodiments.
[0021] FIG3 is a flowchart of a data transmission method according to some embodiments.
[0022] FIG4 is a schematic diagram of a message according to some embodiments.
[0023] FIG5 is a schematic diagram of another message according to some embodiments.
[0024] FIG6 is a schematic diagram of another message according to some embodiments.
[0025] FIG7 is a schematic diagram of another message according to some embodiments.
[0026] FIG8 is a schematic diagram of a message transmission according to some embodiments.
[0027] FIG9 is a flowchart of another data transmission method according to some embodiments.
[0028] FIG10 is a schematic diagram of yet another transmission message according to some embodiments.
[0029] FIG11 is a flowchart of yet another data transmission method according to some embodiments.
[0030] FIG12 is a flowchart of yet another data transmission method according to some embodiments.
[0031] FIG13 is a schematic diagram of yet another transmission message according to some embodiments.
[0032] FIG14 is a schematic diagram of another transmission message according to some embodiments.
[0033] FIG15 is a schematic diagram of another transmission message according to some embodiments.
[0034] FIG16 is a schematic structural diagram of a data transmission device according to some embodiments.
[0035] FIG17 is a schematic structural diagram of another data transmission device according to some embodiments.
[0036] FIG18 is a schematic structural diagram of yet another data transmission device according to some embodiments. DETAILED DESCRIPTION
[0037] To help those skilled in the art better understand the technical solutions of the embodiments of the present disclosure, the technical solutions of the present disclosure will be clearly and completely described below in conjunction with the drawings in the present disclosure. Obviously, the embodiments described are only some of the embodiments of the present disclosure, not all of them. Based on the embodiments of the present disclosure, all other embodiments obtained by those of ordinary skill in the art without making any creative efforts shall fall within the scope of protection of the present disclosure.
[0038] It should be noted that in this disclosure, words such as "exemplarily" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described in this disclosure as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplarily" or "for example" is intended to present the relevant concepts in a concrete manner.
[0039] In the following, the terms "first," "second," etc. are used for descriptive purposes only and should not be understood to indicate or imply relative importance or implicitly specify the number of technical features indicated. Therefore, a feature defined as "first," "second," etc. may explicitly or implicitly include one or more of such features.
[0040] In the description of this disclosure, unless otherwise specified, " / " means "or." For example, A / B can mean A or B. "And / or" herein is merely a description of an association relationship between associated objects, indicating that three possible relationships exist. For example, "A and / or B" can mean: only A, only B, and both A and B. Furthermore, "at least one" means one or more, and "a plurality" means two or more.
[0041] The CQF mechanism proposed in the 802.1Qch draft of the IEEE (Institute of Electrical and Electronics Engineers) Time-Sensitive Networking Working Group can provide deterministic forwarding services for time-sensitive network (TSN) services.
[0042] In the CQF mechanism, each node's egress port maintains a slotted circular queue template, which includes information about the slot length and number of slots (typically, a slot corresponds to an egress port queue). For example, as shown in Figure 1, the slot length of the circular queue template is T = 10us, and the number of slots is N = 5. For the slotted circular queue template, data buffered in the queue is scheduled for transmission using a slot-based polling method.
[0043] In large-scale networks, 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] Some technologies have proposed large-scale deterministic solutions based on timeslot label mapping between upstream and downstream nodes. In this solution, upstream nodes add timeslot labels to outgoing packets. Downstream nodes, based on locally maintained timeslot label mappings, ensure that packets carrying the same label value are sent in the same timeslot, thereby providing end-to-end deterministic transmission services with bounded latency and jitter.
[0045] However, this solution requires carrying time slot label information in the message, which requires modifying the existing message encapsulation and standardizing it for different networks. Encapsulations for different networks include Internet Protocol version 4 (IPv4), Internet Protocol version 6 (IPv6), multi-protocol label switching (MPLS), and segment routing IPv6 (SRv6). Among them, encapsulations such as IPv4 and MPLS 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 disclosure provides a data transmission method that 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] 2 is a schematic diagram of a network to which the data transmission method provided in an embodiment of the present disclosure is applicable. As shown in FIG2 , the network 100 includes: a first node 110 and a second node 120. The first node 110 and the second node 120 are any two nodes in the network 100.
[0048] The first node 110 and the second node 120 include upstream nodes and downstream nodes. Messages from the upstream node can be forwarded to the downstream node, which then forwards them. For example, if the first node 110 is an upstream node and the second node 120 is a downstream node of the first node 110, the first node 110 can send the message to be sent to the second node 120, which will then forward the message. Alternatively, if the second node 120 is an upstream node and the first node 110 is a downstream node of the second node 120, the second node 120 can send the message to be sent to the first node 110, which will then forward the message.
[0049] It should be understood that the embodiments of the present disclosure do not limit the number of nodes included in network 100 or the upstream and downstream relationships between nodes. The network diagram shown in Figure 2 is merely an example and does not limit the scope of protection of this disclosure. For ease of explanation, the following embodiments use the example of first node 110 being the upstream node of second node 120.
[0050] Exemplarily, the first node 110 and the second node 120 may be routers or other network devices capable of forwarding packets.
[0051] For example, the network 100 may be a deterministic network. A deterministic network is a network built using network resources to provide high bandwidth, low latency, low jitter, and deterministic capabilities, and can provide a deterministic service experience for different industries.
[0052] In some embodiments, the first node 110 includes an egress port and an ingress port. The egress port is used to send messages from the first node 110 to a downstream node (e.g., the second node 120 described above) of the first node 110; the ingress port is used to receive messages 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. The egress port is used to send messages from the second node 120 to a downstream node of the second node 120; the ingress port is used to receive messages 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 the time slot circular queue template shown in FIG1 , so that the first node 110 and the second node 120 can schedule transmission of the data cached in the queue based on time slot polling.
[0055] It should be noted that the system architecture and application scenarios described in the embodiments of this disclosure are intended to more clearly illustrate the technical solutions of the embodiments of this disclosure and do not constitute a limitation on the technical solutions provided by the embodiments of this disclosure. Those skilled in the art will appreciate that, as system architectures evolve and new business scenarios emerge, the technical solutions provided by the embodiments of this disclosure will also be applicable to similar technical problems.
[0056] The following is an introduction to a data transmission method provided by an embodiment of the present disclosure.
[0057] For example, as shown in FIG3 , a data transmission method provided by an embodiment of the present disclosure may be implemented as follows S201 - S203 .
[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] 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, for example, 30 ms). The above-mentioned sending time slot is the time period during which the first node sends information (for example, 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 the time before the first node transmits the deterministic message in the transmit time slot. Exemplarily, a transmit time slot may include multiple symbols, and the target time may be the symbol before the symbol at which the first node transmits the deterministic message in the transmit time slot. For example, a transmit time slot may include 14 symbols. If the first node transmits the header of the deterministic message starting from the second symbol in the transmit time slot, the target time may be the first symbol in the transmit time slot.
[0064] In some embodiments, the indication message is used to enable the second node to define a time slot range. For example, the second node can determine, based on the number of indication messages received, to which transmission time slot of the first node the indication message and the deterministic message following the indication message belong.
[0065] In some embodiments, the indication message may include a quantity identifier. The quantity identifier is used to identify the number of deterministic messages following the indication message. For example, 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 seven deterministic messages to the second node after the indication message (all seven deterministic messages are 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 transmission time slot may include only deterministic messages or may include messages other than 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] For example, the messages sent by the first node in the same transmit timeslot may include deterministic messages and best-effort (BE) messages. Strict priority scheduling is used 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 deterministic messages (i.e., the second node only needs to determine the transmit timeslot to which the deterministic messages received by the second node belong, and the receive timeslot 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 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 further 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 for sending the indication message) or the receiving time slot (the receiving time slot for receiving the 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, as shown in (a) of Figure 4, a PCS code block sequence includes a start block (S block), multiple data blocks (D blocks), and a termination block (T block). The structure of the S block is: "0b10 0x78" + 7 "0x55".
[0072] In some embodiments, 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"s can be modified to indicate the quantity and scheduling period.
[0073] For example, as shown in (b) in FIG4 , “0x78” in the S block can be modified to “0x79” to indicate that the message is an indication message; and the last four “0x55” in the S block can be modified to the quantity identifier and the scheduling period identifier.
[0074] In some embodiments, the D block in the PCS code block sequence may be expanded to obtain an indication message. For example, the number of D blocks in the PCS code block sequence may be reduced to less than four, thereby indicating that the message is an indication message, and the D block or T block may carry a quantity identifier and a scheduling period identifier.
[0075] Exemplarily, the format of the PCS code block sequence is defined as: S+n*D (n is any value of 0, 1, 2, or 3)+T. For example, the PCS code block sequence can be any of the following: an S+T code block sequence, an S+D+T code block sequence, an S+D+D+T code block sequence, or an S+D+D+D+T code block sequence.
[0076] It should be understood that, since the Ethernet standard defines a minimum message length of 64 bytes, the number of D blocks in a PCS code block sequence must be no less than four. Any number of D blocks less than four is considered an illegal message block, and the receiving end will discard the received code block sequence. Therefore, the number of D blocks in a PCS message can be adjusted (even if the number of D blocks is less than four) to indicate that the message is an indication message. In this way, after receiving the message, the receiving end (e.g., the second node) can determine that the message is an indication message by judging the number of D blocks, extract the extended information (e.g., the quantity identifier and the scheduling period identifier) from the D blocks or T blocks, and then discard the indication message.
[0077] In some embodiments, the instruction message may be a PAUSE frame. In the Ethernet standard, a PAUSE frame is used to notify a peer device to pause sending messages. Upon receiving the PAUSE frame, the receiving device initiates a flow control operation, stops sending data, and then discards the PAUSE frame message.
[0078] For example, as shown in (a) of FIG. 5 , the format of the PAUSE frame message may include the fields shown in Table 1 below:
[0079] Table 1
[0080] 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.
[0081] In some embodiments, 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 PAD reserved field may carry a quantity identifier and a scheduling period identifier.
[0082] For example, as shown in (b) in Figure 5, the operating parameter yy-yy of the PAUSE_TIMING field can be modified to "0x0000" to indicate that the message is an indication message, and the operating parameter value is set to 0, which will not pause the message sending of the other end, and the quantity identifier and scheduling period identifier are carried in the PAD reserved field.
[0083] In some embodiments, the above-mentioned indication message may be a standard Ethernet message.
[0084] For example, as shown in (a) of FIG6 , the format of a standard Ethernet message may include fields as shown in the following Table 2:
[0085] Table 2
[0086] In some embodiments, the operating parameters of the destination MAC address in the standard Ethernet message may be modified to indicate that the message is an indication message, and the quantity identifier and the scheduling period identifier may be carried in the DATA field.
[0087] For example, as shown in (b) of FIG6 , the operation parameter of the destination MAC address may 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.
[0088] In some embodiments, the operating parameters of the EtherType field in the standard Ethernet message may be modified to indicate that the message is an indication message, and the quantity identifier and the scheduling period identifier may be carried in the DATA field.
[0089] For example, as shown in (c) in FIG6 , the operation parameter of the EtherType field may 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.
[0090] In some embodiments, the indication message may be an Ethernet Y.1731 OAM message.
[0091] Exemplarily, as shown in Figure 7, the Y.1731OAM message includes: a maintenance domain level (MD level) field, a protocol version number (Version) field, a message coding (OpCode) field, a Flag field (Flags) field, a TLV (Type, Length, Value) compensation (TLV offset) field, a data (DATA) field, and an end TLV (End TLV) field.
[0092] Different values of the OpCode field's operation parameter represent different types of connectivity fault management (CFM) protocol data units (PDUs). When the OpCode field's operation parameter is 0x01, the CFM PDU is a CCM PDU; when the OpCode field's operation parameter is 0x02, the CFM PDU is an LBR PDU; when the OpCode field's operation parameter is 0x03, the CFM PDU is an LBM PDU, and so on.
[0093] The DATA field includes: Sequence Number, Sequence Number Transation Identification (ID), Maintenance Association End Point (MEP) ID, Maintenance Association (MA) ID, Y.1731, Qptional TLVs, etc.
[0094] In some embodiments, as shown in FIG7 , the value of the operation parameter of the OpCode field can be modified to indicate that the message is an indication message, and the operation parameter of the DATA field can be defined to carry the quantity identifier and the scheduling period identifier.
[0095] 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 may extract the quantity identifier from the indication message and mark the deterministic message following the indication message according to the quantity identifier.
[0096] Exemplarily, if the quantity identifier extracted by the second node from the indication message is 7, the second node identifies the 7 messages following the indication message as deterministic messages.
[0097] 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.
[0098] 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.
[0099] 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.
[0100] For example, as shown in FIG8 , the first node sends the first indication message SP-1 at the start of the first transmission time slot, sends the second indication message SP-2 at the start of the second transmission time slot, and sends the third indication message SP-3 at the start 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 identified by SP-1 and SP-2 are marked as<SP-1,SP-2> ; Mark the transmission time slots identified by SP-2 and SP-3 as<SP-2,SP-3> .
[0101] In some embodiments, the second node receives the (N+1)th indication message sent by the first node in the (N+1)th sending time slot.
[0102] 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.
[0103] Exemplarily, if the first node sends the first indication message to the second node at the beginning of the first sending time slot of the first node; the first node sends the second indication message to the second node at the beginning of the second sending time slot of the first node; 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.
[0104] It can be understood that compared to some technologies that require modifying the encapsulation of existing messages to carry time slot label information in the messages, the method provided by the embodiments of the present disclosure does not need to change 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, and thus can achieve deterministic scheduling transmission without modifying the message encapsulation.
[0105] In some embodiments, as shown in FIG9 , the above method further includes the following S204 .
[0106] S204: The second node determines 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.
[0107] In some embodiments, the second node may establish an association relationship between the deterministic message received by the second node and the receiving time slot of the second node.
[0108] In some embodiments, an association relationship may be established based on the reception 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.
[0109] For example, assuming 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, based on the number of time slots in the circular queue of the second node, it can be determined that the association relationship satisfies the following formula (1): {SP-x, SP-x+1}——REM(a+x-1, N) Formula (1)
[0110] Among them, SP represents the indication message, x or x+1 represents the number of the indication message, {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.
[0111] 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.
[0112] Exemplarily, as shown in Figure 8, 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).
[0113] The second node can determine that the deterministic messages received by the second node between SP-2 and SP-3 (including SP-2) belong to the same transmission time slot of the first node (further, the second node can determine that the deterministic messages received by the second node between SP-1 and SP-2 (including SP-1) belong to the second transmission time slot of the first node). In addition, the second node can also determine the order of receiving time slots based on the order in which SP-1, SP-2, and SP-3 are received, 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.
[0114] For example, as shown in FIG10 , 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 carried in SP-1 (indicating that the number of deterministic messages is m), and then extracts the quantity identifier m from the SP-1 message.<SP-1,SP-2> Mark m deterministic messages in the messages received between the two times, 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.
[0115] In some embodiments, after step S204, the method further includes: the second node discarding the indication message. It is understood that the primary function of the indication message is to enable the second node to determine to which transmit time slot of the first node the deterministic message received by the second node belongs, and to which receive time slot of the second node the message falls. Therefore, after step S204, the purpose of the indication message has been fulfilled, and to avoid redundancy, the second node may discard the indication message.
[0116] In some embodiments, after 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.
[0117] 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 by the embodiment of the present disclosure to achieve deterministic transmission.
[0118] For ease of understanding, the data transmission method provided in the above S201 - S204 is described below in the form of an example.
[0119] Exemplarily, as shown in FIG11 , for a received message, the overall processing flow of the second node may include the following Sa1-Sa7.
[0120] Sa1: The ingress port of the second node receives the indication message and the service message.
[0121] Exemplarily, the second node identifies the indication message from the received messages and maintains a counter to record the number of indication messages received. For example, the xth indication message is recorded as: SP-x.
[0122] Sa2. The second node determines whether the currently received indication message is the first indication message.
[0123] If yes, return to step Sa1; if no, execute the following step Sa3.
[0124] Sa3. The second node determines whether the currently received indication message is the second indication message.
[0125] If yes, execute the following step Sa4; if no, execute the following step Sa5.
[0126] 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.
[0127] Exemplarily, the above association relationship satisfies the above formula (1).
[0128] 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.
[0129] For example, the second node<SP-x,SP-x+1> The receiving time slot into which the message received during this period falls is: MOD(a+x-1,N).
[0130] 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.
[0131] Sa7. The second node discards the indication message, 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.
[0132] It can be seen that based on the data transmission method provided by the embodiment of the present disclosure, the second node can determine the sending time slot and the receiving time slot to which the deterministic message received by the second node belongs based on the received indication message (the number of indication messages and the information carried by the indication message), thereby realizing deterministic scheduled transmission.
[0133] In some embodiments, the method provided in S201 - S204 above may be a data transmission method in a single-cycle template scenario (for example, the first node and the second node only use the first scheduling cycle).
[0134] In other embodiments, the method provided in S201-S204 above 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 in S201-S204 above may be a data transmission method for the first scheduling period in a multi-period template scenario.
[0135] In some embodiments, as shown in FIG12 , in a multi-period template scenario (for example, the first node and the second node may adopt the first scheduling period and the second scheduling period), the data transmission method provided by the embodiment of the present disclosure may include the following S301-S306.
[0136] 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.
[0137] In some embodiments, the first node may use a first scheduling period to send a message. The first scheduling period includes a plurality of first sending time slots (ie, the first sending time slots belong to the first scheduling period).
[0138] The first indication message is an indication message sent by the first node to the second node in the first sending time slot.
[0139] In some embodiments, the first indication message includes an identifier of a first scheduling period to which the first sending time slot belongs.
[0140] In some embodiments, the first indication message further includes a quantity identifier. The quantity identifier is used to identify the number of first deterministic messages following the first indication message. The first deterministic message is a deterministic message scheduled by the first node within the first scheduling period.
[0141] 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.
[0142] 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.
[0143] The first indication message is used to enable the second node to define the first transmission time slot range. For example, the second node can determine to which first transmission time slot of the first node the first indication message and the first deterministic message following the first indication message belong based on the number of first indication messages received.
[0144] In some embodiments, a second node may receive the Nth first indication message sent by the first node in the Nth first transmission time slot. If 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. If 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 thereby determine that the first deterministic message following the first indication message belongs to the first scheduling period.
[0145] S302: The first node sends a P-th second indication message to the second node in the P-th second sending time slot of the first node.
[0146] P is an integer greater than or equal to 1.
[0147] In some embodiments, the first node may also use a second scheduling period to send the message. The second scheduling period includes a plurality of second sending time slots (ie, the second sending time slots belong to the second scheduling period).
[0148] The second indication message is an indication message sent by the first node to the second node in the second sending time slot.
[0149] In some embodiments, 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.
[0150] In some embodiments, the second indication message further includes a quantity identifier. The quantity identifier is used to identify the number of second deterministic messages following the second indication message. The second deterministic messages are deterministic messages scheduled by the first node within the second scheduling period.
[0151] 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.
[0152] 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.
[0153] In some embodiments, the second indication message is used to enable the second node to define a second transmission time slot range. Exemplarily, the second node may determine, based on the number of received second indication messages, to which second transmission time slot of the first node the second indication message and the second deterministic message following the second indication message belong.
[0154] 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. If 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. If the second indication message includes a scheduling period identifier, in some embodiments, the second node may extract the second scheduling period identifier from the second indication message and thereby determine to which scheduling period the second deterministic message following the second indication message belongs.
[0155] 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.
[0156] 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.
[0157] In some embodiments, the implementation of the above step S303 can refer to the implementation of the above step S301, which will not be repeated here.
[0158] In some embodiments, the second node may receive the (N+1)th first indication message sent by the first node in the (N+1)th first sending time slot.
[0159] 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.
[0160] 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.
[0161] S305 : The first node sends a P+1 th second indication message to the second node in the P+1 th second sending time slot of the first node.
[0162] In some embodiments, the implementation of the above step S305 can refer to the implementation of the above step S302, which will not be repeated here.
[0163] 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.
[0164] 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.
[0165] 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.
[0166] Exemplarily, if the first node sends the first second indication message to the second node at the starting time of the first second sending time slot of the first node; the first node sends the second second indication message to the second node at the starting time of the second second sending time slot of the first node; 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.
[0167] 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. X is an identifier of the number of second deterministic messages indicated by the Pth second indication message; Y is an identifier of the number of first deterministic messages indicated by the N+1th first indication message.
[0168] It is understandable that, because the priority of the first scheduling period is higher than the priority of the second scheduling period, when the first node receives the pending first deterministic message while sending the second deterministic message, the first node interrupts sending the second deterministic message and begins sending the pending first deterministic message. After the pending first deterministic message is sent, the first node resumes sending the second deterministic message.
[0169] In some embodiments, after step S304, the method further includes: the second node determining 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.
[0170] 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.
[0171] In some embodiments, the second node may determine, based on 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.
[0172] In some embodiments, after step S306, the method further includes: the second node determining a receiving time slot to which a deterministic message received by the second node between the Pth second indication message and the P+1th second indication message belongs.
[0173] 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.
[0174] In some embodiments, the second node may determine, according to the above formula (1), to which second reception time slot among the P-th second indication message and the (P + 1)-th second indication message the second deterministic message received by the second node belongs.
[0175] For ease of understanding, the data transmission method in the multi-cycle template scenario will be described below by way of example.
[0176] Exemplarily, it is assumed that the multi-cycle template includes a scheduling cycle A and a scheduling cycle B; among them, the priority of the scheduling cycle A is higher than that of the scheduling cycle B. The scheduling cycle A transmits a deterministic message A; the scheduling cycle B transmits a deterministic message B. The priority of the deterministic message A is higher than that of the deterministic message B, and the priority of the deterministic message B is higher than that of the BE message.
[0177] Exemplarily, as shown in FIG. 13, 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 messages 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 messages 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 not marked), extracts the quantity identifier h and the identifier A of the scheduling cycle from SP-3; since the priority of the deterministic message A is higher than that of the deterministic message B, the second node first marks h messages after SP-3 as deterministic messages A in sequence, and then marks the following n - i messages as deterministic messages B according to the priority scheduling rule. After the deterministic message A and the deterministic message B are both marked, the remaining messages are marked as BE messages.
[0178] For the scheduling cycle A and the scheduling cycle B, the second node determines, according to the association relationship shown in the above formula (1), the reception time slots to which the received deterministic message A and the deterministic message B belong, so as to implement the scheduling and forwarding of the deterministic messages.
[0179] It can be seen that the data transmission method provided by the embodiments of the present disclosure can carry the identifier of the scheduling cycle in the indication message, so as to implement data transmission in the multi-cycle template scenario. Thus, 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 disclosure can achieve deterministic scheduling transmission without modifying the message encapsulation.
[0180] 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.
[0181] For example, as shown in (a) of Figure 14, the operation parameter of the OpCode field in the Y.1731 OAM message is defined as: OpCode = 0x08, indicating that the message is an indication message in a single-cycle template scenario. The quantity 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.
[0182] 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.
[0183] Exemplarily, as shown in (b) in FIG14 , the first node sends an indication message SP-1 at the start 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 start 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 start time of the third sending time slot.
[0184] 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 transmit time slot based on SP-1 and SP-2, and identifies the messages belonging to the same transmit time slot based on SP-2 and SP-3. It determines the receive 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.
[0185] The second node can<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 determined, and an association relationship between the deterministic message received by the second node and the receiving time slot of the second node is established.
[0186] For example, the association relationship may 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.
[0187] For the second node<SP-1,SP-2> The second node marks the message received between the two nodes according to the number of identifiers 3 extracted from SP-1.<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.<SP-1,SP-2> The remaining four messages are marked as BE messages and are processed according to the scheduling method of BE messages.
[0188] For the second node<SP-2,SP-3> The second node marks the message received between the two nodes according to the number of identifiers 4 extracted from SP-2.<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.
[0189] The second node is<SP-3,SP-4> The messages between and in subsequent time slots are processed in the same way as<SP-2,SP-3> The same, no further description here.
[0190] It should be noted that the "D" in FIG14 stands for DetNet, indicating that the message is a deterministic message, and the "BE" indicates that the message is a BE message.
[0191] The following describes a data transmission method in a single-cycle template scenario by taking a Y.1731 OAM message as an example.
[0192] For example, as shown in Figure 15 (a), the operational parameter of the OpCode field in the Y.1731 OAM message is defined as: OpCode = 0x09, indicating that the message is an indication message in a multi-cycle template scenario. The quantity identifier is defined in the DATA field as: DetNet Packets Number, which occupies 24 bits; the cycle template information is defined as: Cycle Template, which occupies 3 bits. The rest of the DATA field is reserved for extension.
[0193] When the second node receives the above message, it first determines that the message is a Y.1731 OAM message based on EtherType = 0x8902, and further identifies the message as an indication message in a multi-period template scenario based on OpCode = 0x09. At this time, the quantity identifier and scheduling period identifier can also be extracted from the indication message.
[0194] For example, as shown in (b) of Figure 15 , a multi-cycle template includes scheduling period A and scheduling period B. Scheduling period A has a higher priority than scheduling period B. Scheduling period A transmits deterministic message A ("AD" in Figure 15 indicates deterministic message A), while scheduling period B transmits deterministic message B ("BD" in Figure 15 indicates deterministic message B). Deterministic message A has a higher priority than deterministic message B, and deterministic message B has a higher priority than BE messages.
[0195] 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.
[0196] The first node sends an indication message SP-2 before 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 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.
[0197] When the message arrives at the second node, it identifies the indicator messages SP-1, SP-2, SP-3, SP-4, and SP-5. Based on SP-1 and SP-3, it identifies messages belonging to the same transmit time slot in scheduling cycle A. Based on SP-3 and SP-4, it identifies messages belonging to the same transmit time slot in scheduling cycle A. Based on SP-2 and SP-5, the second node identifies messages belonging to the same transmit time slot in scheduling cycle B.
[0198] 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 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 messages between SP-2 and SP-5 fall into the receiving time slot 2 and receiving time slot 3 of the scheduling period A (or are considered to fall into the receiving time slot 3). The second node determines that SP-2 and SP-5 fall into the receiving time slots.<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).
[0199] For the second node<SP-1,SP-3> The second node marks the message received between the two nodes according to the number of identifiers 3 extracted from SP-1.<SP-1,SP-3> The first three messages between them are deterministic messages A.
[0200] For the second node<SP-3,SP-4> The second node marks the message received between the two nodes according to the number of identifiers 4 extracted from SP-3.<SP-3,SP-4> The first four messages between them are deterministic messages A.
[0201] For the second node<SP-2,SP-5> The second node marks the message received between the two nodes according to the number of identifiers 7 extracted from SP-2.<SP-2,SP-5> The first 7 messages between them are deterministic messages B.
[0202] During this process, if a high-priority deterministic message (for example, deterministic message A) is received, marking of deterministic message B is suspended. The high-priority deterministic message is marked first, and after the high-priority deterministic message is marked, deterministic message B is marked. The remaining unmarked messages are all BE messages.
[0203] 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.
[0204] 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. It should be easily appreciated by those skilled in the art that, in combination with the algorithm steps of each example described in the embodiments of the present disclosure, the present disclosure 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 disclosure.
[0205] The embodiment of the present disclosure can divide the data transmission device into functional modules according to the above-mentioned 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-mentioned 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 disclosure 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.
[0206] FIG16 is a schematic diagram of the structure of a data transmission device provided by an embodiment of the present disclosure, wherein the data transmission device is applied to a first node. As shown in FIG16 , the data transmission device 400 includes: a sending module 401 .
[0207] The 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 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.
[0208] In some embodiments, the sending module 401 is 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 the deterministic message in the first sending time slot.
[0209] 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.
[0210] In some embodiments, the sending module 401 is also used to send the Pth second indication message to the second node within the Pth second sending time slot of the first node; send the P+1th second indication message to the second node within 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 within the Pth second sending time slot from the messages received between the Pth second indication message and the P+1th second indication message.
[0211] 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.
[0212] 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.
[0213] In some embodiments, the indication message is one of the following: PCS, PAUSE frame, standard Ethernet message, Ethernet Y.1731 OAM message.
[0214] Figure 17 is a schematic diagram of the structure of a data transmission device provided in an embodiment of the present disclosure, which is applied to a second node. As shown in Figure 17, the data transmission device 500 includes a receiving module 501 and a determining module 502. In other embodiments, the data transmission device 500 also includes a constructing module 503, a marking module 504, and a sending module 505.
[0215] 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.
[0216] The determining 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.
[0217] In some embodiments, the determination module 502 is further configured to 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.
[0218] 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 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.
[0219] In some embodiments, the construction module 503 is 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 time slots in the circular queue of the second node.
[0220] In some embodiments, the marking module 504 is configured 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 configured to send the marked deterministic message to the egress port of the second node.
[0221] 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 messages following the first indication message according to the quantity identifier.
[0222] 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.
[0223] 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.
[0224] 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.
[0225] 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.
[0226] In some embodiments, the indication message is one of the following: PCS, PAUSE frame, standard Ethernet message, Ethernet Y.1731 OAM message.
[0227] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, the embodiment of the present disclosure provides another structure of the data transmission device involved in the above-mentioned embodiment. As shown in Figure 18, the data transmission device 600 includes: a memory 601, a processor 602, a communication interface 603, and a bus 604.
[0228] The memory 601 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, 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 code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
[0229] Processor 602 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of this disclosure. 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 device, a transistor logic device, a hardware component, or any combination thereof. It may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of this disclosure. Processor 602 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, or a combination of a DSP and a microprocessor.
[0230] The communication interface 603 is used to connect to other devices via a communication network, such as Ethernet, wireless access network, or wireless local area network (WLAN).
[0231] In some embodiments, the memory 601 may exist independently of the processor 602 and 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 embodiments of the present disclosure can be implemented.
[0232] In some embodiments, the memory 601 may also be integrated with the processor 602 .
[0233] Bus 604 can be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 604 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG18 shows only one thick solid line, but this does not mean that there is only one bus or only one type of bus.
[0234] Some embodiments of the present disclosure 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.
[0235] For example, the computer-readable storage media may include, but are not limited to, magnetic storage devices (e.g., hard disks, floppy disks, or magnetic tapes), optical disks (e.g., compact disks (CDs), digital versatile disks (DVDs), etc.), smart cards, and flash memory devices (e.g., erasable programmable read-only memories (EPROMs), cards, sticks, or key drives, etc.). The various computer-readable storage media described in the present disclosure 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.
[0236] An embodiment of the present disclosure provides a computer program product comprising 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.
[0237] The above is only a specific embodiment of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Any changes or replacements within the technical scope disclosed in the present disclosure should be included in the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.
Claims
1. A data transmission method, applied to a first node; wherein: The method comprises: Sending an Nth first indication message to the second node in the Nth first sending time slot of the first node; wherein 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, wherein: 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, wherein: 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, wherein: 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, wherein: 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, wherein: 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, applied to a second node, wherein: 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, further comprising: 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, further comprising: 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, wherein: 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, further comprising: 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, wherein: 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, wherein: 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, wherein: 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, wherein: 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, wherein: 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, comprising: 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, wherein: 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.
Citation Information
Patent Citations
Message transmission method and device
CN113711572A
Message forwarding method, electronic equipment and storage medium
CN115037399A
Deterministic service transmission method and device based on jitter time delay
CN115643220A
Supporting asynchronous packet operations in a deterministic network
US20210021510A1
