Resource scheduling method and device and storage medium

By acquiring the service data volume and terminal channel status parameters of the target cell, scheduling priority parameters are determined, solving the problem of unreasonable resource scheduling in complex scenarios and achieving a reduction in total user experience latency and a balance in service experience.

CN115568031BActive Publication Date: 2026-02-06CHINA UNITED NETWORK COMM GRP CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202211212632.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-09-29
Publication Date
2026-02-06
Estimated Expiration
2042-09-29

AI Technical Summary

Technical Problem

Existing resource scheduling methods struggle to allocate resources effectively in complex scenarios, leading to increased overall user latency and an imbalance in business experience.

Method used

By obtaining the service data volume and terminal channel status parameters in the target cell, scheduling priority parameters are determined, and data volume and channel status are comprehensively considered to schedule resources for the target service.

Benefits of technology

It effectively reduced the total latency of downlink services for terminals within the community and balanced the service experience of multiple terminals.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115568031B_ABST
    Figure CN115568031B_ABST
Patent Text Reader

Abstract

A resource scheduling method and device, and a storage medium, relate to the technical field of communication, and are used to solve the problem of how to reasonably schedule resources in a complex scenario. The method comprises the following steps: first, a plurality of target data volumes corresponding to a plurality of services and a plurality of channel state parameters corresponding to a plurality of terminals in a target cell are acquired, wherein the target data volume of a target service is the data volume of downlink service data of the target service. Then, the number of services with a target data volume less than a data volume threshold in the plurality of services is determined as a target service number, and a scheduling priority parameter corresponding to the target service is determined according to a resource scheduling parameter. The resource scheduling parameter comprises at least one of the target data volume of the target service, the data volume threshold, the target service number, a preset service number threshold, the channel state parameter of a target terminal, and a service priority level. Subsequently, resources are scheduled for the target service based on the scheduling priority parameter.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

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

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

[0003] Currently, the resource scheduling method used in the communication system mainly applies a round robin (RR) algorithm, a maximum C / I algorithm and a proportional fair algorithm. However, the above algorithms are only applicable to simple scenarios, for example, a small cell with a small number of services and a single service type, and how to reasonably schedule resources in a complex scenario is a problem to be solved at present. SUMMARY

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

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

[0006] In a first aspect, a resource scheduling method is provided, which includes: first, obtaining 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 a 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. Then, the number of services in the plurality of services whose target data volume is less than a preset data volume threshold is determined as the number of target services, and a scheduling priority parameter corresponding to the target service is determined according to a resource scheduling parameter. The resource scheduling parameter includes at least one of the target data volume of the target service, the data volume threshold, the number of target services, a preset service number threshold, the channel state parameter of the target terminal and the service priority level corresponding to the target terminal. The target terminal is a terminal for receiving downlink service data in the plurality of terminals. Subsequently, the target service is scheduled resources based on the scheduling priority parameter.

[0007] Optionally, when the target data volume of the target service is less than the data volume threshold, the resource scheduling parameter comprises: the target data volume of the target service, the data volume threshold, the target service quantity, the service quantity threshold, the channel state parameter of the target terminal and the service priority level; and the method for determining the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter comprises: when the target service quantity is greater than or equal to the service quantity threshold, determining the scheduling priority parameter according to the target data volume of the target service, the data volume threshold, the target service quantity, the service quantity threshold, the channel state parameter of the target terminal and the service priority level; and the target data volume of the target service, the data volume threshold, the target service quantity, the channel state parameter of the target terminal, the service quantity threshold, the service priority level and the scheduling priority parameter satisfy the following formula:

[0008]

[0009] Load ij is the target data volume; Lth is the data volume threshold; S t is the target service quantity; Sth is the service quantity threshold; Q i is the channel state parameter of the target terminal; Pl ij is the service priority level; Pr ij is the scheduling priority parameter.

[0010] When the target service quantity is less than the service quantity threshold, the scheduling priority parameter is determined 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; and 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:

[0011]

[0012] Optionally, when the target data volume of the target service is greater than or equal to the data volume threshold, the resource scheduling parameter comprises: the channel state parameter of the target terminal and the service priority level; and the method for determining the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter comprises: determining the scheduling priority parameter according to the channel state parameter of the target terminal and the service priority level; and the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter satisfy the following formula:

[0013]

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

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

[0016] In a second aspect, a resource scheduling apparatus is provided, comprising: an obtaining unit and a processing unit; the obtaining unit is configured to obtain a plurality of target data volumes corresponding to a plurality of services respectively, and a plurality of channel state parameters corresponding to a plurality of terminals respectively in a target cell; the target data volume of a target service is the data volume of 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 the number of services whose target data volumes obtained by the obtaining unit are less than a preset data volume threshold as the number of target services; the processing unit is further configured to determine a scheduling priority parameter corresponding to the target services according to a resource scheduling parameter; the resource scheduling parameter comprises at least one of the target data volume of the target service, the data volume threshold, the number of target services, a preset service number threshold, the channel state parameter of a target terminal, and a service priority level corresponding to the target terminal; the target terminal is a terminal for receiving downlink service data among the plurality of terminals; the processing unit is further configured to schedule downlink resources for the target services based on the scheduling priority parameter.

[0017] Optionally, when the target data volume of the target service is less than the data volume threshold, the resource scheduling parameter comprises: the target data volume of the target service, the data volume threshold, the number of target services, the service number threshold, the channel state parameter of the target terminal, and the service priority level; the processing unit is specifically configured to: when the number of target services is greater than or equal to the service number threshold, determine the scheduling priority parameter according to the target data volume of the target service, the data volume threshold, the number of target services, the service number threshold, 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 number of target services, the channel state parameter of the target terminal, the service number threshold, the service priority level, and the scheduling priority parameter satisfy the following formula:

[0018]

[0019] Load ij is the target data volume; Lth is the data volume threshold; S t is the number of target services; Sth is the service number threshold; Q i is the channel state parameter of the target terminal; Pl ij is the service priority level; Pr ij is the scheduling priority parameter.

[0020] When the number of target services is less than the service number threshold, the scheduling priority parameter is determined 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; 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:

[0021]

[0022] Optionally, when the target data volume of the target service is greater than or equal to the data volume threshold, the resource scheduling parameter comprises: a channel state parameter of the target terminal and a service priority level; and the processing unit is specifically configured to: determine a scheduling priority parameter according to the channel state parameter of the target terminal and the service priority level; and the channel state parameter of the target terminal, the service priority level and the scheduling priority parameter satisfy the following formula:

[0023]

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

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

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

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

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

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

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

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

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

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

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

[0035] Based on any of the above aspects, the present application provides a resource scheduling method, which can first acquire a plurality of target data amounts 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 amount of the target service is the data amount of the downlink service data of the target service. The target service is any one of the plurality of services. Then, the number of services in the plurality of services whose target data amount is less than a preset data amount threshold value is determined as the number of target services, and a scheduling priority parameter corresponding to the target service is determined according to a resource scheduling parameter. The resource scheduling parameter includes at least one of the target data amount of the target service, the data amount threshold value, the number of target services, a preset service number threshold value, the channel state parameter of the target terminal, and the service priority level corresponding to the target terminal. The target terminal is a terminal in the plurality of terminals for receiving downlink service data. Subsequently, the target service can be scheduled resources based on the scheduling priority parameter.

[0036] In this way, the resource scheduling device in the present application can comprehensively consider the data amount of the downlink service and the channel state of the terminal to determine the scheduling priority parameter corresponding to the target service, effectively reducing the total user experience delay of the downlink service of the plurality of terminals in the entire cell, and balancing the service experience of the users corresponding to the plurality of terminals. BRIEF DESCRIPTION OF DRAWINGS

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

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

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

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

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

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

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

[0044] Figure 8 A flow diagram of a resource scheduling method provided by an embodiment of the present application Figure 4 ;

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

