Method and device for managing scheduling request in 5G / NR system and base station
By determining the scheduling sequence in the 5G/NR system and prioritizing the handling of important services and low-latency conditions, the scheduling problem when the uplink resources are insufficient is solved and communication quality is ensured.
Patent Information
- Application Number
- CN202411356815.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-26
- Publication Date
- 2024-11-08
AI Technical Summary
In 5G/NR systems, how to schedule multiple scheduling requests (SRs) is an urgent problem to be solved, especially when the uplink resources are insufficient, important services and SRs with high latency requirements cannot be scheduled in time, which affects the communication quality.
When the uplink resources are insufficient, determine the scheduling sequence, prioritize the processing of SRs with preset important services and low latency conditions, and divide the scheduling queues through channel priority, waiting processing time and sending cycle to ensure that SRs with high latency requirements for important services and high latency requirements are required by SRs. Get timely dispatch.
It effectively ensures the communication quality of uplink data, ensures that important services and SRs with high latency requirements are timely scheduled when resources are insufficient, and improves communication quality.
Smart Images

Figure CN118921752A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to mobile communication technology, and more particularly to a method, device and base station for managing scheduling requests in a 5G / NR system. Background Art
[0002] In wireless protocols, scheduling requests (SR) are used to apply for transmission resources for uplink data, and play an important role in the uplink communication of terminals. In the long-term evolution system, SR configuration is relatively simple, and only one SR is configured for one terminal. In the new radio (NR) system, up to 8 SR resources can be configured for each terminal, which means that different SR resources can be configured for different uplink channels to meet the latency requirements of different services. So how to schedule multiple SRs for 5G is an urgent problem to be solved. Summary of the invention
[0003] Embodiments of the present application provide a method, device, and base station for managing scheduling requests in a 5G / NR system.
[0004] A method for managing scheduling requests in a 5G / NR system, applied to a base station, the method comprising: When the allocatable uplink resources cannot meet the needs of the current multiple scheduling requests SR, determine the scheduling order of the multiple SRs, wherein the SRs ranked first in the scheduling order include SRs of preset important services and / or SRs corresponding to data that meet preset low latency conditions; The allocatable uplink resources are used to process the SRs that are ranked first in the scheduling order.
[0005] A management device for scheduling requests in a 5G / NR system, applied to a base station, the device comprising: A determination module, configured to determine a scheduling order of the multiple SRs when the allocatable uplink resources cannot meet the uplink resources required by the current multiple SRs, wherein the SRs ranked first in the scheduling order include SRs of preset important services and / or SRs corresponding to data that meet preset low latency conditions; The processing module is configured to utilize the allocatable uplink resources to process the SR that is ranked first in the scheduling order.
[0006] A base station comprises the device described above.
[0007] In the embodiment of the present application, when the allocatable uplink resources cannot meet the needs of the current multiple SRs, a scheduling order is determined for the multiple SRs, and the allocatable uplink resources are used to process the SRs that are ranked first in the scheduling order, thereby ensuring that the SRs of important services and SRs with high latency requirements are scheduled in a timely manner when the allocatable uplink resources are insufficient, thereby effectively ensuring the communication quality of the uplink data.
[0008] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or be understood by implementing the present application. Other advantages of the present application can be realized and obtained by the schemes described in the description and the drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0009] The accompanying drawings are used to provide an understanding of the technical solution of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present application and do not constitute a limitation on the technical solution of the present application.
[0010] Figure 1 A flowchart of a method for managing SR in a 5G / NR system provided in an embodiment of the present application; Figure 2 A schematic diagram of a management method for SR resources provided in an embodiment of the present application; Figure 3 A schematic diagram of the structure of a scheduling request management device in a 5G / NR system provided in an embodiment of the present application. DETAILED DESCRIPTION
[0011] The present application describes multiple embodiments, but the description is exemplary rather than restrictive, and it is obvious to those skilled in the art that there may be more embodiments and implementations within the scope of the embodiments described in the present application. Although many possible feature combinations are shown in the drawings and discussed in the specific embodiments, many other combinations of the disclosed features are also possible. Unless specifically limited, any feature or element of any embodiment may be used in combination with any other feature or element in any other embodiment, or may replace any other feature or element in any other embodiment.
[0012] The present application includes and contemplates combinations of features and elements known to those of ordinary skill in the art. The embodiments, features and elements disclosed in the present application may also be combined with any conventional features or elements to form a unique invention scheme. Any features or elements of any embodiment may also be combined with features or elements from other invention schemes to form another unique invention scheme. Therefore, it should be understood that any feature shown and / or discussed in the present application may be implemented individually or in any appropriate combination. Therefore, except for the limitations made according to the attached claims and their equivalents, the embodiments are not subject to other restrictions. In addition, various modifications and changes may be made within the scope of protection of the attached claims.
[0013] In addition, when describing representative embodiments, the specification may have presented the method and / or process as a specific sequence of steps. However, to the extent that the method or process does not rely on the specific order of the steps described herein, the method or process should not be limited to the steps of the specific order described. As will be understood by those of ordinary skill in the art, other sequences of steps are also possible. Therefore, the specific sequence of the steps set forth in the specification should not be interpreted as a limitation to the claims. In addition, the claims for the method and / or process should not be limited to the steps of performing them in the order written, and those skilled in the art can easily understand that these sequences can be changed and still remain within the spirit and scope of the embodiments of the present application.
[0014] Figure 1 A flow chart of a method for managing SR in a 5G / NR system provided in an embodiment of the present application. Figure 1 As shown, the method is applied to a base station, and the method includes:
[0015] Step 101: When the allocatable uplink resources cannot meet the needs of the current multiple SRs, determine the scheduling order of the multiple SRs, wherein the SRs ranked first in the scheduling order include SRs of preset important services and / or SRs corresponding to data that meet preset low latency conditions; The allocatable uplink resources are idle resources that can be used to transmit uplink data.
[0016] The allocatable uplink resources cannot meet the needs of multiple current SRs, indicating that the uplink idle resources are insufficient. When there are fewer uplink subframes and a large number of SRs received at the same time, the problem of insufficient uplink idle resources is likely to occur.
[0017] In the prior art, the SR scheduling method is generally random scheduling, that is, when the base station receives multiple SRs at the same time, random scheduling is performed to ensure the fairness of each SR. However, when the allocatable uplink resources cannot meet the transmission resources required by the multiple SRs received, in actual operation, only the transmission resources required by some SRs can be met first. If random scheduling is continued, it cannot be guaranteed that all specific SRs can be scheduled in time.
[0018] Specifically, in the 5G / NR system, SRs are associated with different logical channels and have different latency requirements. If random scheduling continues to be used, SRs of some important services and services with high latency requirements will not be scheduled in a timely manner, which will increase latency and affect the quality of terminal uplink communications.
[0019] Therefore, an embodiment of the present application proposes to determine a scheduling order, wherein the communication quality of the uplink data corresponding to the SR ranked earlier in the scheduling order is higher than the communication quality of the uplink data corresponding to the SR ranked later, so as to ensure that the SR with high communication quality requirements can be scheduled in a timely and preferential manner, thereby ensuring that the SR of important services and the SR with high latency requirements are scheduled in a timely manner when the allocatable uplink resources are insufficient.
[0020] Step 102: Using the allocatable uplink resources, process the SR that is ranked first in the scheduling order; Processing multiple SRs in accordance with the scheduling order can ensure that SRs of important services and SRs with high latency requirements are scheduled in a timely manner, thereby effectively ensuring the communication quality of uplink data.
[0021] The method provided in the embodiment of the present application determines a scheduling order for multiple SRs when the allocatable uplink resources cannot meet the needs of multiple current SRs, and uses the allocatable uplink resources to process the SRs that are ranked first in the scheduling order, thereby ensuring that SRs of important services and SRs with high latency requirements are scheduled in a timely manner when the allocatable uplink resources are insufficient, thereby effectively ensuring the communication quality of uplink data.
[0022] The method provided in the embodiment of the present application is described below: First, the transmission resources requested by SR are explained: Step 1: After the cell within the base station coverage is established, the base station initializes the SR resources.
[0023] Step 2: After the Radio Resource Control (RRC) connection is established, the terminal accesses the cell. The base station side can allocate one or more SR resources to each terminal according to the service delay requirements of the terminal, so that the terminal initiates SR using the allocated SR resources; SR is sent periodically, so each terminal also occupies its allocated SR resources periodically. The shorter the SR sending period, the smaller the delay of the data corresponding to the SR; conversely, the longer the SR sending period, the greater the delay of the data corresponding to the SR.
[0024] In addition, the occupation periods of at least some of the allocated SR resources are different, and therefore, the sending periods of at least some of the SRs are different.
[0025] Among them, the SR resources allocated to each terminal are orthogonal resources, and the base station side can allocate SR resources through time division multiplexing, frequency division multiplexing, and code division multiplexing.
[0026] Each logical channel (LCH) can be assigned an SR and identified by an SR ID, and multiple logical channels can use the same SR ID. Each SR resource has a unique resource identifier, and the resource identifier corresponds to the SR ID one by one.
[0027] Figure 2 Schematic diagram of the SR resource management method provided in the embodiment of the present application. Figure 2 As shown, Figure 2 As an example, three SR resources are given, namely SR resource ID1, SR resource ID2 and SR resource ID3; three SR IDs, namely SR ID1, SRID2 and SR ID3; four LCHs, namely LCH1, LCH2, LCH3 and LCH4; wherein each LCH has a corresponding SR ID, wherein LCH1 corresponds to SR ID1, LCH2 corresponds to SR ID3, and LCH3 and LCH4 both correspond to SR ID2; each SR ID has a corresponding SR resource, wherein SR ID1 corresponds to SR resource ID2, SR ID2 corresponds to SR resource ID1, and SR ID3 corresponds to SR resource ID3.
[0028] Step 3: When processing uplink communication services, the terminal needs to send an SR to the base station to request uplink resources to transmit uplink data; each terminal triggers different SRs according to the service type.
[0029] Step 4: The base station receives the SR.
[0030] Due to the multiplexing characteristics of SR resources, multiple SRs from different terminals or different logical channels are often received at the same time. When uplink resources are insufficient, these SRs need to be scheduled in an orderly manner.
[0031] The following describes how to determine the scheduling order of SRs: In an exemplary embodiment, determining the scheduling order of the multiple SRs includes: Obtaining a channel priority of a logical channel corresponding to each SR in the multiple SRs, wherein the channel priority is determined according to a quality of service (Quality of Service) parameter corresponding to a service type of a radio bearer of the logical channel; Determining a first priority of each SR in the multiple SRs according to the channel priority, wherein the higher the channel priority, the higher the first priority; and the lower the channel priority, the lower the first priority; The multiple SRs are divided into multiple first scheduling queues, wherein the first priority of the SRs in each first scheduling queue is the same, and the scheduling order of the multiple first scheduling queues is from high to low according to the first priority.
[0032] Specifically, in the NR protocol, each LCH is associated with an SR resource, and a terminal can be configured with up to 8 SR resources. LCH is associated with a specific radio bearer, where the relevant content of the bearer type in the NR protocol is shown in Table 1:
[0033] Table 1 In Table 1, the 5QI values are quantitative indicators of QoS levels in 5G, GBR (Guaranteed Bit Rate) and NGBR (Non-Guaranteed Bit Rate).
[0034] In this example, the default priority of each service type recorded in Table 1 can be used as a protocol specified value, which is used to indicate the priority of the service type, and is used as the channel priority here. In actual applications, the channel priority of the LCH can also be determined based on other information.
[0035] The default priority value ranges from 1 to 100. In order to reduce the computational complexity, the default priority is quantized with a step size of 5 and mapped to the first priority (1 to 20), as shown in Table 2:
[0036] Table 2 In Table 2, the smaller the first priority value is, the higher the priority level is; the larger the first priority is, the lower the priority level is; therefore, the SR scheduling priority corresponding to the LCH with a higher priority is higher. According to the first priority determined in Table 2, the first priority corresponding to each radio bearer in Table 1 is shown in Table 3:
[0037] Table 3 Based on Table 3, the first priority corresponding to the SR can be determined according to the 5QI value.
[0038] For example, the three received SRs are 5QI 1 SR, 5QI 2 SR and 5QI 7 SR. According to Table 3, the first priority of 5QI 1 SR is 4, the first priority of 5QI 2 SR is 8, and the first priority of 5QI 7 SR is 14. Since the first priorities of the three SRs are different, three first scheduling queues can be obtained, in which 5QI 1 SR, 5QI 2 SR and 5QI 7 SR are processed in order from high to low first priorities.
[0039] From the above example, it can be seen that the communication quality of high-priority services can be guaranteed by giving priority to scheduling SRs with high QOS priorities.
[0040] See also Figure 2 As can be seen from the schematic diagram, one SR ID can correspond to multiple LCHs. If the channel priorities of multiple LCHs are different, it is necessary to consider the different channel priorities of the multiple LCHs to determine the first priority of the SR.
[0041] In an exemplary embodiment, determining the first priority of each SR according to the channel priority includes: If a first SR among the multiple SRs corresponds to multiple LCHs and at least some of the multiple LCHs have different channel priorities, the first priority of the first SR is determined according to the LCH with the highest channel priority among the multiple LCHs.
[0042] By selecting the LCH with the highest priority among multiple LCH channels, it can be ensured that the first SR has a higher first priority, thereby increasing the possibility that the first SR is scheduled in time.
[0043] In the process of processing the first scheduling queue, the same first scheduling queue may contain multiple SRs. If multiple SRs in the same first scheduling queue are randomly scheduled, the SR received for the first time may be given priority, while the SRs received multiple times in succession may continue to be delayed, resulting in a lack of fairness in the SR processing operation. In addition, if the SR initiated by the terminal is not processed for a long time, the terminal will release the SR resources and no longer initiate the SR, and start to request uplink resources through a random access method in the connected state, resulting in an increase in the uplink service delay, thereby reducing the uplink communication quality. In order to solve the above technical problems, the embodiments of the present application propose the following solutions, including:
[0044] If any first scheduling queue includes at least two SRs, obtaining the waiting time information of each SR in the first scheduling queue; Determine the second priority of each SR in the first scheduling queue according to the time information, wherein the larger the value of the time information is, the higher the second priority is; the smaller the value of the time information is, the lower the second priority is; The first scheduling queue is divided into multiple second scheduling queues, wherein the second priority of SRs in each second scheduling queue is the same, and the scheduling order of the multiple second scheduling queues is from high to low according to the second priority.
[0045] In this step, the second priority is determined according to the time information of the SR waiting for processing, and multiple SRs in the first scheduling queue are processed in descending order according to the second priority. This can increase the probability of SRs waiting for processing for a long time being processed. In addition, it can effectively avoid the problem of increased uplink service delay caused by random access initiated by SRs not being scheduled for a long time.
[0046] Due to the difference in the SR sending cycle, there are differences in the terminal's tolerance for continuing to wait for SR responses for at least two SRs with the same waiting response time. For example, the sending cycle of SR ID1 is 10ms, and the sending cycle of SR ID2 is 100ms. Since the first SR was initiated, the waiting time for both is 55ms. However, for the SR with SR ID1, the terminal has initiated SR five times in a row, and for the SR with SR ID2, the terminal has only initiated one SR request. From the number of SRs initiated, it can be seen that the base station should give priority to the SR with SR ID1. Based on the above analysis, the embodiments of the present application propose the following solutions, including:
[0047] The obtaining the time information of each SR waiting for processing in the first scheduling queue includes: The following operations are performed on each SR in the first scheduling queue, including: For the current SR, the waiting time of the current SR is determined according to the current time and the first reception time of the current SR, and the ratio of the waiting time of the current SR to the maximum waiting time of the current SR is calculated to obtain the time information of the current SR waiting for processing.
[0048] Specifically, when the same first scheduling queue contains multiple SRs, the time when the SR is first received is recorded ( ), based on the difference in current scheduling time ( ) and the time when the SR was first received ( ), determine the waiting time for the SR to be processed ( ), and then calculate the SR waiting time ( ) and the maximum waiting time of the SR ( ) of the ratio ( ), where the ratio ( ) is larger, the higher the second priority is; conversely, the ratio ( ) is smaller, the lower the second priority is. The calculation expression is as follows: Among them, after the SR is processed, the length of time the SR waits for processing ( ) is cleared.
[0049] Among them, the ratio ( ) ranges from 0 to 1, where the larger the ratio is, the closer the SR waiting time is to the maximum waiting time ( ), the greater the possibility of initiating random access to request resources, the greater the ratio ( ) Large SR takes precedence over ratio ( ) Small SR.
[0050] Furthermore, the maximum waiting time of the current SR ( ) is based on the current SR sending cycle ( ) and the maximum number of retransmissions for the current SR ( ), where the calculation expression is as follows: T_sr is the period configured for each SR, and SR_max is the maximum number of retransmissions of the terminal SR.
[0051] Since SR is sent periodically, when the number of consecutive SR transmissions exceeds SR_max, the terminal will release SR resources, stop sending SR, and start requesting uplink resources through random access in the connected state.
[0052] For example, there are two SRs in any first scheduling queue, namely SR ID3 and SR ID4, and their transmission cycles are both 10ms, and their maximum retransmission times are 8 and 4 respectively. Therefore, their maximum waiting times are 80ms and 40ms respectively. If their current waiting processing time is 30ms, since the SR with SR ID4 is about to reach the maximum number of retransmissions of the SR, if the SR with SR ID4 is not processed in time, the terminal corresponding to the SR with SR ID4 will be triggered to initiate random access to apply for uplink resources.
[0053] According to the solution provided in this application, the ratio of SR ID3 is 3 / 8, and the ratio of SR ID4 is 3 / 4. Since the ratio of SR ID4 is greater than that of SR ID3, SR priority processing of SR ID4 can effectively reduce the occurrence of random access problems caused by long-term unprocessed SR, and effectively reduce the uplink communication quality.
[0054] Furthermore, in the process of processing the second scheduling queue, any second scheduling queue may contain multiple SRs with the same second priority. If multiple SRs in the same second scheduling queue are randomly scheduled, it is possible that the SRs corresponding to the data with large delay will be processed first, while the SRs corresponding to the data with low delay will continue to be delayed, so that the data with low delay cannot obtain the required transmission resources in time, resulting in the problem of reduced uplink communication quality; in addition, to a certain extent, the SR processing operation lacks fairness. In order to solve the above technical problems, the embodiments of the present application propose the following solutions, including:
[0055] If any second scheduling queue includes at least two SRs, obtaining a sending period of each SR in the second scheduling queue; Determine, according to the sending cycle, the third priority of each SR in the second scheduling queue, wherein the shorter the sending cycle, the higher the third priority; the longer the sending cycle, the lower the third priority; The second scheduling queue is divided into multiple third scheduling queues, wherein the third priority of the SR in each third scheduling queue is the same, and the scheduling order of the multiple third scheduling queues is from high to low according to the third priority.
[0056] Specifically, in actual applications, different service types can configure SRs with different delays according to different delay requirements. The shorter the SR sending period, the shorter the delay requirement. Therefore, SRs with short sending periods are given priority.
[0057] For example, there are two SRs in the same second scheduling queue, namely SR of 5QI 79 and SR of 5QI 80, and their transmission periods are 10ms and 2ms respectively. Since the transmission period of SR of 5QI 79 is greater than that of SR of 5QI 80, SR of 5QI 80 is scheduled first.
[0058] In addition, the scheduling order of at least two SRs in the same third scheduling queue is a random order, and multiple SRs in the same third scheduling queue are randomly scheduled.
[0059] As can be seen from the above, when processing SR, the embodiment of the present application takes into account the channel priority of LCH so that the data of the high-priority radio bearer can be transmitted in time, ensuring that the SR of important services and the SR with high latency requirements are scheduled in time. In addition, the embodiment of the present application also takes into account the waiting time for SR processing and the sending cycle of SR to take into account the fairness of SR scheduling.
[0060] The following is an exemplary description of the method provided in the embodiment of the present application: The embodiment of the present application provides a method for processing SR in a 5G / NR system, the method comprising: Step A01: when the allocatable uplink resources cannot satisfy the uplink resources required by the current multiple SRs, determine the channel priority of the logical channel corresponding to each SR; Step A02: Determine the first priority of each SR according to the channel priority; Step A03: divide the multiple SRs into M first scheduling queues according to the first priority, wherein the first priority of the SRs in each first scheduling queue is the same, where M is an integer greater than or equal to 2; Step A04: determine the processing order of the M first scheduling queues in descending order of the first priority; Step A05: Process the mth first scheduling queue according to the processing order of the first scheduling queue, where m is an integer greater than or equal to 1 and less than or equal to M; Step A06: determine whether the number of SRs in the mth first scheduling queue is one; If yes, then execute step A07 first and then execute steps A08 and A09; otherwise, execute steps B01 to B09 first and then execute steps A08 and A09; Step A07, processing the mth SR in the first scheduling queue; Step A08, update the value of m to m+1; Step A09, determine whether the updated m is greater than M; If the updated m is greater than M, the process ends, otherwise, continue to step A05.
[0061] Step B01, determining the time information of each SR waiting for processing in the mth first scheduling queue; Step B02: Determine the second priority of each SR in the mth first scheduling queue according to the time information; Step B03: according to the second priority, divide the SRs in the mth first scheduling queue into N second scheduling queues, wherein the second priority of the SRs in each second scheduling queue is the same, wherein N is an integer greater than or equal to 2; Step B04: Determine the processing order of the N second scheduling queues in descending order of the second priority; Step B05: Process the nth second scheduling queue according to the processing order of the second scheduling queue, where n is an integer greater than or equal to 1 and less than or equal to N; Step B06: determine whether the number of SRs in the nth second scheduling queue is one; If yes, then execute step B07 first and then execute steps B08 and B09; otherwise, execute steps C01 to C08 first and then execute steps B08 and B09; Step B07, processing the nth SR in the second scheduling queue; Step B08, update the value of n to n+1; Step B09, determine whether the updated n is greater than N; If the updated n is greater than N, execute step A08; otherwise, continue to execute step B05.
[0062] Step C01, determining the sending period of each SR in the nth second scheduling queue; Step C02: Determine the third priority of each SR in the nth second scheduling queue according to the sending cycle; Step C03: according to the third priority, divide the SRs in the nth second scheduling queue into K third scheduling queues, wherein the third priority of the SRs in each third scheduling queue is the same, wherein K is an integer greater than or equal to 2; Step C04: determining the processing order of the K third scheduling queues in descending order of the third priority; Step C05: Process the kth third scheduling queue according to the processing order of the third scheduling queue, where k is an integer greater than or equal to 1 and less than or equal to K; Step C06: Process the kth SR in the third scheduling queue in a random order; Step C07, update the value of k to k+1; Step C08, determining whether the updated n is greater than N; If the updated k is greater than K, execute step B08; otherwise, continue to execute step C05.
[0063] The method provided in the embodiment of the present application utilizes the channel priority of LCH, the time information of SR waiting processing, and the sending period of SR to schedule SR, thereby ensuring the delay requirements of important services and the delay requirements of services with high delay requirements, and taking into account the fairness of SR scheduling.
[0064] Figure 3 A schematic diagram of the structure of a management device for scheduling requests in a 5G / NR system provided in an embodiment of the present application. Figure 3 As shown, the device is applied to a base station, and the device includes:
[0065] A determination module, configured to determine a scheduling order of the multiple SRs when the allocatable uplink resources cannot meet the uplink resources required by the current multiple SRs, wherein the SRs ranked first in the scheduling order include SRs of preset important services and / or SRs corresponding to data that meet preset low latency conditions; The processing module is configured to utilize the allocatable uplink resources to process the SR that is ranked first in the scheduling order.
[0066] The device provided in the embodiment of the present application determines a scheduling order for multiple SRs when the allocatable uplink resources cannot meet the needs of the current multiple SRs, and uses the allocatable uplink resources to process the SRs that are ranked first in the scheduling order, thereby ensuring that SRs of important services and SRs with high latency requirements are scheduled in a timely manner when the allocatable uplink resources are insufficient, thereby effectively ensuring the communication quality of uplink data.
[0067] In addition, the present invention also provides a base station, including Figure 3 The device shown in the figure can be deployed as an independent functional module in the circuit structure of the base station, or integrated into the processor of the base station.
[0068] It will be appreciated by those skilled in the art that all or some of the steps, systems, and functional modules / units in the methods disclosed above may be implemented as software, firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some or all components may be implemented as software executed by a processor, such as a digital signal processor or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or transient medium). As is known to those skilled in the art, the term "computer storage medium" includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, it is well known to those skilled in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.
Claims
1. A method for managing scheduling requests in a 5G / NR system, applied to a base station, the method comprising: When the allocatable uplink resources cannot meet the needs of the current multiple scheduling requests SR, determine the scheduling order of the multiple SRs, wherein the SRs ranked first in the scheduling order include SRs of preset important services and / or SRs corresponding to data that meet preset low latency conditions; The allocatable uplink resources are used to process the SRs that are ranked first in the scheduling order.
2. The method according to claim 1, characterized in that The determining the scheduling order of the multiple SRs includes: Acquire a channel priority of a logical channel corresponding to each SR in the multiple SRs, wherein the channel priority is determined according to a quality of service parameter corresponding to a service type of a radio bearer of the logical channel; Determining a first priority of each SR in the multiple SRs according to the channel priority, wherein the higher the channel priority, the higher the first priority; and the lower the channel priority, the lower the first priority; The multiple SRs are divided into multiple first scheduling queues, wherein the first priority of the SRs in each first scheduling queue is the same, and the scheduling order of the multiple first scheduling queues is from high to low according to the first priority.
3. The method according to claim 2, characterized in that The determining, according to the channel priority, a first priority of each SR includes: If a first SR among the multiple SRs corresponds to multiple logical channels and at least some of the multiple logical channels have different channel priorities, the first priority of the first SR is determined according to a logical channel with the highest channel priority among the multiple logical channels.
4. The method according to claim 2, characterized in that: The method further comprises: If any first scheduling queue includes at least two SRs, obtaining the waiting time information of each SR in the first scheduling queue; Determine the second priority of each SR in the first scheduling queue according to the time information, wherein the larger the value of the time information is, the higher the second priority is; the smaller the value of the time information is, the lower the second priority is; The first scheduling queue is divided into multiple second scheduling queues, wherein the second priority of SRs in each second scheduling queue is the same, and the scheduling order of the multiple second scheduling queues is from high to low according to the second priority.
5. The method according to claim 4, characterized in that The obtaining the time information of each SR waiting for processing in the first scheduling queue includes: The following operations are performed on each SR in the first scheduling queue, including: For the current SR, the waiting time of the current SR is determined according to the current time and the first reception time of the current SR, and the ratio of the waiting time of the current SR to the maximum waiting time of the current SR is calculated to obtain the time information of the current SR waiting for processing.
6. The method according to claim 5, characterized in that: The maximum waiting time of the current SR is determined according to the sending period of the current SR and the maximum number of retransmissions of the current SR.
7. The method according to claim 4, characterized in that The method further comprises: If any second scheduling queue includes at least two SRs, obtaining a sending period of each SR in the second scheduling queue; Determine, according to the sending cycle, the third priority of each SR in the second scheduling queue, wherein the shorter the sending cycle, the higher the third priority; the longer the sending cycle, the lower the third priority; The second scheduling queue is divided into multiple third scheduling queues, wherein the third priority of the SR in each third scheduling queue is the same, and the scheduling order of the multiple third scheduling queues is from high to low according to the third priority.
8. The method according to claim 7, characterized in that The scheduling order of at least two SRs in the same third scheduling queue is a random order.
9. A management device for scheduling requests in a 5G / NR system, applied to a base station, the device comprising: A determination module, configured to determine a scheduling order of the multiple SRs when the allocatable uplink resources cannot meet the uplink resources required by the current multiple SRs, wherein the SRs ranked first in the scheduling order include SRs of preset important services and / or SRs corresponding to data that meet preset low latency conditions; The processing module is configured to utilize the allocatable uplink resources to process the SR that is ranked first in the scheduling order.
10. A base station, comprising the device according to claim 9.
