Data transmission method and device, equipment, storage medium and program product

Abstract

The invention discloses a data transmission method and device, equipment, a storage medium and a program product, and the method comprises the steps: obtaining first information which indicates the waiting scheduling time delay of a first data packet of a to-be-transmitted service; second information is acquired, the second information indicates target time delay and / or target time delay jitter of the first data packet, and the target time delay jitter indicates an absolute value of a time delay difference of two adjacent first data packets tolerable by the to-be-transmitted service; and performing scheduling transmission on the first data packet based on the waiting scheduling time delay, the target time delay and / or the target time delay jitter.

Description

Technical Field

[0001] The present application relates to, but is not limited to, the field of wireless communication technology, and in particular to a data transmission method, apparatus, device, storage medium, and computer program product. Background Art

[0002] In the wireless field, facing the high energy consumption challenge of network-side devices, in the time domain, related technologies have proposed using delay scheduling to aggregate dispersed services into a single symbol for scheduling, in order to increase the proportion of idle symbols during data transmission. However, in these related technologies, delay scheduling is determined based on the maximum schedulable delay of data packets on the network side as the target delay. This results in large errors in the target delay during data transmission centered on the wireless side, resulting in inaccurate packet aggregation and a negative impact on the service experience. Summary of the Invention

[0003] The present application provides a data transmission method, apparatus, device, storage medium and program product.

[0004] The technical solution of the embodiment of the present application is implemented as follows:

[0005] A data transmission method, the method comprising:

[0006] Acquire first information, where the first information indicates a waiting scheduling delay of a first data packet of a service to be transmitted;

[0007] Acquire second information, where the second information indicates a target delay and / or a target delay jitter of the first data packet, where the target delay jitter indicates an absolute value of a delay difference between two adjacent first data packets that is tolerable for the service to be transmitted;

[0008] The first data packet is scheduled for transmission based on the waited scheduling delay, the target delay and / or the target delay jitter.

[0009] In the above solution, the method further includes:

[0010] Acquire third information, where the third information indicates a delay of a second data packet of the service to be transmitted, where the second data packet is an adjacent data packet transmitted before the first data packet;

[0011] determining a delay threshold based on the third information, the target delay and / or the target delay jitter, where the delay threshold is smaller than the target delay, and / or an absolute value of a difference between the delay threshold and the third information is smaller than the target delay jitter;

[0012] The first data packet is scheduled for transmission based on the waiting scheduling delay and the delay threshold.

[0013] In the above solution, the target delay indication is a difference obtained by subtracting the delay of the first data packet from the core network to the base station from the maximum delay of the first data packet from the core network to the terminal.

[0014] In the above solution, the target delay jitter indicates a difference obtained by subtracting the delay jitter of the first data packet from the core network to the base station from the maximum delay jitter of the first data packet from the core network to the terminal.

[0015] In the above solution, the target delay indication is the difference obtained by subtracting the delay of the first data packet from the core network to the base station and the air interface transmission delay from the maximum delay of the first data packet from the core network to the terminal.

[0016] In the above scheme, the target delay jitter indication is the difference obtained by subtracting the delay jitter of the first data packet from the core network to the base station and the air interface transmission delay jitter from the maximum delay jitter of the first data packet from the core network to the terminal.

[0017] In the above solution, scheduling transmission of the first data packet based on the waiting scheduling delay and the delay threshold includes:

[0018] When the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold, the first data packet is sent to the terminal.

[0019] In the above solution, when the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold, sending the first data packet to the terminal includes:

[0020] When the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold, generating a second scheduling factor based on the maximum value of the delay threshold, the waiting scheduling delay, and the first scheduling factor of the first data packet;

[0021] The first data packet is sent to the terminal based on the second scheduling factor.

[0022] In the above solution, the method further includes:

[0023] When one or more of the following conditions are met, the data packets of the to-be-transmitted service are aggregated into one symbol for scheduling to obtain the first data packet:

[0024] A utilization rate of a physical resource block of a downlink physical channel within a monitoring period is higher than a first threshold;

[0025] The number of connected users or connected users in the cell during the monitoring period is higher than a second threshold;

[0026] The average utilization rate of the physical resource blocks of the downlink physical channel in each time slot, each subframe, or each fixed time duration within the monitoring time is higher than a third threshold.

[0027] In the above solution, the method further includes:

[0028] When one or more of the following conditions are met, it is prohibited to aggregate the data packets of the service to be transmitted into one symbol for scheduling:

[0029] The utilization rate of the physical resource blocks of the downlink physical channel within the monitoring time is lower than a fourth threshold;

[0030] During the multiple delay scheduling processes, no other service data units arrive on the downlink physical channel;

[0031] The average number of idle symbols additionally added through delayed scheduling in each time slot, each subframe, or each fixed time length during the monitoring time is less than a fifth threshold.

[0032] In the above solution, obtaining the second information includes:

[0033] Obtaining the second information based on the service level agreement parameters of the contracted slice service; or

[0034] The second information is obtained based on the quality of service parameter.

[0035] The present invention further provides a data transmission device, comprising:

[0036] an acquiring unit, configured to acquire first information, where the first information indicates a waiting scheduling delay of a first data packet of a service to be transmitted;

[0037] The acquiring unit is further configured to acquire second information, where the second information indicates a target delay and / or target delay jitter of the first data packet, and the target delay jitter indicates an absolute value of a delay difference between two adjacent first data packets that is tolerable for the service to be transmitted;

[0038] A processing unit is configured to schedule transmission of the first data packet based on the waiting scheduling delay, the target delay and / or the target delay jitter.

[0039] The embodiment of the present application further provides a data transmission device, comprising: a processor and a memory for storing a computer program that can be run on the processor; wherein,

[0040] The processor is configured to execute the steps of the aforementioned data transmission method when running the computer program.

[0041] An embodiment of the present application further provides a storage medium having a computer program stored thereon, wherein the computer program implements the steps of the aforementioned data transmission method when executed by a processor.

[0042] An embodiment of the present application further provides a computer program product, including a computer program, which can be executed by a processor of an electronic device to complete the steps of the aforementioned data transmission method.

[0043] The embodiments of the present application provide a data transmission method, apparatus, device, storage medium and program product, wherein the method includes: obtaining first information, the first information indicating the waiting scheduling delay of the first data packet of the service to be transmitted; obtaining second information, the second information indicating the target delay and / or target delay jitter of the first data packet, the target delay jitter indicating the absolute value of the delay difference between two adjacent first data packets that the service to be transmitted can tolerate; scheduling the transmission of the first data packet based on the waiting scheduling delay, target delay and / or target delay jitter. That is, the present application makes a judgment on delay scheduling based on the target delay and / or target delay jitter, which solves the problem in the related art of making a judgment on delay scheduling based on the maximum schedulable delay of the data packet on the network side as the target delay, so that in the data transmission process with the wireless side as the core, there is a large target delay error, which leads to the inability to accurately accumulate packets and affects the service experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 Schematic diagram of data transmission using sub-frame silence in related art;

