CN115695327A

CN115695327A - Data transmission method, system and electronic equipment

Info

Publication number: CN115695327A
Application number: CN202211324724.2A
Authority: CN
Inventors: 刘兆博; 李加新; 曲延锋; 陈学平
Original assignee: Beijing Star Net Ruijie Networks Co Ltd
Current assignee: Beijing Star Net Ruijie Networks Co Ltd
Priority date: 2022-10-27
Filing date: 2022-10-27
Publication date: 2023-02-03

Abstract

In the method provided by the application, a period mapping label is generated by directly reporting an available enqueue period through a forwarding node, end-to-end service transmission is realized without time synchronization, and period conflict caused by time synchronization errors is avoided. And the generated period mapping table is directly added into the service flow, each forwarding node directly forwards the service flow according to the period mapping label in the service flow, and the period mapping table is not required to be created and maintained by consuming equipment resources, so that the resource consumption of the equipment is reduced, and the operating pressure of the equipment is reduced.

Description

Data transmission method, system and electronic equipment

Technical Field

The present application relates to the field of communications technologies, and in particular, to a data transmission method, a data transmission system, and an electronic device.

Background

In the current communication Network, a Deterministic Network (DetNet) is a technology that helps to realize that an IP (Internet Protocol) Network is from "best-effort" to "on-time, accurate, and fast" to control and reduce end-to-end delay. DetNet is just another Quality of Service (QoS) offered by best-effort networks.

The traditional QoS means has better effect in the aspect of guaranteeing bandwidth and forwarding queue priority scheduling, but the essence of the IP network is still a statistical multiplexing network, and network equipment lacks accurate time control on the transmission behavior of data packets. When the traffic flows sent from multiple upstream network devices reach the same physical port of a downstream network device at the same time, a micro-burst of traffic is formed, and at this time, the data packet can only request a forwarding resource by queuing. With the accumulation of the micro-bursts in the network, the increase of the time delay and jitter between end to end of the service is finally reflected.

In order to solve the above problems, the current DetNet scheme can be regarded as a derivative of a Multiple round robin queue Forwarding (english: multiple Cyclic Queuing and Forwarding, abbreviated as Multiple-CQF) scheme. The Multi-CQF selects a plurality of queues (the number of the queues is more than or equal to 3 and is usually 4) from the scheduling queues of the outgoing port and is used for receiving and sending deterministic traffic. For example, as shown in fig. 1, 4 queues are selected for receiving and sending deterministic traffic flows, and the 4 queues sequentially open dequeue gating in turn by taking a period T as a unit. In the dequeue cycle, the dequeue gate is open and the queue is in the transmit state, at which time the enqueue gate should be closed. Conversely, during an enqueue cycle, enqueue gating is on, and dequeue gating should be off, with the queue in the receive state. In this way, each node completes the reception and transmission of data.

In the specific implementation of the opening and closing of the queue gating, various manufacturers propose specific implementation algorithms, such as a Cycle Specified Queuing and Forwarding (CSQF) algorithm, an extensible Deterministic Forwarding (SDF) algorithm, and the like.

The CSQF algorithm requires that traffic enqueued on the local device for one cycle T0 should be dequeued for the next cycle T1. Next, the traffic flow arrives at the downstream device, and the CSQF algorithm requires to calculate the delay introduced on the transmission link first when the controller schedules which traffic flow should enter which queue cycle. The link delay is divided by the cycle period T and rounded up to obtain an integer period shift of 1T, 2T, 3T and the like, and the integer period shift is reported to the controller for arrangement. However, the CSQF algorithm has a problem that a very strict time synchronization is required in the whole network, and a periodic collision problem occurs when a plurality of end-to-end service paths are scheduled due to the influence of a synchronization error.

In addition to implementing Multi-CQF by CSQF algorithm, it can also be implemented by SDF algorithm, specifically, SDF algorithm allows queue cycles of upstream and downstream devices not to be aligned, and only requires that the service flow received in the current cycle is sent out in the next cycle on the local device. For example: the upstream node a sends a deterministic traffic flow in T (x) period, which enters the queue at T (y) period of the downstream node B and sends out the queue at T (y + 1) period of the node B.

Although the advantage of the SDF algorithm is that each node of the network does not need time synchronization, but only needs to satisfy frequency synchronization, so that there is no problem of queue period conflict, and there is no need to consider the delay introduced by link transmission, which is more suitable for deployment in large-scale wide area networks. However, just as the period mapping table is created and maintained by the device, the SDF algorithm is more consuming device performance resources, which is a disadvantage of the SDF algorithm, and the more deterministic traffic, the more resource consumption of the device is multiplied.

Therefore, the CSQF algorithm and the SDF algorithm still have the problems of complex algorithm and high consumption of device resources at present.

Disclosure of Invention

The application provides a data transmission method, a data transmission system and electronic equipment, which are used for realizing the deterministic forwarding of data under the condition of not needing time synchronization.

In a first aspect, the present application provides a data transmission method, where the method includes:

determining an available enqueue period in a current data transmission period in each forwarding node, wherein the data transmission period is a period for transmitting data by the transmitting end; the available enqueue period is the period that the current forwarding node can receive the data sent by the previous forwarding node;

