CN115568031A - Resource scheduling method, device and storage medium - Google Patents

Resource scheduling method, device and storage medium Download PDF

Info

Publication number
CN115568031A
CN115568031A CN202211212632.5A CN202211212632A CN115568031A CN 115568031 A CN115568031 A CN 115568031A CN 202211212632 A CN202211212632 A CN 202211212632A CN 115568031 A CN115568031 A CN 115568031A
Authority
CN
China
Prior art keywords
target
service
parameter
scheduling
threshold
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202211212632.5A
Other languages
Chinese (zh)
Inventor
刘英男
仇剑书
李福昌
张涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202211212632.5A priority Critical patent/CN115568031A/en
Publication of CN115568031A publication Critical patent/CN115568031A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • H04W72/1263Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows

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 plurality of target data volumes corresponding to a plurality of services one to one and a plurality of channel state parameters corresponding to a plurality of terminals one to one in a target cell can be obtained, wherein the data volume of downlink service data of the target data volume target service of the target service. Then, the service quantity of which the target data quantity is smaller than the data quantity threshold value in the plurality of services may be determined as the target service quantity, and the scheduling priority parameter corresponding to the target service may be determined according to the resource scheduling parameter. The resource scheduling parameter includes at least one of a target data volume of the target service, a data volume threshold, a target service quantity, a preset service quantity threshold, a channel state parameter of the target terminal, and a service priority level. Subsequently, resources may 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.
Currently, a resource scheduling method used in a communication system mainly applies a Round Robin (RR), a maximum carrier-to-interference ratio (maximum C/I) 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 services and a single service type, and how to reasonably schedule resources in a complex scenario is a problem that needs to be solved at present.
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 plurality of target data volumes corresponding to a plurality of services in a target cell and a plurality of channel state parameters corresponding to a plurality of terminals in the target cell, wherein the target data volume of the target service is the data volume of downlink service data of the target service. The target service is any one of a plurality of services. Then, the service quantity of which the target data quantity is smaller than the preset data quantity threshold value among the plurality of services can be determined as the target service quantity, and the scheduling priority parameter corresponding to the target service is determined according to the resource scheduling parameter. Wherein, the resource scheduling parameter comprises: at least one of a target data volume of the target service, a data volume threshold, a target service number, a preset service number threshold, a channel state parameter of the target terminal, and a service priority level corresponding to the target terminal. The target terminal is a terminal used for receiving downlink service data in the plurality of terminals. Subsequently, resources may be scheduled for the target traffic based on the scheduling priority parameter.
Optionally, when the target data volume of the target service is smaller than the data volume threshold, the resource scheduling parameter includes: target data volume, data volume threshold, target service quantity, service quantity threshold, channel state parameter of target terminal and service priority level of target service; the method for determining the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter comprises the following steps: when the target service quantity is greater than or equal to the service quantity threshold value, determining a scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold value, the target service quantity, the service quantity threshold value, the channel state parameter of the target terminal and the service priority level; the target data volume, data volume threshold, target service quantity, channel state parameter of the target terminal, service quantity threshold, service priority level and scheduling priority parameter of the target service satisfy the following formula:
Figure BDA0003873248020000021
Load ij is a target data volume; the L threshold is a data volume threshold; s. the t Is the target traffic volume; the threshold of S is a threshold of the number of services; q i Channel state parameters of a target terminal; pl ij Is a service priority level; pr (Pr) of ij A scheduling priority parameter;
when the target service quantity is smaller than the service quantity threshold value, determining a scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold value, the channel state parameter of the target terminal and the service priority level; the target data volume, the data volume threshold value, the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter of the target service satisfy the following formulas:
Figure BDA0003873248020000022
optionally, when the target data amount of the target service is greater than or equal to the data amount threshold, the resource scheduling parameter includes: channel state parameters and service priority levels of the target terminal; the method for determining the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter comprises the following steps: determining a scheduling priority parameter according to a channel state parameter and a service priority level of a target terminal; the channel state parameter, the service priority level and the scheduling priority parameter of the target terminal satisfy the following formulas:
Figure BDA0003873248020000023
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; an obtaining unit, configured to obtain multiple target data volumes corresponding to multiple services in a target cell one to one, and multiple channel state parameters corresponding to multiple terminals in the target cell one to one; the target data volume of the target service is the data volume of the downlink service data of the target service; the target service is any one of a plurality of services; the processing unit is used for determining the number of the services of which the target data volume acquired by the acquisition unit is smaller than a preset data volume threshold value from a plurality of services as the target service number; the processing unit is also used for determining a scheduling priority parameter corresponding to the target service according to the resource scheduling parameter; the resource scheduling parameters include: at least one of a target data volume of the target service, a data volume threshold, a target service number, a preset service number threshold, a channel state parameter of the target terminal, and a service priority level corresponding to the target terminal; the target terminal is a terminal used for receiving downlink service data in the plurality of terminals; and the processing unit is also used for scheduling the downlink resources for the target service based on the scheduling priority parameter.
Optionally, when the target data volume of the target service is smaller than the data volume threshold, the resource scheduling parameter includes: target data volume, data volume threshold, target service quantity, service quantity threshold, channel state parameter of target terminal and service priority level of target service; a processing unit, specifically configured to: when the target service quantity is greater than or equal to the service quantity threshold value, determining a scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold value, the target service quantity, the service quantity threshold value, the channel state parameter of the target terminal and the service priority level; the target data volume, data volume threshold, target service quantity, channel state parameter of the target terminal, service quantity threshold, service priority level and scheduling priority parameter of the target service satisfy the following formula:
Figure BDA0003873248020000031
Load ij is a target data volume; the L threshold is a data amount threshold; s. the t Is the target service number; the threshold of S is a threshold of the number of services; q i Channel state parameters of a target terminal; pl ij Is a service priority level; pr (Pr) of ij A scheduling priority parameter;
when the target service quantity is smaller than the service quantity threshold value, determining a scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold value, the channel state parameter of the target terminal and the service priority level; the target data volume, the data volume threshold value, the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter of the target service meet the following formula:
Figure BDA0003873248020000032
optionally, when the target data amount of the target service is greater than or equal to the data amount threshold, the resource scheduling parameter includes: channel state parameters and service priority levels of the target terminal; a processing unit, specifically configured to: determining a scheduling priority parameter according to a channel state parameter and a service priority level of a target terminal; the channel state parameter, the service priority level and the scheduling priority parameter of the target terminal satisfy the following formulas:
Figure BDA0003873248020000033
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 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 comprises computer-executable instructions, which, 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 the present application, the names of the resource scheduling devices do not limit the devices or the functional modules themselves, and in practical implementations, the devices or the functional modules may appear by other names. As long 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 of the above aspects, the present application provides a resource scheduling method, which may first obtain a plurality of target data volumes corresponding to a plurality of services in a target cell one to one, and a plurality of channel state parameters corresponding to a plurality of terminals in the target cell one to one, where the target data volume of the target service is the data volume of downlink service data of the target service. The target service is any one of a plurality of services. Then, the service quantity of which the target data quantity is smaller than the preset data quantity threshold value among the plurality of services can be determined as the target service quantity, and the scheduling priority parameter corresponding to the target service is determined according to the resource scheduling parameter. Wherein, the resource scheduling parameters include: at least one of a target data volume of the target service, a data volume threshold, a target service number, a preset service number threshold, a channel state parameter of the target terminal, and a service priority level corresponding to the target terminal. The target terminal is a terminal used for receiving downlink service data in the plurality of terminals. Subsequently, resources may be scheduled for the target service based on the scheduling priority parameter.
Therefore, in the application, the resource scheduling device can comprehensively consider the data volume of the downlink service and the channel state of the terminal, determine the scheduling priority parameter corresponding to the target service, effectively reduce the total time delay of the user experience of the downlink service of a plurality of terminals in the whole cell, and balance the service experience of the 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 fourth flowchart illustrating a resource scheduling method according to an embodiment of the present application;
fig. 9 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 obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, belong to 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 experience) to feed back 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 uplink 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, i.e. 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
Figure BDA0003873248020000071
Figure BDA0003873248020000081
3. 5G quality of service identifier (5G QoS identifier, 5QI)
The 5QI of a service is a scalar used to index the 5G quality of service (QoS) characteristics. Table 2 is directed to Guaranteed Bit Rate (GBR) services 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 a resource scheduling priority among 5G QoS streams, the parameter is used to distinguish the QoS streams of one service terminal and also used to distinguish the QoS streams of different terminals, and a smaller value of the service priority level indicates a higher 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
Figure BDA0003873248020000082
Figure BDA0003873248020000091
TABLE 3
Figure BDA0003873248020000092
Figure BDA0003873248020000101
4. Channel Quality Indication (CQI)
The Channel Quality Indicator (CQI) is a downlink channel condition that the terminal reports to the base station according to the received quality (SINR) of a downlink reference signal (CSI-RS) transmitted by the base station. The CQI has a value of 0 to 15, and the larger the value, the better the channel quality. Currently, modulation modes supported by downlink data of the 5G-NR standard include Quadrature Phase Shift Keying (QPSK), 16 Quadrature Amplitude Modulation (QAM), 64QAM, and 256QAM. Table 4 gives the indices for reporting CQI based on QPSK, 16QAM and 64QAM and their explanations. Table 5 gives the indices for reporting CQI based on QPSK, 16QAM, 64QAM, and 256QAM and explanations thereof.
TABLE 4
Figure BDA0003873248020000111
TABLE 5
Figure BDA0003873248020000112
Figure BDA0003873248020000121
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 firstly obtain a plurality of target data volumes corresponding to a plurality of services in a target cell one to one and a plurality of channel state parameters corresponding to a plurality of terminals in the target cell one to one, wherein the data volume of downlink service data of the target data volume target service of the target service. The target service is any one of a plurality of services. Then, the service quantity of which the target data quantity is smaller than the preset data quantity threshold value among the plurality of services can be determined as the target service quantity, and the scheduling priority parameter corresponding to the target service is determined according to the resource scheduling parameter. Wherein, the resource scheduling parameter comprises: at least one of a target data volume of the target service, a data volume threshold, a target service number, a preset service number threshold, a channel state parameter of the target terminal, and a service priority level corresponding to the target terminal. The target terminal is a terminal used for receiving downlink service data in the plurality of terminals. Subsequently, resources may be scheduled for the target service based on the scheduling priority parameter.
Therefore, in the application, the resource scheduling device can comprehensively consider the data volume of the downlink service and the channel state of the terminal, determine the scheduling priority parameter corresponding to the target service, effectively reduce the total time delay of the user experience of the downlink service of a plurality of terminals in the whole cell, and balance the service experience of the users corresponding to the plurality of terminals.
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 of wireless communication, and the like. In the embodiment of the present application, the base station may 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).
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 wireless 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 service 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 devices.
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 device, 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 that does not indicate 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 obtains a plurality of target data volumes corresponding to a plurality of services in a target cell one by one and a plurality of channel state parameters corresponding to a plurality of terminals in the target cell one by one.
The target data volume of the target service is the data volume of the downlink service data of the target service, and the target service is any one of the plurality of services.
In an implementation manner, a method for a resource scheduling device to obtain multiple target data volumes corresponding to multiple services in a target cell one to one may include: the resource scheduling device may receive target service data sent by the service sending end, and identify a target data volume.
In an implementation manner, a method for a resource scheduling device to obtain a plurality of channel state parameters corresponding to a plurality of terminals in a target cell one to one may include: the resource scheduling device may receive channel state information reported by any terminal in the target cell, and read a channel state parameter from the channel state information.
S502, the resource scheduling equipment determines the number of the services of which the target data volume is smaller than a preset data volume threshold value in the plurality of services as the target service number.
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.
In an implementation manner, when the target data amount is smaller than a preset data amount threshold, the resource scheduling device may determine the target service as a packet service, and determine the service number of the packet service.
S503, the resource scheduling equipment determines a scheduling priority parameter corresponding to the target service according to the resource scheduling parameter.
Wherein, the resource scheduling parameters include: at least one of a target data volume of the target service, a data volume threshold, a target service number, a preset service number threshold, a channel state parameter of the target terminal, and a service priority level corresponding to the target terminal. The target terminal is a terminal used for receiving the downlink data of the target service in the plurality of terminals.
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 volume of the target service is smaller than the data volume threshold and the target service number is greater than or equal to the service number threshold, the resource scheduling device may determine the scheduling priority parameter according to the target data volume of the target service, the data volume threshold, the target service number, the service number threshold, the channel state parameter of the target terminal, and the service priority level.
When the target data volume of the target service is smaller than the data volume threshold and the target service volume is smaller than the service volume threshold, the resource scheduling device may determine the scheduling priority parameter according to the target data volume of the target service, the data volume threshold, the channel state parameter of the target terminal, and the service priority level.
When the target data volume of the target service is greater than or equal to the data volume threshold, the resource scheduling device may determine the scheduling priority parameter according to the channel state parameter of the target terminal 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.
S504, the resource scheduling device schedules downlink resources 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 downlink resources for the downlink buffer queue of each service according to a plurality of scheduling priority parameters corresponding to a plurality of services in the target cell one to one, in order from large to small of the scheduling priority parameters, that is, preferentially schedule the downlink resources for the services with large values of the scheduling priority parameters.
The technical scheme provided by the embodiment at least has the following beneficial effects: as can be seen from S501-S504, a plurality of target data volumes corresponding to a plurality of services in a target cell and a plurality of channel state parameters corresponding to a plurality of terminals in the target cell may be obtained, where the target data volumes of the target services are data volumes of downlink service data of the target services. The target service is any one of a plurality of services. Then, the service quantity of which the target data quantity is smaller than the preset data quantity threshold value among the plurality of services can be determined as the target service quantity, and the scheduling priority parameter corresponding to the target service is determined according to the resource scheduling parameter. Wherein, the resource scheduling parameter comprises: at least one of a target data amount of the target service, a data amount threshold, a target service amount, a preset service amount threshold, a channel state parameter of the target terminal, and a service priority level corresponding to the target terminal. The target terminal is a terminal used for receiving downlink service data in the plurality of terminals. Subsequently, resources may be scheduled for the target service based on the scheduling priority parameter.
Therefore, in the application, the resource scheduling device can comprehensively consider the data volume of the downlink service and the channel state of the terminal, determine the scheduling priority parameter corresponding to the target service, effectively reduce the total time delay of the user experience of the downlink service of a plurality of terminals in the whole cell, and balance the service experience of the users corresponding to the plurality of terminals.
In an optional embodiment, when the target data amount of the target service is smaller than the data amount threshold, the resource scheduling parameter includes: target data volume of the target service, data volume threshold, target service number, service number threshold, channel state parameter of the target terminal and service priority level. In this case, with reference to fig. 5 and as shown in fig. 6, in S503, the method for the resource scheduling device to determine the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter includes:
s601, when the target service quantity is larger than or equal to the service quantity threshold, the resource scheduling equipment determines a scheduling priority parameter according to the target data quantity, the data quantity threshold, the target service quantity, the service quantity threshold, the channel state parameter of the target terminal and the service priority level of the target service.
The target data volume, the data volume threshold, the target service number, the service number threshold, the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter of the target service satisfy the following formulas:
Figure BDA0003873248020000171
Load ij is a target data amount, the L threshold is a data amount threshold, S t For a target traffic number, the S threshold is the traffic number threshold, Q i Is the channel state parameter, pl, of the target terminal 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 channel states corresponding to different terminals are different, when the channel state corresponding to the target terminal is better, that is, the channel state parameter corresponding to the target terminal is larger, the time delay for receiving downlink service data is shorter, so that downlink resources can be preferentially scheduled for the service corresponding to the terminal with the larger channel state parameter. The channel state parameter is used as one influence coefficient (hereinafter referred to as "first influence coefficient") of the scheduling priority parameter.
In addition, in order to realize the priority of scheduling resources for the packet traffic, a ratio of the data amount threshold to the target data amount of the target traffic may be used as another influence coefficient (hereinafter referred to as "second influence coefficient") of the scheduling priority parameter. Thus, the second influence coefficient is larger as the target data amount of the target traffic is smaller, that is, the traffic flow is smaller. And because the target data volume of the packet service is smaller than the data volume threshold, the second 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.
Further, when the number of the target services is greater than or equal to the threshold of the number of the services, it indicates that the number of the services of the small packet service in the target cell is large, and at this time, if the scheduling priority parameter of the small packet service is increased, the scheduling sequence of the large packet service is delayed, the waiting time is too long, and the user experience is affected. Therefore, when the target traffic amount is greater than or equal to the traffic amount threshold, the scheduling priority parameter of the packet traffic is appropriately decreased. Based on this, the ratio of the traffic number threshold to the target traffic number may be used as a further influence coefficient (hereinafter referred to as "third influence coefficient") of the scheduling priority parameter. Thus, when the number of the target services is larger, the third influence coefficient is smaller, and the corresponding scheduling priority parameter is smaller.
It should be noted that, when the threshold of the number of services is higher, the event triggering the adjustment of the scheduling priority parameter of the packet service is later. For example, the traffic number threshold may take the value 300.
S602, when the target service quantity is smaller than the service quantity threshold, the resource scheduling equipment determines a scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold, the channel state parameter of the target terminal and the service priority level.
The target data volume, the data volume threshold value, the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter of the target service meet the following formula:
Figure BDA0003873248020000181
in conjunction with the description of S601, when the target service number is smaller than the service number threshold, it indicates that the service number of the packet service in the target cell is smaller, and at this time, downlink resources may be preferentially scheduled for the packet service. Therefore, in this case, the scheduling priority parameter may be a product of the initial priority parameter and the first and second influence coefficients.
The technical scheme provided by the embodiment at least has the following beneficial effects: from S601-S602, when the target service is a packet service, the scheduling priority coefficient of the target service may be increased in the embodiment of the present application. In addition, when the number of the services of the small packet service in the target cell is large, the scheduling priority coefficient of the target service can be properly reduced, so that the user experience of the large packet service data is ensured. Therefore, the embodiment of the application can comprehensively consider the factors such as the size of the service flow, the number of the services and the like, and realize the reasonable scheduling of the downlink resources in the target cell.
In an optional embodiment, when the target data amount of the target service is greater than or equal to the data amount threshold, the resource scheduling parameter includes: channel state parameters and service priority level of the target terminal. In this case, referring to fig. 6, as shown in fig. 7, in S503, the method for determining, by the resource scheduling device, the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter includes:
s701, the resource scheduling equipment determines a scheduling priority parameter according to the channel state parameter and the service priority level of the target terminal.
The channel state parameter, the service priority level and the scheduling priority parameter of the target terminal satisfy the following formulas:
Figure BDA0003873248020000191
it is to be understood that when the target amount of data is greater than or equal to the data amount threshold, the target traffic is considered to be large packet traffic. At this time, the product of the initial priority parameter and the first influence coefficient may be determined as the scheduling priority parameter, taking into account only the data volume and the channel state of the downlink service to be transmitted. Because the scheduling priority parameter corresponding to the small packet service is also related to the second influence coefficient and/or the third influence coefficient, when the number of the small packet service is small, the scheduling priority parameter corresponding to the small packet service is larger than the scheduling priority parameter corresponding to the large packet service. When the number of the small packet services is large, the scheduling priority parameter corresponding to the small packet service may also be smaller 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: as can be seen from S701, when the target service is a big packet service, the embodiment of the present application may provide a method for determining a scheduling priority coefficient of the target service. Therefore, the embodiment of the application can comprehensively consider the factors such as the size of the service flow, the number of the services and the like, and realize the reasonable scheduling of the downlink resources in the target cell.
In an alternative embodiment, referring to fig. 5, as shown in fig. 8, the resource scheduling method further includes:
s801, the resource scheduling device 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. In order to implement the above functions, it includes a hardware structure and/or a software module for performing each function. 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. 9 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 method of resource scheduling shown in fig. 5, 6, 7 and 8. The resource scheduling apparatus shown in fig. 9 includes: an acquisition unit 901 and a processing unit 902.
An obtaining unit 901, configured to obtain multiple target data amounts corresponding to multiple services in a target cell one to one, and multiple channel state parameters corresponding to multiple terminals in the target cell one to one; the target data volume of the target service is the data volume of the downlink service data of the target service; the target service is any one of a plurality of services.
The processing unit 902 is configured to determine, as the target traffic quantity, the traffic quantity whose target data quantity acquired by the acquisition unit 901 is smaller than a preset data quantity threshold, among the multiple services.
The processing unit 902 is further configured to determine a scheduling priority parameter corresponding to the target service according to the resource scheduling parameter; the resource scheduling parameters include: at least one of a target data volume of the target service, a data volume threshold, a target service number, a preset service number threshold, a channel state parameter of the target terminal, and a service priority level corresponding to the target terminal; the target terminal is a terminal used for receiving downlink service data in the plurality of terminals.
The processing unit 902 is further configured to schedule downlink resources for the target service based on the scheduling priority parameter.
Optionally, when the target data volume of the target service is smaller than the data volume threshold, the resource scheduling parameter includes: target data volume, data volume threshold, target service quantity, service quantity threshold, channel state parameter of target terminal and service priority level of target service; the processing unit 902 is specifically configured to: when the target service quantity is greater than or equal to the service quantity threshold, determining a scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold, the target service quantity, the service quantity threshold, the channel state parameter of the target terminal and the service priority level; the target data volume, data volume threshold, target service quantity, channel state parameter of the target terminal, service quantity threshold, service priority level and scheduling priority parameter of the target service satisfy the following formula:
Figure BDA0003873248020000201
Load ij is a target data volume; the L threshold is a data amount threshold; s t Is the target service number; the threshold of S is a threshold of the number of services; q i Channel state parameters of a target terminal; pl ij Is a service priority level; pr (Pr) of ij A scheduling priority parameter;
when the target service quantity is smaller than the service quantity threshold value, determining a scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold value, the channel state parameter of the target terminal and the service priority level; the target data volume, the data volume threshold value, the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter of the target service meet the following formula:
Figure BDA0003873248020000211
optionally, when the target data amount of the target service is greater than or equal to the data amount threshold, the resource scheduling parameter includes: channel state parameters and service priority levels of the target terminal; the processing unit 902 is specifically configured to: determining a scheduling priority parameter according to a channel state parameter and a service priority level of a target terminal; the channel state parameter, the service priority level and the scheduling priority parameter of the target terminal satisfy the following formulas:
Figure BDA0003873248020000212
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 embodiment of the present application further provides a computer program, where the computer program may be directly loaded into the 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 by the foregoing embodiment.
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 as a software functional unit and sold or used as a separate 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 embodiments 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 also within 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 (12)

1. A method for scheduling resources, comprising:
acquiring a plurality of target data volumes corresponding to a plurality of services in a target cell one to one and a plurality of channel state parameters corresponding to a plurality of terminals in the target cell one to one; the target data volume of the target service is the data volume of the downlink service data of the target service; the target service is any one of the plurality of services;
determining the service quantity of which the target data quantity is smaller than a preset data quantity threshold value in the plurality of services as the target service quantity;
determining a scheduling priority parameter corresponding to the target service according to the resource scheduling parameter; the resource scheduling parameters include: at least one of a target data volume of the target service, the data volume threshold, the target service number, a preset service number threshold, a channel state parameter of a target terminal, and a service priority level corresponding to the target terminal; the target terminal is a terminal used for receiving the downlink service data in the plurality of terminals;
and scheduling downlink resources for the target service based on the scheduling priority parameter.
2. The method according to claim 1, wherein when the target data amount of the target service is smaller than the data amount threshold, the resource scheduling parameter comprises: a target data volume of the target service, the data volume threshold, the target service number, the service number threshold, a channel state parameter of the target terminal, and the service priority level;
the determining a scheduling priority parameter corresponding to the target service according to the resource scheduling parameter includes:
when the target service quantity is greater than or equal to the service quantity threshold value, determining the scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold value, the target service quantity, the service quantity threshold value, the channel state parameter of the target terminal and the service priority level; the target data volume of the target service, the data volume threshold, the target service number, the channel state parameter of the target terminal, the service number threshold, the service priority level, and the scheduling priority parameter satisfy the following formulas:
Figure FDA0003873248010000011
the Load is ij Is the target data volume; said L Threshold (THD) Is the data volume threshold; said S t The target service quantity is obtained; said S Threshold (THD) Is the traffic quantity threshold; said Q i The channel state parameter of the target terminal is obtained; the Pl ij Is the service priority level; the Pr ij Is the scheduling priority parameter;
when the target service quantity is smaller than the service quantity threshold value, determining the scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold value, the channel state parameter of the target terminal and the service priority level; the target data volume of the target service, the data volume threshold, the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter satisfy the following formula:
Figure FDA0003873248010000021
3. the method according to claim 2, wherein when the target data amount of the target service is greater than or equal to the data amount threshold, the resource scheduling parameter comprises: the channel state parameter of the target terminal and the service priority level;
the determining a scheduling priority parameter corresponding to the target service according to the resource scheduling parameter includes:
determining the scheduling priority parameter according to the channel state parameter of the target terminal and the service priority level; the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter satisfy the following formulas:
Figure FDA0003873248010000022
4. the method according to any of claims 1-3, wherein the service priority level is a target priority level of 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.
5. The method for scheduling resources according to claim 1, further comprising:
and updating the scheduling priority parameter in a preset scheduling period.
6. A resource scheduling apparatus, comprising: an acquisition unit and a processing unit;
the acquiring unit is configured to acquire a plurality of target data volumes corresponding to a plurality of services in a target cell one to one, and a plurality of channel state parameters corresponding to a plurality of terminals in the target cell one to one; the target data volume of the target service is the data volume of the downlink service data of the target service; the target service is any one of the plurality of services;
the processing unit is configured to determine, as the target service quantity, a service quantity in the plurality of services for which the target data quantity acquired by the acquisition unit is smaller than a preset data quantity threshold;
the processing unit is further configured to determine a scheduling priority parameter corresponding to the target service according to the resource scheduling parameter; the resource scheduling parameters include: at least one of a target data volume of the target service, the data volume threshold, the target service number, a preset service number threshold, a channel state parameter of a target terminal, and a service priority level corresponding to the target terminal; the target terminal is a terminal used for receiving the downlink service data in the plurality of terminals;
the processing unit is further configured to schedule downlink resources for the target service based on the scheduling priority parameter.
7. The apparatus for resource scheduling according to claim 6, wherein when the target data amount of the target service is smaller than the data amount threshold, the resource scheduling parameter comprises: a target data volume of the target service, the data volume threshold, the target service number, the service number threshold, a channel state parameter of the target terminal, and the service priority level;
the processing unit is specifically configured to:
when the target service quantity is greater than or equal to the service quantity threshold value, determining the scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold value, the target service quantity, the service quantity threshold value, the channel state parameter of the target terminal and the service priority level; the target data volume of the target service, the data volume threshold, the target service number, the channel state parameter of the target terminal, the service number threshold, the service priority level and the scheduling priority parameter satisfy the following formulas:
Figure FDA0003873248010000031
the Load is ij Is the target data volume; said L Threshold (THD) Is the data volume threshold; said S t The target service quantity is obtained; said S Threshold (THD) Is the traffic quantity threshold; said Q i The channel state parameter of the target terminal is obtained; the Pl ij Is the service priority level; the Pr ij Is the scheduling priority parameter;
when the target service quantity is smaller than the service quantity threshold value, determining the scheduling priority parameter according to the target data quantity of the target service, the data quantity threshold value, the channel state parameter of the target terminal and the service priority level; the target data volume of the target service, the data volume threshold, the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter satisfy the following formula:
Figure FDA0003873248010000032
8. the apparatus for resource scheduling according to claim 7, wherein when the target data amount of the target service is greater than or equal to the data amount threshold, the resource scheduling parameter comprises: the channel state parameter of the target terminal and the service priority level;
the processing unit is specifically configured to:
determining the scheduling priority parameter according to the channel state parameter of the target terminal and the service priority level; the channel state parameter, the service priority level and the scheduling priority parameter of the target terminal satisfy the following formulas:
Figure FDA0003873248010000033
9. the apparatus according to any of claims 6-8, wherein the traffic 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.
10. The apparatus as claimed in claim 6, wherein the processing unit is further configured to:
and updating the scheduling priority parameter in a preset scheduling period.
11. 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-5.
12. 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-5.
CN202211212632.5A 2022-09-29 2022-09-29 Resource scheduling method, device and storage medium Pending CN115568031A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211212632.5A CN115568031A (en) 2022-09-29 2022-09-29 Resource scheduling method, device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211212632.5A CN115568031A (en) 2022-09-29 2022-09-29 Resource scheduling method, device and storage medium

Publications (1)

Publication Number Publication Date
CN115568031A true CN115568031A (en) 2023-01-03

Family

ID=84744526

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211212632.5A Pending CN115568031A (en) 2022-09-29 2022-09-29 Resource scheduling method, device and storage medium

Country Status (1)

Country Link
CN (1) CN115568031A (en)

Similar Documents

Publication Publication Date Title
US10887072B2 (en) Methods and apparatus for adjusting a carrier aggregation operation in a wireless communication system
CN111092640B (en) Method and device used in user equipment and base station for wireless communication
WO2020057375A1 (en) Resource allocation method and communication device
CN115568027A (en) Resource scheduling method, device and storage medium
CN115665879A (en) Resource scheduling method, device and storage medium
WO2013000242A1 (en) Resource allocation method and device
US11102695B2 (en) Beam avoidance method and base station
US10469135B2 (en) Transmission control methods and transmission control apparatus
CN115037342B (en) UE pairing method, device and storage medium
CN114257331A (en) Scheduling method, device and storage medium of satellite communication system
WO2020227913A1 (en) Method and apparatus for beam management
CN115955443B (en) Resource scheduling method, device and storage medium
CN115568031A (en) Resource scheduling method, device and storage medium
CN115568030A (en) Resource scheduling method, device and storage medium
CN115568029A (en) Resource scheduling method, device and storage medium
CN115568026A (en) Resource scheduling method, device and storage medium
CN115955443A (en) Resource scheduling method, device and storage medium
CN115568028A (en) Resource scheduling method, device and storage medium
US11742904B2 (en) Method and apparatus for multi-user multi-antenna transmission
CN114157328A (en) Channel feedback method and device
CN115119282B (en) UE pairing method, device and storage medium
WO2023207668A1 (en) Method for transmitting physical uplink shared channel, and device and storage medium
WO2023185987A1 (en) Transmission processing method, network device, terminal, apparatus and storage medium
CN115333681B (en) Information transmission method, device and storage medium
WO2023207782A1 (en) Communication method and communication apparatus

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination