CN115568029A

CN115568029A - Resource scheduling method, device and storage medium

Info

Publication number: CN115568029A
Application number: CN202211202669.XA
Authority: CN
Inventors: 刘英男; 仇剑书; 张涛; 李福昌
Original assignee: China United Network Communications Group Co Ltd
Current assignee: China United Network Communications Group Co Ltd
Priority date: 2022-09-29
Filing date: 2022-09-29
Publication date: 2023-01-03

Abstract

A resource scheduling method, a resource scheduling device and a storage medium relate to the technical field of communication and are used for solving the problem of how to reasonably schedule resources in a complex scene. The method comprises the following steps: first, a target data volume, a historical data volume and a historical transmission time length corresponding to a target service to be transmitted can be obtained. 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 downlink data. Then, a scheduling priority parameter corresponding to the target service may be determined according to the target data amount, a preset data amount threshold, a historical data amount, a historical transmission duration, and a service priority level corresponding to the target terminal. The target terminal is a terminal for receiving downlink data of the target service. Subsequently, downlink resources can be scheduled for the target service based on the scheduling priority parameter.

Description

Resource scheduling method, device and storage medium

Technical Field

The present application relates to the field of communications technologies, and in particular, to a resource scheduling method, apparatus, and storage medium.

Background

With the development of wireless communication technology, a base station may implement resource scheduling for multiple terminals through a large-scale (massive) multiple-input multiple-output (MIMO) antenna technology.

The resource scheduling method used in the current communication system mainly applies a Round Robin (RR), a maximum carrier-to-interference ratio (maximum C/I) algorithm and a proportional fair (proportional fair) algorithm. However, the above algorithm is only applicable to a simple scenario, such as a cell with a small number of terminals, and how to reasonably schedule resources in a complex scenario is a problem that needs to be solved at present.

Disclosure of Invention

The application provides a resource scheduling method, a resource scheduling device and a storage medium, which are used for solving the problem of how to reasonably schedule resources in a complex scene.

In order to achieve the purpose, the technical scheme is as follows:

in a first aspect, a resource scheduling method is provided, including: first, a target data volume, a historical data volume and a historical transmission time length corresponding to a target service to be transmitted can be obtained. 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 downlink data. Then, a scheduling priority parameter corresponding to the target service may be determined according to the target data amount, a preset data amount threshold, a historical data amount, a historical transmission duration, and a service priority level corresponding to the target terminal. The target terminal is a terminal for receiving downlink data of the target service. Subsequently, downlink resources can be scheduled for the target service based on the scheduling priority parameter.

Optionally, the method for determining the scheduling priority parameter corresponding to the target service according to the target data size, the preset data size threshold, the historical data size, the historical transmission duration, and the service priority level corresponding to the target terminal includes: when the target data volume is smaller than the data volume threshold, determining a scheduling priority parameter according to the target data volume, the data volume threshold, the historical data volume, the historical transmission time and the service priority level; the target data volume, the data volume threshold, the historical data volume, the historical transmission time, the service priority level and the scheduling priority parameter satisfy the following formula:

Load _ij is a target amount of data, L _{Threshold (THRESH)} As a data amount threshold, time _ij For historical transmission duration, traffic _ij For historical data volume, pl _ij Pr as a service priority level _ij A scheduling priority parameter;

when the target data volume is greater than or equal to the data volume threshold, determining a scheduling priority parameter according to the historical data volume, the historical transmission time 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 formulas:

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 of the plurality of priority levels.

Optionally, the resource scheduling method further includes: and updating the scheduling priority parameter in a preset scheduling period.

In a second aspect, an apparatus for scheduling resources is provided, including: an acquisition unit and a processing unit; the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring a target data volume, a historical data volume and historical transmission time corresponding to a target service to be sent; 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 historical downlink data sent by the target service in a preset historical time period; the historical transmission duration is the transmission duration corresponding to the historical downlink data; the processing unit is used for determining 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 and a service priority level corresponding to the target terminal, which are acquired by the acquisition unit; the target terminal is a terminal for receiving downlink data of the target service; and the processing unit is also used for scheduling the downlink resources for the target service based on the scheduling priority parameter.