and generating a period mapping label containing an available enqueue period, and adding the period mapping label to a service flow, so that each forwarding node of the N forwarding nodes forwarding the service flow receives data according to the available enqueue period in the period mapping label.

By the method, the forwarding node directly reports the available enqueue period to generate the period mapping label, so that end-to-end service transmission is realized without time synchronization, and period conflict caused by time synchronization errors is avoided. And the generated period mapping table is directly added into the service flow, each forwarding node directly forwards the service flow according to the period mapping label in the service flow, and the establishment of consumed equipment resources and the maintenance of the period mapping table are not needed, so that the resource consumption of the equipment is reduced, and the operating pressure of the equipment is reduced.

In an optional embodiment, the determining an available enqueue period in a data transmission period in each forwarding node includes:

acquiring 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;

and determining the available queue entering period of each forwarding node according to the occupied queue period of each forwarding node.

The available queue period can be accurately determined by occupying the queue period, so that the accuracy of the period mapping label is ensured.

In an alternative embodiment, the generating a cycle map tag containing available enqueue cycles includes:

determining J available enqueue cycles after the queue occupation cycle of each forwarding node as priority enqueue cycles, and determining the remaining available enqueue cycles as to-be-selected enqueue cycles, wherein J is an integer greater than or equal to 2;

generating a cycle mapping label containing a priority enqueue cycle of each forwarding node and a to-be-selected enqueue cycle;

and each forwarding node in the N forwarding nodes is instructed to receive data according to the priority queue cycle and/or the to-be-selected queue cycle in the cycle mapping label.

By the method, the optimal queue entering period can be accurately determined, and the problem that data cannot be completely forwarded due to phase errors among phase forwarding nodes is solved.

determining the dequeuing period of the current service flow at the first forwarding node in the N forwarding nodes;

and sequentially screening out priority enqueue periods of other forwarding nodes in the N forwarding nodes according to the dequeue period, and generating a period mapping label corresponding to the current service flow.

In an optional embodiment, before acquiring the queue occupation period of each forwarding node, the method further includes:

in the current data transmission period, controlling an upstream node in the N forwarding nodes to send a queue period occupation state request to a downstream node;

and receiving the occupied queue cycle in the current data transmission cycle returned by the N forwarding nodes.

In a second aspect, the present application provides a data processing method, including:

a current forwarding node sends a queue period occupation state request to a downstream forwarding node, wherein the queue period occupation state request is used for indicating the downstream forwarding node to report an occupation queue period;

receiving an occupation queue cycle returned by the downstream forwarding node based on the queue cycle occupation state request;

and reporting the occupied queue period to the controller so that the controller generates a period mapping label according to the occupied queue period.

By the mode, the forwarding node directly reports the available enqueue period to generate the period mapping label, so that end-to-end service transmission is realized without time synchronization, and period conflict caused by time synchronization errors is avoided.

In addition, each forwarding node directly forwards the service flow according to the periodic mapping label in the service flow without consuming equipment resource establishment and maintaining a periodic mapping table, so that the resource consumption of the equipment is reduced, and the operating pressure of the equipment is reduced.

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

receiving a service flow sent by a sending end;

analyzing a period mapping label in the service flow, determining an in-out queue period in the period mapping label, and receiving the service flow according to the in-queue period.

In a third aspect, the present application provides a data transmission apparatus, including:

a determining module, configured to determine an available queue entry period in a current data transmission period in each forwarding node, where the data transmission period is a period in which the sending end sends data; the available enqueue period is the period that the current forwarding node can receive the data sent by the previous forwarding node;

and the processing module is used for generating a period mapping label containing an available enqueue period, and adding the period mapping label into a service flow so that each forwarding node of the N forwarding nodes forwarding the service flow receives data according to the available enqueue period in the period mapping label.

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

and determining the available enqueue period of each forwarding node according to the occupied queue period of each forwarding node.

In an optional embodiment, the determining module is specifically configured to determine J available enqueue cycles after the queue occupation cycle of each forwarding node as priority enqueue cycles, and determine the remaining available enqueue cycles as to-be-selected enqueue cycles, where J is an integer greater than or equal to 2;

and each forwarding node in the N forwarding nodes is instructed to receive data according to the priority queue period and/or the to-be-selected queue period in the period mapping label.

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

and sequentially screening the priority levels of the rest forwarding nodes in the N forwarding nodes into a queue period according to the queue-out period, and generating a period mapping label corresponding to the current service flow.

In a fourth aspect, the present application provides a data transmission apparatus, comprising:

a sending module, configured to send a queue period occupation state request to a downstream forwarding node, where the queue period occupation state request is used to instruct the downstream forwarding node to report an occupation queue period;

and the reporting module is used for reporting the occupied queue period to the controller so that the controller generates a period mapping label according to the occupied queue period.

In a fifth aspect, the present application provides a data transmission system, where the system includes forwarding nodes and a controller, where the forwarding nodes are located between a data sending end and a data receiving end and are connected in sequence, and each forwarding node receives data according to an enqueue period and sends data according to an dequeue period;

the controller is configured to determine an available enqueue period in a current data transmission period in each forwarding node, where the data transmission period is a period in which the sending end sends data; the available enqueue period is a period in which the current forwarding node can receive data sent by the previous forwarding node;

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