[0045] Figure 2 Schematic diagram of data transmission using sub-frame silence enhanced by packet aggregation scheduling in the related art;

[0046] Figure 3 This is a flow chart of a data transmission method according to an embodiment of the present application;

[0047] Figure 4 This is a flowchart of an optimal method for determining delayed scheduling in the actual scenario of this application;

[0048] Figure 5 This is a schematic diagram of a function distribution curve of a priority scheduling coefficient in the actual scenario of this application;

[0049] Figure 6 This is a structural diagram of a data transmission device according to an embodiment of the present application;

[0050] Figure 7 This is a structural diagram of a data transmission device according to an embodiment of the present application. DETAILED DESCRIPTION

[0051] The present application will be described in further detail below with reference to the accompanying drawings and embodiments.

[0052] In order to cope with the high energy consumption challenge of 5G base stations, the wireless field has proposed a number of energy-saving technologies in the time domain, frequency domain, spatial domain and power domain. Among them, in the time domain, sub-frame silence is used in related technologies to save energy. Figure 1 As shown, in the time domain resources, when the service is transmitted, the service load will fluctuate. During the monitoring period, such as 5 milliseconds (ms), when the base station detects that some downlink subframes / subframes (downlink symbols) have data to send, the radio frequency channel is started for normal data transmission. When the base station detects that some downlink subframes / subframes (downlink symbols) have no data to send, the radio frequency hardware such as the power amplifier is turned off to reduce static power consumption. In the subframe silence enhancement technology, the related technology introduces delay scheduling, also known as packet scheduling, refer to Figure 2 As shown, the scattered downlink services are concentrated into one symbol for scheduling. Specifically, some downlink subframes are closed and the service data to be transmitted are concentrated into a certain subframe for transmission to increase the proportion of idle symbols.

[0053] However, after the introduction of sub-frame silence enhancement technology, in order to concentrate the scattered services into one symbol for scheduling, some services need to be delayed in scheduling, which will have a certain impact on service delay. In addition, when sub-frame silence and sub-frame silence enhancement technology are applied in existing networks, they are usually required to be turned on at all times. Even in the case of very low business volume, that is, data packets are relatively sparse and almost no other data arrives during the packet aggregation process, packet aggregation scheduling will be carried out, resulting in increased service delay and limited energy-saving benefits.

[0054] For guaranteed bit rate (GBR) services defined in the 5G Quality of Service Indicator (5QI), such as services with a 5QI variable value of 82 to 90, the related art does not centrally schedule these delay-sensitive services, while the remaining services can be centrally scheduled to reduce service delay. Furthermore, the related art identifies the target delay of the service packet by slicing and decomposing the GPRS Tunnelling Protocol for the user plane (GTP-U) packet header at the user layer, and performs time slot aggregation and symbol shutdown differently based on whether the service reaches near the target delay value.

[0055] However, although the relevant technology considers differentiating services according to delay requirements and performing differentiated centralized scheduling for differentiated services, it usually judges whether the scheduling waiting delay has reached the maximum schedulable delay on the network side. There is a problem that the judgment of the timing of delayed scheduling is not accurate enough, the error is large, and accurate packet aggregation cannot be achieved.

[0056] Based on this, this application provides a data transmission method, referring to Figure 3 As shown, the method includes the following steps:

[0057] Step 101: Obtain first information.

[0058] In actual application, the first information indicates the waiting scheduling delay of the first data packet of the service to be transmitted.

[0059] In actual application, when scheduling transmission, the waiting scheduling delay of the first data packet of the service to be transmitted is obtained. The first data packet is the data packet to be transmitted.

[0060] Step 102: Obtain second information.

[0061] In actual application, the second information indicates the target delay and / or target delay jitter of the first data packet.

[0062] In actual application, the target delay is the delay when the service to be transmitted is scheduled for transmission. It can be understood that in one case, when the waiting scheduling delay of the first data packet of the service to be transmitted is about to reach the target delay, the first data packet is scheduled for transmission.

[0063] In practical applications, the target delay jitter indicates the absolute value of the delay difference between two adjacent first data packets that can be tolerated by the service to be transmitted. Delay jitter represents the variation in the transmission delay between two adjacent data packets in the network, which affects the quality of data transmission. Understandably, the greater the delay jitter, the lower the quality of data transmission. When scheduling data packets for transmission, the difference between the delays of two adjacent first data packets that can be tolerated by the service to be transmitted is calculated and the absolute value of this difference is taken. This results in the change in the transmission delay between the current data packet and the previous data packet of the service to be transmitted in the network, thereby obtaining the target delay jitter for the service to be transmitted.

[0064] Step 103: Schedule transmission of the first data packet based on the waiting scheduling delay, the target delay and / or the target delay jitter.

[0065] In actual application, after obtaining the waiting scheduling delay of the first data packet of the service to be transmitted, it is determined whether the waiting scheduling delay of the first data packet meets the delay requirement of the scheduled transmission based on the target delay and / or delay jitter. If so, the first data packet is scheduled for transmission.

[0066] In actual application, the network device on the wireless side schedules transmission of the first data packet based on the waiting scheduling delay, the target delay and / or the target delay jitter. The wireless side is a radio access network, and the corresponding network devices may include a base station (BS) / next generation node B (gNB), an access point (AP), a new radio (NR), etc., depending on the actual application technology.

[0067] In actual application, the waiting scheduling delay can be calculated by comparing the timestamp corresponding to the waiting time after the service data unit (SDU) under the Radio Link Control (RLC) arrives at the RLC buffer with the timestamp corresponding to the actual scheduling time.

[0068] A data transmission method provided by an embodiment of the present application includes: obtaining first information, the first information indicating the waiting scheduling delay of the first data packet of the service to be transmitted; obtaining second information, the second information indicating the target delay and / or target delay jitter of the first data packet, the target delay jitter indicating the absolute value of the delay difference between two adjacent first data packets that the service to be transmitted can tolerate; scheduling the transmission of the first data packet based on the waiting scheduling delay, target delay and / or target delay jitter. That is, the present application makes a judgment based on the target delay and / or target delay jitter for scheduling, which solves the problem in the related art of making a judgment based on the maximum schedulable delay of the data packet on the network side as the target delay for scheduling, so that in the data transmission process with the wireless side as the core, there is a large target delay error, which leads to the problem that the packet cannot be accurately accumulated and the service experience is affected.

[0069] In one embodiment, in step 103, the first data packet is scheduled for transmission based on the waiting scheduling delay, the target delay, and / or the delay jitter. The method further includes:

[0070] Acquire third information, where the third information indicates a delay of a second data packet of the service to be transmitted, where the second data packet is an adjacent data packet transmitted before the first data packet;

[0071] Determining a delay threshold based on the third information, the target delay and / or the target delay jitter, where the delay threshold is less than the target delay, and / or an absolute value of a difference between the delay threshold and the third information is less than the delay jitter;

