Resource allocation method and device and computer equipment

By obtaining network load indicators and judging the scheduling time slot type in the base station, determining the resource allocation strategy, the problem of not considering QoS in the energy saving of base stations is solved, and the service quality and energy saving efficiency are improved.

CN119095107APending Publication Date: 2024-12-06CHINA TELECOM INTELLIGENT NETWORK TECHNOLOGY CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411287989.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-13
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

The prior art fails to effectively consider QoS of services in terms of base station energy saving, resulting in the rate not meeting the GBR rate requirements, affecting service quality.

Method used

By obtaining the network load indicators of the network equipment within the preset period, determining the type of the current scheduling time slot, and determining the target resource allocation strategy based on the type, ensuring the resource allocation of the bearer, including multiple rounds of allocation and sleep time slot processing.

Benefits of technology

It improves the quality of business services, solves the problem of poor service quality caused by resource allocation methods, and achieves more effective base station energy saving.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119095107A_ABST
    Figure CN119095107A_ABST
Patent Text Reader

Abstract

The invention discloses a resource allocation method and device and computer equipment. The method comprises the following steps: acquiring a network load index of network equipment according to a preset period; under the condition that the network load index is lower than a preset threshold value, acquiring an urgent scheduling moment of each bearer in a service quality judgment queue corresponding to the current scheduling time slot, and determining the type of the current scheduling time slot according to the urgent scheduling moment of each bearer; and determining a target resource allocation strategy of all the bearers corresponding to the current scheduling time slot according to the type of the current scheduling time slot, and allocating target resources to all the bearers corresponding to the current scheduling time slot according to the allocation strategy of the target resources. According to the invention, the technical problem of poor business service quality caused by a resource allocation mode in related technologies is solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a resource allocation method, device and computer equipment. Background Art

[0002] Energy saving in base stations has always been a key means to reduce operating costs and improve network efficiency. The optional energy-saving features of base stations include sub-frame shutdown, channel shutdown and base station sleep. Among them, sub-frame shutdown means that when the device detects the sending moment of some downlink symbols and there is no data to be sent, the PA (Power Amplifier) ​​is turned off to save the static power consumption of the PA. Data is preferentially aggregated to the time slots where broadcast, public channels and reference signals are located for centralized transmission, thereby increasing the chances of symbol shutdown and improving the energy saving ratio. At present, the practice in related technologies monitors the traffic volume, determines the load level, selects the sleep level according to the load level, and selects a certain number of time slots to shut down the PA. However, the QoS (Quality of Service) of the service is not considered, which is easy to cause service quality problems such as the rate cannot meet the GBR (Guranteed Bit Rate) rate requirements. Summary of the invention

[0003] The embodiments of the present application provide a resource allocation method, apparatus and computer device to at least solve the technical problem of poor business service quality caused by the resource allocation method in the related art.

[0004] According to one aspect of an embodiment of the present application, a resource allocation method is provided, including: obtaining a network load indicator of a network device according to a preset period; when the network load indicator is lower than a preset threshold value, obtaining the urgent scheduling moment of each bearer in the service quality judgment queue corresponding to the current scheduling time slot, and determining the type of the current scheduling time slot according to the urgent scheduling moment of each bearer; determining a target resource allocation strategy for all bearers corresponding to the current scheduling time slot according to the type of the current scheduling time slot, and allocating the target resource to all bearers corresponding to the current scheduling time slot according to the target resource allocation strategy.

[0005] Optionally, the type of the current scheduling time slot is determined according to the urgent scheduling moment of each bearer, including: when the type of the current scheduling time slot is not a downlink normally open time slot, obtaining a comparison result between the urgent scheduling moment of each bearer in the decision queue and the moment corresponding to the current scheduling time slot; determining whether each bearer in the decision queue has reached the urgent scheduling moment according to the comparison result; and determining the type of the current scheduling time slot according to whether each bearer in the decision queue has reached the urgent scheduling moment.

[0006] Optionally, a comparison result between the urgent scheduling moment of each bearer in the decision queue and the moment corresponding to the current scheduling time slot is obtained, including: obtaining the arrival moment of the first arriving data packet of each bearer, the transmission delay of the first arriving data packet calculated based on the minimum guaranteed rate, the transmission delay of the first arriving data packet calculated based on the maximum guaranteed rate, the data packet delay budget and the data packet delay margin; determining the urgent scheduling moment of each bearer according to the arrival moment of the first arriving data packet of each bearer, the transmission delay of the first arriving data packet calculated based on the minimum guaranteed rate, the transmission delay of the first arriving data packet calculated based on the maximum guaranteed rate, the data packet delay budget and the data packet delay margin; obtaining the comparison result by comparing the urgent scheduling moment of each bearer with the moment corresponding to the current scheduling time slot.

[0007] Optionally, determining whether each bearer in the judgment queue has reached the urgent scheduling moment is determined based on the comparison result, including: when the comparison result indicates that the moment corresponding to the current scheduling time slot is not less than the urgent scheduling moment of each bearer, determining that each bearer has reached the urgent scheduling moment; when the comparison result indicates that the moment corresponding to the current scheduling time slot is greater than the urgent scheduling moment of each bearer, determining that each bearer has not reached the urgent scheduling moment.

[0008] Optionally, the type of the current scheduling time slot is determined based on whether each bearer in the decision queue reaches the urgent scheduling moment, including: when there is a bearer in the decision queue that reaches the urgent scheduling moment, determining the type of the current scheduling time slot as an urgent scheduling time slot; when there is no bearer in the decision queue that reaches the urgent scheduling moment, determining the type of the current scheduling time slot as a sleep time slot.

[0009] Optionally, the target resources are allocated to all bearers corresponding to the current scheduling time slot according to the target resource allocation strategy, including: when the type of the current scheduling time slot is the downlink normally open time slot and the urgently scheduled time slot, the target resources are allocated to all bearers corresponding to the current scheduling time slot in a multi-round allocation manner, wherein the multi-round allocation manner includes: a first round of allocation and a second round of allocation, the first round of allocation includes: allocating the required number of target resources to each bearer until each bearer reaches the minimum guaranteed rate, the second round of allocation includes: when the target resources remain after the first round of allocation, allocating the target resources to the highest priority bearer until all data packets of the highest priority bearer have been scheduled; when the type of the current scheduling time slot is a sleep time slot, turning off the power amplifier of the current scheduling time slot.

[0010] Optionally, the network load indicator of the network device is obtained according to a preset period, including: obtaining the physical resource block utilization of each time slot within the preset period; determining the latest utilization of the physical resource blocks of each time slot based on the physical resource block utilization of the time slot before the physical resource block utilization of each time slot and a preset forgetting factor; and determining the maximum value of the latest utilization of the physical resource blocks of each time slot within the preset period as the network load indicator.

[0011] According to another aspect of an embodiment of the present application, a resource allocation device is also provided, including: an acquisition module, used to acquire a network load indicator of a network device according to a preset period; a determination module, used to obtain the urgent scheduling moment of each bearer in the service quality judgment queue corresponding to the current scheduling time slot when the network load indicator is lower than a preset threshold value, and determine the type of the current scheduling time slot according to the urgent scheduling moment of each bearer; an allocation module, used to determine a target resource allocation strategy for all bearers corresponding to the current scheduling time slot according to the type of the current scheduling time slot, and allocate the target resource to all bearers corresponding to the current scheduling time slot according to the allocation strategy of the target resource.

[0012] According to another aspect of the embodiment of the present application, a computer device is provided, including: a memory and a processor, wherein the memory is used to store program instructions; and the processor is connected to the memory and is used to execute the above-mentioned resource allocation method.

[0013] According to another aspect of the embodiments of the present application, a non-volatile storage medium is provided, which includes a stored computer program, wherein the device where the non-volatile storage medium is located executes the above-mentioned resource allocation method by running the computer program.

[0014] According to another aspect of the embodiments of the present application, a computer program product is provided, including computer instructions, which implement the above-mentioned resource allocation method when executed by a processor.

[0015] In an embodiment of the present application, a network load indicator of a network device is obtained according to a preset period; when the network load indicator is lower than a preset threshold value, the urgent scheduling moment of each bearer in the service quality judgment queue corresponding to the current scheduling time slot is obtained, and the type of the current scheduling time slot is determined according to the urgent scheduling moment of each bearer; according to the type of the current scheduling time slot, a target resource allocation strategy for all bearers corresponding to the current scheduling time slot is determined, and the target resource is allocated to all bearers corresponding to the current scheduling time slot according to the allocation strategy of the target resource, thereby achieving the technical effect of improving the business service quality by determining the urgent scheduling moment of each bearer in the service quality judgment queue corresponding to the current scheduling time slot, and then solving the technical problem of poor business service quality caused by the resource allocation method in the related technology. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0017] Figure 1 is a hardware structure block diagram of a computer terminal for implementing a resource allocation method according to an embodiment of the present application;

[0018] Figure 2 is a flow chart of a resource allocation method according to an embodiment of the present application;

[0019] Figure 3 is a flow chart of another resource allocation method according to an embodiment of the present application;

[0020] Figure 4 It is a structural diagram of a resource allocation device according to an embodiment of the present application. DETAILED DESCRIPTION

[0021] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0022] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0023] The information collected in the embodiments of the present application is information and data authorized by the user or fully authorized by all parties, and the collection, storage, use, processing, transmission, provision, disclosure and application of the relevant data comply with the relevant laws, regulations and standards of the relevant regions, take necessary confidentiality measures, do not violate public order and good morals, and provide corresponding operation entrances for users to choose to authorize or reject automated decision-making results; if the user chooses to reject, the expert decision-making process will be entered.

[0024] In order to solve the problems existing in the related art, the embodiment of the present application provides a resource allocation method, which can be run on Figure 1 In the computer terminal shown, the computer terminal is explained below.

[0025] The resource allocation method embodiment provided in the embodiment of the present application can be executed in a mobile terminal, a computer terminal or a similar computing device. Figure 1 FIG. 1 shows a hardware structure block diagram of a computer terminal for implementing a resource allocation method. Figure 1 As shown, the computer terminal 10 may include one or more (102a, 102b, ..., 102n are used to illustrate) processors (the processor may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA), a memory 104 for storing data, and a transmission module 106 for communication functions connected via a wired and / or wireless network. In addition, it may also include: a display, a keyboard, a cursor control device, an input / output interface (I / O interface), a universal serial bus (USB) port (which may be included as one of the ports of the I / O interface), a network interface, and a BUS bus. Those skilled in the art can understand that Figure 1 The structure shown is only for illustration and does not limit the structure of the above electronic device. Figure 1 More or fewer components as shown, or with Figure 1Different configurations shown.

[0026] It should be noted that the one or more processors and / or other data processing circuits described above may generally be referred to herein as "data processing circuits". The data processing circuits may be embodied in whole or in part as software, hardware, firmware, or any other combination thereof. In addition, the data processing circuit may be a single independent processing module, or may be incorporated in whole or in part into any of the other components in the computer terminal 10. As described in the embodiments of the present application, the data processing circuit acts as a processor control (e.g., selection of a variable resistor terminal path connected to an interface).

[0027] The memory 104 can be used to store software programs and modules of application software, such as the program instructions / data storage device corresponding to the resource allocation method in the embodiment of the present application. The processor executes various functional applications and data processing by running the software programs and modules stored in the memory 104, that is, realizing the above-mentioned resource allocation method. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include a memory remotely arranged relative to the processor, and these remote memories may be connected to the computer terminal 10 via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0028] The transmission module 106 is used to receive or send data via a network. The specific example of the above network may include a wireless network provided by a communication provider of the computer terminal 10. In one example, the transmission module 106 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission module 106 can be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0029] The display may be, for example, a touch screen liquid crystal display (LCD) that enables a user to interact with a user interface of the computer terminal 10 .

[0030] It should be noted that, in some optional embodiments, the above Figure 1 The computer terminal shown may include hardware elements (including circuits), software elements (including computer code stored on a computer-readable medium), or a combination of hardware elements and software elements. It should be noted that Figure 1This is merely one example of a particular embodiment and is intended to illustrate the types of components that may be present in the computer terminal described above.

[0031] In the above-mentioned operating environment, an embodiment of the present application provides an embodiment of a resource allocation method. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although the logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0032] Figure 2 is a flow chart of a resource allocation method according to an embodiment of the present application, such as Figure 2 As shown, the method comprises the following steps:

[0033] Step S202, obtaining a network load index of a network device according to a preset period;

[0034] In the above step S202, the network equipment includes but is not limited to: base stations, and the network load indicator can be based on the uplink and downlink PRB (Physical Resource Block) utilization and PDCCH (Physical Downlink Control Channel) resource utilization as the network load indicator. For example, the average resource utilization within the period can be counted or the statistical value can be continuously filtered and updated using a forgetting factor.

[0035] Step S204, when the network load indicator is lower than a preset threshold value, obtaining the urgent scheduling time of each bearer in the service quality judgment queue corresponding to the current scheduling time slot, and determining the type of the current scheduling time slot according to the urgent scheduling time of each bearer;

[0036] In the above step S204, a bearer queue that needs to be maintained may be selected according to the bearer QoS, for example, a GBR bearer queue, and the bearer queue may be determined as a service quality determination queue.

[0037] Step S206: determine a target resource allocation strategy for all bearers corresponding to the current scheduling time slot according to the type of the current scheduling time slot, and allocate the target resource to all bearers corresponding to the current scheduling time slot according to the target resource allocation strategy.