In an optional embodiment, the controller is specifically configured to determine J available enqueue cycles after the queue occupation cycle of each forwarding node as priority enqueue cycles, and determine the remaining available enqueue cycles as to-be-selected enqueue cycles, where J is an integer greater than or equal to 2;

generating a cycle mapping label comprising a priority enqueue cycle of each forwarding node and a to-be-selected enqueue cycle;

In a sixth aspect, the present application provides an electronic device, comprising:

a memory for storing a computer program;

and the processor is used for realizing the steps of the data transmission method when executing the computer program stored in the memory.

In a seventh aspect, the present application provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the data transmission method described above.

For each of the third to seventh aspects and possible technical effects of each aspect, please refer to the above description of the possible technical effects of the first aspect or each possible solution of the first aspect, and no repeated description is given here.

Drawings

Fig. 1 is a schematic structural diagram of a multi-circular queue forwarding system provided in the present application;

fig. 2 is a schematic diagram of a forwarding flow of queuing and forwarding in a specified period provided in the present application;

fig. 3 is a schematic diagram of a forwarding flow of scalable deterministic forwarding provided in the present application;

FIG. 4 is a schematic diagram of an architecture of a deterministic network provided herein;

fig. 5 is a flowchart of a data transmission method provided in the present application;

fig. 6 is a second flowchart of a data transmission method provided in the present application;

FIG. 7 is a schematic diagram of label forwarding based on periodic mapping provided herein;

FIG. 8 is a flow chart of a data processing method provided herein;

fig. 9 is a schematic structural diagram of a data transmission device according to the present application;

FIG. 10 is a schematic diagram of a data processing apparatus according to the present application;

fig. 11 is a schematic structural diagram of a data transmission system provided in the present application;

fig. 12 is a schematic structural diagram of an electronic device provided in the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more clear, the present application will be further described in detail with reference to the accompanying drawings. The particular methods of operation in the method embodiments may also be applied to apparatus embodiments or system embodiments. It should be noted that "a plurality" is understood as "at least two" in the description of the present application. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. A is connected with B and can represent: a and B are directly connected and A and B are connected through C. In addition, in the description of the present application, the terms "first," "second," and the like are used for descriptive purposes only and are not intended to indicate or imply relative importance nor order to be construed.

The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

At present, the DetNet scheme can be regarded as a derivative of a Multiple circular queue Forwarding (English: multiple Cyclic Queuing and Forwarding, abbreviated as Multiple-CQF) scheme. The Multi-CQF selects a plurality of queues (the number of the queues is more than or equal to 3 and is usually 4) from the scheduling queues of the outgoing port and is used for receiving and sending deterministic traffic. For example, as shown in fig. 1, 4 queues are selected for receiving and sending deterministic traffic flows, and the 4 queues sequentially open dequeue gating in turn by taking a period T as a unit. In the dequeue cycle, the dequeue gate is open and the queue is in the transmit state, at which time the enqueue gate should be closed. Conversely, in an enqueue cycle, the enqueue gate is open, at which point the dequeue gate should be closed, and the queue is in a receive state. In this way, each node completes the reception and transmission of data.

In the specific implementation of the opening and closing of the queue gate control, at present, various manufacturers propose specific implementation algorithms, such as a Specified Cycle Queuing and Forwarding (CSQF) algorithm, an extensible Deterministic Forwarding (SDF) algorithm, and the like.

The CSQF algorithm requires that traffic enqueued on the local device for one cycle T0 should be dequeued for the next cycle T1. Next, the traffic flow arrives at the downstream device, and the CSQF algorithm requires to calculate the delay introduced on the transmission link first when the controller schedules which traffic flow should enter which queue cycle. The link delay is divided by the cycle period T and rounded up to obtain an integer period shift of 1T, 2T, 3T and the like, and the integer period shift is reported to the controller for arrangement. That is, the enqueue period for data entering the downstream device should be:

tdownstream enqueue period = Tupstream dequeue period + integer period shift introduced by link delay

For example, referring to fig. 2, there are 4 deterministic queues named T0, T1, T2, and T3, respectively, and if the dequeue period of the traffic flow at node a is T0, the link delay from node a to node B is 0.5T, and the round-up is 1T, the enqueue period of the traffic flow at node B should be T1. Similarly, the dequeue period of the service flow at the node B is T2, the link delay from the node B to the node is 1.5T, and the round-up is 2T, so the enqueue period of the service flow at the node C should be T0. The controller arranges in sequence to obtain the end-to-end periodic mapping table of the service flow.

The controller will issue the scheduled periodic mapping tables of all deterministic services to each head node. When there is a service request, the head node directly carries the end-to-end periodic mapping ID information on the head packet of the service flow by using the protocol extension. Each hop of the traffic flow behind performs enqueuing and dequeuing strictly according to the periodic mapping, thereby realizing end-to-end deterministic forwarding.

The CSQF algorithm has the advantages that all nodes of the network do not need to maintain the flow state of the service, the flow state is uniformly calculated and issued by the controller, and the pressure of network equipment is low. And an Extension header Routing Extension header (SRH) using an IPv 6-based Segment Routing (SRv 6) may naturally carry information of an Identity (ID) of a periodic mapping. However, the CSQF algorithm has a problem that a very strict time synchronization is required for the whole network, and a periodic collision problem occurs when a plurality of end-to-end service paths are scheduled due to a synchronization error.

