Resource scheduling method and device and storage medium

Abstract

A resource scheduling method and device, and a storage medium, relate to the technical field of communication, and are used to solve the problem of how to reasonably schedule resources in a complex scenario. The method comprises the following steps: first, a target data volume, a cache waiting time and a cache waiting number corresponding to a target terminal are acquired. The target data volume is the data volume of the data that can be cached by a target cache queue corresponding to the target terminal, the cache waiting time is the waiting time from the time when the historical uplink data sent by the target terminal arrives at the target cache queue to the transmission time within a preset historical time period, and the cache waiting number is the waiting number of the target terminal within the preset historical time period. Then, a scheduling priority parameter corresponding to the target terminal is determined according to the target data volume, a preset data volume threshold, the cache waiting time, the cache waiting number and a service priority level corresponding to the target terminal. Subsequently, resources are scheduled for the target terminal based on the scheduling priority parameter.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, and particularly relates to a resource scheduling method and device and storage medium. BACKGROUND

[0002] With the development of wireless communication technology, a base station can perform resource scheduling for multiple terminals through massive multiple-input multiple-output (MIMO) antenna technology.

[0003] Currently, the resource scheduling methods used in communication systems mainly apply round robin (RR), maximum C / I and proportional fair algorithms. However, the above algorithms are only applicable to simple scenarios, such as a cell with a small number of terminals and a single service type, and how to reasonably schedule resources in a complex scenario is a problem that needs to be solved at present. SUMMARY

[0004] The present application provides a resource scheduling method, device and storage medium, which are used to solve the problem of how to reasonably schedule resources in a complex scenario.

[0005] To achieve the above object, the present application adopts the following technical solutions:

[0006] In a first aspect, a resource scheduling method is provided, which includes: first, a target data amount, a cache waiting time and a cache waiting number corresponding to a target terminal can be obtained. The target data amount is the data amount of the data that can be cached by a target cache queue corresponding to the target terminal, the cache waiting time is the waiting time from the time when the historical uplink data sent by the target terminal reaches the target cache queue to the transmission time within a preset historical time period, and the cache waiting number is the waiting number of the target terminal within the preset historical time period. Then, a scheduling priority parameter corresponding to the target terminal can be determined according to the target data amount, a preset data amount threshold, the cache waiting time, the cache waiting number and a service priority level corresponding to the target terminal. Subsequently, resources can be scheduled for the target terminal based on the scheduling priority parameter.

[0007] Optionally, the method for determining the scheduling priority parameter corresponding to the target terminal according to the target data amount, the preset data amount threshold, the cache waiting time, the cache waiting number and the service priority level corresponding to the target terminal includes: when the target data amount is less than the data amount threshold, the scheduling priority parameter is determined according to the target data amount, the data amount threshold, the cache waiting time, the cache waiting number and the service priority level; the target data amount, the data amount threshold, the cache waiting time, the cache waiting number, the service priority level and the scheduling priority parameter satisfy the following formula:

[0008]

[0009] B_LCG ik is a target data amount; B 门限 is a data amount threshold value; is a cache waiting time; N is a cache waiting number of times; Max{P_LCG ij} is a service priority level; Pr i is a scheduling priority parameter;

[0010] When the target data amount is greater than or equal to the data amount threshold value, the scheduling priority parameter is determined according to the cache waiting time, the cache waiting number of times and the service priority level; the cache waiting time, the cache waiting number of times, the service priority level and the scheduling priority parameter satisfy the following formula:

[0011]

[0012] Optionally, the method for obtaining the target data amount corresponding to the target terminal comprises: receiving channel characteristic information of a logical channel sent by the target terminal; and the channel characteristic information comprises the target data amount.

[0013] Optionally, the resource scheduling method further comprises: updating the scheduling priority parameter in a preset scheduling period.

[0014] Optionally, the service priority level is a target priority level in a plurality of priority levels corresponding to the target terminal; and the target priority level is higher than other priority levels in the plurality of priority levels.

[0015] In a second aspect, a resource scheduling apparatus is provided, comprising: an obtaining unit and a processing unit; the obtaining unit is configured to obtain a target data amount, a cache waiting time and a cache waiting number of times corresponding to a target terminal; the target data amount is a data amount of data that can be buffered in a target buffer queue corresponding to the target terminal; the cache waiting time is a waiting time from a time when historical uplink data sent by the target terminal arrives at the target buffer queue to a transmission time within a preset historical time period; and the cache waiting number of times is a waiting number of times of the target terminal within the preset historical time period; and the processing unit is configured to determine a scheduling priority parameter corresponding to the target terminal according to the target data amount, a preset data amount threshold value, the cache waiting time, the cache waiting number of times and a service priority level corresponding to the target terminal obtained by the obtaining unit; and the processing unit is further configured to schedule uplink resources for the target terminal based on the scheduling priority parameter.

[0016] Optionally, the processing unit is specifically configured to: when the target data amount is less than the data amount threshold, determining the scheduling priority parameter according to the target data amount, the data amount threshold, the cache waiting time, the cache waiting number and the service priority level; the target data amount, the data amount threshold, the cache waiting time, the cache waiting number, the service priority level and the scheduling priority parameter satisfy the following formula:

[0017]

[0018] B_LCG ik is the target data amount; B 门限 is the data amount threshold; is the cache waiting time; N is the cache waiting number; Max{P_LCG ij} is the service priority level; Pr i is the scheduling priority parameter;