[0038] Through the above steps S202 to S206, the network load index of the network device is obtained according to the preset period; when the network load index is lower than the preset threshold value, the urgent scheduling moment of each bearer in the service quality judgment queue corresponding to the current scheduling time slot is obtained, and the type of the current scheduling time slot is determined according to the urgent scheduling moment of each bearer; the target resource allocation strategy of all bearers corresponding to the current scheduling time slot is determined according to the type of the current scheduling time slot, and the target resource is allocated to all bearers corresponding to the current scheduling time slot according to the allocation strategy of the target resource, so as to achieve the technical effect of improving the service quality of the business by determining the urgent scheduling moment of each bearer in the service quality judgment queue corresponding to the current scheduling time slot, and then determining the resource allocation strategy according to the scheduling time slot type. The following is a detailed description.

[0039] In step S204 of the above-mentioned resource allocation method, the type of the current scheduling time slot is determined according to the urgent scheduling moment of each bearer, including: when the type of the current scheduling time slot is not a downlink normally open time slot, obtaining a comparison result between the urgent scheduling moment of each bearer in the decision queue and the moment corresponding to the current scheduling time slot; determining whether each bearer in the decision queue has reached the urgent scheduling moment according to the comparison result; and determining the type of the current scheduling time slot according to whether each bearer in the decision queue has reached the urgent scheduling moment.

[0040] It should be noted that Downlink Continuous Time Slot refers to a continuous time period allocated for downlink transmission (from base station to mobile device) in a wireless communication system, especially in a time division multiple access (TDMA) system. This time slot is pre-set and remains open throughout the communication cycle so that the base station can continuously send data to the mobile device;

[0041] Urgent Scheduling Duration refers to the length of time it takes to quickly respond to and process certain high-priority data or service requests in the network.

[0042] Urgent Scheduling Time refers to the specific time point in a communication network or system when the network scheduler decides to immediately process or transmit certain high-priority service or data transmission requests.

[0043] In an optional manner, a comparison result between the urgent scheduling moment of each bearer in the decision queue and the moment corresponding to the current scheduling time slot is obtained, including: obtaining the arrival moment of the first arriving data packet of each bearer, the transmission delay of the first arriving data packet calculated based on the minimum guaranteed rate, the transmission delay of the first arriving data packet calculated based on the maximum guaranteed rate, the data packet delay budget and the data packet delay margin; determining the urgent scheduling moment of each bearer according to the arrival moment of the first arriving data packet of each bearer, the transmission delay of the first arriving data packet calculated based on the minimum guaranteed rate, the transmission delay of the first arriving data packet calculated based on the maximum guaranteed rate, the data packet delay budget and the data packet delay margin; obtaining the comparison result by comparing the urgent scheduling moment of each bearer with the moment corresponding to the current scheduling time slot.

[0044] Specifically, determine whether the time corresponding to the current scheduling time slot is greater than or equal to the urgent scheduling time of each bearer:

[0045] T slot ≥urgentScheduleTime i ;

[0046] Where, T slot is the time corresponding to the current scheduling time slot, urgentScheduleTime i is the urgent scheduling time required by the first arriving data packet of the ith carrier;

[0047] Among them, urgentScheduleTime i =min((arrivalTime i +minRateTime-maxRateTime), (arrivalTimei+maxlatency-maxRateTime-marginal));

[0048] Among them, arrivalTime iis the arrival time of the first data packet arriving on the ith carrier, minRateTime is the transmission delay of the first data packet calculated based on the minimum guaranteed rate, for example, minRateTime=packetSize / GBR; maxRateTime is the transmission delay of the first data packet calculated based on the maximum guaranteed rate, for example: according to the channel quality of the terminal, a certain amount of RBs (Resource Blocks, physical resource blocks) are scheduled, for example, 80% of the RB resources (target resources) can achieve the maximum rate delay of the first data packet, that is, maxRateTime=packetSize / maxRate; maxlatency is the PDB (Packet Delay Budge) defined by QoS, and marginal is the delay margin (packet delay margin) considering network transmission.

[0049] In some embodiments of the present application, determining whether each bearer in the judgment queue has reached the urgent scheduling moment is determined based on the comparison result, including: when the comparison result indicates that the moment corresponding to the current scheduling time slot is not less than the urgent scheduling moment of each bearer, determining that each bearer has reached the urgent scheduling moment; when the comparison result indicates that the moment corresponding to the current scheduling time slot is greater than the urgent scheduling moment of each bearer, determining that each bearer has not reached the urgent scheduling moment.