For example, referring to FIG. 3, assume that there are now 4 deterministic queues, one for transmit and 3 for receive. The T (y) period is used to receive the traffic flow sent by the T (x) period, and the sending period is set to T (y + 1). Similarly, the T (y + 1) period is used to receive the service flow sent by the T (x + 1) period, and the sending period is set to be T (y + 2); the T (y + 2) period is used for receiving the service flow sent by the T (x + 2) period, and the sending period is set to be T (y + 3), and the mechanism can relieve the flow micro-burst caused by one more aggregation of network topology to a certain extent.

Specifically, let the first packet of the traffic flow carry the enqueue and dequeue cycle ID information, such as: the upstream T (x) dequeue, local T (y) enqueue, and local T (y + 1) dequeue, generate a periodic mapping table for that traffic flow only. And each pair of neighbors needs to maintain a period mapping table for each deterministic service flow, and the synchronization mode of the period tables among the neighbors can be selected to be sent by a controller in a centralized mode or a distributed mode. Each hop of the traffic flow on the path performs enqueuing and dequeuing strictly according to the periodic mapping, thereby realizing end-to-end deterministic forwarding.

The SDF algorithm has the advantages that each node of the network does not need time synchronization, only needs frequency synchronization, and therefore the problem of queue period conflict does not exist, time delay introduced by link transmission does not need to be considered, and the SDF algorithm is more suitable for deployment in a large-scale wide area network. In addition, the SDF algorithm requires the device ports to create and maintain a periodic mapping table of services through flow learning, so the algorithm can be deployed without controller assistance. However, just as the period mapping table is created and maintained by the device, the SDF algorithm is more consuming device performance resources, which is a disadvantage of the SDF algorithm, and the more deterministic traffic, the more resource consumption of the device is multiplied.

In order to solve the problems of complex algorithm and high equipment resource consumption in multi-circular queue forwarding, the embodiment of the present application provides a data transmission method, where the method may be applied to a DetNet network system shown in fig. 4, where the DetNet network system includes a controller, a sending end, a receiving end, and N forwarding nodes, the N forwarding nodes are located between the sending end and the receiving end, and the N forwarding nodes are connected in sequence, and each forwarding node receives data according to an enqueue period and sends data according to an dequeue period. In the embodiment of the application, N is an integer which is greater than or equal to 2.

It should be noted here that the enqueue period and the dequeue period form all data transmission periods of one forwarding node, and when all data transmission periods are in a condition of receiving data, all data transmission periods are determined as enqueue periods, for example, forwarding node 1 and forwarding node 2 shown in fig. 4 have 4 data transmission periods, which are T0, T1, T2, and T3, respectively. The 4 data transmission cycles may be enqueue cycles or dequeue cycles. When data is transmitted or received, the data is circularly executed by 4 queue periods of T0, T1, T2 and T3.

Based on the application scenario, the data transmission method provided in this embodiment of the present application determines an available enqueue period in a current data transmission period in each forwarding node, generates a period mapping tag including the available enqueue period, adds the period mapping tag to a service stream, and sends the service stream to a first forwarding node of N forwarding nodes, so that the first forwarding node and subsequent forwarding nodes can both receive data according to the available enqueue period in the period mapping tag in the service stream.

In the method provided by the embodiment of the application, the forwarding node directly reports the available enqueue period to generate the period mapping label, so that end-to-end service transmission is realized without time synchronization, and the period conflict caused by time synchronization errors is avoided.

In addition, the generated period mapping table is directly added into the service flow, each forwarding node directly forwards the service flow according to the period mapping label in the service flow, and the establishment of consumed equipment resources and the maintenance of the period mapping table are not needed, so that the resource consumption of the equipment is reduced, and the operating pressure of the equipment is reduced.

Example one

Referring to fig. 5, a flowchart of a data transmission method provided in an embodiment of the present application is shown, where the method includes:

s1, determining an available enqueue period in a current data transmission period in each forwarding node;

in this embodiment, first, the method is applied to a controller in a DetNet network system, where the controller instructs each forwarding node to send a queue period occupation state request to a downstream forwarding node, for example, an automatic transfer node a, a forwarding node B, a forwarding node C, and a forwarding node D are sequentially connected between a sending end and a receiving end. At this time, the forwarding node a sends a queue period occupation state request to the forwarding node B, the forwarding node B sends a queue period occupation state request to the forwarding node C, and the forwarding node C sends a queue period occupation state request to the forwarding node D. The queue period occupation state request is used for requesting a resource state of a queue period of each downstream node, that is, requesting each forwarding node to report an available enqueue period.

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

For example, each forwarding node has 4 queue periods, which are T0, T1, T2, and T3, and reports the corresponding available queue period to the controller according to the occupation of the queue period of each forwarding node, forwarding node a reports T0, T1, and T2, forwarding node B reports T1, T2, and T3, forwarding node C reports T2, T3, and forwarding node D reports T3, T0, and T1.

Through the process, the available enqueue period of each forwarding node can be measured, so that accurate information can be provided for ensuring the subsequent periodic arrangement.

