Data transmission method, system and electronic device

Abstract

This application discloses a data transmission method, system, and electronic device. In the method provided herein, a period mapping label is generated by directly reporting available queue periods by forwarding nodes, enabling end-to-end service delivery without the need for time synchronization, thus avoiding period conflicts caused by time synchronization errors. Furthermore, the generated period mapping table is directly added to the service flow, and each forwarding node forwards directly based on the period mapping label in the service flow. This eliminates the need to consume device resources to create and maintain the period mapping table, thereby reducing device resource consumption and operational pressure.

Description

Technical Field

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

[0002] In current communications networks, deterministic networking (DetNet) is a technology that helps Internet Protocol (IP) networks transition from "best-effort" to "punctual, accurate, and fast" services, controlling and reducing end-to-end latency. DetNet is simply another form of Quality of Service (QoS) offered by best-effort networks.

[0003] Traditional QoS measures are effective in guaranteeing bandwidth and prioritizing forwarding queues. However, IP networks are still essentially statistical multiplexing networks, and network devices lack precise timing control over packet transmission. When traffic flows from multiple upstream network devices simultaneously arrive at the same physical port on a downstream network device, traffic microbursts occur. During this time, packets must queue to request forwarding resources. The accumulation of microbursts in the network ultimately results in increased end-to-end latency and jitter.

[0004] To solve the above problems, the current DetNet solutions can be regarded as derivatives of the Multiple Cyclic Queuing and Forwarding (Multi-CQF) solution. Multi-CQF selects multiple queues (number of queues ≥ 3, usually 4) from the scheduling queue of the outgoing port for receiving and sending deterministic services. For example, Figure 1 As shown, four queues are selected to receive and send deterministic traffic flows. Each of these queues takes turns opening the outbound gates in a period T. During the outbound period, the outbound gate is open, and the queue is in the sending state. At this time, the inbound gate should be closed. Conversely, during the inbound period, the inbound gate is open, and the outbound gate should be closed, and the queue is in the receiving state. In this way, each node can both receive and send data.

[0005] To implement queue gating, various vendors have proposed specific implementation algorithms, such as the Cycle Specified Queuing and Forwarding (CSQF) algorithm and the Scalable Deterministic Forwarding (SDF) algorithm.

[0006] The CSQF algorithm requires that the service flow that enters the queue on the local device in the previous cycle T0 should be dequeued in the next cycle T1. Next, when the service flow arrives at the downstream device, the controller must first calculate the delay introduced on the transmission link when arranging which service flow should enter which queue cycle. First, divide the link delay by the cycle period T and round it up to get an integer cycle shift of 1T, 2T, 3T, and so on. This integer cycle shift is then reported to the controller for orchestration. However, the problem with the CSQF algorithm is that it requires very strict time synchronization across the entire network. Due to synchronization errors, multiple end-to-end service paths will have cycle conflicts during orchestration.

[0007] In addition to implementing Multi-CQF using the CSQF algorithm, the SDF algorithm can also be used. Specifically, the SDF algorithm allows for unaligned queue periods between upstream and downstream devices, requiring only that the local device send traffic received in the current period in the next period. For example, upstream node A sends a deterministic traffic flow in period T(x). This traffic flow enters the queue of downstream node B in period T(y) and is sent out of the queue in period T(y+1).

[0008] While the SDF algorithm has the advantage of eliminating the need for time synchronization between network nodes, only frequency synchronization, and thus avoiding queue period conflicts and unnecessary consideration of link transmission latency, making it more suitable for large-scale wide area network deployments, it also suffers from the disadvantage of increasing device resource consumption due to the creation and maintenance of the period mapping table by the device. The more deterministic services involved, the more resource consumption increases exponentially.

[0009] Therefore, the current CSQF algorithm and SDF algorithm still have problems of algorithm complexity and high device resource consumption. Summary of the Invention

[0010] The present application provides a data transmission method, system and electronic device for achieving deterministic forwarding of data without the need for time synchronization.

[0011] In a first aspect, the present application provides a data transmission method, the method comprising:

[0012] Determine an available queuing period in a current data transmission period for each forwarding node, wherein the data transmission period is a period during which the transmitting end sends data; and the available queuing period is a period during which the current forwarding node can receive data sent by the previous forwarding node;

[0013] A cycle mapping label including an available queuing period is generated, and the cycle mapping label is added to the service flow, so that each forwarding node of the N forwarding nodes forwarding the service flow receives data according to the available queuing period in the cycle mapping label.

[0014] The above method generates cycle mapping labels by directly reporting available queueing cycles from forwarding nodes. This enables end-to-end service delivery without the need for time synchronization, avoiding cycle conflicts caused by time synchronization errors. Furthermore, the generated cycle mapping table is directly added to the service flow, and each forwarding node forwards traffic based on the cycle mapping label in the service flow. This eliminates the need to expend device resources to create and maintain the cycle mapping table, reducing device resource consumption and operational strain.

[0015] In an optional embodiment, determining the available queuing period in each forwarding node during the data transmission period includes:

[0016] Obtaining an occupied queue period of each forwarding node, wherein the occupied queue period is a queue period for sending data in the current data transmission period;

[0017] The available queuing period of each forwarding node is determined according to the occupied queuing period of each forwarding node.

[0018] The available queue cycles can be accurately determined by the occupied queue cycles, thereby ensuring the accuracy of the cycle mapping label.

[0019] In an optional embodiment, generating a period mapping tag including an available enqueue period includes:

[0020] Determine J available queueing periods after the occupied queue period of each forwarding node as priority queueing periods, and determine the remaining available queueing periods as waiting queueing periods, where J is an integer greater than or equal to 2;

[0021] Generate a cycle mapping label containing the priority queue entry cycle and the waiting queue entry cycle of each forwarding node;

[0022] Instruct each of the N forwarding nodes to receive data according to the priority queuing period and / or the to-be-selected queuing period in the period mapping label.

[0023] Through the above-mentioned method, the optimal queuing period can be accurately determined, thereby avoiding the problem of incomplete data forwarding due to phase errors between phase forwarding nodes.

[0024] In an optional embodiment, generating a period mapping tag including an available enqueue period includes:

[0025] Determine a dequeue period of a first forwarding node among the N forwarding nodes for the current service flow;

[0026] The priority enqueue periods of the remaining forwarding nodes in the N forwarding nodes are sequentially screened according to the dequeue period, and a period mapping label corresponding to the current service flow is generated.

[0027] In an optional embodiment, before obtaining the occupied queue period of each forwarding node, the method further includes:

[0028] In the current data transmission cycle, controlling an upstream node among the N forwarding nodes to send a queue cycle occupancy status request to a downstream node;

[0029] Receive the occupied queue periods in the current data transmission period returned by the N forwarding nodes.

[0030] In a second aspect, the present application provides a data processing method, the method comprising:

[0031] The current forwarding node sends a queue cycle occupancy status request to the downstream forwarding node, wherein the queue cycle occupancy status request is used to instruct the downstream forwarding node to report the occupied queue cycle;

[0032] receiving an occupied queue period returned by the downstream forwarding node based on the queue period occupancy status request;

[0033] The occupied queue period is reported to the controller, so that the controller generates a period mapping label according to the occupied queue period.

[0034] In the above manner, since the available queuing period is directly reported by the forwarding node to generate the period mapping label, end-to-end service transmission is achieved without the need for time synchronization, avoiding period conflicts caused by time synchronization errors.

[0035] In addition, each forwarding node directly forwards according to the periodic mapping label in the service flow, and does not need to consume device resources to create and maintain the periodic mapping table, which reduces device resource consumption and reduces device operating pressure.

[0036] In an optional embodiment, after reporting the occupied queue period to the controller, the method further includes:

[0037] Receive the business flow sent by the sender;

[0038] A period mapping tag is parsed from the service flow, and an entry and exit queue period is determined in the period mapping tag, and the service flow is received according to the entry queue period.

[0039] In a third aspect, the present application provides a data transmission device, the device comprising:

[0040] a determination module, configured to determine an available queuing period in a current data transmission period in each forwarding node, wherein the data transmission period is a period during which the transmitting end sends data; and the available queuing period is a period during which the current forwarding node can receive data sent by the previous forwarding node;

[0041] A processing module is configured to generate a cycle mapping label including an available queuing period, and add the cycle mapping label to a service flow, so that each of the N forwarding nodes that forward the service flow receives data according to the available queuing period in the cycle mapping label.

[0042] In an optional embodiment, the determining module is specifically configured to obtain an occupied queue period of each forwarding node, wherein the occupied queue period is a queue period for sending data in a current data transmission period;

[0043] According to the occupied queue period of each forwarding node, the available queue period of each forwarding node is determined.

[0044] In an optional embodiment, the determining module is specifically configured to determine J available queuing periods after the occupied queuing period of each forwarding node as priority queuing periods, and determine the remaining available queuing periods as waiting-for-selection queuing periods, where J is an integer greater than or equal to 2;

[0045] Generate a cycle mapping label containing the priority queue entry cycle and the waiting queue entry cycle of each forwarding node;

[0046] Instruct each of the N forwarding nodes to receive data according to the priority queuing period and / or the waiting queuing period in the period mapping label.

[0047] In an optional embodiment, the processing module is specifically configured to determine a dequeue period of a first forwarding node among N forwarding nodes for the current service flow;

[0048] The priority enqueue periods of the remaining forwarding nodes among the N forwarding nodes are sequentially screened according to the dequeue period, and a period mapping label corresponding to the current service flow is generated.

[0049] In a fourth aspect, the present application provides a data transmission device, comprising:

[0050] A sending module, configured to send a queue cycle occupancy status request to a downstream forwarding node, wherein the queue cycle occupancy status request is used to instruct the downstream forwarding node to report the occupied queue cycle;

[0051] The reporting module is configured to report the occupied queue period to the controller, so that the controller generates a period mapping label according to the occupied queue period.

[0052] In a fifth aspect, the present application provides a data transmission system, the system comprising a forwarding node and a controller, the forwarding node being located between a data sending end and a data receiving end and connected in sequence, each forwarding node receiving data according to an in-queue cycle and sending data according to a de-queue cycle;

[0053] The controller is configured to determine an available queuing period in a current data transmission period in each forwarding node, wherein the data transmission period is a period during which the transmitting end sends data; and the available queuing period is a period during which the current forwarding node can receive data sent by the previous forwarding node;

[0054] A cycle mapping label including an available queuing period is generated, and the cycle mapping label is added to the service flow, so that each forwarding node of the N forwarding nodes forwarding the service flow receives data according to the available queuing period in the cycle mapping label.

[0055] In an optional embodiment, the controller is specifically configured to obtain an occupied queue period of each forwarding node, wherein the occupied queue period is a queue period for sending data in the current data transmission period;

[0056] The available queuing period of each forwarding node is determined according to the occupied queuing period of each forwarding node.

[0057] In an optional embodiment, the controller is specifically configured to determine J available queuing periods after the occupied queuing period of each forwarding node as priority queuing periods, and determine the remaining available queuing periods as waiting-for-selection queuing periods, where J is an integer greater than or equal to 2;

[0058] Generate a cycle mapping label containing the priority queue entry cycle and the waiting queue entry cycle of each forwarding node;

[0059] Instruct each of the N forwarding nodes to receive data according to the priority queuing period and / or the to-be-selected queuing period in the period mapping label.

[0060] In a sixth aspect, the present application provides an electronic device, including:

[0061] Memory for storing computer programs;

[0062] The processor is configured to implement the above-mentioned steps of the data transmission method when executing the computer program stored in the memory.

[0063] In a seventh aspect, the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the above-mentioned data transmission method steps are implemented.

[0064] For each of the above-mentioned aspects from the third to the seventh aspect and the technical effects that may be achieved by each aspect, please refer to the above-mentioned description of the technical effects that can be achieved by the first aspect or various possible solutions in the first aspect, and no further details will be given here. BRIEF DESCRIPTION OF THE DRAWINGS

[0065] Figure 1 A schematic diagram of the structure of the multi-circular queue forwarding system provided by this application;