Optionally, the processing unit is specifically configured to: when the target data volume is smaller than the data volume threshold, determining a scheduling priority parameter according to the target data volume, the data volume threshold, the historical data volume, the historical transmission time and the service priority level; the target data volume, the data volume threshold, the historical data volume, the historical transmission time, the service priority level and the scheduling priority parameter satisfy the following formula:

Load _ij is a target data volume, L _{Threshold (THD)} As a data amount threshold, time _ij For historical transmission duration, traffic _ij For historical data volume, pl _ij Pr as a service priority level _ij A scheduling priority parameter;

Optionally, the processing unit is further configured to: and updating the scheduling priority parameter in a preset scheduling period.

In a third aspect, an apparatus for scheduling resources is provided, which includes a memory and a processor; the memory is used for storing computer execution instructions, and the processor is connected with the memory through a bus; when the resource scheduling apparatus is operating, the processor executes computer-executable instructions stored in the memory to cause the resource scheduling apparatus to perform the resource scheduling method of the first aspect.

The resource scheduling apparatus may be a network device, or may be a part of an apparatus in the network device, such as a system on chip in the network device. The system on chip is configured to support the network device to implement the functions involved in the first aspect and any one of the possible implementations thereof, for example, to obtain, determine, and send data and/or information involved in the resource scheduling method. The chip system includes a chip and may also include other discrete devices or circuit structures.

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.

In a fifth aspect, there is also provided a computer program product comprising computer instructions which, when run on a resource scheduling apparatus, cause the resource scheduling apparatus to perform the resource scheduling method as described in the first aspect above.

It should be noted that all or part of the above computer instructions may be stored on the first computer readable storage medium. The first computer readable storage medium may be packaged together with the processor of the resource scheduling apparatus, or may be packaged separately from the processor of the resource scheduling apparatus, which is not limited in this application.

For the descriptions of the second, third, fourth and fifth aspects in this application, reference may be made to the detailed description of the first aspect; in addition, for the beneficial effects of the second aspect, the third aspect, the fourth aspect and the fifth aspect, reference may be made to the beneficial effect analysis of the first aspect, and details are not repeated here.

In this application, the names of the resource scheduling apparatuses do not limit the devices or the functional modules themselves, and in actual implementation, the devices or the functional modules may appear by other names. Insofar as the functions of the respective devices or functional modules are similar to those of the present application, they fall within the scope of the claims of the present application and their equivalents.

These and other aspects of the present application will be more readily apparent from the following description.

The technical scheme provided by the application at least brings the following beneficial effects:

based on any one of the above aspects, the present application provides a resource scheduling method, which may first obtain 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 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 downlink data. Then, a scheduling priority parameter corresponding to the target service may be determined according to the target data amount, a preset data amount threshold, a historical data amount, a historical transmission duration, and a service priority level corresponding to the target terminal. The target terminal is a terminal for receiving downlink data of the target service. Subsequently, downlink resources can be scheduled for the target service based on the scheduling priority parameter.

Therefore, in the application, the resource scheduling device can represent the user experience through the transmission duration, determine the scheduling priority parameter corresponding to the target service more accurately, effectively reduce the total user experience time delay of the downlink services of a plurality of terminals in the whole cell, and balance the service experience of users corresponding to the plurality of terminals.

Drawings

Fig. 1 is a schematic structural diagram of a resource scheduling system according to an embodiment of the present application;

fig. 2 is a schematic structural diagram of a resource scheduling device according to an embodiment of the present application;

fig. 3 is a first hardware structure diagram of a resource scheduling apparatus according to an embodiment of the present disclosure;

fig. 4 is a schematic hardware structure diagram of a resource scheduling apparatus according to an embodiment of the present application;