And S2, generating a periodic mapping label containing an available enqueue period, and adding the periodic mapping label into the service flow.

In step S1, the available queue cycles of each forwarding node are already obtained, and at this time, the available queue cycles of each forwarding node are arranged, and the list of the available queue cycles of each forwarding node is shown in table 1:

TABLE 1

The available enqueue periods for each forwarding node may be determined from the list of available enqueue periods in table 1. Therefore, the available enqueue cycle list is arranged according to the following specific arrangement mode:

firstly, determining the dequeuing period of the current service flow at the first forwarding node in the N forwarding nodes, then sequentially screening the available enqueuing periods of the rest forwarding nodes in the N forwarding nodes according to the dequeuing period, and generating a period mapping label corresponding to the current service flow.

For example, the dequeue period of the current service flow at the forwarding node a is T3, the dequeue period corresponding to the forwarding node a is T3, the available queue period corresponding to the dequeue period in the forwarding node B in table 1 is T0, T1, and T2, at this time, T0 is selected as the period of the forwarding node B, and the enqueue period of each forwarding node is sequentially selected according to the method, so that the period mapping label is obtained. At this time, the period mapping label corresponding to the current service flow is determined to be T3-T0-T1-T3.

Through the above manner, the period mapping label corresponding to each service flow can be obtained, for example, the finally obtained period mapping label is shown in table 2:

TABLE 2

Traffic flow	Periodic mapping tags
		1	T3～T0～T1～T3
2	T2～T1～T3～T0
		3	T1～T2～T0～T3
4	T0～T3～T1～T2

After the periodic mapping label is generated, the periodic mapping label is added to a service flow to be forwarded, for example, when the service flow 1 is forwarded, the periodic mapping label (T3-T0-T1-T3) is added to a first packet of the service flow, and each forwarding node of the service flow in the DetNet network system performs enqueuing and dequeuing according to a period in the periodic mapping label, thereby implementing deterministic forwarding from end to end.

Therefore, by the above manner, the forwarding node directly reports the available enqueue period to generate the period mapping label, so that end-to-end service transmission is realized without time synchronization, and period conflict caused by time synchronization errors is avoided. And the generated period mapping table is directly added into the service flow, each forwarding node directly forwards the service flow according to the period mapping label in the service flow, and the period mapping table is not required to be created and maintained by consuming equipment resources, so that the resource consumption of the equipment is reduced, and the operating pressure of the equipment is reduced.

Example two

Referring to fig. 6, a flowchart of a data transmission method provided in an embodiment of the present application is shown, where the method includes:

s61, acquiring an occupied queue period of each forwarding node;

in this embodiment of the present application, first, a controller in a DetNet network system instructs each forwarding node to send a queue period occupation state request to a downstream forwarding node, where the queue period occupation state request is used to request each forwarding node to report an occupied queue period, that is, an unavailable queue period.

For example, the automatic transfer node a, the forwarding node B, the forwarding node C, and the forwarding node D are sequentially connected between the sending end and the receiving end. At this time, the forwarding node a sends a measurement probe to the forwarding node B, the forwarding node B sends a measurement probe to the forwarding node C, and the forwarding node C sends a measurement probe to the forwarding node D. The measurement probe is used for requesting the resource state of the queue period of each downstream node, namely measuring the occupied queue period of each forwarding node.

For example, as shown in fig. 7, the forwarding node a actively sends a first packet measurement probe in a T1 queue period, the forwarding node B repackages a queue period T2 in which data is being sent to the forwarding node a, then sends the measurement probe again in a T0 queue period, and then the forwarding node B repackages the measurement probe to the forwarding node a, so that the forwarding node a can determine the queue occupation period of the forwarding node B in each queue period.

According to the mode, each forwarding node reports the corresponding occupied queue period to the controller according to the self queue period occupation condition. For example, the forwarding node a reports the queue period T0, the forwarding node B reports the queue period T2, the forwarding node C reports the queue period T1, and the forwarding node D reports the queue period T3.

Through the process, the queue occupation period of each forwarding node can be measured, so that accurate information can be provided for ensuring the subsequent period arrangement.

S62, determining an available queue entering period of each forwarding node according to the occupied queue period of each forwarding node;

the occupied queue period of each forwarding node is obtained in step S61, and then each forwarded occupied queue period is a queue period for sending data in the data transmission period, that is, a dequeue period.

And screening available enqueue cycles of each forwarding node according to the occupied queue cycle of each forwarding node, for example, screening the occupied queue cycle T0 reported by the forwarding node A, the available queue cycles of the forwarding node A being T1, T2 and T3, and the occupied queue cycle reported by the forwarding node B being T2, wherein the corresponding available enqueue cycles are T0, T1 and T3, and determining the occupied queue cycle and the available enqueue cycle corresponding to each forwarding node according to the mode.

And S63, generating a period mapping label containing the available enqueue period, and adding the period mapping label into the service flow.

Firstly, determining J available enqueue cycles after the queue occupation cycle of each forwarding node as priority enqueue cycles, and determining the remaining available enqueue cycles as to-be-selected enqueue cycles, wherein J is an integer greater than or equal to 2.