[0046] 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. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work fall within the scope of protection of the present application.

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

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

[0049] For the convenience of understanding the present application, the related elements involved in the present application are described.

[0050] 1, massive multiple-input multiple-output (MIMO) antenna technology

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

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

[0053] 2、Channel State Information (CSI)

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

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

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

[0057] Table 1

[0058]

[0059]

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

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

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

[0063] Table 2

[0064]

[0065]

[0066] Table 3

[0067]

[0068]

[0069] 4、Channel quality index (CQI)

[0070] Channel quality indication (CQI) is a downlink channel condition reported by a terminal to a base station according to the reception quality (SINR) of a downlink reference signal (CSI-RS) transmitted by the base station. The value of CQI is 0-15, and the larger the value, the better the channel quality. The modulation modes supported by the current 5G-NR standard downlink data include quadrature phase shift keying (QPSK), 16 quadrature amplitude modulation (QAM), 64 QAM, and 256 QAM. Table 4 shows the indicators and their explanations for reporting CQI based on QPSK, 16 QAM, and 64 QAM. Table 5 shows the indicators and their explanations for reporting CQI based on QPSK, 16 QAM, 64 QAM, and 256 QAM.

[0071] Table 4

[0072]

[0073] Table 5

[0074]

[0075]

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

[0077] The embodiment of the present application provides a resource scheduling method, which can first acquire a plurality of target data amounts 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 amount of the target service is the data amount of the downlink service data of the target service. The target service is any one of the plurality of services. Then, the number of services in the plurality of services whose target data amount is less than a preset data amount threshold value is determined as the number of target services, and the scheduling priority parameter corresponding to the target service is determined according to the resource scheduling parameter. The resource scheduling parameter includes at least one of the target data amount of the target service, the data amount threshold value, the number of target services, the preset service number threshold value, the channel state parameter of the target terminal, and the service priority level corresponding to the target terminal. The target terminal is a terminal in the plurality of terminals for receiving downlink service data. Subsequently, the target service can be scheduled resources based on the scheduling priority parameter.

[0078] In this way, the resource scheduling device in the present application can comprehensively consider the data amount of the downlink service and the channel state of the terminal to determine the scheduling priority parameter corresponding to the target service, effectively reducing the total user experience delay of the downlink service of the plurality of terminals in the entire cell, and balancing the service experience of the users corresponding to the plurality of terminals.

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

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

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

[0082] In an embodiment, the resource scheduling device 101 in the resource scheduling system can be a base station or a base station controller of wireless communication, etc. In the embodiment of the present application, the base station can be a base station (BTS) in global system for mobile communication (GSM) or code division multiple access (CDMA), a base station (node B) in wideband code division multiple access (WCDMA), a base station (eNB) in internet of things (IoT) or narrowband-internet of things (NB-IoT), a base station in future 5G mobile communication network or future evolved public land mobile network (PLMN). Figure 1 In another embodiment, the resource scheduling device 101 can also be one server in a server cluster (composed of a plurality of servers), can also be a chip in the server, can also be a system on chip in the server, and can also be implemented by a virtual machine (VM) deployed on the server for cloud deployment, and the embodiment of the present application does not limit this.

[0083]

[0084] Figure 1 ​​The terminal in the specification can refer to a device providing voice and / or data connectivity for a user in a device having wireless connection function, or other processing device connected to a wireless modem. The wireless terminal can communicate with one or more core networks through a radio access network (RAN). The wireless terminal can be a mobile terminal, such as a mobile telephone (or called "cellular" phone) and a computer with mobile termination, and also can be a portable, pocket, handheld, computer-included or car-mounted moving apparatus, which exchanges language and / or data with a radio access network, for example, a mobile phone, a tablet computer, a notebook computer, a netbook computer, a personal digital assistant (PDA).

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

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

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

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

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

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

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

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

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

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

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

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

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

[0098] Figure 4 Another hardware structure of the communication apparatus in the embodiments of the present application is shown. As shown in Figure 4 the communication apparatus can include a processor 31 and a communication interface 32. The processor 31 is coupled to the communication interface 32.

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

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

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

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

[0103] S501, the resource scheduling device acquires a plurality of target data amounts 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.

[0104] Among them, the target data amount of the target service is the data amount of the downlink service data of the target service, and the target service is any one of the plurality of services.

[0105] In an implementable manner, the method for the resource scheduling device to acquire the target data volume corresponding to each of the services in the target cell can include: the resource scheduling device can receive the target service data sent by the service sending end, and identify the target data volume.

[0106] In an implementable manner, the method for the resource scheduling device to acquire the channel state parameter corresponding to each of the terminals in the target cell can include: the resource scheduling device can receive the channel state information reported by any one of the terminals in the target cell, and read the channel state parameter from the channel state information.

[0107] S502, the resource scheduling device determines the number of services whose target data volume is less than the preset data volume threshold as the target service number.

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

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

[0110] It can be understood that, since the downlink service data transmission of large packet services with large traffic requires more resources, the waiting time of the corresponding resource scheduling is longer. Therefore, compared with the waiting time of the large packet service being preferentially scheduled, the small packet service with small traffic obtaining priority scheduling can reduce the overall resource scheduling waiting time (i.e., the cache delay) of all terminals in the target cell.

[0111] In an implementable manner, when the target data volume is less than the preset data volume threshold, the resource scheduling device can determine the target service as a small packet service, and determine the service number of the small packet service.

[0112] S503, the resource scheduling device determines the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter.

[0113] The resource scheduling parameter includes at least one of the target data volume of the target service, the data volume threshold, the target service number, the preset service number threshold, the channel state parameter of the target terminal, and the service priority level corresponding to the target terminal. The target terminal is a terminal for receiving the downlink data of the target service in the plurality of terminals.

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

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

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

[0117] In an implementable manner, when the target data volume of the target service is less than the data volume threshold and the target service quantity is greater than or equal to the service quantity threshold, the resource scheduling device can determine the scheduling priority parameter according to the target data volume of the target service, the data volume threshold, the target service quantity, the service quantity threshold, the channel state parameter of the target terminal and the service priority level.

[0118] When the target data volume of the target service is less than the data volume threshold and the target service quantity is less than the service quantity threshold, the resource scheduling device can 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.

[0119] When the target data volume of the target service is greater than or equal to the data volume threshold, the resource scheduling device can determine the scheduling priority parameter according to the channel state parameter of the target terminal and the service priority level.

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

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

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

[0123] In an implementable manner, in a preset scheduling period, the resource scheduling device can schedule downlink resources for the downlink buffer queue of each service according to the plurality of scheduling priority parameters corresponding to the plurality of services in the target cell in descending order of the scheduling priority parameters, that is, the service with a larger value of the scheduling priority parameter is preferentially scheduled with downlink resources.

[0124] The technical solutions provided by the above embodiments have at least the following beneficial effects: As can be seen from S501-S504, firstly, a plurality of target data amounts 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 can be acquired, wherein the target data amount of a target service is the data amount of downlink service data of the target service. The target service is any one of the plurality of services. Then, the number of services in the plurality of services whose target data amount is less than a preset data amount threshold value can be determined as a target service number, and a scheduling priority parameter corresponding to the target service can be determined according to a resource scheduling parameter. The resource scheduling parameter includes at least one of the target data amount of the target service, the data amount threshold value, the target service number, a preset service number threshold value, the channel state parameter of the target terminal, and a service priority level corresponding to the target terminal. The target terminal is a terminal in the plurality of terminals for receiving downlink service data. Subsequently, the target service can be scheduled with resources based on the scheduling priority parameter.

[0125] In this way, the resource scheduling device in the present application can comprehensively consider the data amount of the downlink service and the channel state of the terminal to determine the scheduling priority parameter corresponding to the target service, effectively reducing the total user experience delay of the downlink service of the plurality of terminals in the entire cell, and balancing the service experience of users corresponding to the plurality of terminals.

[0126] In an optional embodiment, when the target data amount of the target service is less than the data amount threshold value, the resource scheduling parameter includes the target data amount of the target service, the data amount threshold value, the target service number, the service number threshold value, the channel state parameter of the target terminal, and the service priority level. In this case, the method for determining the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter in S503 includes: Figure 5 As shown in Figure 6 The method for determining the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter in S503 includes:

[0127] S601, when the target service number is greater than or equal to the service number threshold value, the resource scheduling device determines the scheduling priority parameter according to the target data amount of the target service, the data amount threshold value, the target service number, the service number threshold value, the channel state parameter of the target terminal, and the service priority level.

[0128] The target data amount of the target service, the data amount threshold value, the target service number, the service number threshold value, the channel state parameter of the target terminal, the service priority level, and the scheduling priority parameter satisfy the following formula:

[0129]

[0130] Load ij is the target data amount, L threshold is the data amount threshold value, S t is the target service number, S threshold is the service number threshold value, Qi is a channel state parameter of the target terminal, Pl ij is a service priority level, Pr ij is a scheduling priority parameter.

[0131] It can be understood that, since the larger the scheduling priority parameter is, the more the target service is prioritized to be scheduled with downlink resources, and the smaller the service priority level is, the more the target service is prioritized to be scheduled with downlink resources, therefore, the scheduling priority parameter can be inversely proportional to the service priority level, that is, the scheduling priority parameter can be positively correlated with the inverse of the service priority level (hereinafter referred to as an "initial priority parameter").

[0132] 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 delay of receiving downlink service data is shorter, therefore, the downlink resources can be prioritized to be scheduled for the service corresponding to the terminal with a larger channel state parameter. Therefore, the channel state parameter is taken as one influence coefficient (hereinafter referred to as a "first influence coefficient") of the scheduling priority parameter.

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

[0134] Further, when the target service quantity is greater than or equal to the service quantity threshold, it indicates that the service quantity of the small packet service in the target cell is larger, at this time, if the scheduling priority parameter of the small packet service is increased, it will cause the scheduling order of the large packet service to be later and the waiting time to be too long, affecting the user experience. Therefore, when the target service quantity is greater than or equal to the service quantity threshold, the scheduling priority parameter of the small packet service should be appropriately reduced. Based on this, the ratio of the service quantity threshold to the target service quantity can be taken as another influence coefficient (hereinafter referred to as a "third influence coefficient") of the scheduling priority parameter. In this way, the more the target service quantity is, the smaller the third influence coefficient is, and the smaller the corresponding scheduling priority parameter is.

[0135] It should be noted that, the higher the service quantity threshold is, the later the adjustment event of the scheduling priority parameter of the small packet service is triggered. For example, the service quantity threshold can be valued at 300.

[0136] S602, when the target service quantity is less than the service quantity threshold, the resource scheduling device 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.

[0137] The target data quantity of the target service, the data quantity threshold, the channel state parameter of the target terminal, the service priority level, and the scheduling priority parameter satisfy the following formula:

[0138]

[0139] In combination with the description of S601, when the target service quantity is less than the service quantity threshold, it indicates that the service quantity of the small packet service in the target cell is small, and at this time, the downlink resource can be preferentially scheduled for the small packet service. Therefore, in this case, the scheduling priority parameter can be the product of the initial priority parameter and the first influence coefficient and the second influence coefficient.

[0140] The above embodiments provide technical solutions with at least the following beneficial effects: As can be seen from S601-S602, when the target service is a small packet service, the embodiments of the present application can improve the scheduling priority coefficient of the target service. In addition, when the service quantity of the small packet service in the target cell is large, the embodiments of the present application can also appropriately reduce the scheduling priority coefficient of the target service to ensure the user experience of large packet service data. In this way, the embodiments of the present application can comprehensively consider factors such as service traffic size and service quantity to realize reasonable scheduling of downlink resources in the target cell.