fig. 5 is a first flowchart illustrating a resource scheduling method according to an embodiment of the present application;

fig. 6 is a flowchart illustrating a second method for scheduling resources according to an embodiment of the present application;

fig. 7 is a third flowchart illustrating a resource scheduling method according to an embodiment of the present application;

fig. 8 is a schematic structural diagram of a resource scheduling apparatus according to an embodiment of the present application.

Detailed Description

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

It should be noted that in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design described herein as "exemplary" or "e.g.," is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.

For the convenience of clearly describing the technical solutions of the embodiments of the present application, in the embodiments of the present application, the terms "first" and "second" are used to distinguish the same items or similar items with basically the same functions and actions, and those skilled in the art can understand that the terms "first" and "second" are not used to limit the quantity and execution order.

To facilitate an understanding of the present application, the relevant elements referred to in the present application will now be described.

1. Large-scale (massive) multiple-input-multiple-output (MIMO) antenna technology

With the evolution and development of wireless communication technology, the new air interface (NR) of the fifth generation mobile communication technology (5 g) has flexibility and supports larger bandwidth, and the Massive MIMO technology brings the wireless air interface performance to be improved to a key technology. The development of large-scale antenna technology makes a larger number of antennas become a key for improving channel capacity, for example, 32tr and 64tr become conventional configurations of 5G Time Division Duplexing (TDD) outdoor macro stations, and a downlink channel spatial hierarchy (spatial stream number) of a cell can be 16 layers, even higher to 24 layers. For a small indoor station such as 5G NR, the number of antennas supported by a single miniature radio remote unit (pRRU) is usually 4 at most, and by using a distributed MIMO technology, multiple antennas of adjacent prrus may form a MIMO cell, so as to form a cell with 16 or more antennas, thus enabling the Massive MIMO technology to be applied to a digital indoor subsystem. However, the current terminal antenna is limited by that the size and processing capability of the terminal can only achieve 4TR, and in order to fully utilize the downlink spatial multi-stream characteristics of the cell, it is necessary to implement a higher transmission rate of the cell by using a multi-user MIMO (MU-MIMO) technology in multi-user pairing.

In the Massive MIMO technology, uplink scheduling and downlink scheduling at a base station side are greatly different, and an independent data buffer queue can be established at the downlink base station side for different service types of each user, so that the data volume of each queue can be easily obtained. In order to save system resources consumed by reporting the data volume of each service buffer by the UE, different QCI services need to be mapped to corresponding logical channel groups, the data volume buffered by the UE is reported according to the logical channel groups, an evolved Node B (eNodeB) supports 4 logical channel groups, and a 5G base station (the next generation Node B, gNB) supports the reporting of 8 logical channel groups at the maximum.

2. Channel State Information (CSI)

In the field of wireless communications, so-called channel state information is the channel properties of a communication link. It describes the fading factor of the signal on each transmission path, i.e. the value of each element in the channel gain matrix H, such as signal Scattering (Scattering), fading or fading, distance fading (power fading) and other information. The CSI may adapt the communication system to the current channel conditions, providing a guarantee for high reliability and high rate communication in a multi-antenna system.