For example, the forwarding node a detects that the occupied queue period of the forwarding node B is T2 in the queue period T1, at this time, the queue period T2 of the forwarding node B is unavailable, and other queue periods of the forwarding node B are available, that is, T0, T1, and T3 are available. In order to enable the data of the traffic flow to be completely forwarded, it is necessary to determine a priority enqueue period among T0, T1, and T3, where the priority enqueue period is determined to ensure that the data is completely enqueued. If the phase difference between the forwarding node a and the forwarding node B is large, the data sent by the forwarding node a cannot be completely received in the T1 queue period of the forwarding node B. I.e., the T1 queue period of the forwarding node B has not yet completely received data, it has already been adjusted from enqueue to dequeue. Therefore, in the embodiment of the present application, the T1 queue period is also correspondingly defined as an unavailable queue period.

Further, 2 queue cycles after the T2 queue cycle are defined as a priority queue cycle, that is, the T0 queue cycle of the forwarding node B is defined as a priority queue cycle, and the remaining T3 queue cycle is determined as a queue cycle to be selected. Specifically, the priority queue period may be calculated according to the following formula:

priority enqueue period = unavailable queue period +2T

Through the above manner, the priority enqueue period and the to-be-selected enqueue period of the forwarding node B in each queue period can be determined, as shown in table 3:

TABLE 3

Table 3 above shows the unavailable queue period, the priority enqueue period, and the to-be-selected enqueue period corresponding to each data transmission period in the forwarding node B. The unavailable queue period, the priority enqueue period, and the pending enqueue period of other forwarding nodes are determined as described above.

It should be noted that the above example is only an illustration, and in an actual application scenario, the priority enqueue period and the to-be-selected enqueue period may be multiple. For example, the cycle period is 5, and in this case, the priority enqueue period may be more than one.

After determining the period mappable table of each forwarding node, determining the dequeue period of the current service flow at the first forwarding node in the N forwarding nodes, sequentially screening the priority levels of the rest forwarding nodes in the N forwarding nodes according to the dequeue period, generating a period mapping label corresponding to the current service flow, and finally adding the period mapping label into the first packet of the service flow.

As shown in fig. 7, the period mapping labels corresponding to the service flow 1 are T1, T3, T2, and T0, the period mapping labels corresponding to the service flow 2 are T2, T0, T3, and T1, and the period mapping labels corresponding to the service flow 3 are T3, T1, T0, and T2. When traffic flow 1 is forwarded, forwarding node a will enqueue at T1, forwarding node B will enqueue at T3, forwarding node C will enqueue at T2, and forwarding node C will enqueue at T0. Traffic flow 2 and traffic flow 3 accomplish forwarding in the same manner.

In summary, in the manner described above, since the forwarding node directly reports the available enqueue period to generate the period mapping label, end-to-end service transmission is realized without time synchronization, and period collision caused by time synchronization errors is avoided. And the generated period mapping table is directly added into the service flow, each forwarding node directly forwards the service flow according to the period mapping label in the service flow, and the period mapping table is not required to be created and maintained by consuming equipment resources, so that the resource consumption of the equipment is reduced, and the operating pressure of the equipment is reduced.

EXAMPLE III

Referring to fig. 8, a flowchart of a data transmission method provided in an embodiment of the present application is shown, where the method includes:

s81, the current forwarding node sends a queue period occupation state request to a downstream forwarding node;

in the embodiment of the present application, the method may be applied to forwarding nodes in a DetNet network system, where each forwarding node is connected in sequence, and a current forwarding node sends a queue period occupation state request to a downstream node, for example, in fig. 4, if a forwarding node a is a current forwarding node, the forwarding node a sends a queue period occupation state request to a downstream forwarding node B; in this way, the forwarding node B sends a queue period occupation state request to the forwarding node C downstream, and the forwarding node C sends a queue period occupation state request to the forwarding node D downstream. The queue period occupation state request is used for requesting a downstream forwarding node to report an occupation queue period.

In the embodiment of the application, the sending of the queue period occupation state request by the current forwarding node to the downstream forwarding node may be actively triggered according to a set period, or triggered by a controller, and the specific implementation manner may be adjusted according to a specific application scenario.

S82, receiving an occupation queue cycle returned by the downstream forwarding node based on the queue cycle occupation state request;

for example, as shown in fig. 7, the forwarding node a actively sends a first packet measurement probe in a T1 queue period, the forwarding node B sends a packet back to the forwarding node a in a queue period T2 during which data is being sent, then sends the measurement probe again in a queue period T0, and then the forwarding node B sends the packet back to the forwarding node a, so that the forwarding node a can determine the queue period occupied by the forwarding node B in each queue period.

According to the mode, each forwarding node reports the corresponding occupied queue cycle to the controller according to the occupation condition of the queue cycle. For example, the forwarding node a reports the queue period T0, the forwarding node B reports the queue period T2, the forwarding node C reports the queue period T1, and the forwarding node D reports the queue period T3.

And S83, reporting the occupied queue period to the controller.

After each forwarding node determines the downstream occupied queue period, each forwarding node reports the occupied queue period to the controller, and the controller obtains a corresponding forwarding node period mapping table according to the occupied queue period reported by each forwarding node, for example, after the forwarding node a reports the occupied queue period of the forwarding node B, the controller generates the forwarding node a period mapping table shown in table 3.