[0050] In some embodiments of the present application, the type of the current scheduling time slot is determined based on whether each bearer in the decision queue reaches the urgent scheduling moment, including: when there is a bearer in the decision queue that reaches the urgent scheduling moment, determining the type of the current scheduling time slot as an urgent scheduling time slot; when there is no bearer in the decision queue that reaches the urgent scheduling moment, determining the type of the current scheduling time slot as a sleep time slot.

[0051] The specific method of allocating the target resources to all bearers corresponding to the current scheduling time slot according to the target resource allocation strategy is: when the type of the current scheduling time slot is the downlink normally open time slot and the urgent scheduling time slot, a multi-round allocation method is used to allocate target resources to all bearers corresponding to the current scheduling time slot, wherein the multi-round allocation method includes: a first round of allocation and a second round of allocation, the first round of allocation includes: allocating the required number of target resources to each bearer until each bearer reaches the minimum guaranteed rate, the second round of allocation includes: when the target resources are remaining after the first round of allocation, allocating the target resources to the highest priority bearer until all data packets of the highest priority bearer have been scheduled; in the case of the sleep time slot, turning off the power amplifier of the current scheduling time slot.

[0052] Specifically, if the current scheduling time slot is an urgent scheduling time slot or a downlink normally open time slot, two rounds of resource allocation are performed; if the current scheduling time slot is a sleep time slot, the PA of the current scheduling time slot is turned off to put the base station to sleep.

[0053] Specifically, for urgent scheduling time slots or downlink always-on time slots, scheduling should meet the principle of scheduling as much as possible, that is, making full use of RB resources to transmit as many services as possible. The scheduling steps are as follows:

[0054] Step S1: traverse all bearers according to the minimum guaranteed rate and allocate RB resources;

[0055] Step S2: If there are RBs remaining, according to the greedy scheduling principle, select the bearer with the highest priority and data packets to be scheduled, and try to schedule all the data packets in the bearer with the highest priority;

[0056] Step S3: If there are still RBs remaining, return to step 2 until all resources are allocated or all data packets corresponding to the current scheduled time slot are scheduled.

[0057] In some embodiments of the present application, a network load indicator of a network device is obtained according to a preset period, including: obtaining a physical resource block utilization rate of each time slot within the preset period; determining the latest utilization rate of the physical resource block of each time slot based on the physical resource block utilization rate of the time slot before the physical resource block utilization rate of each time slot and a preset forgetting factor; and determining the maximum value of the latest utilization rate of the physical resource block of each time slot within the preset period as the network load indicator.

[0058] The latest utilization of the physical resource block in each time slot is calculated as follows:

[0059] P PRB,new =α×P PRB,i +P PRB,old;

[0060] Where P PRB,new represents the physical resource block of each time slot, α represents the preset forgetting factor, P PRB,old Indicates the physical resource block utilization of the previous time slot.

[0061] Figure 3 Another resource allocation method is shown, such as Figure 3 As shown:

[0062] Step 1: The energy-saving startup judgment module determines whether to enter the energy-saving mode by periodically counting network load indicators.

[0063] Step 1-1: Continuously count network load indicators. Network load statistics can be performed based on uplink and downlink PRB utilization and PDCCH resource utilization. The average resource utilization within the period can be counted or the forgetting factor can be used to continuously filter and update the statistical value. The formula is as follows:

[0064] P PRB,new =α×P PRB,i +P PRB,old ;

[0065] Where P PRB,new represents the physical resource block of each time slot, α represents the preset forgetting factor, P PRB,old Indicates the physical resource block utilization of the previous time slot;

[0066] Step 1-2: Determine whether to enter energy-saving mode based on the decision threshold (when the network load index is lower than the preset threshold value). If entered, continue with step 2. Otherwise, continue to perform statistics and use the conventional scheduling method.

[0067] Step 2: The scheduling time slot decision module selects the bearer queue that needs to be maintained according to the bearer QoS, performs scheduling queue maintenance according to the time slot, and calculates and determines the type of the current scheduling time slot, which includes urgent scheduling time slot, sleep time slot and downlink normally open time slot.

[0068] Step 2-1: Select a QoS queue for scheduling time slot decision, for example, select all GBR bearers as the QoS decision queue for scheduling time slot decision;

[0069] Step 2-2: Perform scheduling queue maintenance according to time slots. First, determine whether the time slot is a downlink normally open time slot. If so, skip the decision of the time slot and directly proceed to step 3. Otherwise, calculate whether the QoS decision queue has reached the urgent scheduling moment. Once a bearer in the QoS decision queue has reached the urgent scheduling moment, the time slot is determined as an urgent scheduling time slot. If all bearers in the QoS decision queue have not reached the urgent scheduling moment, the time slot is determined to be a dormant time slot. The scheduling moment instructs the RF end to shut down RF devices such as the power amplifier in the corresponding time slot.

[0070] The decision rule is as follows: determine whether the current scheduling slot is greater than or equal to the urgent scheduling time of each bearer, that is, Tslot≥urgentScheduleTimei, Tslot is the current scheduling slot time, and urgentScheduleTimei is the urgent scheduling time required for the first arriving packet of the i-th bearer.

[0071] urgentScheduleTimei=min((arrivalTimei+minRateTime-maxRateTime), (arrivalTimei+maxlatency-maxRateTime-marginal));

[0072] Among them, arrivalTimei is the arrival time of the first packet arriving on the i-th bearer, minRateTime is the transmission delay of this packet calculated based on the minimum guaranteed rate, for example, minRateTime = packetSize / GBR; maxRateTime is the delay of transmitting this packet at the maximum rate that can be achieved by scheduling a certain amount of RBs (for example, 80% of RB resources) according to the channel quality of the terminal, that is, maxRateTime = packetSize / maxRate; maxlatency is the PDB defined by QoS, and marginal is the delay margin considering network transmission.

[0073] Step 3: If the current scheduling time slot is an urgent scheduling time slot or a downlink normally open time slot, two rounds of resource allocation are performed. If the current scheduling time slot is a sleep time slot, the PA of the current scheduling time slot is turned off to put the base station to sleep.

[0074] For urgent scheduling time slots or downlink always-on time slots, scheduling should meet the principle of scheduling as much as possible, that is, make full use of RB resources and transmit as many services as possible. The scheduling steps are as follows:

[0075] Step 3-1: Traverse all bearers according to the minimum guaranteed rate and allocate RB resources;

[0076] Step 3-2: If there are RBs remaining, according to the greedy scheduling principle, select the bearer with the highest priority and packets to be scheduled, and try to schedule all packets;

[0077] Step 3-3: If there are still RBs remaining, return to step 3-2 until all resources are allocated or all packets are scheduled.

[0078] Figure 4 is a structural diagram of a resource allocation device according to an embodiment of the present application, such as Figure 4 As shown, the device comprises:

[0079] An acquisition module 40 is used for acquiring a network load indicator of a network device according to a preset period;

[0080] A determination module 42, configured to obtain the urgent scheduling time of each bearer in the service quality judgment queue corresponding to the current scheduling time slot when the network load indicator is lower than a preset threshold value, and determine the type of the current scheduling time slot according to the urgent scheduling time of each bearer;

[0081] The allocation module 44 is used to determine the target resource allocation strategy of all bearers corresponding to the current scheduling time slot according to the type of the current scheduling time slot, and allocate the target resource to all bearers corresponding to the current scheduling time slot according to the target resource allocation strategy.

[0082] Through the above-mentioned resource allocation device, the network load index of the network device is obtained according to a preset period; when the network load index is lower than a preset threshold value, the urgent scheduling moment of each bearer in the service quality judgment queue corresponding to the current scheduling time slot is obtained, and the type of the current scheduling time slot is determined according to the urgent scheduling moment of each bearer; according to the type of the current scheduling time slot, the target resource allocation strategy of all bearers corresponding to the current scheduling time slot is determined, and the target resource is allocated to all bearers corresponding to the current scheduling time slot according to the allocation strategy of the target resource, thereby achieving the urgent scheduling moment of each bearer in the service quality judgment queue corresponding to the current scheduling time slot. The scheduling time slot type is determined, and then the resource allocation strategy is determined according to the scheduling time slot type, thereby achieving the technical effect of improving the business service quality, and then solving the technical problem of poor business service quality caused by the resource allocation method in the related technology.

[0083] The determination module 42 in the above-mentioned resource allocation device includes: a determination submodule, which is used to determine the type of the current scheduling time slot according to the urgent scheduling moment of each bearer, including: when the type of the current scheduling time slot is not a downlink normally open time slot, obtaining a comparison result between the urgent scheduling moment of each bearer in the decision queue and the moment corresponding to the current scheduling time slot; determining whether each bearer in the decision queue has reached the urgent scheduling moment according to the comparison result; and determining the type of the current scheduling time slot according to whether each bearer in the decision queue has reached the urgent scheduling moment.

[0084] The determination submodule includes: an acquisition unit, a determination unit and a type unit, wherein the acquisition unit is used to obtain the comparison result of the urgent scheduling moment of each bearer in the decision queue and the moment corresponding to the current scheduling time slot, including: obtaining the arrival time of the first arriving data packet of each bearer, the transmission delay of the first arriving data packet calculated based on the minimum guaranteed rate, the transmission delay of the first arriving data packet calculated based on the maximum guaranteed rate, the data packet delay budget and the data packet delay margin; determining the urgent scheduling moment of each bearer according to the arrival time of the first arriving data packet of each bearer, the transmission delay of the first arriving data packet calculated based on the minimum guaranteed rate, the transmission delay of the first arriving data packet calculated based on the maximum guaranteed rate, the data packet delay budget and the data packet delay margin; obtaining the comparison result by comparing the urgent scheduling moment of each bearer with the moment corresponding to the current scheduling time slot.

[0085] A determination unit, used to determine whether each bearer in the judgment queue has reached the urgent scheduling moment according to the comparison result, including: when the comparison result indicates that the moment corresponding to the current scheduling time slot is not less than the urgent scheduling moment of each bearer, determining that each bearer has reached the urgent scheduling moment; when the comparison result indicates that the moment corresponding to the current scheduling time slot is greater than the urgent scheduling moment of each bearer, determining that each bearer has not reached the urgent scheduling moment.

[0086] A type unit is used to determine the type of the current scheduling time slot according to whether each bearer in the decision queue has reached the urgent scheduling moment, including: when there is a bearer in the decision queue that has reached the urgent scheduling moment, determining the type of the current scheduling time slot as an urgent scheduling time slot; when there is no bearer in the decision queue that has reached the urgent scheduling moment, determining the type of the current scheduling time slot as a sleep time slot.

[0087] The allocation module 44 includes: an allocation submodule, which is used to allocate the target resources to all bearers corresponding to the current scheduling time slot according to the allocation strategy of the target resources, including: when the type of the current scheduling time slot is the downlink normally open time slot and the urgent scheduling time slot, allocating the target resources to all bearers corresponding to the current scheduling time slot using a multi-round allocation method, wherein the multi-round allocation method includes: a first round of allocation and a second round of allocation, the first round of allocation includes: allocating the required number of target resources to each bearer until each bearer reaches the minimum guaranteed rate, the second round of allocation includes: when the target resources are remaining after the first round of allocation, allocating the target resources to the highest priority bearer until all the data packets of the highest priority bearer have been scheduled; in the case of the sleep time slot, turning off the power amplifier of the current scheduling time slot.

[0088] The acquisition module 40 includes: an acquisition submodule, which is used to obtain the network load indicator of the network device according to a preset period, including: obtaining the physical resource block utilization of each time slot within the preset period; determining the latest utilization of the physical resource block of each time slot according to the physical resource block utilization of the time slot before the physical resource block utilization of each time slot and a preset forgetting factor; the maximum value of the latest utilization of the physical resource block of each time slot within the preset period is determined as the network load indicator.

[0089] It should be noted that Figure 4 The resource allocation device shown is used to execute Figure 2 The resource allocation method shown in the figure, therefore the relevant explanations in the above resource allocation method are also applicable to the resource allocation device, and will not be repeated here.

[0090] An embodiment of the present application further provides a computer device, comprising: a memory and a processor, wherein the memory is used to store program instructions; and the processor is connected to the memory and is used to execute the above-mentioned resource allocation method.

[0091] An embodiment of the present application further provides a non-volatile storage medium, which includes a stored computer program, wherein a device where the non-volatile storage medium is located executes the above-mentioned resource allocation method by running the computer program.

[0092] An embodiment of the present application also provides a computer program product, including a non-volatile computer-readable storage medium, wherein the non-volatile computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the resource allocation method in the present application are implemented.

[0093] An embodiment of the present application also provides a computer program product, including computer instructions, which implement the steps of the resource allocation method in the present application when executed by a processor.

[0094] The embodiment of the present application also provides a computer program, which, when executed by a processor, implements the steps of the resource allocation method in the present application.

[0095] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0096] In the above embodiments of the present application, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, please refer to the relevant description of other embodiments.

[0097] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of the units can be a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.

[0098] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0099] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0100] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, disk or optical disk and other media that can store program codes.

[0101] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A resource allocation method, characterized in that: include: Obtain network load indicators of network devices according to a preset period; When the network load indicator is lower than a preset threshold value, obtaining the urgent scheduling time of each bearer in the service quality judgment queue corresponding to the current scheduling time slot, and determining the type of the current scheduling time slot according to the urgent scheduling time of each bearer; A target resource allocation strategy for all bearers corresponding to the current scheduling time slot is determined according to the type of the current scheduling time slot, and the target resource is allocated to all bearers corresponding to the current scheduling time slot according to the target resource allocation strategy.