CSI is channel state information used by a terminal UE (user equipment) to feedback channel quality to a gNB, and since TDD system channels have reciprocity in uplink and downlink, the gNB selects an appropriate Modulation and Coding Scheme (MCS) for transmission of downlink data, and reduces a block error rate (BLER) of data transmission, which is composed of a Channel Quality Indicator (CQI), a Precoding Matrix Indicator (PMI), a CSI reference signal resource indicator (CSI-RS resource indicator (CRI), an SSB resource indicator (SS/PBCH block resource indicator, SSBRI), a layer indicator (layer indicator, LI), a Rank Indicator (RI), a layer 1reference signal received power (layer 1-received power, lrp).

After reporting the CSI measurement result of the cell, the UE determines the rank (rank) used for transmitting the user data, that is, the number of layers or streams to be transmitted, according to the RI reported by the UE. When the base station side transmits the user plane cache data, the MCS used when the user data is transmitted is determined according to the CQI reported by the UE. As shown in table 1, an index table of MCS is defined in detail in Technical Specification (TS) 38.214 of the third generation partnership project (3 gpp).

TABLE 1

3. 5G quality of service identifier (5G QoS identifier, 5QI)

The 5QI of a service is a scalar used to index the quality of service (QoS) characteristics of the 5G. Table 2 is directed to Guaranteed Bit Rate (GBR) traffic with rate guarantee requirements. Table 3 describes Non-GBR traffic without rate guarantee requirements. There is a standardized 5QI mapping relationship in the 3gpp ts23.501 protocol.

In the 5G QoS characteristics, the priority level indicates the resource scheduling priority among 5G QoS flows, the parameter is used to distinguish the QoS flows of one service terminal and also used to distinguish the QoS flows of different terminals, and 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, and indicates whether the service rate guarantee needs to be provided, the guaranteed rate information of GBR service, and the packet delay budget of each service, which is a service guarantee indicator for the service delay requirement.

TABLE 2

TABLE 3

As shown in the background art, currently, it is a problem that needs to be solved urgently to reasonably schedule resources in a complex scene.

The embodiment of the application provides a resource scheduling method, which can first obtain a target data volume, a historical data volume and a historical transmission time corresponding to a target service to be sent. 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 downlink data. Then, a scheduling priority parameter corresponding to the target service may be determined according to the target data amount, a preset data amount threshold, a historical data amount, a historical transmission duration, and a service priority level corresponding to the target terminal. The target terminal is a terminal for receiving downlink data of the target service. Subsequently, downlink resources can be scheduled for the target service based on the scheduling priority parameter.

The resource scheduling method is suitable for a resource scheduling system. Fig. 1 shows a schematic structural diagram of a resource scheduling system. As shown in fig. 1, the resource scheduling system includes: a resource scheduling device 101 and a plurality of terminals (including a target terminal 102).

The resource scheduling apparatus 101 is connected to a plurality of terminals, respectively.

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

In one embodiment, the resource scheduling apparatus 101 in fig. 1 may be a base station or a base station controller, etc. for wireless communication. In the embodiment of the present application, the base station may be a Base Transceiver 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), an internet of things (IoT) or a narrowband internet of things (eNB), a future 5G mobile communication network or a future evolved Public Land Mobile Network (PLMN).

In another embodiment, the resource scheduling device 101 may also be one server in a server cluster (composed of a plurality of servers), a chip in the server, or a system on chip in the server, or may implement cloud deployment by a Virtual Machine (VM) deployed on the server, which is not limited in this embodiment of the present application.

The terminal in fig. 1 may refer to a device that provides voice and/or data connectivity to a user, a handheld device having wireless connection capability, or other processing device connected to a wireless modem. A wireless terminal may communicate with one or more core networks via a Radio Access Network (RAN). The wireless terminals may be mobile terminals such as mobile phones (or "cellular" phones) and computers with mobile terminals, as well as portable, pocket, hand-held, computer-included, or vehicle-mounted mobile devices that exchange language and/or data with a radio access network, such as cell phones, tablets, laptops, netbooks, personal Digital Assistants (PDAs).

In one embodiment, as shown in fig. 2, the resource scheduling apparatus 101 in fig. 1 may include: an information acquisition module 201 and a resource scheduling module 202.

The information acquisition module 201 is configured to acquire data characteristic information of multiple terminals in a cell and channel characteristic information of a logical channel.

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

It should be noted that the resource scheduling apparatus 101 and the target terminal 102 may be referred to as electronic apparatuses.

Referring to fig. 1, a resource scheduling apparatus 101 and a target terminal 102 in a resource scheduling system each include elements included in the communication device shown in fig. 3 or fig. 4. The hardware configurations of the resource scheduling apparatus 101 and the target terminal 102 will be described below by taking the communication device shown in fig. 3 and 4 as an example.

Fig. 3 is a schematic diagram of a hardware structure of a communication device according to an embodiment of the present disclosure. The communication device comprises a processor 21, a memory 22, a communication interface 23, a bus 24. The processor 21, the memory 22 and the communication interface 23 may be connected by a bus 24.

The processor 21 is a control center of the communication apparatus, and may be a single processor or a collective term for a plurality of processing elements. For example, the processor 21 may be a Central Processing Unit (CPU), other general-purpose processors, or the like. Wherein a general purpose processor may be a microprocessor or any conventional processor or the like.

For one embodiment, processor 21 may include one or more CPUs, such as CPU 0 and CPU 1 shown in FIG. 3.

The memory 22 may be, but is not limited to, a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that may 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.

In a possible implementation, the memory 22 may exist separately from the processor 21, and the memory 22 may be connected to the processor 21 via a bus 24 for storing instructions or program codes. The processor 21, when calling and executing the instructions or program codes stored in the memory 22, can implement the resource scheduling method provided by the following embodiments of the present invention.

In another possible implementation, the memory 22 may also be integrated with the processor 21.

The communication interface 23 is used for connecting the communication device with other devices through a communication network, which may be an ethernet, a radio access network, a Wireless Local Area Network (WLAN), or the like. The communication interface 23 may include a receiving unit for receiving data, and a transmitting unit for transmitting data.

The bus 24 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an extended ISA (enhanced industry standard architecture) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 3, but this does not mean only one bus or one type of bus.

Fig. 4 shows another hardware configuration of the communication apparatus in the embodiment of the present invention. As shown in fig. 4, the communication device may include a processor 31 and a communication interface 32. The processor 31 is coupled to a communication interface 32.

The function of the processor 31 can refer to the description of the processor 21 above. The processor 31 also has a memory function and can function as the memory 22.

The communication interface 32 is used to provide data to the processor 31. The communication interface 32 may be an internal interface of the communication device, or may be an external interface (corresponding to the communication interface 23) of the communication device.

It is noted that the configuration shown in fig. 3 (or fig. 4) does not constitute a limitation of the communication apparatus, which may include more or less components than those shown in fig. 3 (or fig. 4), or combine some components, or a different arrangement of components, in addition to the components shown in fig. 3 (or fig. 4).

The resource scheduling method provided by the embodiment of the present application is described in detail below with reference to the accompanying drawings. As shown in fig. 5, the resource scheduling method includes:

s501, the resource scheduling equipment acquires a target data volume, a historical data volume and a historical transmission time length corresponding to a target service to be sent.

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 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 downlink data.

In an implementation manner, a method for a resource scheduling device to obtain a target data volume, a historical data volume, and a historical transmission duration corresponding to a target service to be sent may include: the resource scheduling device may receive target service data sent by the service sending end, and identify a target data volume. In addition, the resource scheduling apparatus may also read the historical data amount and the historical transmission time length from a database for storing the historical transmission information.

S502, the resource scheduling equipment determines 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 and the service priority level corresponding to the target terminal.

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

Optionally, the preset data amount threshold may be a threshold of a data amount of the downlink packet service.

It should be noted that the service data with the target data volume smaller than the preset data volume threshold is regarded as the packet service data. For packet service, scheduling priority parameters of resource scheduling can be improved, and downlink priority scheduling is obtained. The higher the data volume threshold, the greater the amount of packet traffic that can be covered.

It can be understood that, because the downlink service data transmission of the large-traffic packet service requires more resources, the waiting time of the corresponding resource scheduling is longer. Therefore, compared with the waiting time corresponding to the preferential scheduling of the large packet service, the waiting time (namely the buffering delay) of the overall resource scheduling of all the terminals in the range of the target cell can be reduced under the condition that the small packet service with small flow rate is subjected to the preferential scheduling.

Optionally, the service priority level may be a priority level in a 5QI mapping relationship, and resources are preferentially scheduled to a service with a small value of the priority level.

In an implementation manner, the resource scheduling device may obtain multiple priority levels corresponding to the target terminal, and determine the target priority level as a service priority level corresponding to the target terminal. Wherein the target priority level is higher than other priority levels of the plurality of priority levels.

Illustratively, the target terminal establishes four traffic bearers QCI9, QCI1, QCI5 and QCI69, and the four traffic bearers belong to three logical channel groups, wherein the logical channel groups to which QCI5 and QCI69 belong have the highest priority. As can be seen from the priority levels corresponding to the QCI5 and the QCI69, if the logical channel priority of the QCI5 is the highest in the QCI5 and the QCI69, the QCI5 carries the priority level corresponding to the priority level as the service priority level of the target terminal.

In an implementation manner, when the target data amount of the target terminal is smaller than the data amount threshold, the resource scheduling device may determine the scheduling priority parameter according to the target data amount, the data amount threshold, the historical data amount, the historical transmission duration, and the service priority level.

When the target data amount of the target terminal is smaller than the data amount threshold, the resource scheduling device may determine the scheduling priority parameter according to the historical data amount, the historical transmission duration, and the service priority level.

In an implementation manner, in a preset scheduling period, the resource scheduling device may update the scheduling priority parameter corresponding to the target service.

S503, the resource scheduling equipment schedules the downlink resource for the target service based on the scheduling priority parameter.

Optionally, the downlink resource may include: time domain resources and frequency domain resources in the data transmission process.

In an implementation manner, in a preset scheduling period, the resource scheduling device may schedule the downlink resource according to a plurality of scheduling priority parameters corresponding to a plurality of services in the target cell one to one, and for each service, according to a descending order of the scheduling priority parameters, that is, preferentially schedule the downlink resource for the service with the larger value of the scheduling priority parameter.

The technical scheme provided by the embodiment at least has the following beneficial effects: as can be seen from S501-S503, first, a target data size, a historical data size, and a historical transmission duration corresponding to a target service to be sent may be obtained. 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 downlink data. Then, a scheduling priority parameter corresponding to the target service may be determined according to the target data amount, a preset data amount threshold, a historical data amount, a historical transmission duration, and a service priority level corresponding to the target terminal. The target terminal is a terminal for receiving downlink data of the target service. Subsequently, downlink resources can be scheduled for the target service based on the scheduling priority parameter.

In an alternative embodiment, referring to fig. 5, as shown in fig. 6, in S502, the method for determining, by the resource scheduling device, the scheduling priority parameter corresponding to the target service according to the target data size, the preset data size threshold, the historical data size, the historical transmission time length, and the service priority level corresponding to the target terminal includes:

s601, when the target data volume is smaller than the data volume threshold, the resource scheduling equipment determines a scheduling priority parameter according to the target data volume, the data volume threshold, the historical data volume, the historical transmission time 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:

Load _ij is a target data volume, L _{Threshold (THD)} To threshold the amount of data, time _ij For historical transmission duration, traffic _ij For historical data volume, the Pl _ij Pr as a service priority level _ij Is a scheduling priority parameter.

It can be understood that, since the larger the scheduling priority parameter is, the higher the priority of the target service is to be scheduled for the downlink resource, and the smaller the service priority level is, the higher the priority of the target service is to be scheduled for the downlink resource, the scheduling priority parameter may have an inverse proportional relationship with the service priority level, i.e., the scheduling priority parameter may have a positive correlation with the inverse of the service priority level (hereinafter referred to as "initial priority parameter").