After the controller obtains the forwarding node period mapping tables of the forwarding nodes, the controller arranges the enqueue periods, and the specific arrangement mode is described in detail in embodiment two and is not described here again.

After the controller finishes the scheduling, a period mapping label of each service flow is generated, and then the period mapping label is added to the service flow. Therefore, after the forwarding node receives the service flow from the sending end, the forwarding node parses the period mapping tag from the service flow, determines the queue in and out period in the period mapping tag, and receives the service flow according to the queue in period.

For example, as shown in fig. 7, the period mapping labels corresponding to the service flow 1 are T1, T3, T2, and T0, the period mapping labels corresponding to the service flow 2 are T2, T0, T3, and T1, and the period mapping labels corresponding to the service flow 3 are T3, T1, T0, and T2. When traffic flow 1 is forwarded, forwarding node a will enqueue at T1, forwarding node B will enqueue at T3, forwarding node C will enqueue at T2, and forwarding node C will enqueue at T0. Traffic flow 2 and traffic flow 3 accomplish forwarding in the same manner.

Example four

Based on the inventive concepts of the first embodiment and the second embodiment, the embodiment of the present application further provides a data transmission apparatus, which is applied to the controller of the system shown in fig. 4, as shown in fig. 9, the apparatus includes:

a determining module 901, configured to determine an available queue cycle in a current data transmission cycle in each forwarding node, where the data transmission cycle is a cycle in which the sending end sends data; the available enqueue period is the period that the current forwarding node can receive the data sent by the previous forwarding node;

a processing module 902, configured to generate a period mapping label including an available enqueue period, and add the period mapping label to a service flow, so that each forwarding node of the N forwarding nodes that forwards the service flow receives data according to the available enqueue period in the period mapping label.

Based on the device, the forwarding node directly reports the available enqueue period to generate the period mapping label, so that end-to-end service transmission is realized without time synchronization, and period conflict caused by time synchronization errors is avoided. And the generated period mapping table is directly added into the service flow, each forwarding node directly forwards the service flow according to the period mapping label in the service flow, and the period mapping table is not required to be created and maintained by consuming equipment resources, so that the resource consumption of the equipment is reduced, and the operating pressure of the equipment is reduced.

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

In an optional embodiment, the determining module 901 is specifically configured to determine J available enqueue periods after an occupied queue period of each forwarding node as priority enqueue periods, and determine remaining available enqueue periods as to-be-selected enqueue periods, where J is an integer greater than or equal to 2;

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

EXAMPLE five

Based on the third inventive concept of the embodiment, an embodiment of the present application further provides a data transmission apparatus, which is applied to a forwarding node of the system shown in fig. 4, as shown in fig. 10, the apparatus includes:

a sending module 110, configured to send a queue period occupation state request to a downstream forwarding node, where the queue period occupation state request is used to instruct the downstream forwarding node to report an occupation queue period;

the reporting module 111 is configured to report the occupied queue period to the controller, so that the controller generates a period mapping tag according to the occupied queue period.

Based on the device, the forwarding node directly reports the available enqueue period to generate the period mapping label, so that end-to-end service transmission is realized without time synchronization, and period conflict caused by time synchronization errors is avoided.

In an alternative embodiment, the apparatus further comprises:

the control module is used for receiving the service flow sent by the sending end;

Example six

Based on the same inventive concept, an embodiment of the present application further provides a data transmission system, as shown in fig. 11, which is a schematic structural diagram of the data transmission system provided in the embodiment of the present application, and the system includes:

the system comprises forwarding nodes and a controller, wherein the forwarding nodes are positioned between a data sending end and a data receiving end and are sequentially connected, and each forwarding node receives data according to an enqueue period and sends the data according to an dequeue period;

the controller is configured to determine an available queue period in a current data transmission period in each forwarding node, where the data transmission period is a period in which the sending end sends data; the available enqueue period is the period that the current forwarding node can receive the data sent by the previous forwarding node;

and generating a periodic mapping label containing an available enqueue period, and adding the periodic mapping label to the service flow, so that each forwarding node in the N forwarding nodes forwarding the service flow receives data according to the available enqueue period in the periodic mapping label.

In the system, the forwarding node directly reports the available enqueue period to generate the period mapping label, so that end-to-end service transmission is realized without time synchronization, and period conflict caused by time synchronization errors is avoided. And the generated period mapping table is directly added into the service flow, each forwarding node directly forwards the service flow according to the period mapping label in the service flow, and the period mapping table is not required to be created and maintained by consuming equipment resources, so that the resource consumption of the equipment is reduced, and the operating pressure of the equipment is reduced.

In an optional embodiment, the controller is specifically configured to determine J available enqueue periods after an occupied queue period of each forwarding node as priority enqueue periods, and determine remaining available enqueue periods as candidate enqueue periods, where J is an integer greater than or equal to 2;

EXAMPLE seven

Based on the same inventive concept, an embodiment of the present application further provides an electronic device, where the electronic device may implement the function of the foregoing data transmission system, and with reference to fig. 12, the electronic device includes:

at least one processor 1201 and a memory 1202 connected to the at least one processor 1201, in this embodiment, a specific connection medium between the processor 1201 and the memory 1202 is not limited, and fig. 12 illustrates an example in which the processor 1201 and the memory 1202 are connected by a bus 1200. The bus 1200 is shown by a thick line in fig. 12, and the connection manner between other components is merely illustrative and not limited thereto. The bus 1200 may be divided into an address bus, a data bus, a control bus, etc., and is shown in fig. 12 with only one thick line for ease of illustration, but does not represent only one bus or type of bus. Alternatively, the processor 1201 may also be referred to as a controller, without limitation to name a few.

In the embodiment of the present application, the memory 1202 stores instructions executable by the at least one processor 1201, and the at least one processor 1201 can execute one of the data transmission methods discussed above by executing the instructions stored in the memory 1202. The processor 1201 may implement the functions of the various modules in the system shown in fig. 8.

The processor 1201 is a control center of the apparatus, and may connect various parts of the entire control device by using various interfaces and lines, and perform various functions and process data of the apparatus by operating or executing instructions stored in the memory 1202 and calling data stored in the memory 1202, thereby performing overall monitoring of the apparatus.

In one possible design, the processor 1201 may include one or more processing units, and the processor 1201 may integrate an application processor, which handles primarily the operating system, user interfaces, application programs, etc., and a modem processor, which handles primarily wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 1201. In some embodiments, the processor 1201 and the memory 1202 may be implemented on the same chip, or in some embodiments, they may be implemented separately on separate chips.

The processor 1201 may be a general-purpose processor, such as a Central Processing Unit (CPU), digital signal processor, application specific integrated circuit, field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or the like, that performs or implements the methods, steps, and logic blocks disclosed in the embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a data transmission method disclosed in the embodiments of the present application may be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor.

Memory 1202, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The Memory 1202 may include at least one type of storage medium, and may include, for example, a flash Memory, a hard disk, a multimedia card, a card-type Memory, a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Programmable Read Only Memory (PROM), a Read Only Memory (ROM), a charge Erasable Programmable Read Only Memory (EEPROM), a magnetic Memory, a magnetic disk, an optical disk, and so on. The memory 1202 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 1202 in the embodiments of the present application may also be circuitry or any other device capable of performing a storage function for storing program instructions and/or data.

By programming the processor 1201, the code corresponding to one of the data transmission methods described in the foregoing embodiments may be fixed in the chip, so that the chip can execute the steps of one of the data transmission methods of the embodiments shown in fig. 5 and fig. 6 when running. How the processor 1201 is programmed is well known to those skilled in the art and will not be described in detail herein.

Based on the same inventive concept, the present application also provides a storage medium storing computer instructions, which when executed on a computer, cause the computer to execute a data transmission method as discussed above.

In some possible embodiments, aspects of a data transmission method provided herein may also be implemented in the form of a program product including program code for causing a control apparatus to perform the steps of a data transmission method according to various exemplary embodiments of the present application described above in this specification when the program product is run on a device.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A method of data transmission, the method comprising:

2. The method of claim 1, wherein the determining an available enqueue period in a data transmission period in each forwarding node comprises:

3. The method of claim 2, wherein generating a cycle map tag containing available enqueue cycles comprises:

determining J available enqueue cycles after the queue cycle occupied by each forwarding node as priority enqueue cycles, and determining the remaining available enqueue cycles as to-be-selected enqueue cycles, wherein J is an integer greater than or equal to 2;

4. The method of claim 3, wherein generating a cycle map tag containing available enqueue cycles comprises:

determining a dequeuing period of the current service flow at a first forwarding node of the N forwarding nodes;

5. The method of claim 2, wherein prior to obtaining the busy queue period for each forwarding node, further comprising:

and receiving the occupied queue period in the current data transmission period returned by the N forwarding nodes.

6. A method of data processing, the method comprising:

the method comprises the steps that a current forwarding node sends a queue period occupation state request to a downstream forwarding node, wherein the queue period occupation state request is used for indicating the downstream forwarding node to report an occupation queue period;

7. The method of claim 6, wherein after reporting the busy queue period to the controller, the method further comprises:

receiving a service flow sent by a sending end;

8. A data transmission apparatus, characterized in that the apparatus comprises:

a determining module, configured to determine an available enqueue period in a current data transmission period in each forwarding node, where the data transmission period is a period in which the sending end sends data; the available enqueue period is a period in which the current forwarding node can receive data sent by the previous forwarding node;

9. A data processing apparatus, wherein the apparatus is provided in each forwarding node, the apparatus comprising:

and the reporting module is used for reporting the occupation queue period to the controller so that the controller generates a period mapping label according to the occupation queue period.

10. A data transmission system is characterized in that the system comprises forwarding nodes and a controller, wherein the forwarding nodes are positioned between a data sending end and a data receiving end and are sequentially connected, and each forwarding node receives data according to an enqueue period and sends the data according to an dequeue period;

the controller is configured to determine an available enqueue period in a current data transmission period in each forwarding node, where the data transmission period is a period in which the sending end sends data; the available enqueue period is the period that the current forwarding node can receive the data sent by the previous forwarding node;

11. An electronic device, comprising:

a memory for storing a computer program;

a processor for implementing the method steps of any one of claims 1-7 when executing the computer program stored on the memory.

12. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of claims 1 to 7.