CN115734363A - Data scheduling method, system, electronic device and storage medium - Google Patents
Data scheduling method, system, electronic device and storage medium Download PDFInfo
- Publication number
- CN115734363A CN115734363A CN202111014116.7A CN202111014116A CN115734363A CN 115734363 A CN115734363 A CN 115734363A CN 202111014116 A CN202111014116 A CN 202111014116A CN 115734363 A CN115734363 A CN 115734363A
- Authority
- CN
- China
- Prior art keywords
- scheduling
- data packet
- time
- terminal
- generation time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000003860 storage Methods 0.000 title claims abstract description 10
- 238000004590 computer program Methods 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000012544 monitoring process Methods 0.000 claims 1
- 238000004891 communication Methods 0.000 abstract description 3
- 230000005540 biological transmission Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 230000000737 periodic effect Effects 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 238000004904 shortening Methods 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000009849 deactivation Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
- H04W72/1268—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of uplink data flows
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention relates to the field of communication, and discloses a data scheduling method, a data scheduling system, electronic equipment and a storage medium. In the invention, the data scheduling method comprises the following steps: acquiring a predicted generation time interval of a terminal data packet; in the prediction generation time interval, scheduling the terminal data packet according to a scheduling period; wherein the scheduling period meets a preset time precision; obtaining an actual generation time interval of the terminal data packet according to the scheduling success time and the scheduling period; and acquiring the scheduling time of the subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period. The data scheduling method of the invention can shorten the uplink scheduling time delay.
Description
Technical Field
The embodiment of the application relates to the field of communication, in particular to a data scheduling method, a data scheduling system, an electronic device and a storage medium.
Background
At present, the digital conversion of the industry is actively explored in the global and different industries such as energy, industrial manufacturing, ports, transportation and the like. In the data transmission link, the 5G technology is expected to become an important infrastructure for supporting industrial application due to the advantages of special mobility, high bandwidth, low time delay, high reliability, wide connection and the like. However, the vertical industry is very different, the demands for communication networks are also various, and the time delay, reliability, speed, self-service capability and the like are greatly different from the traditional field facing individual users. Especially, smart factory, electric wire netting, trade such as autopilot, to time delay, reliability require extremely high.
However, in the uplink scheduling technology of the 5G base station, a long uplink scheduling delay is required to achieve accurate scheduling.
Disclosure of Invention
The embodiments of the present application mainly aim to provide a data scheduling method, a data scheduling system, an electronic device, and a storage medium, so as to shorten uplink scheduling delay.
In order to achieve the above object, an embodiment of the present application provides a data scheduling method, including: acquiring a predicted generation time interval of a terminal data packet; in the prediction generation time interval, scheduling the terminal data packet according to a scheduling period; wherein the scheduling period meets a preset time precision; obtaining an actual generation time interval of the terminal data packet according to the scheduling success time and the scheduling period; and acquiring the scheduling time of the subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period.
In order to achieve the above object, an embodiment of the present application provides a data scheduling method, including: s1, acquiring a predicted generation time interval of a terminal data packet; s2, scheduling the terminal data packet according to a scheduling period in the prediction generation time interval; s3, obtaining an actual generation time interval of the terminal data packet according to the scheduling success time and the scheduling period; s4, judging whether the scheduling period meets the preset time precision or not; if so, acquiring the scheduling time of a subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period; if not, acquiring the predicted generation time interval of the next terminal data packet according to the actual generation time interval and the data packet generation period, taking the predicted generation time interval of the next terminal data packet as the predicted generation time interval of the terminal data packet, and executing S1 to S4 again.
In order to achieve the above object, an embodiment of the present application further provides a data scheduling system, including: the interval acquisition module is used for acquiring a predicted generation time interval of the terminal data packet; the data scheduling module is used for scheduling the terminal data packet according to a scheduling period in the prediction generation time interval; the interval calculation module is used for obtaining a generation interval of the terminal data packet according to the scheduling success time and the scheduling period; and the scheduling planning module is used for acquiring the scheduling time of the subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period.
In order to achieve the above object, an embodiment of the present application further provides an electronic device, including: at least one processor; a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the data scheduling method described above.
To achieve the above object, an embodiment of the present application further provides a computer-readable storage medium storing a computer program, where the computer program is executed by a processor to implement the above data scheduling method
According to the data scheduling method, trial scheduling is carried out in the predicted generation time interval to obtain the actual generation time interval of successful actual scheduling, the actual generation time interval is obtained according to the scheduling success time and the scheduling period, is smaller than the predicted generation time interval and meets the time precision, namely the actual generation time interval can be regarded as the actual generation time of the terminal data packet, the scheduling time of the subsequent data packet of the terminal is obtained according to the actual generation time interval and the data packet generation period, the time from generation of the data packet to scheduling can be shortened, and therefore uplink scheduling time delay is shortened.
Drawings
Fig. 1 is a schematic flow chart of a data scheduling method according to an embodiment of the present invention;
FIG. 2 is a first diagram illustrating a relationship between a prediction module and a base station according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating a second exemplary relationship between a prediction module and a base station according to an embodiment of the present invention;
FIG. 4 is a schematic diagram illustrating the interface between the prediction module and the scheduling module according to an embodiment of the present invention;
FIG. 5 is a first diagram of packet arrival time prediction provided in accordance with an embodiment of the present invention;
FIG. 6 is a diagram illustrating a second example of packet arrival time prediction according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of a data scheduling system according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present application clearer, the embodiments of the present application will be described in detail below with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that in the examples of the present application, numerous technical details are set forth in order to provide a better understanding of the present application. However, the technical solutions claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments. The following embodiments are divided for convenience of description, and should not constitute any limitation to the specific implementation manner of the present application, and the embodiments may be mutually incorporated and referred to without contradiction.
The embodiment of the invention relates to a data scheduling method, as shown in fig. 1, the method specifically comprises the following steps:
103, obtaining an actual generation time interval of the terminal data packet according to the scheduling success time and the scheduling period;
and step 104, acquiring the scheduling time of the subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period.
The data scheduling method in this embodiment is applied to a base station, for example, a base station of a radio access network such as a 4G base station, a 5G base station, and the like, and specifically, the data scheduling method in this embodiment is used in an uplink scheduling service of the base station, and may be implemented on a board inside the base station. The base station implements uplink scheduling for a data packet generated by the terminal, and usually uses a method of unlicensed scheduling or pre-scheduling, where unlicensed (non-dynamic scheduling) means that the base station activates an uplink grant once for a user terminal, and the user terminal always uses a resource specified by the first uplink grant to perform uplink transmission without receiving deactivation, and in the pre-scheduling method, the base station periodically allocates a resource to the user terminal, and the user terminal performs uplink transmission based on the allocated resource. The data scheduling method of this embodiment may be used in combination with any scheduling method to shorten the uplink scheduling delay.
The method and the device predict the uplink arrival time by issuing the scheduling opportunity and adjusting the scheduling configuration for multiple times in the prediction stage, and particularly predict the generation time of the data packet at the terminal side. If the generation time of the data packet at the terminal side can be accurately predicted, the base station can accurately schedule the uplink data packet, and the time delay from the generation of the uplink data packet at the terminal side to the scheduling of the data packet by the base station is shortened. Which is the most difficult to shorten and solve in the overall end-to-end delay.
According to the data scheduling method, trial scheduling is carried out in the predicted generation time interval to obtain the actual generation time interval of successful actual scheduling, the actual generation time interval is obtained according to the scheduling success time and the scheduling period, is smaller than the predicted generation time interval and meets the time precision, namely the actual generation time interval can be regarded as the actual generation time of the terminal data packet, the scheduling time of the subsequent data packet of the terminal is obtained according to the actual generation time interval and the data packet generation period, the time from generation to scheduling of the data packet can be shortened, and therefore uplink scheduling time delay is shortened.
The following describes implementation details of the data scheduling method of the present embodiment in detail, and the following is only provided for facilitating understanding of the implementation details and is not necessary for implementing the present embodiment.
In step 101, the base station acquires a predicted generation time interval of the terminal packet.
Specifically, the predicted generation time interval is obtained according to the predicted generation time and the arrival error time length of the terminal data packet, the predicted generation time is the difference between the predicted receiving time and the processing time delay of the terminal data packet, and the predicted receiving time and the arrival error time length are obtained according to historical data. In this embodiment, a prediction module may be disposed in the base station or the edge computing node, and connected to a scheduling module in the base station to implement data scheduling, as shown in fig. 2 and fig. 3, the time for the base station to receive a data packet (also referred to as arrival time) is predicted according to the historical time for receiving the data packet of the terminal, and the arrival error duration is calculated, where the arrival error duration may be a standard deviation of the reception time. The processing time delay comprises processing time delay of each layer of the base station and transmission time delay between the prediction module and the base station. The base station needs to judge whether the base station and the prediction module are in clock synchronization, if the base station and the prediction module are not in clock synchronization, the clock difference value of the scheduling module and the prediction module is obtained, and the prediction generation time is updated according to the difference between the prediction generation time and the clock difference value.
In the embodiment, when the predicted generation time interval is calculated, the predicted generation time is calculated according to the predicted generation time and the arrival error duration of the terminal data packet, the predicted generation time is the difference between the predicted receiving time and the processing delay of the terminal data packet, and the predicted receiving time and the arrival error duration are obtained according to historical data, namely, the processing delay is considered when the predicted generation time interval is calculated, so that the error caused by the processing delay can be reduced, the error range of the predicted generation time interval is narrowed, and the accuracy of data scheduling is improved.
In one example, the predicted generation time interval is obtained from an actual generation time interval of a previous terminal packet and a predicted packet generation period. The predicted generation time interval may be the actual generation time interval of the last terminal data packet plus the specific period value of the predicted data packet generation period, or may be an interval formed by the actual generation time interval of the last terminal data packet plus the specific period value of the predicted data packet generation period and the standard deviation of the period value. And after the generation time is acquired in the generation interval, the base station also calibrates the data packet generation period according to the generation time and the generation time of the last terminal data packet.
In this embodiment, the predicted generation time interval is obtained according to the actual generation time interval of the last terminal data packet and the predicted data packet generation period, and the data packet generation period is calibrated according to the generation time and the generation time of the last terminal data packet, so that the error range of the predicted generation time interval of the terminal data packet can be reduced, the error range of the obtained actual generation time interval of the terminal data packet is reduced, the accurate scheduling time of the subsequent data packet of the terminal is obtained, and the time from generation of the data packet to scheduling can be further shortened.
In step 102, the base station schedules the terminal data packet according to a scheduling period in the prediction generation time interval; wherein the scheduling period satisfies a preset time accuracy.
Specifically, the base station starts from the start of the predicted generation time interval, and schedules the terminal data packet once every scheduling period until the terminal data packet is successfully scheduled.
In one example, before step 102, the base station further randomly generates the allowed scheduling times, and divides the predicted generation time interval by the allowed scheduling times to obtain a scheduling period; judging whether the scheduling period meets the time precision or not; if not, adjusting the value of the allowable scheduling times until the scheduling period meets the time precision.
In this embodiment, the scheduling period is controlled to meet the time precision, so that the actual generation time interval of the terminal data packet obtained by calculation meets the time precision, thereby obtaining the accurate scheduling time of the subsequent data packet of the terminal, further shortening the time from the generation of the data packet to the scheduling, and shortening the uplink scheduling delay.
In step 103, the base station obtains an actual generation time interval of the terminal data packet according to the scheduling success time and the scheduling period. Specifically, the base station takes the scheduling success time and the previous scheduling time (i.e., the scheduling success time minus the time point of one scheduling period) as the actual generation time interval of the terminal data packet.
In step 104, the base station obtains the scheduling time of the subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period. Specifically, the data scheduling method of the embodiment of the present application is applied to a service that needs to send data packets periodically in a terminal, so that the base station can add one data packet generation period to an actual generation time interval to obtain the generation time of the next data packet of the terminal, add one data packet generation period to the generation time of the next data packet to obtain the generation time of the next data packet of the terminal, and so on to obtain the generation times of all subsequent data packets of the service of the terminal. In order to minimize the time until the packet is generated to be scheduled, the packet may be scheduled at the packet generation time. The base station may select any one time in the actual generation time interval, for example, a left end point, a right end point, a middle point of the interval, or randomly select any one point as the actual generation time of the terminal data packet.
In one example, the subsequent packet of the terminal is the next packet of the terminal.
In another example, the subsequent data packets of the terminal are all subsequent data packets of the terminal, and after obtaining the scheduling time of the subsequent data packets of the terminal, that is, after step 104, the base station further monitors whether the data packets are successfully scheduled when the scheduling time of the subsequent data packets arrives; and if the data packet cannot be successfully scheduled, the method step from the predicted generation time interval of the data packet of the terminal to the scheduling time of the subsequent data packet of the terminal is executed again, and the scheduling time of the subsequent data packet of the terminal is updated.
In this embodiment, whether the subsequent data packet is successfully scheduled is monitored, and when the scheduling time cannot successfully schedule the data packet, the method is executed again to update the scheduling time of the subsequent data packet of the terminal, so that adjustment and update can be performed when the scheduling time of the data packet is inaccurate, the accuracy of the scheduling time of the subsequent data packet of the terminal is maintained, and the accurate scheduling time of the subsequent data packet of the terminal is ensured to be obtained.
In one example, the scheduling time of the subsequent data packet of the terminal acquired in step 104 may be an unlicensed scheduling time or a pre-scheduled time.
The embodiment of the invention relates to a data scheduling method, which specifically comprises the following steps: s1, acquiring a predicted generation time interval of a terminal data packet; s2, scheduling the terminal data packet according to a scheduling period in the prediction generation time interval; s3, obtaining an actual generation time interval of the terminal data packet according to the scheduling success time and the scheduling period; s4, judging whether the scheduling period meets the preset time precision or not; if yes, acquiring the scheduling time of the subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period; if the predicted time interval does not meet the preset time interval, acquiring the predicted generation time interval of the next terminal data packet according to the actual generation time interval and the data packet generation period, taking the predicted generation time interval of the next terminal data packet as the predicted generation time interval of the terminal data packet, and re-executing S1 to S4.
In one embodiment, the data scheduling method may be implemented by a scheduling module and a prediction module, wherein the scheduling module is located in a base station, and the prediction module may be located in the base station or an edge computing node. In this embodiment, the scheduling time (i.e., the generation time of the data packet) may be calculated through the following steps:
step1: for the periodic service, the prediction module issues a plurality of scheduling opportunities to the scheduling module according to the predicted arrival time of the terminal data packet (the scheduling module in the base station can schedule the terminal according to the arrival time) and the standard deviation of the arrival time, namely, timeOffset, so as to obtain the approximate time period generated by the terminal data packet. Wherein, step1 is divided into 1-1 to 1-4 parts.
The arrival time of a data packet i generated by a terminal predicted by a 1-1 prediction module is t i _ prediction module Obtaining t according to the synchronization mechanism of the prediction module and the scheduling module diff Then the scheduling module schedules the data packet (i.e. the generation time of the data) to be t i ＝t i _ prediction module －t2－t1－t diff . To illustrate, if the prediction module and the scheduling module are clocked synchronously, then t does not need to be calculated diff . t1 is the processing time delay of each layer of the base station,and t2 is the transmission time delay of the prediction module and the base station.
The 1-2 prediction module randomly generates the scheduling times (i.e. the allowed scheduling times) according to the standard deviation of arrival time (timeOffset), and obtains the scheduling interval = timeOffset/scheduling times. The generated scheduling times need to ensure that the interval of two adjacent scheduling times is less than or equal to the time precision, for example, 1ms, and if smaller precision is needed, then multiple iterations are performed.
1-3 scheduling module according to: scheduling time t i Scheduling times and scheduling interval, in t i As a starting point, sequentially obtaining a plurality of scheduling time points for scheduling;
1-4 scheduling module according to time t scheduled to data packet i n And the previous scheduling time t n-1 The generation time of the data packet i is obtained to be between [ t ] n-1 ,t n ]。
Step2, the scheduling module schedules the data packet i on the nth scheduling to the time t of the data packet i n And reporting to a prediction module. Wherein, step2 is divided into 2-1 to 2-2 parts.
2-1 according to the scheduling i of the nth time, the prediction module can obtain the time t of the data packet i based on the clock of the prediction module Prediction module _ n-1 ,t Prediction module _ n ]；
2-2 scheduling to packet i time t n T can be calibrated again i And ti _ prediction module Deviation t of diff (ii) a And at the same time as the reference of the clock of the subsequent scheduling module. The prediction module can also obtain t according to interval of 1-2 n-1 。
Step3: and adjusting the scheduling times according to step2 to obtain accurate time.
The 3-1 prediction module obtains the generation time range [ t ] of the data packet i according to step2 Prediction module _ n-1 ,t Prediction module _ n ]+ predicted period T, resulting in the generation time [ T ] of packet i +1 Prediction module _ n-1 +T,t Prediction module _ n +T]；
The 3-2 prediction module corrects [ T ] according to the standard deviation periodOffset of the prediction period T Prediction module _ n-1 +T,t Prediction module _ n +T]To obtain [ t ] PredictionModule _ n-1 +T－periodOffset,t Prediction module _ n +T+periodOffset]；
3-3 prediction module according to scheduling interval = ((t) Prediction module _ n +T+periodOffset)－(t Prediction module _ n-1 + T-period offset))/the number of schedules, resulting in a plurality of scheduling time points.
3-3-1 if interval<1ms, reducing the scheduling times at intervals of 1ms, and predicting the arrival time t n-1 The + T-period offset, the scheduling times and the scheduling interval are sent to a scheduling module;
3-3-2 otherwise (interval ≧ 1 ms), predicting the arrival time t n-1 The + T-period offset, the scheduling times and the scheduling interval are sent to a scheduling module;
3-4 scheduling module according to: time of arrival t n-1 + T-period offset; and (4) calculating each scheduling time point for scheduling times and scheduling interval for scheduling.
The 3-5 scheduling module schedules the data packet i +1 according to the time point t j And the previous scheduled time t j-1 To obtain the generation time [ t ] of the data packet i +1 j-1 ,t j ]。
Step4, the scheduling module schedules the j-th scheduling to i +1 at the time t of the data packet i +1 j And reporting to a prediction module.
4-1 according to the j scheduling i +1, the prediction module can obtain the generation time [ t ] of the data packet i +1 based on the clock of the prediction module Prediction module _ j-1 ,t Prediction Module _ j ]；
4-2 according to t j And interval in 3-3, the prediction module can get t j-1 。
And Step5, the prediction module adjusts the scheduling times according to Step4 to obtain accurate time.
5-1 according to [ [ t ] Prediction module _ n-1 ,t Prediction module _ n ]And [ t Prediction module _ j-1 ,t Prediction Module _ j ]Calibration period T, i.e. (T) Prediction module _ j-1 －t Prediction module _ n-1 ) And (t) Prediction module _ j －t Prediction module _ n ) The average value of (a) gives the period T.
5-2 predict packet i +2 generation time
5-2-1 if the interval in step3 is obtained according to 3-3-1, the generation time of the data packet i +2 is t j + T, the prediction module will arrive at time T j And + T, sending the period T to the scheduling module, and ending.
5-2-2 otherwise, generating time [ t ] according to the prediction of the data packet i +2 j-1 +T,t j+T ]Jump back to step 3-3, but no longer calibrate with period offset, i.e. consider period offset =0.
The interface transmission content of the prediction module and the scheduling module is shown in fig. 4:
prediction module- > scheduling module: arrival time, scheduling times and scheduling interval;
scheduling module- > prediction module: the time scheduled, the scheduled time (optional) is the number of times scheduled.
If the time deviation is found later, namely the terminal data packet is not scheduled according to the predicted arrival time, the algorithm needs to be started again to correct the deviation.
In one example, the base station utilizes unlicensed scheduling, connects the prediction module and the scheduling module internal to the base station using a base station internal interface, and the prediction and scheduling modules are clock synchronized.
Step1: for the periodic service, the prediction module issues a plurality of authorization-free scheduling opportunities to the scheduling module according to the approximate arrival time of the terminal data packet predicted by the historical data and the standard deviation of the arrival time, namely, timeOffset, so as to obtain the approximate time period generated by the terminal data packet.
1-1 prediction module predicts the time of generating data packet i by terminal as t i _ prediction module If the time for scheduling the data packet by the scheduling module is t i_gNB ＝t i _ prediction module －t2－t1。
The 1-2 prediction module generates 5 times of unlicensed scheduling times (as shown in fig. 5) according to the standard deviation of arrival time (timeOffset), and obtains the scheduling interval = timeOffset/scheduling times 5. The generated scheduling times guarantee that the interval of two adjacent scheduling time intervals is not less than 1ms.
1-3 scheduling module according to: time of arrival t i_gNB Number of unlicensed schedules and unlicensedScheduling interval, at t i_gNB As a starting point, informing the terminal of the authorization-free scheduling configuration;
1-4 scheduling module according to time t scheduled to data packet i 4 And the previous scheduling time t 3 And the generation time of the data packet i is between [ t ] 3 ，t 4 ]。
And Step2, the scheduling module reports the information of the scheduling i in the 4 th time to the prediction module.
2-1 according to the 4 th scheduling i, the prediction module can obtain the time t of the data packet i based on the clock of the prediction module Prediction Module _3 ,t Prediction Module _4 ]；
2-2 prediction Module obtains t 3 ＝t Prediction Module _3 －t2－t1。
Step3: and adjusting the scheduling times according to step2 to obtain accurate time, as shown in fig. 6.
The 3-1 prediction module obtains the generation time range [ t ] of the data packet i according to step2 Prediction Module _3 ,t Prediction module _4 ]+ predicted period T, and obtaining the generation time [ T ] of the data packet i +1 Prediction Module _3 +T,t Prediction module _4 +T]；
3-2 prediction module according to interval = ((t) Prediction module _4 +T)－(t Prediction Module _3 + T))/the number of schedules, resulting in a plurality of scheduled time points.
3-2-1 if interval<1ms, then the number of times of scheduling is reduced by taking 1ms as an interval, and the predicted arrival time t 3 + T; the scheduling times are sent to a scheduling module at a scheduling interval of 1 ms;
if not, the time t is predicted to arrive (the interval ≧ 1 ms) by 3-2-2 3 + T; the scheduling times and the scheduling interval are sent to a scheduling module;
3-3 scheduling module according to: time of arrival t 3 + T; and (4) calculating each scheduling time point for scheduling times and scheduling interval for scheduling.
The 3-4 scheduling module schedules the data packet i +1 according to the time point t j And a previous scheduling time t j-1 To obtain the generation time [ t ] of the data packet i +1 j-1 ,t j ]。
And Step4, the scheduling module reports the i +1 of the jth scheduling to the prediction module.
4-1 according to the j scheduling i +1, the prediction module can obtain the generation time [ t ] of the data packet i +1 based on the clock of the prediction module Prediction module _ j-1 ,t Prediction Module _ j ]；
4-2 prediction Module obtains t j ＝t Prediction module _ j －t2－t1,t j-1 ＝t Prediction module _ j-1 －t2－t1；
And Step5, the prediction module adjusts the scheduling times according to Step4 to obtain accurate time.
5-1 predicting packet i +2 generation time
5-1-1 if the interval in step3 is obtained according to 3-2-1, the generation time of the data packet i +2 is t j + T, the prediction module will arrive at time T j And + T, sending the period T to the scheduling module, and finishing the algorithm.
5-1-2 else, generating time [ t ] according to the prediction of data packet i +2 j-1 +T,t j +T]And the step 3-2 is skipped.
In this embodiment, the prediction module and the scheduling module are both in the base station, and the interface between the prediction module and the scheduling module may be in the form of an internal board private interface.
In one example, the base station uses prescheduling, connects the prediction module and the scheduling module using a standard interface, and the prediction and scheduling modules are not clocked synchronously.
Step1: for periodic service, a plurality of scheduling opportunities are issued to the scheduling module.
1-1 prediction module predicts that the time of a terminal generated data packet i is t i _ prediction module Obtaining t according to the synchronization mechanism of the prediction module and the base station scheduling module diff If the time for scheduling the data packet by the scheduling module is t i ＝t i _ prediction module －t2－t1－t diff 。
The 1-2 prediction module randomly generates the pre-scheduling times according to the standard deviation of arrival time (timeOffset), and obtains the scheduling interval = timeOffset/scheduling times. The generated scheduling times need to ensure that the interval of two adjacent scheduling time intervals is not less than 1ms.
1-3 schedulingThe module is according to: time of arrival t i The pre-scheduling times and the scheduling interval are used for sequentially obtaining a plurality of pre-scheduling time points for scheduling by taking t as a starting point;
1-4 scheduling module according to time t pre-scheduled to data packet i n And the previous scheduling time t n-1 In FIG. 3, the packet i is generated at a time t 3 ，t 4 ]。
Step2, the scheduling module schedules the nth scheduling to the time t of the data packet i n And reporting to the prediction module.
2-1 according to the scheduling i of the nth time, the prediction module can obtain the time t of the data packet i based on the clock of the prediction module Prediction module _ n-1 ,t Prediction module _ n ]；
2-2 scheduling to packet i time t n T can be calibrated again i And t i _ prediction module A deviation of (a); and at the same time as the reference of the clock of the subsequent scheduling module. The prediction module can also obtain t according to the interval of 1-2 n-1 。
Step3: and adjusting the pre-scheduling times according to step2 to obtain accurate time.
The 3-1 prediction module obtains the generation time range [ t ] of the data packet i according to step2 Prediction module _ n-1 ,t Prediction module _ n ]+ predicted period T, resulting in the generation time [ T ] of packet i +1 Prediction module _ n-1 +T,t Prediction module _ n +T]；
The 3-2 prediction module corrects T according to the standard deviation periodOffset of the prediction period T Prediction module _ n-1 +T,t Prediction module _ n +T]To obtain [ t ] Prediction module _ n-1 +T－periodOffset,t Prediction module _ n +T+periodOffset]；
3-3 prediction module according to interval = ((t) Prediction module _ n +T+periodOffset)－(t Prediction module _ n-1 + T-period offset))/the number of schedules, resulting in a plurality of scheduling time points.
3-3-1 if interval<1ms, then the number of times of scheduling is reduced by taking 1ms as an interval, and the predicted arrival time t n-1 + T-period offset; the scheduling times are sent to a scheduling module at a scheduling interval of 1 ms;
if not, the time t is predicted to arrive (the interval ≧ 1 ms) by 3-3-2 n-1 + T-period offset; the scheduling times and the scheduling interval are sent to a scheduling module;
3-4 scheduling module according to: time of arrival t n-1 + T-period offset; and (4) calculating each scheduling time point for scheduling times and scheduling interval for scheduling.
3-5 scheduling module according to the time point t scheduled to the data packet i +1 j And the previous scheduled time t j-1 To obtain the generation time [ t ] of the data packet i +1 j-1 ,t j ]。
Step4, the scheduling module schedules the j-th scheduling to i +1 at the time t of the data packet i +1 j And reporting to a prediction module.
4-1 according to the j scheduling i +1, the prediction module can obtain the generation time [ t ] of the data packet i +1 based on the clock of the prediction module Prediction module _ j-1 ,t Prediction module _ j ]；
4-2 according to t j And interval in 3-3, the prediction module can get t j-1
And Step5, the prediction module adjusts the scheduling times according to Step4 to obtain accurate time.
5-1 according to [ [ t ] Prediction module _ n-1 ,t Prediction module _ n ]And [ t Prediction module _ j-1 ,t Prediction Module _ j ]Calibration period T, i.e. (T) Prediction module _ j-1 －t Prediction module _ n-1 ) And (t) Prediction Module _ j －t Prediction module _ n ) The average value of (a) gives the period T.
5-2 predicting packet i +2 generation time
5-2-1 if the interval in step3 is obtained according to 3-3-1, the generation time of the data packet i +2 is t j + T, the prediction module will arrive at time T j And + T, sending the period T to the scheduling module, and ending.
5-2-2 else, generate time [ t ] according to the prediction of packet i +2 j-1 +T,t j +T]And jumping back to the step 3-3.
In this embodiment, the scheduling module is in the base station and the prediction module is in the edge computing network element, and the interface between the scheduling module and the prediction module may be in the form of a standard E2 interface.
The embodiment of the present invention also relates to a data scheduling method, as shown in fig. 7, the system includes:
an interval obtaining module 701, configured to obtain a predicted generation time interval of the terminal data packet;
a data scheduling module 702, configured to schedule the terminal data packet according to a scheduling period in the predicted generation time interval;
the interval calculation module 703 is configured to obtain a generation interval of the terminal data packet according to the scheduling success time and the scheduling period;
and the scheduling planning module 704 is configured to obtain scheduling time of a subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period.
In one example, the predicted generation time interval is obtained according to the predicted generation time and the arrival error time length of the terminal data packet, the predicted generation time is the difference between the predicted receiving time and the processing time delay of the terminal data packet, and the predicted receiving time and the arrival error time length are obtained according to the prediction of historical data; the system further comprises: a data prediction module for predicting a predicted reception time; the interval obtaining module is further used for judging whether the data scheduling module and the data prediction module are in clock synchronization, if not, obtaining a clock difference value of the data scheduling module and the data prediction module, and updating the prediction generation time according to the difference between the prediction generation time and the clock difference value.
In one example, the predicted generation time interval is obtained according to the actual generation time interval of the last terminal data packet and the predicted data packet generation period; and after the generation time is acquired in the generation interval, the data scheduling module is further used for calibrating the data packet generation period according to the generation time and the generation time of the last terminal data packet.
In one example, in the prediction generation time interval, before scheduling the terminal data packet according to the scheduling period, the scheduling module is further configured to randomly generate the number of allowed scheduling times, and divide the prediction generation time interval by the number of allowed scheduling times to obtain the scheduling period; judging whether the scheduling period meets the time precision; if not, adjusting the value of the allowable scheduling times until the scheduling period meets the time precision.
In one example, after the scheduling time of the subsequent data packet of the terminal is obtained, the system also monitors whether the data packet is successfully scheduled when the scheduling time of the subsequent data packet arrives; if the data packet cannot be successfully scheduled, the method steps from the predicted generation time interval of the terminal data packet to the scheduling time of the subsequent data packet of the terminal are executed again, and the scheduling time of the subsequent data packet of the terminal is updated.
In one example, the predicted generation time interval is obtained according to the predicted generation time and the arrival error time length of the terminal data packet, the predicted generation time is the difference between the predicted receiving time and the processing delay of the terminal data packet, and the predicted receiving time and the arrival error time length are obtained according to historical data.
In one example, scheduling time includes: an unlicensed scheduling time or a pre-scheduled time.
Embodiments of the present invention also relate to an electronic device, as shown in fig. 8, including: at least one processor 801; a memory 802 communicatively coupled to the at least one processor; the memory 802 stores instructions executable by the at least one processor 801, and the instructions are executed by the at least one processor 801 to perform any of the method embodiments described above.
The memory 802 and the processor 801 are coupled by a bus, which may include any number of interconnecting buses and bridges that couple one or more of the various circuits of the processor 801 and the memory 802 together. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. Information processed by the processor 801 may be transmitted over a wireless medium through an antenna, which may receive information and transmit information to the processor 801.
The processor 801 is responsible for managing the bus and general processing and may also provide various functions including timing, peripheral interfaces, voltage regulation, power management, and other control functions. While the memory 802 may be used to store information used by the processor in performing operations.
Embodiments of the present invention relate to a computer-readable storage medium storing a computer program. The computer program realizes the above-described method embodiments when executed by a processor.
That is, as can be understood by those skilled in the art, all or part of the steps in the method according to the above embodiments may be implemented by a program instructing related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps in the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk, and various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples of practicing the invention, and that various changes in form and detail may be made therein without departing from the spirit and scope of the invention in practice.
Claims (11)
1. A method for scheduling data, comprising:
acquiring a predicted generation time interval of a terminal data packet;
in the prediction generation time interval, scheduling the terminal data packet according to a scheduling period; wherein the scheduling period meets a preset time precision;
obtaining an actual generation time interval of the terminal data packet according to the scheduling success time and the scheduling period;
and acquiring the scheduling time of the subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period.
2. The data scheduling method according to claim 1, wherein the predicted generation time interval is obtained from an actual generation time interval of a previous terminal data packet and the predicted generation period of the data packet;
after acquiring the generation time in the generation interval, the method further includes:
and calibrating the data packet generation period according to the generation time and the generation time of the last terminal data packet.
3. The data scheduling method of claim 1, wherein before the scheduling the terminal data packet according to the scheduling period, the method further comprises:
randomly generating the allowed scheduling times, and dividing the predicted generation time interval by the allowed scheduling times to obtain the scheduling period;
judging whether the scheduling period meets the time precision;
if not, adjusting the value of the allowed scheduling times until the scheduling period meets the time precision.
4. The data scheduling method according to claim 1, wherein after the obtaining of the scheduling time of the subsequent data packet of the terminal, the method further comprises:
monitoring whether the data packet is successfully scheduled when the scheduling time of the subsequent data packet arrives;
and if the data packet cannot be successfully scheduled, executing the method steps from the predicted generation time interval of the data packet of the acquired terminal to the scheduling time of the subsequent data packet of the acquired terminal again, and updating the scheduling time of the subsequent data packet of the terminal.
5. The data scheduling method of claim 1, wherein the predicted generation time interval is obtained according to a predicted generation time and an arrival error duration of the terminal data packet, the predicted generation time is a difference between a predicted reception time and a processing delay of the terminal data packet, and the predicted reception time and the arrival error duration are obtained according to historical data.
6. The data scheduling method according to any one of claims 1 to 5, wherein the scheduling time comprises: an unlicensed schedule time or a pre-schedule time.
7. A method for scheduling data, comprising:
s1, acquiring a predicted generation time interval of a terminal data packet;
s2, scheduling the terminal data packet according to a scheduling period in the prediction generation time interval;
s3, obtaining an actual generation time interval of the terminal data packet according to the scheduling success time and the scheduling period;
s4, judging whether the scheduling period meets preset time precision or not;
if so, acquiring the scheduling time of a subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period;
and if the actual generation time interval does not meet the preset generation time interval, acquiring the predicted generation time interval of the next terminal data packet according to the actual generation time interval and the data packet generation period, taking the predicted generation time interval of the next terminal data packet as the predicted generation time interval of the terminal data packet, and re-executing S1 to S4.
8. A data scheduling system, comprising:
the interval acquisition module is used for acquiring a predicted generation time interval of the terminal data packet;
the data scheduling module is used for scheduling the terminal data packet according to a scheduling period in the prediction generation time interval;
the interval calculation module is used for obtaining a generation interval of the terminal data packet according to the scheduling success time and the scheduling period;
and the scheduling planning module is used for acquiring the scheduling time of the subsequent data packet of the terminal according to the actual generation time interval and the data packet generation period.
9. The data scheduling system of claim 8, wherein the predicted generation time interval is obtained according to a predicted generation time and an arrival error duration of the terminal data packet, the predicted generation time is a difference between a predicted reception time and a processing delay of the terminal data packet, and the predicted reception time and the arrival error duration are predicted according to historical data;
the system further comprises: a data prediction module to predict the predicted receive time;
the interval obtaining module is further configured to determine whether the data scheduling module and the data prediction module are in clock synchronization, and if not, obtain a clock difference between the data scheduling module and the data prediction module, and update the prediction generation time with a difference between the prediction generation time and the clock difference.
10. An electronic device, comprising:
at least one processor;
a memory communicatively coupled to the at least one processor;
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a data scheduling method according to any one of claims 1 to 6 or a data scheduling method according to claim 7.
11. A computer-readable storage medium, storing a computer program, wherein the computer program, when executed by a processor, implements the data scheduling method of any one of claims 1 to 6, or the data scheduling method of claim 7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111014116.7A CN115734363A (en) | 2021-08-31 | 2021-08-31 | Data scheduling method, system, electronic device and storage medium |
| PCT/CN2022/105843 WO2023029773A1 (en) | 2021-08-31 | 2022-07-14 | Data scheduling method and system, electronic device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111014116.7A CN115734363A (en) | 2021-08-31 | 2021-08-31 | Data scheduling method, system, electronic device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115734363A true CN115734363A (en) | 2023-03-03 |
Family
ID=85292158
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111014116.7A Pending CN115734363A (en) | 2021-08-31 | 2021-08-31 | Data scheduling method, system, electronic device and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN115734363A (en) |
| WO (1) | WO2023029773A1 (en) |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102932920B (en) * | 2011-08-10 | 2017-05-10 | 中兴通讯股份有限公司 | Radio resource scheduling request (SR) configuration method and device |
| CN103944835B (en) * | 2013-01-18 | 2018-02-13 | 中兴通讯股份有限公司 | A kind of method and apparatus that scheduling is realized during Ping |
| CN106304377B (en) * | 2015-06-04 | 2019-12-13 | 电信科学技术研究院 | Method and equipment for scheduling |
| CN105722122A (en) * | 2016-04-18 | 2016-06-29 | 京信通信技术(广州)有限公司 | Method and device for optimizing user plane time delay |
| US20170317938A1 (en) * | 2016-05-02 | 2017-11-02 | Qualcomm Incorporated | Determination of a data transmission schedule |
| CN110958681B (en) * | 2018-09-27 | 2023-09-05 | 中兴通讯股份有限公司 | Service transmission method and device |
| CN111867073B (en) * | 2019-04-30 | 2023-09-19 | 中国移动通信有限公司研究院 | Time information processing method, timing advance determining method and related equipment |
-
2021
- 2021-08-31 CN CN202111014116.7A patent/CN115734363A/en active Pending
-
2022
- 2022-07-14 WO PCT/CN2022/105843 patent/WO2023029773A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2023029773A1 (en) | 2023-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11917572B2 (en) | Transmission delay indication method and device | |
| US10064213B2 (en) | Method and network node for pre-scheduling grant transmission | |
| CN111479228A (en) | UWB positioning system, tag position determination method and device | |
| CN110958681A (en) | Service transmission method and device | |
| US9445433B2 (en) | Wireless communication apparatus for lower latency communication | |
| WO2016177090A1 (en) | Clock synchronization method and device | |
| US20120327829A1 (en) | Method and System for Allocating Bandwidth for Data Transmissions Between High-Speed Wireless Devices | |
| US20080123619A1 (en) | Apparatus, method, and computer readable medium thereof for dividing a beacon interval | |
| US11856511B2 (en) | Connected vehicle bandwidth-based network selection | |
| CN115734363A (en) | Data scheduling method, system, electronic device and storage medium | |
| CN112187557A (en) | Measurement reporting method and network node | |
| US20180035315A1 (en) | Wireless communication between an access network and a terminal in range of a plurality of base stations of half-duplex type of said access network | |
| CN113711158A (en) | Time synchronization system, master control device, slave device, and program | |
| CN114501644A (en) | Time domain resource configuration method and device, electronic equipment and storage medium | |
| CN111884751A (en) | Smart grid time synchronization method and device based on PTP | |
| EP2930617A1 (en) | Resource management method and device | |
| CN106788881B (en) | Dispatching method, device and the base station of nonessential system message | |
| CN115988543A (en) | Unmanned aerial vehicle number energy calculation joint resource allocation method based on digital twinning | |
| JP2008263323A (en) | Communication synchronizing method and communication terminal | |
| WO2021079618A1 (en) | Method for synchronizing specific node connected to plurality of other node | |
| KR101862249B1 (en) | Networlk device and terminal device, control method thereof | |
| CN111050406A (en) | Method, device, storage medium and network equipment for transmitting system information | |
| CN113647178A (en) | Method and system for wireless TDMA scheduling including propagation delay aware scheduling for industrial machine-to-machine communication | |
| CN112166570A (en) | Wireless communication device, system and method of decoding data packets to establish latency critical services | |
| CN115567153B (en) | Signal receiving method, signal sending method, device and equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |