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, the target data volume corresponding to the target service to be sent, the historical data volume and the historical transmission duration are acquired. The target data volume is the data volume of the downlink data of the target service, the historical data volume is the data volume of the historical downlink data sent by the target service in a preset historical time period, and the historical transmission duration is the transmission duration corresponding to the historical downlink data. Then, the scheduling priority parameter corresponding to the target service is determined according to the target data volume, a preset data volume threshold, the historical data volume, the historical transmission duration and the service priority level corresponding to the target terminal. The target terminal is a terminal used to receive the downlink data of the target service. Subsequently, the downlink resource is scheduled for the target service 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, a resource scheduling method used in a communication system mainly applies a round robin (RR) algorithm, a maximum C / I algorithm and a proportional fair algorithm. However, the above algorithms are only applicable to simple scenarios, for example, a small cell with a small number of terminals, and how to reasonably schedule resources in a complex scenario is a problem to be solved at present. SUMMARY

[0004] The present application provides a resource scheduling method, device and storage medium, and solves 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, obtaining a target data volume, a historical data volume and a historical transmission time length corresponding to a target service to be transmitted. The target data volume is the data volume of downlink data of the target service, the historical data volume is the data volume of historical downlink data transmitted by the target service in a preset historical time period, and the historical transmission time length is the transmission time length corresponding to the historical downlink data. Then, a scheduling priority parameter corresponding to the target service is determined according to the target data volume, a preset data volume threshold, the historical data volume, the historical transmission time length and a service priority level corresponding to a target terminal. The target terminal is a terminal for receiving downlink data of the target service. Subsequently, downlink resources are scheduled for the target service based on the scheduling priority parameter.

[0007] Optionally, the method for determining the scheduling priority parameter corresponding to the target service according to the target data volume, the preset data volume threshold, the historical data volume, the historical transmission time length and the service priority level corresponding to the target terminal includes: when the target data volume is less than the data volume threshold, determining the scheduling priority parameter according to the target data volume, the data volume threshold, the historical data volume, the historical transmission time length and the service priority level; the target data volume, the data volume threshold, the historical data volume, the historical transmission time length, the service priority level and the scheduling priority parameter satisfy the following formula:

[0008]

[0009] Load ij is a target data volume, L 门限 is a data volume threshold, Time ij is a historical transmission duration, Traffic ij is a historical data volume, Pl ij is a service priority level, Pr ij is a scheduling priority parameter;

[0010] When the target data volume is greater than or equal to the data volume threshold, the scheduling priority parameter is determined according to the historical data volume, the historical transmission duration, and the service priority level; the historical data volume, the historical transmission duration, the service priority level, and the scheduling priority parameter satisfy the following formula:

[0011]

[0012] 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.

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

[0014] In a second aspect, a resource scheduling apparatus is provided, comprising: an acquisition unit and a processing unit; the acquisition unit is configured to acquire a target data volume, a historical data volume, and a historical transmission duration corresponding to a target service to be sent; the target data volume is a data volume of downlink data of the target service; the historical data volume is a data volume of historical downlink data sent by the target service in a preset historical time period; the historical transmission duration is a transmission duration corresponding to the historical downlink data; the processing unit is configured to determine a scheduling priority parameter corresponding to the target service according to the target data volume, a preset data volume threshold, the historical data volume, the historical transmission duration, and a service priority level corresponding to a target terminal; the target terminal is a terminal configured to receive the downlink data of the target service; the processing unit is further configured to schedule downlink resources for the target service based on the scheduling priority parameter.

[0015] Optionally, 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 historical data volume, the historical transmission duration, and the service priority level; the target data volume, the data volume threshold, the historical data volume, the historical transmission duration, the service priority level, and the scheduling priority parameter satisfy the following formula:

[0016]

[0017] Loadij is a target data amount, L 门限 is a data amount threshold, Time ij is a historical transmission duration, Traffic ij is a historical data amount, Pl ij is a service priority level, Pr ij is a scheduling priority parameter;