[0072] The first data packet is scheduled for transmission based on the waiting scheduling delay and the delay threshold.

[0073] In actual application, the third information indicates the delay of the second data packet of the service to be transmitted. After obtaining the delay of the second data packet, the absolute value of the difference in the tolerable delays of the two adjacent data packets is calculated based on the delay of the second data packet and the delay of the first data packet, thereby obtaining the delay jitter value of the first data packet.

[0074] In actual application, the delay threshold is the range of values ​​of the waitable scheduling delay of the first data packet. It can be understood that the delay threshold includes the maximum value and minimum value of the waitable scheduling delay of the first data packet. For example, after the waited scheduling delay of the first data packet indicated by the obtained first information falls within the range of the delay threshold, if it is determined that the waited scheduling delay is greater than the minimum value of the waitable scheduling delay and is about to reach the maximum value of the waitable scheduling delay, it indicates that the waited scheduling delay of the first data packet meets the delay requirement for scheduled transmission at this time, and the first data packet can be scheduled for transmission.

[0075] In actual application, when scheduling the transmission of the first data packet based on the waited scheduling delay, target delay and / or delay jitter, after obtaining the waited scheduling delay of the first data packet of the service to be transmitted, the delay of the adjacent data packet transmitted before the first data packet of the service to be transmitted, that is, the delay of the aforementioned second data packet, is further obtained. The target delay jitter of the first data packet is calculated based on the delay of the second data packet, and the aforementioned delay threshold is determined based on the target delay of the first data packet and / or the target delay jitter of the first data packet.

[0076] In actual application, the delay threshold should meet the following requirements: the delay threshold is less than the target delay, and / or the absolute value of the difference between the delay threshold and the third information is less than the target delay jitter. Specifically, the following formula can be used for calculation:

[0077] Dwait <Dran (1)

[0078] |Dwait - Dpre|< Djitter (2)

[0079] Among them, D wait The waiting scheduling delay of the first data packet is in milliseconds.

[0080] D ran The target delay for the first data packet is in milliseconds.

[0081] D pre The delay of the adjacent data packets transmitted before the first data packet corresponding to the second data packet, in milliseconds / ms;

[0082] D jitter The target delay jitter of the first data packet, in milliseconds.

[0083] Furthermore, the range of the waiting scheduling delay is calculated by combining formula (1) and formula (2), thereby obtaining the delay threshold of the first data packet, as shown in formula (3):

[0084] max{Dpre-Djitter, 0} <Dwait <min{Dran,Dpre+Djitter} (3)

[0085] Among them, D wait The waiting scheduling delay of the first data packet is in milliseconds.

[0086] max{D pre -D jitter , 0} is the minimum value of the waiting scheduling delay of the first data packet, in milliseconds / ms;

[0087] min{D ran , D pre +D jitter} is the maximum delay that can be waited for scheduling of the first data packet, in milliseconds / ms;

[0088] It can be understood that the delay threshold of the first data packet is greater than max{D pre –D jitter , 0}, and less than min{D ran , D pre +D jitter} is the range of values ​​for the waiting scheduling delay between .

[0089] In an embodiment of the present application, by obtaining the transmission delay of the adjacent previous data packet, the target delay jitter of the data packet to be transmitted is calculated and obtained, and based on the target delay and target delay jitter of the data packet to be transmitted, the timing of scheduling is comprehensively judged, thereby reducing the judgment error of scheduling and improving the accuracy of scheduling.

[0090] In one embodiment, the target delay indicates a difference obtained by subtracting a delay of the first data packet from the core network to the base station from a maximum delay of the first data packet from the core network to the terminal.

[0091] In practical applications, the term "User Experience" (UE) may also be referred to as a user's device or terminal device. Terminal devices include, but are not limited to, mobile phones, cellular phones, smartphones, tablets, wearable devices, personal digital assistants (PDAs), portable computers, gaming devices, music storage and playback devices, wearable devices, and in-vehicle wireless devices.

[0092] In practical applications, the data transmission delay of a mobile network includes network-side delay and wireless-side delay. The first data packet is transmitted from the core network side to the base station side, and then from the base station side to the terminal. After obtaining the maximum delay of the first data packet from the core network to the terminal, it is necessary to subtract the delay of the first data packet from the core network to the base station, that is, the network-side delay. The difference is the wireless-side delay from the base station to the terminal, which can be calculated using formula (4):

[0093] Dran=Dmax –Dcn (4)

[0094] Among them, D ran The target delay for the first data packet is in milliseconds.

[0095] D max The maximum delay of the first data packet from the core network to the terminal, in milliseconds.

[0096] D cn It is the delay of the first data packet from the core network to the base station, also known as the network side delay, in milliseconds.

[0097] In actual application, in an actual situation, when the maximum delay of the first data packet from the core network to the terminal and the delay of the first data packet from the core network to the base station are obtained, the above-mentioned delay threshold can be calculated by combining the above-mentioned formulas (1), (2) and (4).

[0098] In the embodiment of the present application, the wireless side delay obtained after subtracting the network side delay is used as the target delay, and scheduling is performed based on the target delay, thereby avoiding the influence of the delay between the core network and the base station on the scheduling of the network side equipment and increasing the accuracy of the scheduling.

[0099] In one embodiment, the target delay jitter indicator is a difference obtained by subtracting the delay jitter of the first data packet from the core network to the base station from the maximum delay jitter of the first data packet from the core network to the terminal.

[0100] In actual applications, the data transmission delay of the mobile network includes network-side delay jitter and wireless-side delay jitter. The first data packet is transmitted from the core network side to the base station side, and then from the base station side to the terminal. After obtaining the maximum delay jitter of the first data packet from the core network to the terminal, it is necessary to subtract the delay jitter of the first data packet from the core network to the base station, that is, the network-side delay jitter. The difference is the wireless-side delay jitter from the base station to the terminal, which can be calculated using formula (5):

[0101] Djitter_ran = Djitter_max – Djitter_cn (5)

[0102] Among them, D jitter_ranThe target delay jitter of the first data packet, in milliseconds.

[0103] D jitter_max The maximum delay jitter of the first data packet from the core network to the terminal, in milliseconds.

[0104] D jitter_cn It is the delay jitter of the first data packet from the core network to the base station, also known as the network-side delay jitter, measured in milliseconds.

[0105] In actual application, in an actual situation, after obtaining the maximum delay jitter of the first data packet from the core network to the terminal and the delay jitter of the first data packet from the core network to the base station, the above-mentioned delay threshold can be calculated by combining the above-mentioned formulas (1), (2), (4) and (5).

[0106] In the embodiment of the present application, the wireless side delay jitter obtained after subtracting the network side delay jitter is used as the target delay jitter, and scheduling is performed based on the target delay jitter, thereby avoiding the impact of the delay jitter between the core network and the base station on the scheduling of the network side equipment and increasing the accuracy of the scheduling.

[0107] In one embodiment, the target delay indicates a difference obtained by subtracting the delay of the first data packet from the core network to the base station and the air interface transmission delay from the maximum delay of the first data packet from the core network to the terminal.