[0066] Figure 2 Schematic diagram of the forwarding process for the specified periodic queue forwarding provided by this application;

[0067] Figure 3 Schematic diagram of the forwarding process for scalable deterministic forwarding provided by this application;

[0068] Figure 4 A schematic diagram of the architecture of the deterministic network provided for this application;

[0069] Figure 5 One of the flow charts of a data transmission method provided by this application;

[0070] Figure 6 This is the second flowchart of a data transmission method provided by this application;

[0071] Figure 7 Schematic diagram of periodic mapping label forwarding provided by this application;

[0072] Figure 8 A flowchart of a data processing method provided in this application;

[0073] Figure 9 A schematic diagram of the structure of a data transmission device provided in this application;

[0074] Figure 10 A schematic diagram of the structure of a data processing device provided in this application;

[0075] Figure 11 A schematic diagram of the structure of a data transmission system provided in this application;

[0076] Figure 12 This is a schematic diagram of the structure of an electronic device provided in this application. DETAILED DESCRIPTION

[0077] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application will be further described in detail with reference to the accompanying drawings. The specific operating methods in the method embodiments can also be applied to device embodiments or system embodiments. It should be noted that in the description of the present application, "multiple" is understood as "at least two". "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent the following three situations: A exists alone, A and B exist at the same time, and B exists alone. A is connected to B, which can represent the following two situations: A is directly connected to B and A is connected to B through C. In addition, in the description of the present application, words such as "first" and "second" are only used to distinguish the purpose of description, and cannot be understood as indicating or implying relative importance, nor can they be understood as indicating or implying order.

[0078] The embodiments of the present application are described in detail below with reference to the accompanying drawings.

[0079] At present, all DetNet solutions can be regarded as derivatives of the Multiple Cyclic Queuing and Forwarding (Multi-CQF) solution. Multi-CQF selects multiple queues (number of queues ≥ 3, usually 4) from the scheduling queue of the outgoing port for receiving and sending deterministic services. For example, Figure 1 As shown, four queues are selected to receive and send deterministic traffic flows. Each of these queues takes turns opening the outbound gates in a period T. During the outbound period, the outbound gate is open, and the queue is in the sending state. At this time, the inbound gate should be closed. Conversely, during the inbound period, the inbound gate is open, and the outbound gate should be closed, and the queue is in the receiving state. In this way, each node can both receive and send data.

[0080] To implement queue gating, various vendors have proposed specific implementation algorithms, such as the Cycle Specified Queuing and Forwarding (CSQF) algorithm and the Scalable Deterministic Forwarding (SDF) algorithm.

[0081] The CSQF algorithm requires that a service flow that enters the queue on the local device in the previous cycle T0 should be dequeued in the next cycle T1. When the service flow arrives at the downstream device, the controller must first calculate the delay introduced on the transmission link when arranging which service flow should enter which queue cycle. The link delay is first divided by the cycle period T and rounded up to an integer cycle shift of 1T, 2T, 3T, and so on. This integer cycle shift is then reported to the controller for scheduling. In other words, the cycle for data to enter the queue of the downstream device should be:

[0082] T downstream queue entry period = T upstream queue exit period + integer cycle shift introduced by link delay

[0083] For example, refer to Figure 2 As shown in the figure, there are four deterministic queues, named T0, T1, T2, and T3. If the dequeuing period of a service flow at node A is T0, and the link delay from node A to node B is 0.5T, rounded up to 1T, then the enqueuing period of the service flow at node B should be T1. Similarly, if the dequeuing period of a service flow at node B is T2, and the link delay from node B to node C is 1.5T, rounded up to 2T, then the enqueuing period of the service flow at node C should be T0. The controller orchestrates these sequentially to obtain an end-to-end period mapping table for the service flow.

[0084] The controller distributes the cycle mapping table for all orchestrated deterministic services to each head node. When a service request arrives, the head node uses protocol extensions to carry the end-to-end cycle mapping ID information directly in the first packet of the service flow. Each subsequent hop of the service flow strictly follows the cycle mapping for enqueueing and dequeueing, achieving end-to-end deterministic forwarding.

[0085] The advantage of the CSQF algorithm is that each network node does not need to maintain the flow status of the service. Instead, it is uniformly calculated and issued by the controller, which reduces the pressure on network equipment. In addition, the routing extension header (SRH) based on IPv6 segment routing (English: Segment Routing IPv6, abbreviated as: SRv6) can naturally carry the information of the periodic mapping identity (English: Identity Document, abbreviated as: ID). However, the problem with the CSQF algorithm is that it requires very strict time synchronization across the entire network. Due to the influence of synchronization errors, multiple end-to-end service paths will have periodic conflicts during orchestration.

[0086] In addition to implementing Multi-CQF using the CSQF algorithm, the SDF algorithm can also be used. Specifically, the SDF algorithm allows for unaligned queue periods between upstream and downstream devices, requiring only that the local device send traffic received in the current period in the next period. For example, upstream node A sends a deterministic traffic flow in period T(x). This traffic flow enters the queue of downstream node B in period T(y) and is sent out of the queue in period T(y+1).

[0087] For example, refer to Figure 3 As shown in the figure, assume there are four deterministic queues, one for sending and the other three for receiving. The T(y) period is used to receive traffic from the T(x) period, and the sending period is set to T(y+1). Similarly, the T(y+1) period is used to receive traffic from the T(x+1) period, and the sending period is set to T(y+2). The T(y+2) period is used to receive traffic from the T(x+2) period, and the sending period is set to T(y+3). This mechanism can, to a certain extent, alleviate traffic microbursts caused by the multiple-to-one convergence in the network topology.

[0088] Specifically, the first packet of a service flow carries the cycle ID information for enqueuing and dequeuing. For example, upstream T(x) dequeues, local T(y) enters, and local T(y+1) exits. This generates a cycle mapping table specific to that service flow. Each pair of neighbors must maintain a cycle mapping table for each deterministic service flow. Inter-neighbor synchronization can be achieved through centralized controller issuance or distributed notification. Enqueuing and dequeuing of service flows at every hop along the path strictly follows the cycle mapping, achieving end-to-end deterministic forwarding.