[0018] When the target data amount is greater than or equal to the data amount threshold, the scheduling priority parameter is determined according to the historical data amount, the historical transmission duration, and the service priority level; the historical data amount, the historical transmission duration, the service priority level, and the scheduling priority parameter satisfy the following formula:

[0019]

[0020] 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.

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

[0022] In a third aspect, a resource scheduling apparatus is provided, which includes a memory and a processor; the memory is configured to store computer-executed instructions; the processor is connected to the memory through a bus; when the resource scheduling apparatus is running, the processor executes the computer-executed instructions stored in the memory, so that the resource scheduling apparatus executes the resource scheduling method in the first aspect.

[0023] 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 configured to support the network device to implement the functions involved in the first aspect and any possible implementation manner thereof, for example, acquiring, 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.

[0024] In a fourth aspect, a computer-readable storage medium is provided, which includes computer-executed instructions; when the computer-executed instructions are running on a computer, the computer-executed instructions make the computer execute the resource scheduling method in the first aspect.

[0025] In a fifth aspect, a computer program product is also provided, which includes computer instructions; when the computer instructions are running on a resource scheduling apparatus, the computer instructions make the resource scheduling apparatus execute the resource scheduling method in the first aspect.

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

[0027] The description of the second aspect, the third aspect, the fourth aspect and the fifth aspect in 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.

[0028] 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.

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

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

[0031] 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 service to be sent, a historical data amount and a historical transmission time length. The target data amount is the data amount of the downlink data of the target service, the historical data amount is the data amount of the historical downlink data sent by the target service in a preset historical time period, and the historical transmission time length is the transmission time length corresponding to the historical downlink data. Then, a scheduling priority parameter corresponding to the target service can be determined according to the target data amount, a preset data amount threshold, the historical data amount, the historical transmission time length and a service priority level corresponding to a target terminal. The target terminal is a terminal for receiving the downlink data of the target service. Subsequently, the downlink resource can be scheduled for the target service based on the scheduling priority parameter.

[0032] In this way, the resource scheduling device in the present application can represent user experience through transmission time length, more accurately determine the scheduling priority parameter corresponding to the target service, effectively reduce the total user experience delay of the downlink services of multiple terminals in the entire cell, and balance the service experience of users corresponding to multiple terminals. BRIEF DESCRIPTION OF DRAWINGS

[0033] Figure 1 A structural schematic diagram of a resource scheduling system provided by an embodiment of the present application;

[0034] Figure 2 A structural schematic diagram of a resource scheduling device provided by an embodiment of the present application;

[0035] Figure 3 A hardware structure diagram of a resource scheduling device provided by an embodiment of the present application Figure 1

[0036] Figure 4 A hardware structure diagram of a resource scheduling device provided by an embodiment of the present application Figure 2

[0037] Figure 5 A flow diagram of a resource scheduling method provided by an embodiment of the present application Figure 1

[0038] Figure 6 A flow diagram of a resource scheduling method provided by an embodiment of the present application Figure 2

[0039] Figure 7 A flow diagram of a resource scheduling method provided by an embodiment of the present application Figure 3

[0040] Figure 8 A structure diagram of a resource scheduling device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0041] The technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work fall within the protection scope of the present application.

[0042] It should be noted that in the embodiments of the present application, the words such as “exemplary” or “for example” are used to represent an example, illustration or description. Any embodiment or design scheme described as “exemplary” or “for example” in the embodiments of the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the words such as “exemplary” or “for example” are intended to present the related concept in a specific manner.

[0043] In order to clearly describe the technical solutions in the embodiments of the present application, in the embodiments of the present application, the words such as “first”, “second” are used to distinguish the same items or similar items with basically the same function and role, and those skilled in the art can understand that the words such as “first”, “second” are not used to limit the quantity and execution order.

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

[0045] ​​​​​1. Massive Multiple-Input Multiple-Output (MIMO) Antenna Technology

[0046] With the evolution and development of wireless communication technology, 5G (5th generation mobile communication technology) New Radio (NR) offers flexibility and supports greater bandwidth. Massive MIMO technology is a key technology for improving NR performance. The development of massive MIMO technology has made a larger number of antennas crucial for increasing channel capacity. For example, 32TR and 64TR have become standard configurations for outdoor macro base stations in 5G Time Division Duplexing (TDD), allowing for 16 or even 24 downlink channel spatial layers (spatial stream number) within a cell. For indoor small cells like 5G NR, a single picoremote radio unit (pRRU) typically supports a maximum of four antennas. Through distributed MIMO technology, multiple adjacent pRRU antennas can form a MIMO cell, resulting in cells with 16 or more antennas. This enables the application of Massive MIMO technology in digital indoor distributed systems. Currently, terminal antennas are limited to 4TR due to the size and processing capabilities of the terminal. In order to make full use of the downlink space multi-stream characteristics of the cell, multi-user pairing is required to adopt multi-user MIMO (MU-MIMO) technology to achieve higher transmission rates in the cell.

[0047] In Massive MIMO technology, uplink and downlink scheduling differ significantly at the base station side. For downlink, the base station can establish independent data buffer queues for each user's different service types, making it easy to obtain the data volume for each queue. However, uplink scheduling requires the terminal to report the data volume in its buffer queue. To conserve system resources consumed by the UE reporting the buffered data volume for each service, different QCI services need to be mapped to corresponding logical channel packets. The UE reports the buffered data volume based on these logical channel packets. Evolved Node B (eNodeB) supports 4 logical channel packets, while 5G next-generation Node B (gNB) supports reporting up to 8 logical channel packets.

[0048] 2. Channel State Information (CSI)

[0049] 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) and other information. CSI can make the communication system adapt to the current channel conditions, and provide high reliability and high rate communication in multi-antenna systems.

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

[0051] 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 user data is determined according to the CQI reported by the UE. As shown in Table 1, the index table of MCS is defined in detail in the 3rd generation partnership project (3rd generation partnership project, 3GPP) technical specification (technical specification, TS) 38.214.

[0052] Table 1

[0053]

[0054]

[0055] 3、5G QoS identifier (5QI)

[0056] The 5QI of a service is a scalar value 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 TS 23.501 protocol.

[0057] 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 flow of a service terminal, and also used to distinguish the QoS flow 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.

[0058] Table 2

[0059]

[0060]

[0061] Table 3

[0062]

[0063]

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

[0065] The embodiment of the present application provides a resource scheduling method, which can first acquire a target data amount corresponding to a target service to be transmitted, a historical data amount and a historical transmission time length. The target data amount is the data amount of downlink data of the target service, the historical data amount is the data amount of historical downlink data transmitted by the target service in a preset historical time period, and the historical transmission time length is a transmission time length corresponding to the historical downlink data. Then, a scheduling priority parameter corresponding to the target service can be determined according to the target data amount, a preset data amount threshold, the historical data amount, the historical transmission time length and a service priority level corresponding to a target terminal. The target terminal is a terminal used for receiving downlink data of the target service. Subsequently, the downlink resource can be scheduled for the target service based on the scheduling priority parameter.

[0066] In this way, the resource scheduling device in the present application can more accurately determine the scheduling priority parameter corresponding to the target service by using the transmission time length to represent the user experience, thereby effectively reducing the total time delay of the user experience of the downlink service of the plurality of terminals in the whole cell, and balancing the service experience of the users corresponding to the plurality of terminals.

[0067] 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, Figure 1 The resource scheduling system comprises a resource scheduling device 101 and a plurality of terminals (including a target terminal 102).

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

[0069] Specifically, the resource scheduling device 101 can sequentially schedule the time domain and frequency domain resources of the downlink based on a resource scheduling rule, and transmit downlink service data to the plurality of terminals in the cell respectively.

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