[0019] When the target data amount is greater than or equal to the data amount threshold, determining the scheduling priority parameter according to the cache waiting time, the cache waiting number and the service priority level; the cache waiting time, the cache waiting number, the service priority level and the scheduling priority parameter satisfy the following formula:

[0020]

[0021] Optionally, the obtaining unit is specifically configured to: receive the channel characteristic information of the logical channel sent by the target terminal; the channel characteristic information includes the target data amount.

[0022] Optionally, the processing unit is further configured to: update the scheduling priority parameter in a preset scheduling period.

[0023] Optionally, the service priority level is a target priority level in a plurality of priority levels corresponding to the target terminal; the target priority level is higher than other priority levels in the plurality of priority levels.

[0024] In a third aspect, a resource scheduling apparatus is provided, including a memory and a processor; the memory is used to store computer execution instructions; the processor is connected with the memory through a bus; when the resource scheduling apparatus is running, the processor executes the computer execution instructions stored in the memory, so that the resource scheduling apparatus executes the resource scheduling method in the first aspect.

[0025] The resource scheduling apparatus can be a network device, or a part of the network device, for example, a chip system in the network device. The chip system is used to support the network device to implement the functions involved in the first aspect and any possible implementation manner thereof, for example, obtaining, determining and sending the data and / or information involved in the above-mentioned resource scheduling method. The chip system includes a chip, and can also include other discrete devices or circuit structures.

[0026] In a fourth aspect, a computer-readable storage medium is provided, which includes computer-executable instructions that, when executed on a computer, cause the computer to perform the resource scheduling method of the first aspect.

[0027] In a fifth aspect, a computer program product is also provided, which includes computer instructions that, when executed on a resource scheduling apparatus, cause the resource scheduling apparatus to perform the resource scheduling method of the first aspect.

[0028] It should be noted that the computer instructions described above can be stored on the first computer-readable storage medium in whole or in part. The first computer-readable storage medium can be packaged together with the processor of the resource scheduling apparatus or packaged separately from the processor of the resource scheduling apparatus, and the present application does not limit this.

[0029] The second aspect, the third aspect, the fourth aspect and the fifth aspect of the present application can refer to the detailed description of the first aspect, and the beneficial effects of the second aspect, the third aspect, the fourth aspect and the fifth aspect can refer to the beneficial effect analysis of the first aspect, which will not be repeated here.

[0030] In the present application, the name of the resource scheduling apparatus described above does not constitute a limitation on the device or functional module itself, and in actual implementation, these devices or functional modules can appear with other names. As long as the functions of each device or functional module are similar to those of the present application, they belong to the scope of the claims of the present application and equivalent technologies.

[0031] These aspects or other aspects of the present application will be more apparent in the following description.

[0032] The technical solutions provided by the present application at least have the following beneficial effects:

[0033] Based on any of the above aspects, the present application provides a resource scheduling method, which can first acquire a target data amount corresponding to a target terminal, a cache waiting time and a cache waiting number. The target data amount is the data amount of the cacheable data of a target cache queue corresponding to the target terminal, the cache waiting time is the waiting time from the time when the historical uplink data sent by the target terminal arrives at the target cache queue to the transmission time within a preset historical time period, and the cache waiting number is the waiting number of the target terminal within the preset historical time period. Then, a scheduling priority parameter corresponding to the target terminal can be determined according to the target data amount, a preset data amount threshold, the cache waiting time, the cache waiting number and a service priority level corresponding to the target terminal. Subsequently, resources can be scheduled for the target terminal based on the scheduling priority parameter.

[0034] In this way, the resource scheduling device in this application can characterize user experience through cache waiting time and cache waiting count, more accurately determine the scheduling priority parameters corresponding to the target terminal, effectively reduce the total latency of uplink services for multiple terminals in the entire cell, and balance the service experience of users corresponding to multiple terminals. Attached Figure Description

[0035] Figure 1 This is a schematic diagram of the structure of a resource scheduling system provided in an embodiment of this application;

[0036] Figure 2 This is a schematic diagram of the structure of a resource scheduling device provided in an embodiment of this application;

[0037] Figure 3 A schematic diagram of the hardware structure of a resource scheduling device provided in this application embodiment. Figure 1 ;

[0038] Figure 4 A schematic diagram of the hardware structure of a resource scheduling device provided in this application embodiment. Figure 2 ;

[0039] Figure 5 A flowchart illustrating a resource scheduling method provided in this application embodiment. Figure 1 ;

[0040] Figure 6 A flowchart illustrating a resource scheduling method provided in this application embodiment. Figure 2 ;

[0041] Figure 7 A flowchart illustrating a resource scheduling method provided in this application embodiment. Figure 3 ;

[0042] Figure 8 A flowchart illustrating a resource scheduling method provided in this application embodiment. Figure 4 ;

[0043] Figure 9 This is a schematic diagram of the structure of a resource scheduling device provided in an embodiment of this application. Detailed Implementation

[0044] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0045] It should be noted that in the embodiments of the present application, the words such as "exemplary" or "for example" are used to mean serving as an example, instance, or illustration. Any embodiment or design presented as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being preferred or superior to other embodiments or design solutions. Rather, the use of the words such as "exemplary" or "for example" is intended to present concepts in a particular manner.