Meanwhile, considering that the transmission duration corresponds to the service waiting duration for the user to acquire the service, the average transmission duration of the downlink service data of the service in the preset historical time period, that is, the ratio of the historical transmission duration to the historical data amount, is used as an influence coefficient (hereinafter referred to as a "first influence coefficient") of the scheduling priority parameter. When the average transmission time of the downlink service data of the target service in the preset historical time period is longer, 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 is increased, that is, the scheduling priority parameter of the target service in the current scheduling period is increased, so that the user experience of the current scheduling period can be improved for the service with poor historical experience.

Further, in order to realize the priority of scheduling resources for the packet service, a ratio of the data amount threshold to the target data amount of the target service may be used as another influence coefficient (hereinafter referred to as a "second influence coefficient") of the scheduling priority parameter. Thus, the first influence coefficient is larger as the target data amount of the target traffic is smaller, that is, the traffic of the target traffic is smaller. And because the target data volume of the target service is smaller than the data volume threshold, the first influence coefficient is larger 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 larger than the initial priority parameter.

S602, when the target data volume is larger than or equal to the data volume threshold, the resource scheduling equipment determines a scheduling priority parameter according to the historical data volume, the historical transmission time and the service priority level.

The historical data volume, the historical transmission time length, the service priority level and the scheduling priority parameter meet the following formula:

in connection 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 may be determined as the scheduling priority parameter. The scheduling priority parameter corresponding to the small packet service is also related to the second influence coefficient, so that the scheduling priority parameter corresponding to the small packet service is larger than the scheduling priority parameter corresponding to the large packet service.

The technical scheme provided by the embodiment at least has the following beneficial effects: it can be known from S601-S602 that the embodiments of the present application can provide a method for determining scheduling priority coefficients corresponding to a small packet service and a large packet service, and can comprehensively consider factors such as traffic flow, so as to implement reasonable scheduling of downlink resources in a target cell.

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

s701, the resource scheduling equipment updates the scheduling priority parameter in a preset scheduling period.

In an implementation manner, the resource scheduling device may update the scheduling priority parameter in each scheduling period, and store resource scheduling information corresponding to each terminal in the historical scheduling period.

The scheme provided by the embodiment of the application is mainly introduced from the perspective of a method. To implement the above functions, it includes hardware structures and/or software modules for performing the respective functions. Those of skill in the art would readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the embodiment of the present application, the resource scheduling apparatus may be divided into the functional modules according to the above method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. Optionally, in the embodiment of the present application, the division of the module is schematic, and is only one logic function division, and another division manner may be provided in actual implementation.

Fig. 8 is a schematic structural diagram of a resource scheduling apparatus according to an embodiment of the present application. The resource scheduling apparatus may be used to perform the methods of resource scheduling shown in fig. 5, 6 and 7. The resource scheduling apparatus shown in fig. 8 includes: an acquisition unit 801 and a processing unit 802.

An obtaining unit 801, configured to obtain a target data amount, a historical data amount, and a historical transmission duration corresponding to a target service to be sent; 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 historical downlink data sent by the target service in a preset historical time period; the historical transmission time length is the transmission time length corresponding to the historical downlink data.

A processing unit 802, configured to determine a scheduling priority parameter corresponding to the target service according to the target data size, a preset data size threshold, a historical data size, a historical transmission duration, and a service priority level corresponding to the target terminal, which are obtained by the obtaining unit 801; the target terminal is a terminal for receiving downlink data of the target service.

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

Optionally, the processing unit 802 is specifically configured to: when the target data volume is smaller than the data volume threshold, determining a scheduling priority parameter according to the target data volume, the data volume threshold, the historical data volume, the historical transmission time and the service priority level; the target data volume, the data volume threshold, the historical data volume, the historical transmission time, the service priority level and the scheduling priority parameter satisfy the following formula:

Load _ij is a target data volume, L _{Threshold (THRESH)} To threshold the amount of data, time _ij For historical transmission duration, traffic _ij For historical data volume, pl _ij For service priority level, pr _ij A scheduling priority parameter;

optionally, the processing unit 802 is further configured to: and updating the scheduling priority parameter in a preset scheduling period.

The embodiment of the present application further provides a computer-readable storage medium, where the computer-readable storage medium includes computer-executable instructions, and when the computer-executable instructions are executed on a computer, the computer is enabled to execute the resource scheduling method provided in the foregoing embodiment.

The embodiments of the present application further provide a computer program, where the computer program may be directly loaded into a memory and contains a software code, and the computer program is loaded and executed by a computer, so as to implement the resource scheduling method provided in the embodiments.

Those skilled in the art will recognize that, in one or more of the examples described above, the functions described in this invention may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer-readable storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.

Through the above description of the embodiments, it is clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to complete all or part of the above described functions.

In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical function division, and there may be other division ways in actual implementation. For example, various elements or components may be combined or may be integrated into another device, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form. Units described as separate parts may or may not be physically separate, and parts displayed as units may be one physical unit or a plurality of physical units, may be located in one place, or may 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 solution of the embodiment.

In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit. The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially or partially contributed to by the general technology, or all or part of the technical solutions may be embodied in the form of a software product, where the software product is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

The above description is only for the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. A method for scheduling resources, comprising:

acquiring a target data volume, a historical data volume and historical transmission time corresponding to a target service to be sent; 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 sent by the target service in a preset historical time period; the historical transmission duration is the transmission duration corresponding to the historical downlink data;

determining 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 and a service priority level corresponding to a target terminal; the target terminal is a terminal for receiving downlink data of the target service;

and scheduling downlink resources for the target service based on the scheduling priority parameter.

2. The method according to claim 1, wherein the determining the scheduling priority parameter corresponding to the target service according to the target data size, a preset data size threshold, the historical data size, the historical transmission duration, and a service priority level corresponding to a target terminal includes:

when the target data volume is smaller 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 and the service priority level; the target data volume, the data volume threshold, the historical data volume, the historical transmission duration, the traffic priority level, and the scheduling priority parameter satisfy the following formulas:

the Load is _ij The target data amount, the L threshold is the data amount threshold, and the Time is _ij For the historical transmission duration, the Traffic _ij For the amount of historical data, the Pl _ij For the service priority level, the Pr _ij Is 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 time 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 formulas:

3. the method according to claim 2, wherein the service priority level is a target priority level among a plurality of priority levels corresponding to the target terminal; the target priority level is higher than other priority levels of the plurality of priority levels.

4. The method for scheduling resources according to any one of claims 1-3, further comprising:

and updating the scheduling priority parameter in a preset scheduling period.

5. A resource scheduling apparatus, comprising: an acquisition unit and a processing unit;

the acquisition unit is used for acquiring a target data volume, a historical data volume and a historical transmission time length corresponding to a target service to be sent; 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 sent by the target service in a preset historical time period; the historical transmission duration is the 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 amount, a preset data amount threshold, the historical data amount, the historical transmission time, and a service priority level corresponding to a target terminal, which are acquired by the acquisition unit; the target terminal is a terminal for receiving 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.

6. The resource scheduling apparatus according to claim 5, wherein the processing unit is specifically configured to:

7. the apparatus according to claim 6, wherein the service priority level is a target priority level among a plurality of priority levels corresponding to the target terminal; the target priority level is higher than other priority levels of the plurality of priority levels.

8. The resource scheduling apparatus according to any of claims 5-7, wherein the processing unit is further configured to:

and updating the scheduling priority parameter in a preset scheduling period.

9. A resource scheduling apparatus, comprising a memory and a processor; the memory is used for storing computer execution instructions, and the processor is connected with the memory through a bus; the processor executes the computer-executable instructions stored by the memory when the resource scheduling apparatus is running to cause the resource scheduling apparatus to perform the resource scheduling method of any one of claims 1-4.

10. A computer-readable storage medium comprising computer-executable instructions that, when executed on a computer, cause the computer to perform the method of resource scheduling of any of claims 1-4.