[0071] In another embodiment, the resource scheduling device 101 can also be a server in a server cluster (composed of multiple servers), a chip in the server, a system on chip in the server, or a virtual machine (VM) deployed on the server for cloud deployment, and the embodiment of the present application does not make any limitation in this regard.

[0072] Figure 1 The terminal in the embodiment of the present application can be a device providing voice and / or data connectivity to a user, a handheld device with a wireless connection function, or other processing devices connected to a wireless modem. The wireless terminal can communicate with one or more core networks through a radio access network (RAN). The wireless terminal can be a mobile terminal, such as a mobile phone (or called "cellular" phone) and a computer with a mobile terminal, and can also be a portable, pocket, handheld, built-in or vehicle-mounted mobile device, which exchanges voice and / or data with a radio access network, such as a mobile phone, a tablet computer, a notebook computer, a netbook computer, a personal digital assistant (PDA).

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

[0074] ​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.

[0075] The resource scheduling module 202 is configured to determine a scheduling priority parameter corresponding to a target service 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.

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

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

[0078] As shown in Figure 3 , it is a hardware structure schematic diagram of the communication device provided by the embodiment of the present 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.

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

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

[0081] 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 capable of carrying or storing desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.

[0082] In a 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 of the present application can be implemented.

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

[0084] The communication interface 23 is used for connecting the communication device with other devices through a communication network. The communication network 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 sending unit for sending data.

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

[0086] Figure 4 Another hardware structure of the communication device in the embodiments of the present 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.

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

[0088] 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).

[0089] 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 less components than shown, or combine certain components, or different component arrangements.

[0090] 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:

[0091] S501, the resource scheduling device acquires the target data volume, the historical data volume and the historical transmission time length corresponding to the target service to be sent.

[0092] The target data volume is the data volume of the downlink data of the target service, the historical data volume is the data volume of the historical downlink data sent by the target service in a preset historical time period, and the historical transmission time length is the transmission time length corresponding to the historical uplink and downlink data.

[0093] In one possible implementation manner, the method for the resource scheduling device to acquire the target data volume, the historical data volume and the historical transmission time length corresponding to the target service to be sent can include that the resource scheduling device can receive the target service data sent by the service sending end, and identify the target data volume. In addition, the resource scheduling device can also read the historical data volume and the historical transmission time length from the database for storing historical transmission information.

[0094] S502, the resource scheduling device determines the scheduling priority parameter corresponding to the target service according to the target data volume, the preset data volume threshold, the historical data volume, the historical transmission time length and the service priority level corresponding to the target terminal.

[0095] The target terminal is a terminal for receiving the downlink data of the target service.

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

[0097] It should be noted that the target data volume is less than the preset data volume threshold, and the service data is considered as small packet service data. The scheduling priority parameter of resource scheduling can be improved for small packet service to obtain downlink priority scheduling. The higher the data volume threshold is, the more small packet services can be covered.

[0098] It can be understood that, due to the large amount of resources required for downlink service data transmission of large flow large packet service, the corresponding resource scheduling waiting time is longer. Therefore, compared with the corresponding waiting time of the large packet service being preferentially scheduled, the small flow small packet service obtaining priority scheduling can reduce the overall resource scheduling waiting time (i.e. cache delay) of all terminals in the target cell range.

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

[0100] 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. Wherein, the target priority level is higher than other priority levels in the plurality of priority levels.

[0101] Illustratively, the target terminal establishes four service bearers of QCI9, QCI1, QCI5 and QCI69, and the four bearers belong to three logical channel groups. Among them, the logical channel group to which QCI5 and QCI69 belong has the highest priority. From the corresponding priority levels of QCI5 and QCI69 bearers, it can be seen that among QCI5 and QCI69, the logical channel priority of QCI5 is the highest, and the corresponding priority level of QCI5 bearer is taken as the service priority level of the target terminal.

[0102] In an implementable manner, when the target data volume of the target terminal is less than the data volume threshold, the resource scheduling device can determine the scheduling priority parameter according to the target data volume, the data volume threshold, the historical data volume, the historical transmission duration and the service priority level.