[0046] In order to clearly describe the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first", "second", etc. are used to distinguish the same or similar items with basically the same function and role. Those skilled in the art can understand that the words "first", "second", etc. are not intended to limit the quantity and execution order.

[0047] In order to facilitate understanding of the present application, the related elements involved in the present application will now be described.

[0048] 1. Massive multiple-input multiple-output (MIMO) antenna technology

[0049] With the evolution and development of wireless communication technology, the fifth generation mobile communication technology (5G) new radio (NR) has flexibility and supports larger bandwidth, and the massive MIMO technology is a key technology to improve the performance of the wireless air interface. The development of massive antenna technology makes a larger number of antennas a key to improving channel capacity, such as 32TR and 64TR becoming a regular configuration of 5G time division duplexing (TDD) outdoor macro station. The spatial layer (number of spatial streams) of the downlink channel of the cell can be up to 16 layers, or even higher to 24 layers. For 5G NR indoor small stations, the number of antennas supported by a single picro remote radio unit (pRRU) is usually a maximum of 4. Through distributed MIMO technology, the antennas of multiple adjacent pRRUs can form a MIMO cell, thereby forming a cell with 16 or more antennas, which makes the massive MIMO technology applicable in digital room distribution systems. At present, the terminal antenna is limited by the size and processing capacity of the terminal and can only achieve 4TR. In order to fully utilize the characteristics of the downlink spatial multi-stream of the cell, multi-user (MU) MIMO (MU-MIMO) technology is needed to achieve higher transmission rate of the cell.

[0050] In massive MIMO technology, the uplink and downlink scheduling at the base station side is quite different. For the downlink, the base station can establish independent data buffer queues for different service types of each user, and can easily obtain the data amount of each queue. However, for the uplink scheduling, the terminal needs to report the data amount in the buffer queue. In order to save the system resources consumed by the UE in reporting the buffer data amount of each service, different QCI services need to be mapped to corresponding logical channel groups, and the UE reports the data amount in the buffer according to the logical channel groups. The evolved Node B (eNodeB) supports 4 logical channel groups, and the base station of the next generation (gNB) supports a maximum of 8 logical channel groups.

[0051] 2. Channel state information (CSI)

[0052] In the field of wireless communication, the so-called channel state information is the channel property of the communication link. It describes the attenuation factor of the signal on each transmission path, that is, the value of each element in the channel gain matrix H, such as signal scattering (Scattering), environmental attenuation (fading, multipath fading or shadowing fading), distance attenuation (power decay of distance), etc. The CSI can make the communication system adapt to the current channel conditions, and provide high reliability and high speed communication in a multi-antenna system.

[0053] CSI is the channel state information used by the terminal UE (user experience, UE) to feed back the channel quality to the gNB. Due to the reciprocity of the uplink and downlink channels in the TDD system, the gNB selects a suitable modulation and coding scheme (MCS) for the transmission of uplink data to reduce the block error rate (BLER) of data transmission, which is composed of the channel quality indicator (CQI), the precoding matrix indicator (PMI), the CSI-reference signal resource indicator (CRI), the SS / PBCH block resource indicator (SSBRI), the layer indicator (LI), the rank indicator (RI), and the layer 1 reference signal received power (L1-RSRP).

[0054] When the UE reports the CSI measurement results of the cell, the rank used for transmitting user data is determined according to the RI reported by the UE, that is, the number of layers or streams of transmission. When the base station side transmits the user plane buffer data, the MCS used for transmitting the user data is determined according to the CQI reported by the UE. As shown in Table 1, the index table of the MCS is defined in detail in the 3rd generation partnership project (3GPP) technical specification (TS) 38.214.

[0055] Table 1

[0056]

[0057]

[0058] 3、5G service quality identifier (5G QoS identifier, 5QI)

[0059] The 5QI of a service is a scalar used to index the 5G quality of service (QoS) characteristics. Table 2 is for guaranteed bit rate (GBR) services with rate guarantee requirements. Table 3 describes Non-GBR services without rate guarantee requirements. There is a standardized 5QI mapping relationship in the 3GPP TS23.501 protocol.

[0060] In the 5G QoS characteristics, the priority level represents the resource scheduling priority between 5G QoS flows. This parameter is used to distinguish the QoS flows of a service terminal and also to distinguish the QoS flows of different terminals. The smaller the value of the service priority level, the higher the service priority level. The 5QI parameter also indicates the resource type of each service, GBR or non-GBR service, indicating whether the service rate guarantee needs to be provided, the guaranteed rate information of the GBR service, and the packet delay budget of each service, which is a service guarantee index for the service delay requirement.

[0061] Table 2

[0062]

[0063] Table 3

[0064]

[0065]

[0066] As shown in the background, the current reasonable scheduling of resources in a complex scene is a problem that needs to be solved urgently.

[0067] The embodiment of the present application provides a resource scheduling method. First, the target data amount, the cache waiting time and the cache waiting times corresponding to the target terminal can be acquired. The target data amount is the data amount of the cacheable data of the target cache queue corresponding to the target terminal. The cache waiting time is the waiting time from the time when the historical uplink data sent by the target terminal reaches the target cache queue to the transmission time within a preset historical time period. The cache waiting times is the waiting times of the target terminal within the preset historical time period. Then, the scheduling priority parameter corresponding to the target terminal can be determined according to the target data amount, the preset data amount threshold, the cache waiting time, the cache waiting times and the service priority level corresponding to the target terminal. Subsequently, the resources can be scheduled for the target terminal based on the scheduling priority parameter.