[0089] The advantage of the SDF algorithm is that network nodes do not require time synchronization, only frequency synchronization. Therefore, there are no queue period conflicts, and there is no need to consider the latency introduced by link transmission, making it more suitable for large-scale wide area network deployment. In addition, the SDF algorithm requires device ports to create and maintain a service period mapping table through flow learning, so the algorithm can be deployed without controller assistance. However, because the period mapping table is created and maintained by the device, the SDF algorithm consumes more device performance resources. This is a disadvantage of the SDF algorithm. The more deterministic services, the more device resource consumption increases exponentially.

[0090] In order to solve the problems of complex algorithms and high device resource consumption in multi-cycle queue forwarding, a data transmission method is provided in the embodiment of the present application. The method can be applied to Figure 4 The DetNet network system shown includes a controller, a transmitter, a receiver, and N forwarding nodes. The N forwarding nodes are located between the transmitter and the receiver, and the N forwarding nodes are connected in sequence. Each forwarding node receives data according to an in-queue cycle and sends data according to an out-queue cycle. In the embodiment of the present application, N is an integer greater than or equal to 2.

[0091] It should be noted here that the queue entry period and the queue exit period form all the data transmission periods of a forwarding node. When all data transmission periods are in the process of receiving data, all data transmission periods are determined to be queue entry periods, such as Figure 4 Forwarding nodes 1 and 2 are shown as having four data transmission cycles: T0, T1, T2, and T3. These four data transmission cycles can be either queue entry cycles or queue exit cycles. When data is sent or received, the four queue cycles of T0, T1, T2, and T3 are executed cyclically.

[0092] Based on the above application scenario, the data transmission method provided in the embodiment of the present application will determine the available queuing cycles in each forwarding node in the current data transmission cycle, generate a period mapping label containing the available queuing cycles, and add the period mapping label to the business flow, and send the business flow to the first forwarding node among the N forwarding nodes, so that the first forwarding node and subsequent forwarding nodes can receive data according to the available queuing cycles in the period mapping label in the business flow.

[0093] In the method provided in the embodiment of the present application, since the period mapping label is generated by directly reporting the available queue period through the forwarding node, end-to-end service transmission is achieved without the need for time synchronization, avoiding period conflicts caused by time synchronization errors.

[0094] In addition, the generated periodic mapping table is directly added to the business flow. Each forwarding node directly forwards according to the periodic mapping label in the business flow. There is no need to consume device resources to create and maintain the periodic mapping table, which reduces the resource consumption of the device and reduces the operating pressure of the device.

[0095] Example 1

[0096] Reference Figure 5 FIG. 1 is a flow chart of a data transmission method provided in an embodiment of the present application, the method comprising:

[0097] S1, determining the available queuing cycles in the current data transmission cycle in each forwarding node;

[0098] In an embodiment of the present application, first, the method is applied to a controller in a DetNet network system. The controller instructs each forwarding node to send a queue cycle occupancy status request to a downstream forwarding node. For example, the automatic retransmission node A, forwarding node B, forwarding node C, and forwarding node D are connected in sequence between the sending end and the receiving end. At this time, forwarding node A sends a queue cycle occupancy status request to forwarding node B, forwarding node B sends a queue cycle occupancy status request to forwarding node C, and forwarding node C sends a queue cycle occupancy status request to forwarding node D. The queue cycle occupancy status request is used to request the resource status of the queue cycle of each downstream node, that is, to request each forwarding node to report the available queue cycle.

[0099] In an optional embodiment, each forwarding node in the DetNet network system may periodically report an available queuing period to the controller, and the controller in the DetNet network system directly receives the available queuing period reported by each forwarding node.

[0100] For example, each forwarding node has four queue periods, namely T0, T1, T2, and T3. Each forwarding node reports the corresponding available queue period to the controller based on its own queue period occupancy. Forwarding node A reports T0, T1, and T2; forwarding node B reports T1, T2, and T3; forwarding node C reports T2, T3, and T0; and forwarding node D reports T3, T0, and T1.

[0101] Through the above process, the available queuing cycle of each forwarding node can be measured, thereby providing accurate information for ensuring subsequent cycle scheduling.

[0102] S2: Generate a cycle mapping label containing the available queuing cycle, and add the cycle mapping label to the service flow.

[0103] In step S1, the available queuing periods of each forwarding node have been obtained. Now, the available queuing periods of each forwarding node are arranged. The list of available queuing periods of each forwarding node is shown in Table 1:

[0104] Table 1

[0105]

[0106] The available queuing period of each forwarding node can be determined by the available queuing period list in Table 1. Therefore, the arrangement is performed according to the above available queuing period list. The specific arrangement method is as follows:

[0107] First, the dequeue cycle of the first forwarding node of the current service flow is determined. Then, the available inqueue cycles of the remaining forwarding nodes of the N forwarding nodes are filtered out in sequence according to the dequeue cycle, and the cycle mapping label corresponding to the current service flow is generated.

[0108] For example, the dequeue period of the current service flow at forwarding node A is T3. In Table 1, the available queue periods corresponding to this dequeue period at forwarding node B are T0, T1, and T2. In this case, T0 is selected as the period for forwarding node B. In this manner, the enqueue period of each forwarding node is selected in sequence to obtain a period mapping label. The period mapping label corresponding to the current service flow is determined to be T3-T0-T1-T3.

[0109] Through the above method, the periodic mapping label corresponding to each service flow can be obtained. For example, Table 2 shows the final periodic mapping label:

[0110] Table 2

[0111] Business Flow Cycle Mapping Tags 1 T3~T0~T1~T3 2 T2~T1~T3~T0 3 T1~T2~T0~T3 4 T0~T3~T1~T2

[0112] After generating the periodic mapping label, the periodic mapping label is added to the service flow that needs to be forwarded. For example, when forwarding service flow 1, the periodic mapping label (T3~T0~T1~T3) is first added to the first packet of the service flow. Each forwarding node of the service flow in the DetNet network system executes enqueue and dequeue according to the period in the periodic mapping label, thereby achieving end-to-end deterministic forwarding.