[0103] When the target data volume of the target terminal is less than the data volume threshold, the resource scheduling device can determine the scheduling priority parameter according to the historical data volume, the historical transmission duration and the service priority level.

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

[0105] S503, the resource scheduling device schedules downlink resources for the target service based on the scheduling priority parameter.

[0106] Optionally, the downlink resources can include time domain resources and frequency domain resources in the data transmission process.

[0107] In one feasible approach, within a preset scheduling period, the resource scheduling device can schedule downlink resources for each service according to multiple scheduling priority parameters corresponding to multiple services in the target cell, in descending order of the scheduling priority parameters. That is, downlink resources are scheduled for services with larger scheduling priority parameter values.

[0108] The technical solution provided by the above embodiments brings at least the following beneficial effects: As shown in S501-S503, firstly, the target data volume, historical data volume, and historical transmission duration corresponding to the target service to be sent can be obtained. Here, the target data volume is the downlink data volume of the target service, the historical data volume is the historical downlink data volume sent by the target service within a preset historical time period, and the historical transmission duration is the transmission duration corresponding to the historical downlink data. Then, based on the target data volume, the preset data volume threshold, the historical data volume, the historical transmission duration, and the service priority level corresponding to the target terminal, the scheduling priority parameters corresponding to the target service can be determined. Here, the target terminal is the terminal used to receive the downlink data of the target service. Subsequently, downlink resources can be scheduled for the target service based on the scheduling priority parameters.

[0109] In this way, the resource scheduling device in this application can characterize user experience through transmission duration, more accurately determine the scheduling priority parameters corresponding to the target service, effectively reduce the total user experience latency of downlink services for multiple terminals in the entire cell, and balance the service experience of users corresponding to multiple terminals.

[0110] In one alternative embodiment, combined with Figure 5 ,like Figure 6 As shown in S502, the method by which the resource scheduling device determines the scheduling priority parameters corresponding to the target service based on the target data volume, the preset data volume threshold, the historical data volume, the historical transmission duration, and the service priority level corresponding to the target terminal includes:

[0111] S601. When the target data volume is less than the data volume threshold, the resource scheduling device determines the scheduling priority parameters based on the target data volume, the data volume threshold, the historical data volume, the historical transmission duration, and the service priority level.

[0112] The target data volume, data volume threshold, historical data volume, historical transmission duration, service priority level, and scheduling priority parameters satisfy the following formula:

[0113]

[0114] Load ij For the target data volume, L 门限 Time is the data volume threshold. ijTraffic is a historical transmission duration ij Pl is a historical data volume ij Pr is a service priority level ij is a scheduling priority parameter.

[0115] It can be understood that, as the larger the scheduling priority parameter is, the more priority the target service is scheduled with downlink resources, and the smaller the service priority level is, the more priority the target service is scheduled with downlink 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 inverse of the service priority level (hereinafter referred to as "initial priority parameter").

[0116] At the same time, considering that the transmission duration corresponds to the service waiting duration of the user obtaining the service, therefore, the ratio of the average transmission duration of the downlink service data of the service in the preset historical time period, that is, the historical transmission duration and the historical data volume, is taken as one of the influence coefficients (hereinafter referred to as "first influence coefficient") of the scheduling priority parameter. When the average transmission duration of the downlink service data of the target service in the preset historical time period is long, it indicates that the user experience of the service terminal in the preset historical time period is poor, at this time, the corresponding first influence coefficient increases, that is, the scheduling priority parameter of the target service in the current scheduling period increases, which can make the service with historical poor experience improve the user experience in the current scheduling period.

[0117] Further, in order to realize the priority scheduling of small packet services, the ratio of the data volume threshold and the target data volume of the target service can be taken as another influence coefficient (hereinafter referred to as "second influence coefficient") of the scheduling priority parameter. In this way, the smaller the target data volume of the target service is, that is, the smaller the traffic of the target service is, the larger the first influence coefficient is. And because the target data volume of the target service is smaller than the data volume threshold, therefore, the first influence coefficient is greater than 1. Therefore, when the target data volume of the target service is smaller than the data volume threshold, the corresponding scheduling priority parameter is greater than the initial priority parameter.

[0118] S602, when the target data volume is greater than or equal to the data volume threshold, the resource scheduling device determines the scheduling priority parameter according to the historical data volume, the historical transmission duration and the service priority level.

[0119] Wherein, the historical data volume, the historical transmission duration, the service priority level and the scheduling priority parameter satisfy the following formula:

[0120]

[0121] 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, the large packet service data is considered. At this time, the product of the initial priority parameter and the first influence coefficient is determined as the scheduling priority parameter. Since the scheduling priority parameter corresponding to the small packet service is also related to the second influence coefficient, the scheduling priority parameter corresponding to the small packet service is greater than the scheduling priority parameter corresponding to the large packet service.

[0122] The technical solutions provided by the above embodiments at least have the following beneficial effects: as can be seen from S601-S602, the embodiments of the present application can provide a method for determining the scheduling priority coefficients corresponding to the small packet service and the large packet service, which can comprehensively consider factors such as service traffic size, and realize reasonable scheduling of downlink resources in a target cell.

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

[0124] S701, the resource scheduling device updates the scheduling priority parameter in a preset scheduling period.

[0125] In an 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.

[0126] The above mainly introduces the solutions provided by the embodiments of the present application from the perspective of methods. In order to realize the above functions, it contains the hardware structure and / or software module corresponding to the execution of each function. 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 in the present text, the present application can be realized in the form of hardware or combination of hardware and computer software. Whether a certain function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solutions. Professional technicians can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0127] The embodiments of the present application can divide the functional modules of the resource scheduling device according to the above method examples. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated in one processing module. The above integrated module can be realized in the form of hardware or in the form of software functional module. Optionally, the division of modules in the embodiments of the present application is illustrative, and is only a logical functional division. When actually implemented, there can be another division manner.

[0128] AsFigure 8 As shown in FIG. 1, a structure schematic diagram of a resource scheduling device provided by an embodiment of the present application is shown. The resource scheduling device can be used to execute the method of resource scheduling shown in FIGS. 2, 3, 4 and 5. Figure 5 Figure 6 Figure 7 Figure 8 The resource scheduling device shown in FIG. 1 includes an acquisition unit 801 and a processing unit 802.

[0129] The acquisition unit 801 is configured to acquire a target data volume, a historical data volume and a historical transmission time length corresponding to a target service to be transmitted; the target data volume is a data volume of downlink data of the target service; the historical data volume is a data volume of historical downlink data transmitted by the target service in a preset historical time period; and the historical transmission time length is a transmission time length corresponding to the historical downlink data.

[0130] The processing unit 802 is configured to determine a scheduling priority parameter corresponding to the target service according to the target data volume, a preset data volume threshold, the historical data volume, the historical transmission time length and a service priority level corresponding to a target terminal, wherein the target terminal is a terminal used to receive the downlink data of the target service.

[0131] The processing unit 802 is further configured to schedule downlink resources for the target service based on the scheduling priority parameter.

[0132] Optionally, the processing unit 802 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 historical data volume, the historical transmission time length and the service priority level; the target data volume, the data volume threshold, the historical data volume, the historical transmission time length, the service priority level and the scheduling priority parameter satisfy the following formula:

[0133]

[0134] Load ij is the target data volume, L 门限 is the data volume threshold, Time ij is the historical transmission time length, Traffic ij is the historical data volume, Pl ij is the service priority level, Pr ij is the scheduling priority parameter.

[0135] When the target data volume is greater than or equal to the data volume threshold, the scheduling priority parameter is determined according to the historical data volume, the historical transmission time length and the service priority level; the historical data volume, the historical transmission time length, the service priority level and the scheduling priority parameter satisfy the following formula:

[0136] When the target data volume is greater than or equal to the data volume threshold, the scheduling priority parameter is determined according to the historical data volume, the historical transmission time length and the service priority level; the historical data volume, the historical transmission time length, the service priority level and the scheduling priority parameter satisfy the following formula:​​

[0137] Optionally, the processing unit 802 is further configured to update the scheduling priority parameter at a preset scheduling period.

[0138] The embodiment of the present application further provides a computer readable storage medium, which comprises computer execution instructions, and 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.

[0139] The embodiment of the present 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.

[0140] Those skilled in the art should understand that the functions described in the one or more examples described above can be realized by hardware, software, firmware or any combination thereof. When realized by software, the 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.

[0141] 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 taken as an example, 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.

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

[0143] In addition, each function unit in each embodiment 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 essentially or the parts that make a contribution to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product, which 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 perform all or part of the steps of the method described in each embodiment of the present application. The foregoing 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.

[0144] 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 volume, a historical data volume and a historical transmission duration corresponding to a target service to be transmitted; the target data volume is a data volume of downlink data of the target service; the historical data volume is a data volume of historical downlink data transmitted by the target service within a preset historical time period; and the historical transmission duration is a transmission duration corresponding to the historical downlink data; when the target data volume is less than a preset data volume threshold, determining a scheduling priority parameter corresponding to the target service according to the target data volume, the data volume threshold, the historical data volume, the historical transmission duration and a service priority level corresponding to a target terminal; the target terminal is a terminal used for receiving downlink data of the target service; the target data volume, the data volume threshold, the historical data volume, the historical transmission duration, the service priority level and the scheduling priority parameter satisfy the following formula: ； the for the target data volume, the for the data volume threshold, the for the historical transmission duration, the for the historical data volume, the for the service priority level, the for the scheduling priority parameter; when the target data volume is greater than or equal to the data volume threshold, determining the scheduling priority parameter according to the historical data volume, the historical transmission duration and the service priority level; the historical data volume, the historical transmission duration, the service priority level and the scheduling priority parameter satisfy the following formula: ； scheduling downlink resources for the target service based on the scheduling priority parameter.

2. 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; the target priority level is higher than other priority levels in the plurality of priority levels.

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

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 volume, a historical data volume and a historical transmission duration corresponding to a target service to be transmitted; the target data volume is a data volume of downlink data of the target service; the historical data volume is a data volume of historical downlink data transmitted by the target service within a preset historical time period; and the historical transmission duration is a transmission duration corresponding to the historical downlink data; the processing unit is configured to, when the target data volume is less than a preset data volume threshold, determine a scheduling priority parameter corresponding to the target service according to the target data volume, the data volume threshold, the historical data volume, the historical transmission duration and a service priority level corresponding to a target terminal; the target terminal is a terminal used for receiving downlink data of the target service; the target data volume, the data volume threshold, the historical data volume, the historical transmission duration, the service priority level and the scheduling priority parameter satisfy the following formula: ； the for the target data volume, the for the data volume threshold, the for the historical transmission duration, the for the historical data volume, the for the service priority level, the for the scheduling priority parameter; the processing unit is further configured to, when the target data volume is greater than or equal to the data volume threshold, determine the scheduling priority parameter according to the historical data volume, the historical transmission duration and the service priority level; the historical data volume, the historical transmission duration, the service priority level and the scheduling priority parameter satisfy the following formula: ； the processing unit is further configured to schedule downlink resources for the target service based on the scheduling priority parameter.

5. 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; and the target priority level is higher than other priority levels in the plurality of priority levels.

6. The resource scheduling apparatus according to claim 4 or 5, characterized by, The processing unit is further configured to: update the scheduling priority parameter in a preset scheduling period.

7. A resource scheduling apparatus, characterized by comprising: The resource scheduling device comprises 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 device is running, the processor executes the computer execution instructions stored in the memory, so that the resource scheduling device executes the resource scheduling method according to any one of claims 1-3.

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

Images