[0108] In practice, data transmission delay in mobile networks also includes air interface transmission delay, also known as air interface delay. Air interface transmission delay is the data transmission delay between wireless network equipment and terminals.

[0109] In actual application, after obtaining the maximum delay of the first data packet from the core network to the terminal, it is necessary to subtract the delay of the first data packet from the core network to the base station, that is, the network side delay, and subtract the air interface transmission delay. The difference is the wireless side delay from the base station to the terminal, which can be calculated according to formula (6):

[0110] Dran=Dmax–Dcn-D Uu (6)

[0111] Among them, D ran The target delay for the first data packet, in milliseconds.

[0112] D max The maximum delay of the first data packet from the core network to the terminal, in milliseconds.

[0113] D cn The delay of the first data packet from the core network to the base station, also known as the network side delay, in milliseconds.

[0114] D Uu The air interface transmission delay of the first data packet, in milliseconds.

[0115] In actual application, in an actual situation, after obtaining the maximum delay of the first data packet from the core network to the terminal, the delay of the first data packet from the core network to the base station, and the air interface transmission delay of the first data packet, the above-mentioned delay threshold can be calculated by combining the above-mentioned formulas (1), (2), and (6).

[0116] In actual application, the air interface transmission delay can be calculated by recording the first N historical data packets of the service to be transmitted or the air interface transmission delay D within a period of time. Uu (i.e., half of the time from the time the data packet is sent from the network device to the time the acknowledgment character (ACK) fed back by the terminal is received), or it can be obtained by predicting the current air interface transmission delay based on the current channel quality indicator (Channel Quality Indicator, CQI) of the service to be transmitted, the reference signal received power (Reference Signal Received Power, RSRP), the timing advance (Timing Advance, TA) and / or historical air interface transmission delay data.

[0117] In the embodiment of the present application, the wireless side delay obtained by subtracting the network side delay and the air interface transmission delay is used as the target delay, and scheduling is performed based on the target delay, thereby avoiding the impact of the delay between the core network and the base station, and between the base station and the terminal on the scheduling of the network side equipment, and further increasing the accuracy of the scheduling.

[0118] In one embodiment, the delay jitter indication is a difference obtained by subtracting the delay jitter of the first data packet from the core network to the base station and the air interface transmission delay jitter from the maximum delay jitter of the first data packet from the core network to the terminal.

[0119] In actual applications, the data transmission delay jitter of the mobile network can also include the air interface transmission delay jitter. The air interface transmission delay jitter represents the delay jitter that exists during the data transmission process due to the influence of the air interface transmission delay. In actual applications, the first data packet is transmitted from the core network side to the base station side, and then from the base station side to the terminal. After obtaining the maximum delay jitter of the first data packet from the core network to the terminal, it is necessary to subtract the delay jitter of the first data packet from the core network to the base station, that is, the network side delay jitter, and subtract the air interface transmission delay jitter. The difference obtained is the wireless side delay jitter from the base station to the terminal, which can be specifically calculated using formula (7):

[0120] Djitter_ran = Djitter_max – Djitter_cn-Djitter_ Uu (7)

[0121] Among them, D jitter_ran The target delay jitter of the first data packet, in milliseconds.

[0122] D jitter_max The maximum delay jitter of the first data packet from the core network to the terminal, in milliseconds.

[0123] D jitter_cn The delay jitter of the first data packet from the core network to the base station, also known as the network-side delay jitter, is expressed in milliseconds.

[0124] D jitter_Uu The air interface transmission delay jitter of the first data packet, in milliseconds.

[0125] In actual application, in an actual situation, after obtaining the maximum delay jitter of the first data packet from the core network to the terminal, the delay jitter of the first data packet from the core network to the base station, and the air interface transmission delay jitter of the first data packet, the above-mentioned delay threshold can be calculated by combining the above-mentioned formulas (1), (2), (4), and (7).

[0126] In the embodiment of the present application, the wireless side delay jitter obtained by subtracting the network side delay jitter and the air interface transmission delay jitter is used as the target delay jitter, and scheduling is performed based on the target delay jitter, thereby avoiding the impact of the delay jitter between the core network and the base station, and the delay jitter between the base station and the terminal on the scheduling of the network side equipment, and further increasing the accuracy of the scheduling.

[0127] In one embodiment, scheduling transmission of the first data packet based on the waiting scheduling delay and the delay threshold includes:

[0128] When the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold, a first data packet is sent to the terminal.

[0129] In actual application, the minimum value of the delay threshold indicates the minimum delay of delayed scheduling, which can be understood as the earliest time when delayed scheduling can be performed; the maximum value of the delay threshold indicates the maximum delay of delayed scheduling, that is, the maximum waitable scheduling delay, which can be understood as the latest time when delayed scheduling can be performed.

[0130] When the waiting scheduling delay of the first data packet falls within the corresponding delay threshold range and is greater than the minimum value of the delay threshold, it means that the waiting scheduling time of the first data packet has reached the earliest time when delay scheduling can be performed. However, in actual situations, the first data packet will not be delayed scheduled at the first time due to network, data packet size and other reasons. Therefore, based on the delay threshold, when the waiting scheduling delay of the first data packet is greater than the minimum value of the delay threshold, it is further determined whether the waiting scheduling delay is about to reach the maximum waiting scheduling delay. When the waiting scheduling time of the first data packet is about to reach the maximum waiting scheduling delay, that is, the latest time when delay scheduling can be performed, the first data packet is prioritized for delay scheduling and sent to the terminal, thereby ensuring the integrity of data transmission.

[0131] In one embodiment, when the waiting scheduling delay is greater than a minimum value of the delay threshold and is about to reach a maximum value of the delay threshold, sending a first data packet to the terminal includes:

[0132] When the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold, generating a second scheduling factor based on the maximum value of the delay threshold, the waiting scheduling delay, and the first scheduling factor of the first data packet;

[0133] A first data packet is sent to the terminal based on the second scheduling factor.

[0134] In actual application, the first scheduling factor indicates the traditional scheduling priority factor, and the second scheduling factor is a real-time adjusted scheduling priority factor obtained based on the real-time calculated delay threshold when the waiting scheduling delay of the first data packet is about to reach the maximum value of the delay threshold. The delay scheduling priority factor of the first data packet can be calculated and updated in real time using formula (8) or (9):

[0135]

[0136]

[0137] Among them, PF ds The priority factor for delay scheduling of the first data packet, in milliseconds;

[0138] PF s It is the priority factor of traditional scheduling, in milliseconds.

[0139] D (wait-max) The maximum waiting scheduling delay for the first data packet, in milliseconds.

[0140] D wait The waiting scheduling delay of the first data packet is in milliseconds.

[0141] In actual application, when it is determined that the waiting scheduling delay of the first data packet is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold, that is, the waiting scheduling time of the first data packet is about to reach the latest time for delayed scheduling, the scheduling priority of the first data packet is increased and it is scheduled first.