[0113] Therefore, this approach generates cycle mapping labels by directly reporting available queueing cycles from forwarding nodes. This allows end-to-end service delivery without the need for time synchronization, avoiding cycle conflicts caused by time synchronization errors. Furthermore, the generated cycle mapping table is directly added to the service flow, and each forwarding node forwards traffic based on the cycle mapping label in the service flow. This eliminates the need to expend device resources to create and maintain the cycle mapping table, reducing device resource consumption and operational strain.

[0114] Example 2

[0115] Reference Figure 6 FIG. 1 is a flow chart of a data transmission method provided in an embodiment of the present application, the method comprising:

[0116] S61, obtaining the occupied queue period of each forwarding node;

[0117] In an embodiment of the present application, first, the controller in the DetNet network system instructs each forwarding node to send a queue cycle occupancy status request to the downstream forwarding node. The queue cycle occupancy status request is used to request each forwarding node to report the occupied queue cycle, that is, the unavailable queue cycle.

[0118] For example, the transmitter and receiver are connected in sequence to automatic retransmission node A, forwarding node B, forwarding node C, and forwarding node D. In this case, forwarding node A sends a measurement probe to forwarding node B, forwarding node B sends a measurement probe to forwarding node C, and forwarding node C sends a measurement probe to forwarding node D. The measurement probe is used to request the resource status of the queue cycle of each downstream node, that is, to measure the occupied queue cycle of each forwarding node.

[0119] for example, Figure 7 As shown, forwarding node A actively sends the first packet measurement probe in queue period T1. Forwarding node B returns a packet to forwarding node A in queue period T2, during which it is sending data. Then, it sends the measurement probe again in queue period T0. Forwarding node B returns a packet to forwarding node A. In this way, forwarding node A can determine the queue period occupied by forwarding node B in each queue period.

[0120] In the above manner, each forwarding node reports its queue period occupancy to the controller. For example, forwarding node A reports queue period T0, forwarding node B reports queue period T2, forwarding node C reports queue period T1, and forwarding node D reports queue period T3.

[0121] Through the above process, the occupied queue period of each forwarding node can be measured, thereby providing accurate information for ensuring subsequent period scheduling.

[0122] S62, determining an available queuing period of each forwarding node according to the occupied queuing period of each forwarding node;

[0123] In step S61, the occupied queue period of each forwarding node has been obtained, and then the occupied queue period of each forwarding node is calculated. Here, the occupied queue period is the queue period for sending data in the data transmission period, that is, the dequeue period.

[0124] Based on the occupied queue period of each forwarding node, the available entry queue period of each forwarding node is filtered out. For example, if the occupied queue period reported by forwarding node A is T0, and the available queue periods of forwarding node A are T1, T2, and T3, and the occupied queue period reported by forwarding node B is T2, then the corresponding available entry queue periods are T0, T1, and T3. In this way, the occupied queue period and available entry queue period corresponding to each forwarding node can be determined.

[0125] S63: Generate a cycle mapping label containing an available queuing cycle, and add the cycle mapping label to the service flow.

[0126] First, J available queuing periods after the occupied queuing period of each forwarding node are determined as priority queuing periods, and the remaining available queuing periods are determined as waiting queuing periods, where J is an integer greater than or equal to 2.

[0127] For example, forwarding node A detects that the occupied queue period of forwarding node B is T2 during the T1 queue period. At this time, the T2 queue period of forwarding node B is unavailable, while the other queue periods of forwarding node B are available, that is, T0, T1, and T3 are available. In order to ensure that the data of the service flow can be completely forwarded, it is necessary to determine a priority queue period among T0, T1, and T3. The determined priority queue period can ensure that the data is completely queued. In forwarding node B, the T1 queue period is the next period of the T2 queue period. If the phase difference between forwarding node A and forwarding node B is large, the data sent by forwarding node A will not be completely received during the T1 queue period of forwarding node B. In other words, the T1 queue period of forwarding node B has not yet completely received the data, but it has been adjusted from enqueuing to dequeuing. Therefore, in the embodiment of the present application, the T1 queue period is also correspondingly defined as an unavailable queue period.

[0128] Furthermore, the two queue periods after the T2 queue period are defined as priority queue periods. That is, the T0 queue period of forwarding node B is defined as the priority queue period, and the remaining T3 queue period is determined as the waiting queue period. Specifically, the priority queue period can be calculated according to the following formula:

[0129] Priority queue period = unavailable queue period + 2T

[0130] Through the above method, the priority queueing period and the waiting queueing period of the forwarding node B in each queue period can be determined, as shown in Table 3:

[0131] Table 3

[0132]

[0133] Table 3 above shows the unavailable queue period, priority queue period, and pending queue period corresponding to the current data transmission cycle of each data transmitter at forwarding node B. The unavailable queue period, priority queue period, and pending queue period of other forwarding nodes are determined in the same manner as described above.

[0134] It should be noted that the above example is only for illustration, and in actual application scenarios, there may be multiple priority queueing cycles and waiting queueing cycles. For example, if the cycle period is 5, there may be more than one priority queueing cycle.

[0135] After determining the periodic mapping table of each forwarding node, determine the dequeue cycle of the first forwarding node among the N forwarding nodes for the current business flow, and filter out the priority enqueue cycles of the remaining forwarding nodes among the N forwarding nodes according to the dequeue cycle, generate a periodic mapping label corresponding to the current business flow, and finally add the periodic mapping label to the first packet of the business flow.

[0136] like Figure 7 As shown, the periodic mapping labels for service flow 1 are T1, T3, T2, and T0; the periodic mapping labels for service flow 2 are T2, T0, T3, and T1; and the periodic mapping labels for service flow 3 are T3, T1, T0, and T2. When service flow 1 is forwarded, forwarding node A will enqueue at T1, forwarding node B at T3, forwarding node C at T2, and forwarding node C at T0. Service flows 2 and 3 are forwarded in the same manner.

[0137] In summary, the above approach generates cycle mapping labels by directly reporting available queueing cycles via forwarding nodes. This enables end-to-end service delivery without the need for time synchronization, avoiding cycle conflicts caused by time synchronization errors. Furthermore, the generated cycle mapping table is directly added to the service flow, and each forwarding node forwards traffic based on the cycle mapping label in the service flow. This eliminates the need to consume device resources to create and maintain the cycle mapping table, reducing device resource consumption and operational pressure.

[0138] Example 3

[0139] Reference Figure 8FIG. 1 is a flow chart of a data transmission method provided in an embodiment of the present application, the method comprising:

[0140] S81, the current forwarding node sends a queue cycle occupancy status request to the downstream forwarding node;

[0141] In the embodiment of the present application, the method can be applied to the forwarding nodes in the DetNet network system. Each forwarding node is connected in turn. The current forwarding node will send a queue cycle occupancy status request to the downstream node. For example, Figure 4 In the example, forwarding node A is the current forwarding node. It then sends a queue cycle occupancy status request to its downstream forwarding node B. Similarly, forwarding node B sends a queue cycle occupancy status request to its downstream forwarding node C, and forwarding node C sends a queue cycle occupancy status request to its downstream forwarding node D. This queue cycle occupancy status request is used to request the downstream forwarding node to report the occupied queue cycle.

[0142] In an embodiment of the present application, the current forwarding node sending a queue period occupancy status request to the downstream forwarding node can be actively triggered according to a set period or triggered by a controller. The specific implementation method can be adjusted according to the specific application scenario.

[0143] S82, receiving an occupied queue period returned by the downstream forwarding node based on the queue period occupancy status request;

[0144] After receiving the queue cycle occupancy status request, each downstream forwarding node will determine its own occupied queue cycle and return the queue cycle to the upstream node, for example, Figure 7 As shown, forwarding node A actively sends the first packet measurement probe in queue period T1. Forwarding node B returns a packet to forwarding node A in queue period T2, during which it is sending data. Then, it sends the measurement probe again in queue period T0. Forwarding node B returns a packet to forwarding node A. In this way, forwarding node A can determine the queue period occupied by forwarding node B in each queue period.

[0145] In the above manner, each forwarding node reports its queue period occupancy to the controller. For example, forwarding node A reports queue period T0, forwarding node B reports queue period T2, forwarding node C reports queue period T1, and forwarding node D reports queue period T3.

[0146] S83: Report the occupied queue period to the controller.

[0147] After each forwarding node determines the occupied queue period of the downstream, each forwarding node will report the occupied queue period to the controller. The controller will obtain the corresponding forwarding node period mapping table based on the occupied queue period reported by each forwarding node. For example, after forwarding node A reports the occupied queue period of forwarding node B, the controller will generate the forwarding node A period mapping table shown in Table 3.

[0148] After obtaining the forwarding node period mapping table of each forwarding node, the controller will arrange the queuing period. The specific arrangement method has been described in detail in the second embodiment and will not be repeated here.

[0149] After the controller completes orchestration, it generates a cycle mapping tag for each service flow and then adds it to the service flow. Therefore, after receiving a service flow from the sender, the forwarding node parses the cycle mapping tag from the service flow, determines the queue entry and exit cycles from the cycle mapping tag, and then receives the service flow according to the queue entry cycle.

[0150] for example, Figure 7 As shown, the periodic mapping labels for service flow 1 are T1, T3, T2, and T0; the periodic mapping labels for service flow 2 are T2, T0, T3, and T1; and the periodic mapping labels for service flow 3 are T3, T1, T0, and T2. When service flow 1 is forwarded, forwarding node A will enqueue at T1, forwarding node B at T3, forwarding node C at T2, and forwarding node C at T0. Service flows 2 and 3 are forwarded in the same manner.

[0151] In the above manner, since the available queuing period is directly reported by the forwarding node to generate the period mapping label, end-to-end service transmission is achieved without the need for time synchronization, avoiding period conflicts caused by time synchronization errors.

[0152] In addition, each forwarding node directly forwards according to the periodic mapping label in the service flow, and does not need to consume device resources to create and maintain the periodic mapping table, which reduces device resource consumption and reduces device operating pressure.

[0153] Example 4

[0154] Based on the inventive concept of the first and second embodiments, the present application also provides a data transmission device, which is applied to Figure 4 In the controller of the system shown, Figure 9 As shown, the device includes:

[0155] Determining module 901, configured to determine an available queuing period in a current data transmission period at each forwarding node, wherein the data transmission period is a period during which the transmitting end sends data; and the available queuing period is a period during which the current forwarding node can receive data sent by the previous forwarding node;

[0156] The processing module 902 is used to generate a cycle mapping label including an available queuing period, and add the cycle mapping label to the service flow so that each forwarding node of the N forwarding nodes forwarding the service flow receives data according to the available queuing period in the cycle mapping label.

[0157] Based on the above-described device, because the available enqueuing cycles are directly reported by forwarding nodes to generate cycle mapping labels, end-to-end service delivery is achieved without the need for time synchronization, avoiding cycle conflicts caused by time synchronization errors. Furthermore, the generated cycle mapping table is directly added to the service flow, and each forwarding node forwards the service flow based on the cycle mapping label. This eliminates the need to consume device resources to create and maintain the cycle mapping table, reducing device resource consumption and operational pressure.

[0158] In an optional embodiment, the determination module 901 is specifically configured to obtain an occupied queue period of each forwarding node, wherein the occupied queue period is a queue period for sending data in a current data transmission period;

[0159] According to the occupied queue period of each forwarding node, the available queue period of each forwarding node is determined.

[0160] In an optional embodiment, the determining module 901 is specifically configured to determine J available queuing periods after the occupied queuing period of each forwarding node as priority queuing periods, and determine the remaining available queuing periods as waiting-for-selection queuing periods, where J is an integer greater than or equal to 2.

[0161] Generate a cycle mapping label containing the priority queue entry cycle and the waiting queue entry cycle of each forwarding node;

[0162] Instruct each of the N forwarding nodes to receive data according to the priority queuing period and / or the waiting queuing period in the period mapping label.

[0163] In an optional embodiment, the processing module 902 is specifically configured to determine a dequeue period of a first forwarding node among N forwarding nodes for the current service flow;

[0164] The priority enqueue periods of the remaining forwarding nodes among the N forwarding nodes are sequentially screened according to the dequeue period, and a period mapping label corresponding to the current service flow is generated.

[0165] Example 5

[0166] Based on the inventive concept of embodiment 3, a data transmission device is also provided in the embodiment of the present application. The device is applied to Figure 4 In the forwarding node of the system shown in Figure 10 As shown, the device includes:

[0167] The sending module 110 is configured to send a queue cycle occupancy status request to a downstream forwarding node, wherein the queue cycle occupancy status request is used to instruct the downstream forwarding node to report the occupied queue cycle;

[0168] The reporting module 111 is configured to report the occupied queue period to the controller, so that the controller generates a period mapping label according to the occupied queue period.

[0169] Based on the above device, since the period mapping label is generated by directly reporting the available queuing period by the forwarding node, end-to-end service transmission is achieved without the need for time synchronization, avoiding period conflicts caused by time synchronization errors.

[0170] In addition, each forwarding node directly forwards according to the periodic mapping label in the service flow, and does not need to consume device resources to create and maintain the periodic mapping table, which reduces device resource consumption and reduces device operating pressure.

[0171] In an optional embodiment, the device further includes:

[0172] A control module, configured to receive a service flow sent by a sending end;

[0173] A period mapping tag is parsed out from the service flow, and an entry and exit queue period is determined in the period mapping tag, and the service flow is received according to the entry queue period.

[0174] Example 6

[0175] Based on the same inventive concept, the embodiment of the present application also provides a data transmission system, such as Figure 11 FIG. 1 is a schematic diagram of a data transmission system according to an embodiment of the present application, wherein the system includes:

[0176] Forwarding nodes and controllers. The forwarding nodes are located between the data sending end and the data receiving end and are connected in sequence. Each forwarding node receives data according to the queue entry cycle and sends data according to the queue exit cycle.

[0177] The controller is used to determine the available queuing period in the current data transmission period of each forwarding node, wherein the data transmission period is the period during which the transmitting end sends data; the available queuing period is the period during which the current forwarding node can receive data sent by the previous forwarding node;

[0178] Generate a cycle mapping label containing an available queuing period, and add the cycle mapping label to the service flow, so that each forwarding node of the N forwarding nodes forwarding the service flow receives data according to the available queuing period in the cycle mapping label.

[0179] In the above system, because the available enqueuing cycles are directly reported by forwarding nodes to generate cycle mapping labels, end-to-end service delivery is achieved without the need for time synchronization, avoiding cycle conflicts caused by time synchronization errors. Furthermore, the generated cycle mapping table is directly added to the service flow, and each forwarding node forwards the service flow based on the cycle mapping label. This eliminates the need to consume device resources to create and maintain the cycle mapping table, reducing device resource consumption and operational pressure.

[0180] In an optional embodiment, the controller is specifically configured to obtain an occupied queue period of each forwarding node, wherein the occupied queue period is a queue period for sending data in the current data transmission period;

[0181] The available queuing period of each forwarding node is determined according to the occupied queuing period of each forwarding node.

[0182] In an optional embodiment, the controller is specifically configured to determine J available queuing periods after the occupied queuing period of each forwarding node as priority queuing periods, and determine the remaining available queuing periods as waiting-for-selection queuing periods, where J is an integer greater than or equal to 2;

[0183] Generate a cycle mapping label containing the priority queue entry cycle and the waiting queue entry cycle of each forwarding node;

[0184] Instruct each of the N forwarding nodes to receive data according to the priority queuing period and / or the waiting queuing period in the period mapping label.

[0185] Example 7

[0186] Based on the same inventive concept, an electronic device is also provided in the embodiment of the present application, and the electronic device can realize the functions of the aforementioned data transmission system, referring to Figure 12 , the electronic device includes:

[0187] At least one processor 1201, and a memory 1202 connected to the at least one processor 1201. The specific connection medium between the processor 1201 and the memory 1202 is not limited in the embodiment of the present application. Figure 12 In the example, the processor 1201 and the memory 1202 are connected via the bus 1200. Figure 12 The bus 1200 can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 12 The diagram is represented by only one thick line, but this does not mean that there is only one bus or one type of bus. Alternatively, the processor 1201 may also be referred to as a controller, without limitation to the name.

[0188] In the embodiment of the present application, the memory 1202 stores instructions that can be executed by at least one processor 1201. The at least one processor 1201 can execute a data transmission method discussed above by executing the instructions stored in the memory 1202. The processor 1201 can implement Figure 8 The functions of each module in the system are shown.

[0189] Among them, the processor 1201 is the control center of the device, which can use various interfaces and lines to connect the various parts of the entire control device, and monitor the device as a whole by running or executing instructions stored in the memory 1202 and calling data stored in the memory 1202, the various functions of the device and processing data.

[0190] In one possible design, processor 1201 may include one or more processing units. Processor 1201 may integrate an application processor and a modem processor. The application processor primarily processes the operating system, user interface, and application programs, while the modem processor primarily processes wireless communications. It is understood that the modem processor may not be integrated into processor 1201. In some embodiments, processor 1201 and memory 1202 may be implemented on the same chip. In some embodiments, they may also be implemented on separate chips.

[0191] The processor 1201 can be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. A general-purpose processor can be a microprocessor or any conventional processor. The steps of a data transmission method disclosed in conjunction with the embodiments of the present application can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor.

[0192] Memory 1202 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer executable programs and modules. Memory 1202 may include at least one type of storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory, a random access memory (Random Access Memory, RAM), a static random access memory (Static Random Access Memory, SRAM), a programmable read-only memory (Programmable Read Only Memory, PROM), a read-only memory (Read Only Memory, ROM), an electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), a magnetic memory, a disk, an optical disk, etc. Memory 1202 is any other medium that can be used to carry or store a desired program code in the form of an instruction or data structure and can be accessed by a computer, but is not limited thereto. The memory 1202 in the embodiment of the present application can also be a circuit or any other device that can realize a storage function, for storing program instructions and / or data.

[0193] By designing and programming the processor 1201, the code corresponding to the data transmission method described in the above embodiment can be fixed into the chip, so that the chip can execute the data transmission method during operation. Figure 5 As shown and Figure 6 How to design and program the processor 1201 is a technique well known to those skilled in the art and will not be described in detail here.

[0194] Based on the same inventive concept, an embodiment of the present application further provides a storage medium storing computer instructions. When the computer instructions are executed on a computer, the computer executes a data transmission method discussed above.

[0195] In some possible implementations, various aspects of a data transmission method provided by the present application may also be implemented in the form of a program product, which includes program code. When the program product is run on an apparatus, the program code is used to enable the control device to execute the steps of a data transmission method according to various exemplary implementations of the present application described above in this specification.

[0196] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0197] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the steps in the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0198] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0199] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0200] Obviously, those skilled in the art may make various changes and modifications to this application without departing from the spirit and scope of this application. Thus, if these modifications and variations of this application fall within the scope of the claims of this application and their equivalents, this application is intended to include these modifications and variations.

Claims

1. A data transmission method, characterized in that: The method comprises: Determine an available queuing period for each forwarding node in a current data transmission period, wherein the data transmission period is a period during which a transmitting end sends data; and the available queuing period is a period during which a current forwarding node can receive data sent by a previous forwarding node; Determine J available queueing periods after the occupied queue period of each forwarding node as priority queueing periods, and determine the remaining available queueing periods as waiting queueing periods, where J is an integer greater than or equal to 2; Generate a cycle mapping label containing the priority queue entry cycle and the waiting queue entry cycle of each forwarding node; The periodic mapping label is added to the service flow, so that each forwarding node among the N forwarding nodes that forward the service flow receives data according to the available queuing period in the periodic mapping label.

2. The method according to claim 1, wherein The determining of the available queuing period in each forwarding node during the data transmission period includes: Obtaining an occupied queue period of each forwarding node, wherein the occupied queue period is a queue period for sending data in the current data transmission period; The available queuing period of each forwarding node is determined according to the occupied queuing period of each forwarding node.

3. The method according to claim 1, wherein Generating a cycle mapping tag including available queuing cycles includes: Determine a dequeue period of a first forwarding node among the N forwarding nodes for the current service flow; The priority enqueue periods of the remaining forwarding nodes in the N forwarding nodes are sequentially screened according to the dequeue period, and a period mapping label corresponding to the current service flow is generated.

4. The method according to claim 2, wherein Before obtaining the occupied queue period of each forwarding node, it also includes: In the current data transmission cycle, controlling an upstream node among the N forwarding nodes to send a queue cycle occupancy status request to a downstream node; Receive the occupied queue periods in the current data transmission period returned by the N forwarding nodes.

5. A data processing method, characterized in that: The method comprises: The current forwarding node sends a queue cycle occupancy status request to the downstream forwarding node, wherein the queue cycle occupancy status request is used to instruct the downstream forwarding node to report the occupied queue cycle; receiving an occupied queue period returned by the downstream forwarding node based on the queue period occupancy status request; The occupied queue period is reported to the controller so that the controller generates a period mapping label according to the occupied queue period, wherein the period mapping label includes the priority queue period and the waiting queue period of each forwarding node. The priority queue period is determined as the J available queue periods after the occupied queue period of each forwarding node as the priority queue period, and the waiting queue period is determined as the remaining available queue periods as the waiting queue period.

6. The method according to claim 5, wherein After reporting the occupied queue period to the controller, the method further includes: Receive the business flow sent by the sender; A period mapping tag is parsed from the service flow, and an entry and exit queue period is determined in the period mapping tag, and the service flow is received according to the entry queue period.

7. A data transmission device, characterized in that: The device comprises: A determination module is configured to determine an available queuing period for each forwarding node in a current data transmission period, wherein the data transmission period is a period during which a transmitting end sends data; and the available queuing period is a period during which a current forwarding node can receive data sent by a previous forwarding node; The processing module is configured to determine J available enqueueing periods after the occupied queuing period of each forwarding node as priority enqueueing periods, and determine the remaining available enqueueing periods as to-be-selected enqueueing periods, where J is an integer greater than or equal to 2; generate a cycle mapping label including the priority enqueueing period and the to-be-selected enqueueing period of each forwarding node; and add the cycle mapping label to a service flow so that each of the N forwarding nodes forwarding the service flow receives data according to the available enqueueing periods in the cycle mapping label.

8. A data processing device, characterized in that: The device is provided in each forwarding node, and includes: A sending module, configured to send a queue cycle occupancy status request to a downstream forwarding node, wherein the queue cycle occupancy status request is used to instruct the downstream forwarding node to report the occupied queue cycle; A reporting module is configured to report the occupied queue period to a controller so that the controller generates a period mapping label based on the occupied queue period, wherein the period mapping label includes a priority queue period and a to-be-selected queue period of each forwarding node, wherein the priority queue period is determined as the J available queue periods after the occupied queue period of each forwarding node, and the to-be-selected queue period is determined as the remaining available queue periods.

9. A data transmission system, characterized in that: The system includes a forwarding node and a controller. The forwarding node is located between a data sending end and a data receiving end and is connected in sequence. Each forwarding node receives data according to an in-queue cycle and sends data according to an out-queue cycle. The controller is configured to determine an available queuing period in a current data transmission period in each forwarding node, wherein the data transmission period is a period during which the transmitting end sends data; and the available queuing period is a period during which the current forwarding node can receive data sent by the previous forwarding node; Determine J available enqueueing periods after the occupied queuing period of each forwarding node as priority enqueueing periods, and determine the remaining available enqueueing periods as to-be-selected enqueueing periods, where J is an integer greater than or equal to 2; generate a cycle mapping label including the priority enqueueing period and the to-be-selected enqueueing period of each forwarding node, and add the cycle mapping label to the service flow so that each forwarding node among the N forwarding nodes forwarding the service flow receives data according to the available enqueueing periods in the cycle mapping label.

10. An electronic device, characterized in that: include: Memory for storing computer programs; A processor, configured to implement the method steps of any one of claims 1 to 6 when executing the computer program stored in the memory.

11. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method steps according to any one of claims 1 to 6 are implemented.

Images