2. The method according to claim 1, characterized in that Determining the type of the current scheduling time slot according to the urgent scheduling time of each bearer includes: When the type of the current scheduling time slot is not a downlink normally open time slot, obtaining a comparison result between the urgent scheduling time of each bearer in the decision queue and the time corresponding to the current scheduling time slot; Determine whether each bearer in the judgment queue reaches an urgent scheduling time according to the comparison result; The type of the current scheduling time slot is determined according to whether each bearer in the decision queue reaches an urgent scheduling moment.

3. The method according to claim 2, characterized in that Obtaining a comparison result between the urgent scheduling time of each bearer in the decision queue and the time corresponding to the current scheduling time slot, including: Obtaining the arrival time of the first arriving data packet of each carrier, the transmission delay of the first arriving data packet calculated based on the minimum guaranteed rate, the transmission delay of the first arriving data packet calculated based on the maximum guaranteed rate, the data packet delay budget and the data packet delay margin; Determine the urgent scheduling time of each bearer according to the arrival time of the first arriving data packet of each bearer, the transmission delay of the first arriving data packet calculated based on the minimum guaranteed rate, the transmission delay of the first arriving data packet calculated based on the maximum guaranteed rate, the data packet delay budget and the data packet delay margin; The comparison result is obtained by comparing the urgent scheduling time of each bearer with the time corresponding to the current scheduling time slot.

4. The method according to claim 2, characterized in that: Determining whether each bearer in the decision queue reaches an urgent scheduling moment according to the comparison result includes: When the comparison result indicates that the time corresponding to the current scheduling time slot is not less than the urgent scheduling time of each bearer, determining that each bearer reaches the urgent scheduling time; When the comparison result indicates that the time corresponding to the current scheduling time slot is greater than the urgent scheduling time of each bearer, it is determined that each bearer has not reached the urgent scheduling time.

5. The method according to claim 2, characterized in that: Determining the type of the current scheduling time slot according to whether each bearer in the decision queue reaches an urgent scheduling moment includes: In the case that there is a bearer in the decision queue that reaches the urgent scheduling time, determining the type of the current scheduling time slot as an urgent scheduling time slot; In a case where there is no bearer in the decision queue that reaches the urgent scheduling time, it is determined that the type of the current scheduling time slot is a sleep time slot.

6. The method according to claim 1, characterized in that Allocating the target resource to all bearers corresponding to the current scheduling time slot according to the allocation strategy of the target resource includes: In the case where the type of the current scheduling time slot is a downlink normally open time slot and the urgent scheduling time slot, a multi-round allocation method is used to allocate target resources to all bearers corresponding to the current scheduling time slot, wherein the multi-round allocation method includes: a first round of allocation and a second round of allocation, the first round of allocation includes: allocating the required number of target resources to each bearer until each bearer reaches a minimum guaranteed rate, and the second round of allocation includes: in the case where the target resources are remaining after the first round of allocation, allocating the target resources to the highest priority bearer until all data packets of the highest priority bearer have been scheduled; When the type of the currently scheduled time slot is a sleep time slot, the power amplifier of the currently scheduled time slot is turned off.

7. The method according to claim 1, characterized in that Obtain network load indicators of network devices according to preset periods, including: Obtaining a physical resource block utilization rate of each time slot within the preset period; Determine the latest utilization rate of the physical resource blocks in each time slot according to the utilization rate of the physical resource blocks in the previous time slot and a preset forgetting factor; The maximum value of the latest utilization rate of the physical resource block of each time slot within the preset period is determined as the network load indicator.

8. A resource allocation device, characterized in that: include: An acquisition module, used to acquire network load indicators of network devices according to a preset period; A determination module, configured to obtain, when the network load index is lower than a preset threshold value, an urgent scheduling time of each bearer in the service quality judgment queue corresponding to the current scheduling time slot, and determine the type of the current scheduling time slot according to the urgent scheduling time of each bearer; An allocation module is used to determine the target resource allocation strategy of all bearers corresponding to the current scheduling time slot according to the type of the current scheduling time slot, and allocate the target resource to all bearers corresponding to the current scheduling time slot according to the allocation strategy of the target resource.

9. A computer device, characterized in that: include: A memory and a processor, wherein the memory is used to store program instructions; The processor is connected to the memory, and is used to execute the resource allocation method described in any one of claims 1 to 7.

10. A computer program product comprising computer instructions, characterized in that: When the computer instructions are executed by a processor, the resource allocation method described in any one of claims 1 to 7 is implemented.

Citation Information

Cited By

  • Resource allocation method and device and nonvolatile storage medium

    CN119967599A