[0141] In an optional embodiment, when the target data quantity of the target service is greater than or equal to the data quantity threshold, the resource scheduling parameter includes the channel state parameter of the target terminal and the service priority level. In this case, in combination with Figure 6 As shown in FIG. 5C, 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: Figure 7

[0142] S701, the resource scheduling device determines a scheduling priority parameter according to the channel state parameter of the target terminal and the service priority level.

[0143] The channel state parameter of the target terminal, the service priority level, and the scheduling priority parameter satisfy the following formula:

[0144]

[0145] ​It can be understood that when the target data amount is greater than or equal to the data amount threshold, the target service is considered as a large packet service. At this time, only the data amount of the downlink service to be transmitted and the channel state are considered, and the product of the initial priority parameter and the first influence coefficient is determined as the scheduling priority parameter. Since the scheduling priority parameter corresponding to the small packet service is also related to the second influence coefficient and / or the third influence coefficient, when the number of small packet services is small, the scheduling priority parameter corresponding to the small packet service is greater than the scheduling priority parameter corresponding to the large packet service. When the number of small packet services is large, the scheduling priority parameter corresponding to the small packet service can also be less than the scheduling priority parameter corresponding to the large packet service.

[0146] The technical solutions provided by the above embodiments at least have the following beneficial effects: As can be known from S701, when the target service is a large packet service, the embodiment of the present application can provide a method for determining the scheduling priority coefficient of the target service. In this way, the embodiment of the present application can comprehensively consider factors such as service traffic size and service quantity, and realize reasonable scheduling of downlink resources in the target cell.

[0147] In an optional embodiment, in combination with Figure 5 As shown in the resource scheduling method, the method further comprises: Figure 8

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

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

[0150] The above mainly introduces the solutions provided by the embodiments of the present application from the perspective of methods. In order to realize the above functions, it contains the hardware structure and / or software module corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of the examples described in the embodiments disclosed in the present text, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or computer software driven hardware depends on the specific application and design constraints of the technical solutions. Professional technicians can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

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

[0152] As shown in Figure 9 , it is a structural schematic diagram of a resource scheduling device provided by the embodiments of the present application. The resource scheduling device can be used to execute the method of resource scheduling shown in Figure 5 , Figure 6 , Figure 7 and Figure 8 . Figure 9 The resource scheduling device shown in

[0153] The acquisition unit 901 is configured to acquire 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. The target data volume of a 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.

[0154] The processing unit 902 is configured to determine the number of services whose target data volumes acquired by the acquisition unit 901 are less than a preset data volume threshold value as the number of target services in the plurality of services.

[0155] The processing unit 902 is further configured to determine a scheduling priority parameter corresponding to the target service according to a resource scheduling parameter. The resource scheduling parameter includes at least one of the target data volume of the target service, the data volume threshold value, the number of target services, a preset service number threshold value, the channel state parameter of a target terminal, and a service priority level corresponding to the target terminal. The target terminal is a terminal for receiving downlink service data in the plurality of terminals.

[0156] The processing unit 902 is further configured to schedule a downlink resource for the target service based on the scheduling priority parameter.

[0157] Optionally, when the target data volume of the target service is less than the data volume threshold, the resource scheduling parameter comprises: the target data volume of the target service, the data volume threshold, the target service quantity, the service quantity threshold, the channel state parameter of the target terminal and the service priority level; the processing unit 902 is specifically configured to: when the target service quantity is greater than or equal to the service quantity threshold, determine the scheduling priority parameter according to the target data volume of the target service, the data volume 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 of the target service, the data volume threshold, the target service quantity, the channel state parameter of the target terminal, the service quantity threshold, the service priority level and the scheduling priority parameter satisfy the following formula:

[0158]

[0159] Load ij is the target data volume; L threshold is the data volume threshold; S t is the target service quantity; S threshold is the service quantity threshold; Q i is the channel state parameter of the target terminal; Pl ij is the service priority level; Pr ij is the scheduling priority parameter.

[0160] When the target service quantity is less than the service quantity threshold, the scheduling priority parameter is determined 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; 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:

[0161]

[0162] Optionally, when the target data volume of the target service is greater than or equal to the data volume threshold, the resource scheduling parameter comprises: the channel state parameter of the target terminal and the service priority level; the processing unit 902 is specifically configured to: determine 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 formula:

[0163]

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

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

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

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

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

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

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

Claims

1. A resource scheduling method, characterized in that, The method comprises the following steps: obtaining a 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; a target data volume of a target service is a data volume of downlink service data of the target service; the target service is any one of the plurality of services; a number of services in the plurality of services, a target data volume of which is less than a preset data volume threshold, is determined as a target service number; determining a scheduling priority parameter corresponding to the target service according to a resource scheduling parameter; the resource scheduling parameter comprises at least one of the 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 in the plurality of terminals for receiving the downlink service data; when the target data volume of the target service is less than the data volume threshold, the resource scheduling parameter comprises the target data volume of the target service, the data volume threshold, the target service number, the preset service number threshold, the channel state parameter of the target terminal, and the service priority level; When the target service quantity is greater than or equal to the preset service quantity threshold, the scheduling priority parameter is satisfied: ; When the target service quantity is less than the preset service quantity threshold, the scheduling priority parameter is satisfied: ; Among them, the The target data volume; The data volume threshold; The target number of services; The preset service quantity threshold; The channel state parameters of the target terminal; The service priority level; The scheduling priority parameter is used as the scheduling priority parameter; based on the scheduling priority parameter, downlink resources are scheduled for the target service.

2. The method of claim 1, wherein, when the target data volume of the target service is greater than or equal to the data volume threshold, the resource scheduling parameter comprises the channel state parameter of the target terminal and the service priority level; the determining of the scheduling priority parameter corresponding to the target service according to the resource scheduling parameter comprises: 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 formula: 。 3. The method of claim 1 or 2, wherein, the service priority level is a target priority level in a plurality of priority levels corresponding to the target terminal; the target priority level is higher than other priority levels in the plurality of priority levels.

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

5. A resource scheduling apparatus, characterized by comprising: The method comprises the following steps: an obtaining unit and a processing unit; the obtaining unit is configured to obtain a 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; a target data volume of a target service is a data volume of 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 a number of services in the plurality of services, a target data volume of which is less than a preset data volume threshold, as a target service number; the processing unit is further configured to determine a scheduling priority parameter corresponding to the target service according to a resource scheduling parameter; the resource scheduling parameter comprises at least one of the 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 in the plurality of terminals for receiving the downlink service data; When the target data volume of the target service is less than the data volume threshold, the resource scheduling parameter comprises the target data volume of the target service, the data volume threshold, the target service quantity, the preset service quantity threshold, the channel state parameter of the target terminal and the service priority level; When the target service quantity is greater than or equal to the preset service quantity threshold, the scheduling priority parameter is satisfied: ; When the target service quantity is less than the preset service quantity threshold, the scheduling priority parameter is satisfied: ; Among them, the The target data volume; The data volume threshold; The target number of services; The preset service quantity threshold; The channel state parameters of the target terminal; The service priority level; The scheduling priority parameter; The processing unit is further configured to schedule a downlink resource for the target service based on the scheduling priority parameter.

6. The apparatus of claim 5, wherein, When the target data volume of the target service is greater than or equal to the data volume 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: determine 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 formula: 。 7. The resource scheduling apparatus according to claim 5 or 6, characterized by, The service priority level is a target priority level in a plurality of priority levels corresponding to the target terminal; the target priority level is higher than other priority levels in the plurality of priority levels.

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

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

10. A computer-readable storage medium, characterized in that, The computer readable storage medium comprises computer execution instructions; when the computer execution instructions run on a computer, the computer executes the resource scheduling method according to any one of claims 1-4.

Citation Information

Patent Citations

  • Scheduling method and device

    CN112243298A

  • Resource allocation method and device and computer readable storage medium

    CN113939033A