[0068] In this way, the resource scheduling device in the application can use the cache waiting time and the cache waiting number to represent the user experience, more accurately determine the scheduling priority parameter corresponding to the target terminal, effectively reduce the total delay of the user experience of the uplink service of the plurality of terminals in the entire cell, and balance the service experience of the users corresponding to the plurality of terminals.

[0069] The resource scheduling method is suitable for a resource scheduling system. Figure 1 A structural schematic diagram of a resource scheduling system is shown. As shown in the figure, the resource scheduling system includes a resource scheduling device 101 and a plurality of terminals (including a target terminal 102). Figure 1

[0070] The resource scheduling device 101 is connected with the plurality of terminals respectively.

[0071] Specifically, the resource scheduling device 101 can receive the uplink service transmission request of the plurality of terminals, and the resource scheduling device 101 can allocate time domain and frequency domain resources for the plurality of terminals to transmit uplink service data in turn based on a resource scheduling rule.

[0072] In an embodiment, Figure 1 The resource scheduling device 101 in the application can be a base station or a base station controller of wireless communication, etc. In the embodiment of the application, the base station can be a base station (BTS) in the global system for mobile communication (GSM), code division multiple access (CDMA), a base station (node B) in wideband code division multiple access (WCDMA), a base station (eNB) in the internet of things (IoT) or narrowband-internet of things (NB-IoT), a base station in the future 5G mobile communication network or the future evolved public land mobile network (PLMN).

[0073] In another embodiment, the resource scheduling device 101 can also be one server in a server cluster (composed of a plurality of servers), can also be a chip in the server, can also be a system on chip in the server, and can also be implemented by a virtual machine (VM) deployed on the server for cloud deployment. The embodiment of the application does not limit this.

[0074] ​Figure 1 A terminal in the specification can refer to a device that provides voice and / or data connectivity to a user, a handheld device having wireless connection capability, or other processing devices connected to a wireless modem. The wireless terminal can communicate with one or more core networks via a radio access network (RAN). The wireless terminal can be a mobile terminal, such as a mobile telephone (also known as a "cellular" telephone) and a computer having a mobile terminal, which communicates with a radio access network. The wireless terminal can also be a portable, pocket, hand-held, computer-included or car-mounted mobile apparatus, which communicates with a radio access network, such as a mobile phone, a tablet computer, a laptop computer, a netbook, a personal digital assistant (PDA).

[0075] In an embodiment, as shown in Figure 2 , Figure 1 The resource scheduling device 101 in the specification can include an information collection module 201 and a resource scheduling module 202.

[0076] The information collection module 201 is configured to acquire data characteristic information of a plurality of terminals in a cell and channel characteristic information of a logical channel.

[0077] The resource scheduling module 202 is configured to determine a scheduling priority parameter corresponding to a target terminal according to the data characteristic information and the channel characteristic information acquired by the information collection module 201, and then schedule resources for the target terminal based on the scheduling priority parameter.

[0078] It should be noted that the above-mentioned resource scheduling device 101 and target terminal 102 can be referred to as electronic devices.

[0079] In combination with Figure 1 , the resource scheduling device 101 and the target terminal 102 in the resource scheduling system both include elements included in the communication device as shown in Figure 3 or Figure 4 . In the following, the hardware structure of the resource scheduling device 101 and the target terminal 102 will be introduced by taking the communication device as shown in Figure 3 and Figure 4 as an example.

[0080] As shown in Figure 3 , it is a hardware structure schematic diagram of the communication device provided by the embodiment of the application. The communication device includes a processor 21, a memory 22, a communication interface 23, and a bus 24. The processor 21, the memory 22, and the communication interface 23 can be connected through the bus 24.

[0081] The processor 21 is a control center of the communication device, which can be one processor or a collective term of multiple processing elements. For example, the processor 21 can be a general central processing unit (CPU), or other general-purpose processor, etc. The general-purpose processor can be a microprocessor or any conventional processor, etc.

[0082] As an embodiment, the processor 21 can include one or more CPUs, such as the CPU 0 and the CPU 1 shown in FIG. 2. Figure 3

[0083] The memory 22 can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.

[0084] In one possible implementation, the memory 22 can exist independently of the processor 21, and the memory 22 can be connected to the processor 21 through the bus 24 for storing instructions or program code. When the processor 21 invokes and executes the instructions or program code stored in the memory 22, the resource scheduling method provided by the embodiments described below can be implemented.

[0085] In another possible implementation, the memory 22 can also be integrated with the processor 21.

[0086] The communication interface 23 is used for connecting the communication device to other devices through a communication network, which can be an Ethernet, a wireless access network, a wireless local area network (WLAN), etc. The communication interface 23 can include a receiving unit for receiving data, and a transmitting unit for transmitting data.

[0087] ​The bus 24 can be an industry standard architecture (ISA) bus, a peripheral component interconnect (PCI) bus, an extended industry standard architecture (EISA) bus, or the like. The bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, Figure 3 Only one thick line is used to represent the bus in the figure, but it does not mean that there is only one bus or only one type of bus.

[0088] Figure 4 Another hardware structure of the communication device in the embodiment of the application is shown. As shown in the figure, Figure 4 The communication device can include a processor 31 and a communication interface 32. The processor 31 is coupled to the communication interface 32.

[0089] The functions of the processor 31 can refer to the description of the processor 21 above. In addition, the processor 31 also has a storage function, which can function as the memory 22 described above.

[0090] The communication interface 32 is used to provide data for the processor 31. The communication interface 32 can be an internal interface of the communication device, or an external interface of the communication device (equivalent to the communication interface 23).

[0091] It should be noted that, Figure 3 The structure shown in (or Figure 4 ) does not constitute a limitation on the communication device. In addition to the components shown in (or Figure 3 (or Figure 4 ), the communication device can include more or fewer components than shown, or combine certain components, or different component arrangements.

[0092] The resource scheduling method provided by the embodiment of the application will be described in detail below with reference to the accompanying drawings. As shown in the figure, Figure 5 The resource scheduling method includes:

[0093] S501, the resource scheduling device acquires a target data volume, a cache waiting time, and a cache waiting number corresponding to a target terminal.

[0094] The target data volume is the data volume of the data that can be cached by the target cache queue corresponding to the target terminal, the cache waiting time is the waiting time from the time when the historical uplink data sent by the target terminal arrives at the target cache queue to the transmission time within a preset historical time period, and the cache waiting number is the waiting number of the target terminal within the preset historical time period.

[0095] Optionally, the target buffer queue can be a buffer queue in a logical channel corresponding to the highest priority level of the target terminal.

[0096] In an implementable manner, the method for the resource scheduling device to obtain the target data volume, the buffer waiting time and the buffer waiting times corresponding to the target terminal can include: the resource scheduling device can receive the channel characteristic information reported by the terminal, and then identify the target data volume from the channel characteristic information. In addition, the resource scheduling device can also read the buffer waiting time and the buffer waiting times corresponding to the target terminal from the database for storing historical transmission information.

[0097] S502, the resource scheduling device determines a scheduling priority parameter corresponding to the target terminal according to the target data volume, a preset data volume threshold, the buffer waiting time, the buffer waiting times and a service priority level corresponding to the target terminal.

[0098] Optionally, the preset data volume threshold can be a threshold value of the data volume of the uplink small packet service.

[0099] It should be noted that the service data with a target data volume less than the preset data volume threshold is considered as small packet service data. The terminal transmitting the small packet service data can improve the scheduling priority parameter of the resource scheduling to obtain uplink priority scheduling. The higher the data volume threshold is, the more terminals transmitting the small packet service data can be covered. For example, the target data volume can be 2 kilobits (kbits).

[0100] It can be understood that the resource required for the uplink service data transmission of the large packet service with large traffic is more, and the corresponding resource scheduling waiting time is longer. Therefore, compared with the waiting time corresponding to the priority scheduling of the large packet service, the overall resource scheduling waiting time (i.e. buffer delay) of all terminals in the target cell can be reduced in the case of priority scheduling of the small packet service with small traffic.

[0101] Optionally, the service priority level can be a priority level in the 5QI mapping relationship, and resources are preferentially scheduled to services with smaller values of the priority level.

[0102] In an implementable manner, the resource scheduling device can obtain a plurality of priority levels corresponding to the target terminal, and determine the target priority level as the service priority level corresponding to the target terminal from the plurality of priority levels. The target priority level is higher than other priority levels in the plurality of priority levels.

[0103] For example, the target terminal establishes four service bearers of QCI9, QCI1, QCI5 and QCI69, and the four bearers belong to three logical channel groups, wherein the logical channel group to which QCI5 and QCI69 belong has the highest priority. As can be seen from the priority level corresponding to the QCI5 and QCI69 bearers, among the QCI5 and QCI69, the logical channel priority of QCI5 is the highest, and thus the priority level corresponding to the QCI5 bearer is taken as the service priority level of the target terminal.

[0104] In an implementable manner, when the target data amount of the target terminal is less than the data amount threshold, the resource scheduling device can determine the scheduling priority parameter according to the target data amount, the data amount threshold, the cache waiting time, the cache waiting number and the service priority level.

[0105] When the target data amount of the target terminal is less than the data amount threshold, the resource scheduling device can determine the scheduling priority parameter according to the cache waiting time, the cache waiting number and the service priority level.

[0106] In an implementable manner, in a preset scheduling period, the resource scheduling device can update the scheduling priority parameter corresponding to the target terminal.

[0107] S503, the resource scheduling device schedules uplink resources for the target terminal based on the scheduling priority parameter.

[0108] Optionally, the resource can include time domain resources and frequency domain resources in a data transmission process.

[0109] In an implementable manner, in a preset scheduling period, the resource scheduling device can schedule uplink resources for the uplink cache queue of each terminal according to the multiple scheduling priority parameters corresponding to the multiple terminals in the target cell in descending order of the scheduling priority parameters, that is, the terminal with a larger scheduling priority parameter value is preferentially scheduled with uplink resources.

[0110] The technical scheme provided by the above embodiments at least brings the following beneficial effects: as can be seen from S501-S503, first, the target data amount, the cache waiting time and the cache waiting number corresponding to the target terminal can be obtained. The target data amount is the data amount of the data that can be cached by the target cache queue corresponding to the target terminal, the cache waiting time is the waiting time from the time when the historical uplink data sent by the target terminal arrives at the target cache queue to the transmission time within a preset historical time period, and the cache waiting number is the waiting number of the target terminal within the preset historical time period. Then, the scheduling priority parameter corresponding to the target terminal can be determined according to the target data amount, the preset data amount threshold, the cache waiting time, the cache waiting number and the service priority level corresponding to the target terminal. Subsequently, the resource can be scheduled for the target terminal based on the scheduling priority parameter.

[0111] In this way, the resource scheduling device can characterize user experience by the cache waiting time and the cache waiting number of times, more accurately determine the scheduling priority parameter corresponding to the target terminal, effectively reduce the total delay of the user experience of the uplink service of the plurality of terminals in the entire cell, and balance the service experience of the users corresponding to the plurality of terminals.

[0112] In an optional embodiment, in combination with Figure 5 As shown in FIG. 5, in S502, the resource scheduling device determines the scheduling priority parameter corresponding to the target terminal according to the target data volume, the preset data volume threshold, the cache waiting time, the cache waiting number of times, and the service priority level corresponding to the target terminal. Figure 6 The method for determining the scheduling priority parameter corresponding to the target terminal includes the following steps.

[0113] S601, when the target data volume is less than the data volume threshold, the resource scheduling device determines the scheduling priority parameter according to the target data volume, the data volume threshold, the cache waiting time, the cache waiting number of times, and the service priority level.

[0114] The target data volume, the data volume threshold, the cache waiting time, the cache waiting number of times, the service priority level, and the scheduling priority parameter satisfy the following formula.

[0115]

[0116] B_LCG ik is the target data volume, B 门限 is the data volume threshold, is the cache waiting time, N is the cache waiting number of times, Max{P_lcg ij is the service priority level, Pr i is the scheduling priority parameter.

[0117] It can be understood that, since the larger the scheduling priority parameter is, the more the target terminal is preferentially scheduled uplink resources, and the smaller the service priority level is, the more the target terminal is preferentially scheduled uplink resources, therefore, the scheduling priority parameter can be inversely proportional to the service priority level, that is, the scheduling priority parameter can be positively correlated with the reciprocal of the service priority level (hereinafter referred to as “initial priority parameter”).

[0118] Meanwhile, considering that the cache waiting time corresponds to the service waiting time of the terminal, the average waiting time of the uplink service data transmitted by the terminal in a preset historical time period, i.e., the ratio of the cache waiting time to the cache waiting times, is taken as an influence coefficient (hereinafter referred to as a "first influence coefficient") of the scheduling priority parameter. When the average waiting time of the uplink service data of the target terminal in the preset historical time period is long, it indicates that the user experience of the target terminal in the preset historical time period is poor, at this time, the corresponding first influence coefficient increases, i.e., the scheduling priority parameter of the target terminal in the current scheduling period increases, which can improve the current experience of the terminal with a historical poor experience.

[0119] Further, in order to realize the scheduling of resources for the terminal transmitting small packet service data, the ratio of the data amount threshold to the target data amount of the target terminal can be taken as another influence coefficient (hereinafter referred to as a "second influence coefficient") of the scheduling priority parameter. In this way, the smaller the target data amount of the target terminal, i.e., the smaller the flow of small packet service data transmitted by the target terminal, the larger the first influence coefficient. Since the target data amount of the target terminal is smaller than the data amount threshold, the first influence coefficient is greater than 1. Therefore, when the target data amount of the target terminal is smaller than the data amount threshold, the corresponding scheduling priority parameter is greater than the initial priority parameter.

[0120] S602, when the target data amount is greater than or equal to the data amount threshold, the resource scheduling device determines the scheduling priority parameter according to the cache waiting time, the cache waiting times, and the service priority level.

[0121] The cache waiting time, the cache waiting times, the service priority level, and the scheduling priority parameter satisfy the following formula:

[0122]

[0123] In combination with the description of S601, it can be understood that when the target data amount is greater than or equal to the data amount threshold, it is considered as large packet service data. At this time, the product of the initial priority parameter and the first influence coefficient can be determined as the scheduling priority parameter. Since the terminal transmitting small packet service data corresponds to the scheduling priority parameter related to the second influence coefficient, the scheduling priority parameter corresponding to the terminal transmitting small packet service data is greater than the scheduling priority parameter corresponding to the terminal transmitting large packet service data.

[0124] The technical scheme provided by the above embodiment at least brings the following beneficial effects: as can be known from S601-S602, the embodiment of the present application can provide a method for determining the scheduling priority coefficient corresponding to the terminal transmitting small packet service and large packet service, which can comprehensively consider the service waiting time of the user and other factors, and realize the reasonable scheduling of the uplink resource in the target cell.

[0125] In an optional embodiment, in combination withFigure 5 As shown in Figure 7 , in S501, the method for the resource scheduling device to obtain the target data volume corresponding to the target terminal includes:

[0126] S701, the resource scheduling device receives the channel characteristic information of the logical channel sent by the target terminal.

[0127] The channel characteristic information includes the target data volume.

[0128] Optionally, the channel characteristic information can be the channel state information reported by the terminal.

[0129] In one implementable manner, in combination with Figure 2 , the resource scheduling device 101 can receive the buffer status report (BSR) reported by the target terminal through the information collection module 201. The BSR is used to indicate the data volume contained in the buffer queue of the jth logical channel group, which can be reported to the base station according to the logical channel group.

[0130] For example, as shown in Table 4, the logical channel group can be related to the service type pre-subscribed by the target terminal.

[0131] Table 4

[0132]

[0133]

[0134] The above-mentioned embodiments provide technical solutions with at least the following beneficial effects: As can be seen from S701, the resource scheduling device can obtain the target data volume of the target terminal by receiving the channel characteristic information of the logical channel sent by the target terminal. The present application provides a method for determining the target data volume, so that the subsequent resource scheduling device can implement the priority scheduling of the uplink resource in the target cell based on the target data volume.

[0135] In an optional embodiment, in combination with any one of Figure 5 , Figure 6 or Figure 7 resource scheduling method, as shown in Figure 8 , the resource scheduling method further includes:

[0136] S801, the resource scheduling device updates the scheduling priority parameter in a preset scheduling period.

[0137] In one implementable manner, the resource scheduling device can update the scheduling priority parameter in each scheduling period, and store the resource scheduling information corresponding to each terminal in the historical scheduling period.

[0138] The above describes the solutions provided by the embodiments of the present application from the method aspect. To implement the above functions, hardware structures and / or software modules corresponding to the functions are included. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of the examples described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is implemented in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0139] The embodiments of the present application can divide the function modules of the resource scheduling apparatus according to the above method examples. For example, each function module can be divided according to each function, or two or more functions can be integrated in one processing module. The above integrated module can be implemented in the form of hardware or software function module. Optionally, the division of the modules in the embodiments of the present application is illustrative, and is only a logical function division. Actual implementation can have another division manner.

[0140] As shown in Figure 9 , it is a structure schematic diagram of a resource scheduling apparatus provided by the embodiments of the present application. The resource scheduling apparatus can be used to execute the resource scheduling method shown in Figure 5 , Figure 6 , Figure 7 and Figure 8 . Figure 9 The resource scheduling apparatus shown in the figure includes an acquisition unit 901 and a processing unit 902.

[0141] The acquisition unit 901 is configured to acquire a target data amount, a cache waiting time and a cache waiting number corresponding to a target terminal. The target data amount is a data amount of cacheable data of a target cache queue corresponding to the target terminal. The cache waiting time is a waiting time from a time when historical uplink data sent by the target terminal arrives at the target cache queue to a transmission time within a preset historical time period. The cache waiting number is a waiting number of the target terminal within the preset historical time period.

[0142] The processing unit 902 is configured to determine a scheduling priority parameter corresponding to the target terminal according to the target data amount, a preset data amount threshold, the cache waiting time, the cache waiting number and a service priority level corresponding to the target terminal acquired by the acquisition unit 901.

[0143] The processing unit 902 is further configured to schedule uplink resources for the target terminal based on the scheduling priority parameter.

[0144] Optionally, the processing unit 902 is specifically configured to: when the target data amount is less than the data amount threshold, determine a scheduling priority parameter according to the target data amount, the data amount threshold, a cache waiting time, a cache waiting number and a service priority level; the target data amount, the data amount threshold, the cache waiting time, the cache waiting number, the service priority level and the scheduling priority parameter satisfy the following formula:

[0145]

[0146] B_LCG ik is the target data amount; B 门限 is the data amount threshold; is the cache waiting time; N is the cache waiting number; Max{P_lcg ij} is the service priority level; Pr i is the scheduling priority parameter;

[0147] when the target data amount is greater than or equal to the data amount threshold, determine the scheduling priority parameter according to the cache waiting time, the cache waiting number and the service priority level; the cache waiting time, the cache waiting number, the service priority level and the scheduling priority parameter satisfy the following formula:

[0148]

[0149] Optionally, the obtaining unit 901 is specifically configured to: receive channel characteristic information of a logical channel sent by a target terminal; the channel characteristic information includes a target data amount.

[0150] Optionally, the processing unit 902 is further configured to: update the scheduling priority parameter in a preset scheduling period.

[0151] The embodiment of the application further provides a computer readable storage medium, which includes computer execution instructions, when the computer execution instructions run on a computer, the computer execution instructions make the computer execute the resource scheduling method provided by the above embodiment.

[0152] The embodiment of the application further provides a computer program, which can be directly loaded into a memory and contains software codes, and the computer program can realize the resource scheduling method provided by the above embodiment after being loaded and executed by a computer.

[0153] Those skilled in the art should clearly understand that, in one or more examples described above, the functions described in the present application can be implemented by hardware, software, firmware or any combination thereof. When implemented by software, these functions can be stored in a computer readable medium or transmitted as one or more instructions or codes on a computer readable medium. The computer readable medium includes a computer readable storage medium and a communication medium, wherein the communication medium includes any medium that facilitates the transfer of computer programs from one place to another. The storage medium can be any available medium that can be accessed by a general or special purpose computer.

[0154] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the convenience and brevity of description, only the division of the above functional modules is exemplified, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.

[0155] In several embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. For example, the above-described device embodiments are only illustrative, for example, the division of the modules or units is only a logical function division, and actual implementation can have another division manner. For example, a plurality of units or components can be combined or integrated into another device, or some features can be omitted or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed ones can be through some interfaces, indirect coupling or communication connection between the devices or units, which can be electrical, mechanical or other forms. The units described as separate components can be or can not be physically separated, and the components shown as units can be one physical unit or multiple physical units, that is, can be located in one place, or can be distributed in multiple different places. According to actual needs, part or all of the units can be selected to achieve the purpose of the present embodiment scheme.

[0156] In addition, each function unit in various embodiments of the present application can be integrated in one processing unit, or each unit can be physically present separately, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software function unit. When the integrated unit is realized in the form of a software function unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solutions of the embodiments of the present application can be embodied in the form of a software product in essence or the part that contributes to the prior art or the whole or part of the technical solutions. The software product is stored in a storage medium and includes a plurality of instructions for causing an apparatus (which can be a single-chip microcomputer, a chip, etc.) or a processor to execute all or part of the steps of the method described in various embodiments of the present application. The aforementioned storage medium includes a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk, and various storage medium capable of storing program codes.

[0157] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or replacements within the technical range disclosed in the present application, which should be covered in the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A resource scheduling method, characterized in that, The method comprises the following steps: obtaining a target data amount, a cache waiting time and a cache waiting number corresponding to a target terminal; the target data amount is the data amount of data that can be cached in a target cache queue corresponding to the target terminal; the cache waiting time is the waiting time from the time when historical uplink data sent by the target terminal arrives at the target cache queue to the time of transmission within a preset historical time period; the cache waiting number is the number of times of waiting of the target terminal within the preset historical time period; and the target cache queue is a cache queue in a logical channel of a highest priority level corresponding to the target terminal; determining a scheduling priority parameter corresponding to the target terminal according to the target data amount, a preset data amount threshold, the cache waiting time, the cache waiting number and a service priority level corresponding to the target terminal; scheduling an uplink resource for the target terminal based on the scheduling priority parameter; the step of determining the scheduling priority parameter according to the target data amount, the preset data amount threshold, the cache waiting time, the cache waiting number and the service priority level corresponding to the target terminal comprises the following steps: when the target data amount is less than the data amount threshold, determining the scheduling priority parameter according to the target data amount, the data amount threshold, the cache waiting time, the cache waiting number and the service priority level; the target data amount, the data amount threshold, the cache waiting time, the cache waiting number, the service priority level and the scheduling priority parameter satisfy the following formula: ； The is the target data volume; the is the data volume threshold; the is the cache waiting time; the is the cache waiting number; the is the service priority level; the is the scheduling priority parameter; when the target data amount is greater than or equal to the data amount threshold, determining the scheduling priority parameter according to the cache waiting time, the cache waiting number and the service priority level; the cache waiting time, the cache waiting number, the service priority level and the scheduling priority parameter satisfy the following formula: ； the step of obtaining the target data amount corresponding to the target terminal comprises the following steps: receiving channel characteristic information of a logical channel sent by the target terminal; the channel characteristic information comprises the target data amount.

2. The method of claim 1, wherein, The method further comprises the following steps: updating the scheduling priority parameter in a preset scheduling period.

3. The method of claim 1, wherein, the service priority level is a target priority level in a plurality of priority levels corresponding to the target terminal; and the target priority level is higher than other priority levels in the plurality of priority levels.

4. A resource scheduling apparatus, characterized by comprising: The method comprises the following steps: an obtaining unit and a processing unit; the obtaining unit is configured to obtain a target data amount, a cache waiting time and a cache waiting number corresponding to a target terminal; the target data amount is the data amount of data that can be cached in a target cache queue corresponding to the target terminal; the cache waiting time is the waiting time from the time when historical uplink data sent by the target terminal arrives at the target cache queue to the time of transmission within a preset historical time period; the cache waiting number is the number of times of waiting of the target terminal within the preset historical time period; and the target cache queue is a cache queue in a logical channel of a highest priority level corresponding to the target terminal; The processing unit is configured to determine a scheduling priority parameter corresponding to the target terminal according to the target data volume, a preset data volume threshold, the cache waiting time, the cache waiting times, and a service priority level corresponding to the target terminal. The processing unit is further configured to schedule uplink resources for the target terminal based on the scheduling priority parameter. The processing unit is specifically configured to: when the target data volume is less than the data volume threshold, determine the scheduling priority parameter according to the target data volume, the data volume threshold, the cache waiting time, the cache waiting times, and the service priority level; the target data volume, the data volume threshold, the cache waiting time, the cache waiting times, the service priority level, and the scheduling priority parameter satisfy the following formula: ； The is the target data volume; the is the data volume threshold; the is the cache latency; the is the cache latency number; the is the service priority level; the is the scheduling priority parameter; when the target data volume is greater than or equal to the data volume threshold, determine the scheduling priority parameter according to the cache waiting time, the cache waiting times, and the service priority level; the cache waiting time, the cache waiting times, the service priority level, and the scheduling priority parameter satisfy the following formula: ； The obtaining unit is specifically configured to: receive channel characteristic information of a logical channel sent by the target terminal; the channel characteristic information includes the target data volume.

5. The apparatus of claim 4, wherein, The processing unit is further configured to: update the scheduling priority parameter in a preset scheduling period.

6. The apparatus of claim 4, wherein, The service priority level is a target priority level in a plurality of priority levels corresponding to the target terminal; the target priority level is higher than other priority levels in the plurality of priority levels.

7. A resource scheduling apparatus, characterized by comprising: The resource scheduling apparatus includes a memory and a processor; the memory is configured to store computer execution instructions; the processor is connected with the memory through a bus; when the resource scheduling apparatus is running, the processor executes the computer execution instructions stored in the memory, so that the resource scheduling apparatus executes the resource scheduling method in any one of claims 1-3.

8. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer execution instructions; when the computer execution instructions are running on a computer, the computer executes the resource scheduling method in any one of claims 1-3.

Images