[0142] The embodiment of the present application obtains the maximum waiting scheduling delay of the first data packet and the waiting scheduling delay of the first data packet in real time, dynamically calculates and updates the scheduling priority of the data packet, improves the efficiency of service transmission, and ensures the timeliness and integrity of data transmission.

[0143] In one embodiment, the method further comprises:

[0144] When one or more of the following conditions are met, data packets of the service to be transmitted are aggregated into one symbol for scheduling to obtain a first data packet:

[0145] A utilization rate of a physical resource block of a downlink physical channel within a monitoring period is higher than a first threshold;

[0146] The number of connected users or connected users in the cell during the monitoring period is higher than a second threshold;

[0147] The average utilization rate of the physical resource blocks of the downlink physical channel in each time slot, each subframe, or each fixed time duration within the monitoring time is higher than a third threshold.

[0148] In practical applications, the first threshold value includes a minimum value within a first range of utilization of a physical resource block of a downlink physical channel. When the utilization of a physical resource block of a downlink physical channel monitored during the monitoring period is higher than the minimum value within the first range but lower than the maximum value within the first range, it indicates that the utilization of the physical resource block is at a medium level at the current time. In this case, timely consolidating data packets of the transmission service into one symbol for delay scheduling can achieve higher energy savings.

[0149] In actual application, the second threshold includes the minimum value in the second range of the number of user connections or the number of connected users in the cell. The connected users are users who have been connected to the wireless side access device. When the number of users or connected users in the cell where the network device is located monitored during the monitoring time is higher than the minimum value in the second range and lower than the maximum value in the second range, it indicates that there are many users who need to transmit services at the current time and the amount of services to be transmitted is large. At this time, the data packets of the transmission services are promptly concentrated into one symbol for delay scheduling, which can make full use of the delay scheduling of data packets to achieve significant energy saving.

[0150] In actual application, the third threshold includes the minimum value of the third range of the average utilization rate of the physical resource blocks of the downlink physical channel in each time slot or each subframe or each fixed time length. When the average utilization rate of the physical resource blocks of the downlink physical channel in each time slot or each subframe or each fixed time length monitored during the monitoring time is higher than the minimum value of the third range and lower than the maximum value of the third range, it indicates that the average utilization rate of each time slot or each subframe or each fixed time length physical resource block is high at the current time. At this time, the data packets of the transmission service are promptly concentrated into one symbol for delayed scheduling, which can more finely evaluate the cell load condition and obtain higher energy-saving benefits.

[0151] In the embodiment of the present application, when there is a certain amount of business, delay scheduling judgment and centralized scheduling of data packets are performed to ensure the integrity of data transmission.

[0152] In one embodiment, the method further comprises:

[0153] When one or more of the following conditions are met, it is prohibited to aggregate data packets of services to be transmitted into one symbol for scheduling:

[0154] The utilization rate of the physical resource blocks of the downlink physical channel within the monitoring time is lower than a fourth threshold;

[0155] During the multiple delay scheduling process, no other service data units arrive on the downlink physical channel;

[0156] The average number of idle symbols additionally added through delayed scheduling in each time slot, each subframe, or each fixed time length during the monitoring time is less than a fifth threshold.

[0157] In actual application, the fourth threshold includes the minimum value of the fourth range of the utilization rate of the physical resource block of the downlink physical channel. The minimum value of the fourth range can be the same as the minimum value in the first range. When the utilization rate of the physical resource block is monitored to be lower than the minimum value of the fourth range during the monitoring time, it indicates that the utilization rate of the physical resource block is low at the current time, or it is monitored that there are almost no other service data units arriving in the downlink physical channel during multiple delayed scheduling processes, and the data packets are relatively sparse. At this time, it is prohibited to concentrate the data packets of the service to be transmitted into one symbol for scheduling, so as to avoid adding additional delay while having low energy-saving benefits.

[0158] In actual application, the fifth threshold includes the minimum value of the fifth range of the utilization rate of the physical resource block of the downlink physical channel. The minimum value of the fifth range can be the same as the minimum value of the third range. When the average utilization rate of the physical resource block of the downlink physical channel in each time slot or each subframe or each fixed time length is monitored to be lower than the minimum value of the fifth range during the monitoring time, it indicates that the average utilization rate of each time slot or each subframe or each fixed time length physical resource block at the current time is low. At this time, it is prohibited to concentrate the data packets of the service to be transmitted into one symbol for scheduling, so as to avoid adding additional delay while reducing energy saving benefits.

[0159] In an embodiment of the present application, when the network transmission traffic volume is low, delay scheduling is flexibly performed or delayed scheduling is prohibited according to the transmission traffic volume, thereby avoiding the additional delay caused by delay scheduling when the network transmission traffic volume is low, thereby achieving both energy saving and performance.

[0160] In one embodiment, obtaining the second information includes:

[0161] Obtaining second information based on service level agreement parameters of the contracted slice service; or

[0162] Based on the quality of service parameter, second information is obtained.

[0163] In actual application, a delay jitter indicator is added to the service level agreement parameters and service quality parameters of the contracted slice service, and is defined as the absolute value of the delay difference between two adjacent data packets that can be tolerated by the data transmission service.

[0164] In actual application, the maximum delay and / or maximum delay jitter of the first data packet is obtained based on the service level agreement parameters (Service Level Agreement, SLA) of the contracted slice service. A delay jitter indicator is added to the parameter, and the maximum delay jitter is obtained therefrom. Exemplarily, the maximum waitable scheduling delay and delay jitter parameters of the service can be obtained based on the association between the service level agreement parameters of the 5G slice and the identifier of the network slice to which the service belongs (Network Slice Selection Assistance Information, NSSAI). Exemplarily, based on the auxiliary identifier of the network slice selection auxiliary information, the service level agreement parameters of the 5G slice corresponding to the auxiliary identifier are selected.

[0165] In practice, the maximum waitable scheduling delay, also known as the maximum delay or the maximum scheduling delay, reflects the maximum tolerable delay for the service being transmitted. Maximum delay jitter, also known as the maximum delay jitter or the maximum scheduling delay jitter, reflects the maximum tolerable delay jitter for the service being transmitted. When the actual delay of a transmitted service exceeds the maximum delay and / or maximum delay jitter, data transmission delays occur, impacting the service experience.

[0166] In actual application, the maximum delay and / or maximum delay jitter of the first data packet is obtained based on the service quality parameter. A delay jitter indicator is added to the parameter, and the maximum delay jitter is obtained therefrom. For example, the maximum waitable scheduling delay and delay jitter parameters can be obtained based on the packet delay budget parameter (PDB) of the 5G service quality identifier (5G QoS Identifier, 5QI), where the PDB is the maximum delay between the core network and the terminal, and the corresponding maximum delay jitter is obtained according to the added maximum delay jitter indicator.

[0167] In an embodiment of the present application, a delay jitter indicator is added to the service quality parameters and the service level agreement parameters based on the contracted slice service, and is defined as the absolute value of the delay difference between two adjacent data packets that can be tolerated by the transmission service, so as to assist the packet aggregation scheduling in making scheduling decisions for delay scheduling, avoid affecting the service experience, and make up for the deficiency of the existing slice SLA parameters and 5QI parameters that do not have a delay jitter indicator.

[0168] The data transmission method proposed in this application performs centralized scheduling operations of delay scheduling when there is a certain amount of business volume, and accurately aggregates packets based on the target delay and target delay jitter, thereby improving the accuracy of delay scheduling; when the business volume is low or the energy-saving benefits are low, the number of centralized scheduling operations of delay scheduling is flexibly limited, thereby reducing the delay of data transmission and achieving energy saving.

[0169] The present application is described in further detail below with reference to application examples.

[0170] In a practical scenario, packet aggregation scheduling technology is used for data transmission, referring to Figure 4 As shown in the figure, an optimal judgment method for delay scheduling is proposed, which is described as follows:

[0171] S401: Obtain the current waiting scheduling delay.

[0172] According to a timestamp of the scheduling time when each RLC SDU arrives at the RLC buffer, the waiting time of the RLC SDU is calculated, thereby obtaining the current waiting scheduling delay of the service data to be transmitted.

[0173] S402: Obtain the maximum delay and maximum delay jitter.

[0174] The maximum delay and maximum delay jitter of the service are obtained by associating the slice's SLA parameters with the NSSAI, or directly through the 5QI parameters. Referring to Table 1, the maximum delay is obtained based on the association between the slice's SLA parameters and the NSSAI, and the maximum delay jitter is obtained based on the newly added delay jitter indicator in the slice's SLA parameters. The maximum delay and delay jitter are obtained through the transmission delay information of the data packets of the transmission service in the core network (CN), radio access network (RAN), and transmission network (TN) of the 5G network.

[0175]

[0176] Table 1 SLA parameters based on 5G slicing

[0177] As shown in Table 2, the maximum delay of the data packet of the service to be transmitted is obtained according to the PDB parameter table of 5QI, and the maximum delay jitter is obtained from the delay jitter indicator newly added in the PDB parameter.

[0178]

[0179] Table 2 PDB parameters

[0180] S403: Calculate the wireless side target delay.

[0181] Combined with Table 1 or Table 2, the maximum delay Dpre of the previous data packet of the data packet to be transmitted, the maximum delay jitter Djitter of the data packet to be transmitted, and the maximum waitable scheduling delay Dwait of the data packet to be transmitted are obtained. The maximum waitable scheduling delay Dwait must be less than the wireless side target delay Dran, and the absolute value of the difference between the maximum waitable scheduling delay Dwait and the delay Dpre of the previous data packet must be less than the maximum delay jitter Djitter. Combined with the above formulas (1) and (2), the value range of the target delay Dran from the core network to the terminal is calculated.

[0182] In the embodiment of the present application, since the obtained PDB is the core network delay between the user plane function (UPF) of the 5G core network and the terminal, that is, the network side delay, it is necessary to obtain the wireless side delay by subtracting the core network delay CN_PDB, thereby obtaining the target delay D for packet aggregation scheduling. ran, accordingly, if the delay jitter obtained is the wireless side delay jitter, the wireless side delay jitter can be directly used to calculate the wireless side target delay; if the delay jitter obtained is the PDB jitter, that is, the maximum delay jitter between the UPF and the terminal (using D jitter_max It is necessary to subtract the delay difference D between the current data packet and the previous data packet from UPF to the base station. jitter_cn , combined with the above formula (1), formula (2), formula (4) and formula (5), the value range of the wireless side target delay Dran from the wireless access network to the terminal is [max{D pre -D jitter_max -D jitter_cn ,0},min{D ran , D pre +D jitter_max -D jitter_cn}]

[0183] Furthermore, if the air interface transmission delay cannot be ignored, if the delay jitter obtained is the wireless side delay jitter, the wireless side delay jitter can be directly used to calculate the wireless side target delay; if the delay jitter obtained is the maximum schedulable delay corresponding to the core network delay and the air interface transmission delay D Uu When the sum of the two packets is obtained, it is necessary to subtract the delay difference Djitter-cn between the current data packet and the previous data packet from the UPF to the base station and subtract the air interface transmission delay D Uu , combined with the above formula (1), formula (2), formula (4), formula (5) and formula (6), the value range of the wireless side target delay Dran from the wireless access network to the terminal is [max{Dpre-Djitter_max-Djitter_cn-D Uu ,0},min{Dran,Dpre+Djitter_max-Djitter_c-n}-D Uu ].

[0184] In an embodiment of the present application, the method of obtaining the target delay on the wireless side based on the SLA parameters of the 5G slice is similar to the method of obtaining the target delay on the wireless side using the 5QI parameters, and will not be repeated here.

[0185] S404: Determine whether the current waiting scheduling delay is about to reach the maximum value of the target delay.

[0186] The minimum value of the wireless-side target delay range for the data packet is the minimum schedulable delay, and the maximum value of the wireless-side target delay range is the maximum schedulable delay. If the current schedulable delay for the data packet is greater than the minimum schedulable delay, a further determination is made as to whether the current schedulable delay is about to reach the maximum schedulable delay to optimize the delay scheduling. If so, the process proceeds to step S405.

[0187] In the process of packet aggregation scheduling, the embodiment of the present application determines the maximum waiting scheduling delay and the minimum waiting scheduling delay for delay scheduling based on the wireless side target delay and wireless side delay jitter of the service, thereby achieving accurate judgment of delay scheduling and ensuring the timeliness and accuracy of scheduling; in addition, in the embodiment of the present application, by comprehensively considering the transmission delay from the core network to the base station and the air interface transmission delay, the accurate wireless side target delay and the corresponding delay jitter are determined, so that the target delay and delay jitter are more accurate, and thus the judgment of the delay conditions is more accurate when performing delay scheduling, thereby achieving accurate packet aggregation.

[0188] S405: Calculate and update the scheduling priority, and make the optimal decision on delayed scheduling.

[0189] If the current waiting scheduling delay is about to reach the maximum waiting scheduling delay, it indicates that the data packet is about to reach the latest time for delay scheduling. At this time, the scheduling priority of the data packet of the service is adjusted in time, and the data packet is scheduled first to avoid data anomalies. Specifically, the priority factor of the delay scheduling of the data packet can be calculated and updated in real time using the number of formulas (8) or (9). When using formula (8) for calculation, the priority scheduling coefficient The function distribution curve can be referred to Figure 5 shown.

[0190] S406: Perform package aggregation scheduling.

[0191] When a data packet is about to reach the latest time for delay scheduling, the base station calculates the priority of the data packet and sends multiple data packets together to the terminal in order of priority, thereby performing delay scheduling based on packet accumulation.

[0192] Among them, when the network transmission traffic is large, the packet aggregation function is flexibly enabled to centrally schedule data packets; the basis for enabling the packet aggregation function includes: the downlink PRB utilization rate or the number of connected users under the Radio Resource Control (RRC) protocol within the monitoring time T is higher than a certain threshold; or in each time slot (slot) or each subframe or every 5 milliseconds (ms), it is determined that the downlink PRB utilization rate in the current period is higher than a certain threshold.

[0193] Among them, when the network transmission traffic volume is low, the energy-saving gains that can be obtained by packet aggregation scheduling are limited. At this time, the flexible shutdown mechanism of the sub-frame silence enhancement function can be set to turn off the packet aggregation function to reduce the impact on the service experience. The basis for judging the shutdown of the packet aggregation function includes: the downlink PRB utilization rate is lower than a certain threshold within the monitoring time T; no other RLC SDUs arrive during the N packet aggregation processes; the average number of idle symbols added by packet aggregation scheduling per time slot (slot) or per subframe or per 5ms within the monitoring time T is less than a certain threshold. The number of idle symbols added by packet aggregation scheduling can be calculated by subtracting the number of symbols turned off according to sub-frame silence from the number of symbols turned off by packet aggregation scheduling.

[0194] This avoids the extra energy consumption caused by enabling the packet accumulation function when the network transmission traffic is low, thereby achieving energy saving. That is, in the embodiment of the present application, when the network transmission traffic is low and the energy saving gain available is limited, the packet accumulation function is flexibly disabled, thereby ensuring the maximum energy saving gain.

[0195] An optimal judgment method for delay scheduling proposed in an embodiment of the present application flexibly enables the packet aggregation scheduling function when there is a certain business volume, and accurately aggregates packets based on business delay and delay jitter, thereby improving the accuracy of delay scheduling and the integrity of data transmission; when the business volume is low or the energy-saving benefit is low, the packet aggregation function is flexibly turned off, reducing the data transmission delay while improving the energy-saving effect and ensuring the maximization of energy-saving gains.

[0196] In order to implement the data transmission method of the embodiment of the present application, the embodiment of the present application also provides a data transmission device, referring to Figure 6 As shown, the data transmission device 600 includes: an acquisition unit 601 and a processing unit 602; wherein,

[0197] An acquiring unit 601 is configured to acquire first information, where the first information indicates a waiting scheduling delay of a first data packet of a service to be transmitted;

[0198] The acquiring unit 601 is further configured to acquire second information, where the second information indicates a target delay and / or target delay jitter of the first data packet, where the target delay jitter indicates an absolute value of a delay difference between two adjacent first data packets that is tolerable for the service to be transmitted;

[0199] The processing unit 602 is configured to schedule transmission of a first data packet based on the waiting scheduling delay, the target delay and / or the target delay jitter.

[0200] in,

[0201] In one embodiment, the acquiring unit 601 is specifically configured to: acquire third information, where the third information indicates a delay of a second data packet of a service to be transmitted, where the second data packet is an adjacent data packet transmitted before the first data packet;

[0202] In one embodiment, the processing unit 602 is specifically configured to: determine a delay threshold based on the third information, the target delay, and / or the target delay jitter, where the delay threshold is less than the target delay, and / or an absolute value of a difference between the delay threshold and the third information is less than the target delay jitter;

[0203] In one embodiment, the processing unit 602 is specifically configured to schedule transmission of the first data packet based on the waiting scheduling delay and the delay threshold.

[0204] In one embodiment, the acquisition unit 601 is specifically used to: obtain a target delay, where the target delay indicates a difference obtained by subtracting the delay of the first data packet from the core network to the base station from the maximum delay of the first data packet from the core network to the terminal.

[0205] In one embodiment, the acquisition unit 601 is specifically used to: obtain a target delay jitter, where the target delay jitter indicates a difference obtained by subtracting the delay jitter of the first data packet from the core network to the base station from the maximum delay jitter of the first data packet from the core network to the terminal.

[0206] In one embodiment, the acquisition unit 601 is specifically used to: obtain a target delay, where the target delay indicates a difference obtained by subtracting the delay of the first data packet from the core network to the base station and the air interface transmission delay from the maximum delay of the first data packet from the core network to the terminal.

[0207] In one embodiment, the acquisition unit 601 is specifically used to: obtain a target delay jitter, where the target delay jitter indicates a difference obtained by subtracting the delay jitter of the first data packet from the core network to the base station and the air interface transmission delay jitter from the maximum delay jitter of the first data packet from the core network to the terminal.

[0208] In one embodiment, the processing unit 602 is specifically used to schedule the transmission of the first data packet based on the waiting scheduling delay and the delay threshold, including: sending the first data packet to the terminal when the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold.

[0209] In one embodiment, the processing unit 602 is specifically used to: send a first data packet to the terminal when the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold, including: generating a second scheduling factor based on the maximum value of the delay threshold, the waiting scheduling delay and the first scheduling factor of the first data packet when the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold; and sending the first data packet to the terminal based on the second scheduling factor.

[0210] In one embodiment, the processing unit 602 is specifically configured to: concentrate data packets of a service to be transmitted into one symbol for scheduling to obtain a first data packet when one or more of the following conditions are met: a utilization rate of a physical resource block of a downlink physical channel during a monitoring period is higher than a first threshold; the number of user connections or the number of connected users in a cell during a monitoring period is higher than a second threshold; and an average utilization rate of a physical resource block of a downlink physical channel per time slot, per subframe, or per fixed duration during a monitoring period is higher than a third threshold.

[0211] In one embodiment, the processing unit 602 is specifically used to prohibit concentrating data packets of the service to be transmitted into one symbol for scheduling when one or more of the following conditions are met: the utilization rate of the physical resource blocks of the downlink physical channel within the monitoring time is lower than the fourth threshold; no other service data units arrive on the downlink physical channel during multiple delayed scheduling processes; the average number of idle symbols additionally added through delayed scheduling in each time slot or each subframe or each fixed time length within the monitoring time is less than the fifth threshold.

[0212] In one embodiment, the acquisition unit 601 is specifically used to: obtain the second information, including: obtaining the second information based on the service level agreement parameters of the contracted slice service; or, obtaining the second information based on the service quality parameters.

[0213] For the description of the same steps and contents in this embodiment as those in other embodiments, reference can be made to the descriptions in other embodiments and will not be repeated here.

[0214] In order to implement the data transmission method of the embodiment of the present application, the embodiment of the present application also provides a data transmission device, referring to Figure 7 As shown, the data transmission device 700 includes: a processor 701, a memory 702, and a communication bus 703; wherein,

[0215] Processor 701, configured to execute the method provided by one or more of the above technical solutions when running a computer program;

[0216] Memory 702 , storing computer programs that can be run on processor 701 ;

[0217] The communication bus 703 is used to implement communication between the processor 701 and the memory 702 .

[0218] It should be noted that the specific processing process of the processor 701 can be understood by referring to the above method and will not be repeated here.

[0219] Of course, in actual application, the various components in the data transmission device 700 are coupled together via the communication bus 703. It is understood that the communication bus 703 is used to achieve connection and communication between these components. In addition to the data bus, the communication bus 703 also includes a power bus, a control bus, and a status signal bus. However, for the sake of clarity, Figure 7 Various buses are labeled as communication buses 703.

[0220] The memory 702 in the embodiment of the present application is used to store various types of data to support the operation of the data transmission device 700. Examples of such data include: any computer program used to operate on the data transmission device 700.

[0221] The methods disclosed in the above embodiments of the present application can be applied to or implemented by processor 701. Processor 701 may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method can be completed by hardware integrated logic circuits in processor 701 or instructions in software form. Processor 701 can be a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Processor 701 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 the methods disclosed in the embodiments of the present application can be directly implemented as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium located in memory 702. Processor 701 reads the information in memory 702 and, in conjunction with its hardware, completes the steps of the above method.

[0222] In an exemplary embodiment, the data transmission device 700 can be implemented by one or more application-specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), complex programmable logic devices (CPLDs), field-programmable gate arrays (FPGAs), general-purpose processors, controllers, microcontrollers (MCUs), microprocessors, or other electronic components to perform the aforementioned method.

[0223] It is understood that the memory (memory 702) of the embodiment of the present application can be a volatile memory or a non-volatile memory, and can also include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic random access memory (FRAM), a flash memory, a magnetic surface memory, an optical disc, or a compact disc read-only memory (CD-ROM); the magnetic surface memory can be a magnetic disk memory or a tape memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), Sync Link Dynamic Random Access Memory (SLDRAM), and Direct Rambus Random Access Memory (DRRAM).The memories described in the embodiments of this application are intended to include, but are not limited to, these and any other suitable types of memories.

[0224] In an exemplary embodiment, the present application also provides a storage medium, namely, a computer storage medium, specifically, a computer-readable storage medium, including, for example, a memory 702 storing a computer program. The computer program in the memory 702 can be executed by the processor 701 of the data transmission device 700 to complete the steps of the aforementioned method. The computer-readable storage medium can be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface storage, optical disk, or CD-ROM.

[0225] In an exemplary embodiment, the present application also provides a computer program product, including a computer program. The computer program can be executed by the processor 701 of the data transmission device 700 to complete the steps of the above method of the above data transmission device.

[0226] It should be noted that: "first", "second", etc. are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0227] In addition, the technical solutions described in the embodiments of the present application can be arbitrarily combined without conflict.

[0228] The above description is merely a preferred embodiment of the present application and is not intended to limit the scope of protection of the present application.

Claims

1. A data transmission method, characterized in that: The method comprises: Acquire first information, where the first information indicates a waiting scheduling delay of a first data packet of a service to be transmitted; Acquire second information, where the second information indicates a target delay and / or a target delay jitter of the first data packet, where the target delay jitter indicates an absolute value of a delay difference between two adjacent first data packets that is tolerable for the service to be transmitted; The first data packet is scheduled for transmission based on the waited scheduling delay, the target delay and / or the target delay jitter.

2. The method according to claim 1, characterized in that The method further comprises: Acquire third information, where the third information indicates a delay of a second data packet of the service to be transmitted, where the second data packet is an adjacent data packet transmitted before the first data packet; determining a delay threshold based on the third information, the target delay and / or the target delay jitter, where the delay threshold is smaller than the target delay, and / or an absolute value of a difference between the delay threshold and the third information is smaller than the target delay jitter; The first data packet is scheduled for transmission based on the waiting scheduling delay and the delay threshold.

3. The method according to claim 2, characterized in that The target delay indication is a difference obtained by subtracting the delay of the first data packet from the core network to the base station from the maximum delay of the first data packet from the core network to the terminal.

4. The method according to claim 3, characterized in that The target delay jitter indication is a difference obtained by subtracting the delay jitter of the first data packet from the core network to the base station from the maximum delay jitter of the first data packet from the core network to the terminal.

5. The method according to claim 2, characterized in that The target delay indication is a difference obtained by subtracting the delay of the first data packet from the core network to the base station and the air interface transmission delay from the maximum delay of the first data packet from the core network to the terminal.

6. The method according to claim 5, characterized in that The target delay jitter indicates a difference obtained by subtracting the delay jitter of the first data packet from the core network to the base station and the air interface transmission delay jitter from the maximum delay jitter of the first data packet from the core network to the terminal.

7. The method according to claim 2, characterized in that The scheduling transmission of the first data packet based on the waiting scheduling delay and the delay threshold includes: When the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold, the first data packet is sent to the terminal.

8. The method according to claim 7, characterized in that The sending the first data packet to the terminal when the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold includes: When the waiting scheduling delay is greater than the minimum value of the delay threshold and is about to reach the maximum value of the delay threshold, generating a second scheduling factor based on the maximum value of the delay threshold, the waiting scheduling delay, and the first scheduling factor of the first data packet; The first data packet is sent to the terminal based on the second scheduling factor.

9. The method according to claim 1, characterized in that The method further comprises: When one or more of the following conditions are met, the data packets of the to-be-transmitted service are aggregated into one symbol for scheduling to obtain the first data packet: A utilization rate of a physical resource block of a downlink physical channel within a monitoring period is higher than a first threshold; The number of connected users or connected users in the cell during the monitoring period is higher than a second threshold; The average utilization rate of the physical resource blocks of the downlink physical channel in each time slot, each subframe, or each fixed time duration within the monitoring time is higher than a third threshold.

10. The method according to claim 1, characterized in that The method further comprises: When one or more of the following conditions are met, it is prohibited to aggregate the data packets of the service to be transmitted into one symbol for scheduling: The utilization rate of the physical resource blocks of the downlink physical channel within the monitoring time is lower than a fourth threshold; During the multiple delay scheduling processes, no other service data units arrive on the downlink physical channel; The average number of idle symbols additionally added through delayed scheduling in each time slot, each subframe, or each fixed time length during the monitoring time is less than a fifth threshold.

11. The method according to claim 1, wherein The obtaining of the second information includes: The second information is obtained based on the service level agreement parameters of the contracted slice service; or, the second information is obtained based on the service quality parameters.

12. A data transmission device, characterized in that: The data transmission device includes: an acquiring unit, configured to acquire first information, where the first information indicates a waiting scheduling delay of a first data packet of a service to be transmitted; The acquiring unit is further configured to acquire second information, where the second information indicates a target delay and / or target delay jitter of the first data packet, and the target delay jitter indicates an absolute value of a delay difference between two adjacent first data packets that is tolerable for the service to be transmitted; A processing unit is configured to schedule transmission of the first data packet based on the waiting scheduling delay, the target delay and / or the target delay jitter.

13. A data transmission device, characterized in that: include: A processor and a memory for storing a computer program capable of running on the processor; wherein, The processor is configured to execute the steps of the data transmission method according to any one of claims 1 to 11 when running the computer program.

14. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the data transmission method according to any one of claims 1 to 11 are implemented.

15. A computer product comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the data transmission method according to any one of claims 1 to 11 are implemented.

Images