CN113490281B - Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system - Google Patents
Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system Download PDFInfo
- Publication number
- CN113490281B CN113490281B CN202110819157.7A CN202110819157A CN113490281B CN 113490281 B CN113490281 B CN 113490281B CN 202110819157 A CN202110819157 A CN 202110819157A CN 113490281 B CN113490281 B CN 113490281B
- Authority
- CN
- China
- Prior art keywords
- scheduling
- service
- factor
- priority
- buffersize
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention has recorded a method used for 5G NR system scheduling optimization and apparatus, through obtaining every influence factor of the priority of deployment, confirm the priority of deployment of every terminal; and acquiring service bearing information of the terminal and determining the current data volume to be scheduled of the terminal. And sequencing according to the determined scheduling priority and the data volume to be scheduled, and carrying out resource allocation in sequence by combining the current channel condition and the system residual resources so as to achieve the purpose of resource optimization. The invention also describes a device for realizing the method. The invention not only considers various factors related to the traditional 4G scheduling algorithm, but also newly considers the service cache difference brought by the CU-DU separation architecture; under the new 5G framework, the traffic caching conditions of the terminal to be scheduled on both sides of the CU and the DU are dynamically tracked, the scheduling priority and the resource allocation of different terminals are adjusted in real time, more reasonable resource scheduling and allocation can be provided for the terminal, the scheduling fairness and good user perception are considered, and the network performance is improved.
Description
Technical Field
The present invention relates to the field of wireless communication technologies, and in particular, to a method and an apparatus for scheduling optimization of a 5G NR system, and an electronic device.
Background
This section is intended to provide a background or context to the embodiments of the invention that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
With the development of the mobile internet, more and more devices are connected to the mobile network, and new services and applications emerge endlessly. The explosion of mobile data traffic will present a serious challenge to the network. To meet the increasing demand for mobile traffic, the fifth generation (5th generation, 5g) mobile communication networks have been produced. The data transmission rate of the 5G network is faster than the wired internet, 100 times faster than the previous 4G LTE cellular network, and has lower network delay.
In a 5G communication system, the BBU function will be reconfigured into two functional entities, CU and DU. The partitioning of CUs and DU functions distinguishes between handling the real-time nature of the content. The CU equipment mainly comprises a non-real-time wireless high-level protocol stack function, and simultaneously supports partial core network function sinking and edge application service deployment, and the DU equipment mainly processes a physical layer function and a layer function with real-time requirements. Thus, in this system, the physical bottom layer in the original baseband processing unit BBU is sunk to the active antenna unit AAU for processing. The physical high layer, medium access control layer MAC and radio link layer control layer RLC with high real-time requirements are processed in the distribution unit DU, and the packet data convergence layer PDCP and radio resource control layer RRC with low real-time requirements are processed in the central unit CU.
Since the 5G system adopts a CU-DU separation architecture, and the protocol stack layer is divided between the CU and DU sides, this separation architecture may cause a certain real-time offset in the service caches on both sides of the CU and DU. At the same time, differences in the type of traffic bearer, the size of the traffic volume, and the performance of the scheduler itself can indirectly amplify such deviations. If the scheduler of the 5G system still adopts the conventional 4G scheduling algorithm, without considering the influence caused by the difference of the two-end service caches in the new architecture of 5G CU and DU separation, unreasonable scheduling priority and resource allocation may be calculated, thereby affecting the network performance and the user experience.
Therefore, it is desirable to provide a method and apparatus for scheduling optimization of a 5G NR system that can address the practical handling situation and bias problem of the 5G system to optimize system resource allocation.
Interpretation of terms:
BBU: the Base Band Unit (BBU) is a key unit for processing baseband signals and controlling a Base station in a distributed Base station and is connected with the RRU by adopting an optical fiber.
AAU: an Active Antenna Unit is a main device of a 5G base station, and structurally integrates a 4G-era RRU (remote radio Unit) + an Antenna Unit. A plurality of T/R units are integrated in the AAU, and the T/R units are radio frequency transceiving units. The AAU is not the only remote radio unit in the 5G base station, and there will still be RRUs in the 5G.
And MAC: media Access Control English original meaning: media access control layer, chinese paraphrasing: a medium access control layer.
RLC: radio Link Control Radio Link layer Control protocol.
PDCP: packet Data conversion Protocol Packet Data Convergence Protocol/Packet Data Convergence layer
RRC: radio Resource Control layer
DU: distributed unit
CU: central unit centralized unit
NR: new Radio, new air interface, fifth generation New Radio.
Disclosure of Invention
In order to solve the above problems, the present invention provides a method and an apparatus for scheduling optimization of a 5G NR system, which comprehensively consider various factors affecting scheduling priority in the 5G system under the condition of service cache differentiation on both sides of a CU-DU separation architecture of the 5G system, and determine reasonable scheduling priority and resource allocation for different terminals, so as to improve the performance of a scheduler and ensure good user experience.
To achieve the above object, the present invention provides a method for scheduling optimization of a 5G NR system, comprising the steps of:
s1: acquiring various influence factors of the scheduling priority, and determining the scheduling priority of each terminal;
s2: and acquiring service bearing information of the terminal, and determining the current data volume to be scheduled of the terminal so as to allocate resources.
Optionally, step S1 further includes the following process:
step S11: acquiring service type, bearing grade, service rate, distribution and retention priority, waiting time delay, DU side service cache, CU side service cache, channel condition and historical scheduling statistics of current service bearing of a terminal;
step S12: determining various factor values corresponding to the service level factor, the bearing level factor, the rate factor, the ARP factor, the time delay factor, the DU cache factor, the CU cache factor, the channel condition factor and the historical flow factor according to the obtained items;
step S13: determining an adjustment coefficient of each factor according to the proportion of each factor in the scheduling priority;
step S14: and determining the service bearing scheduling priority according to all the factor values and the corresponding adjusting coefficients.
Optionally, step S2 further includes the following process:
step 21: obtaining the minimum data volume Throughput to be dispatched of the terminal service bearer at present minLeft And a maximum amount of data Throughput maxLeft ；
Step 22: obtaining the service buffer size of each terminal service bearer on the CU side cu And DC side traffic buffer size BufferSize du And according to the obtained BufferSize cu 、BufferSize du Calculating the scheduling proportion alpha required for resource allocation bufferSize The formula is as follows:
step 23: according to a scheduling ratio alpha bufferSize Determining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flow Δ The formula is as follows:
BufferSize Δ ＝α bufferSize ·(Throughput maxLeft -Throughput minLeft )；
step 24: determining the final data volume buffer size to be scheduled according to the CU side service buffer size, the additionally distributed data volume and the lowest data volume sch The formula is as follows:
BufferSize sch ＝MIN(BufferSize du ，Throughput minLeft +BufferSize Δ )。
optionally, in step S11, the service class is mapped according to the requirement of the operator, and the mapping level supports a maximum level 4 configuration, including platinum, gold, silver, and bronze; the bearing grade is a default priority corresponding to 5QI according to different bearings; the service rate is the flow rate of the QoS corresponding to different loads; allocating and reserving the priority as ARP according to different load corresponding QoS; the waiting time delay is the time length when the data loaded on the DU side arrives or enqueues and is scheduled by the scheduler; the DU side service buffer is the size of the non-scheduled accumulative buffer which is accumulated on the DU side according to the load; the CU side service cache is the size of the accumulated cache which is not sent to the DU according to the load at the CU side; determining the MCS of the current UE according to the CQI reported by the UE, the actual measurement SINR of the physical layer to the channel and the downlink HARQ feedback condition by the channel condition; the historical scheduling statistics is that the traffic is counted according to the history of the load in the previous t TTIs, and t is a natural number.
Optionally, the value of the service class factor is mapped to different values according to the needs of an operator, and the white metal property is denoted as V Platinum Metallic is described as V Gold Silver attribute is denoted as V Silver Copper property is denoted as V Bronze The formula is as follows:
the bearer level factor value is obtained from the default priority of the standard or extended 5QI mapping corresponding to the bearer and is marked as V 5QI ＝Default Priority Level；
The rate factor value is obtained from the flow rate in the QoS attribute corresponding to the load, and the GBR flow is marked as V GBR non-GBR is denoted as V nonGBR The formula is as follows:
the bearer level factor value is obtained from the default priority of the standard or extended 5QI mapping corresponding to the bearer, and is denoted as V 5QI ＝Default Priority Level；
The rate factor value is obtained from the flow rate in the QoS attribute corresponding to the load, and the GBR flow is marked as V GBR non-GBR is denoted as V nonGBR The formula is as follows:
the ARP factor value is obtained from the ARP value in the QoS attribute corresponding to the load bearing and is marked as V ARP The range is 1 to 15;
the Delay factor value is from the bearer waiting scheduling duration Delay and the target maximum waiting Delay DelayTargetIs obtained and marked as V delay The formula is as follows:
the DelayTarget needs to consider the processing time delay of a core network and a base station protocol stack;
the channel condition factor value is obtained from the TB block size that the current MCS of the UE can support, and is marked as V TBSize (ii) a The formula:
wherein, TBmax is the bit number of the maximum code block of the UE, namely, the maximum TBSize of a single stream is taken in the case of a single stream, and the maximum TBSize which can be supported by the UE is taken in the case of a double stream; TBSize is obtained by table look-up mapping according to MCS and the maximum RB number of the corresponding bandwidth; single-stream n =1, double-stream n =2;
the CU and DU buffer factor values respectively represent service buffers at two sides of the CU and DU, the size of the loaded service volume is comprehensively reflected, the priority of the CU and DU should be properly improved when the service volume is larger, otherwise, the priority of the CU and DU should be reduced and is marked as V CuBuffer ，V DuBuffer ；
The historical traffic factor value is obtained from the load history scheduling statistics conversion and is marked as V History The formula is as follows:
wherein, V History (t-1) is the historical flow counted in the last TTI, and TBSize (t-1) is the maximum TBSize which can be supported by the channel condition in the last TTI; θ is a parameter less than 1.
Optionally, the calculation formula for determining the service bearer scheduling priority in step S14 is as follows:
(ii) a If there are multiple service bearers in a single UE, the highest priority in all the bearers is taken as the scheduling priority of the UE.
In addition, the invention also provides a device for scheduling optimization of the 5G NR system, which comprises the following components:
the CU and DU service buffer memory determining module is used for acquiring the service bearing service buffer memory size from the CU side and the DC side, updating the CU and DU service buffer memory condition in real time, sending the updated CU and DU service buffer memory condition to the scheduling priority determining module and the scheduling data amount determining module, receiving the processing results of other modules and updating locally;
the scheduling priority determining module is used for determining the scheduling priority of the terminal according to the priority factor values and the adjusting coefficients;
the scheduling data volume determining module is used for determining the current data volume to be scheduled of the terminal;
the resource allocation module is used for confirming the number of RBs and the size of the TB according to the data volume to be scheduled of the terminal, the current channel condition and the condition of the residual resources of the system;
and the scheduling maintenance module is used for maintaining various priority factors and adjustment coefficients of the scheduling priority determination module and information required by the scheduling data amount determination module in real time according to historical scheduling statistics, channel conditions, service bearing change, service cache change, a current scheduling result and scene demand change.
Optionally, the scheduling priority determining module determines the service bearer scheduling priority by using the following calculation formula:
if there are multiple service bearers in a single UE, the highest priority in all the bearers is taken as the scheduling priority of the UE.
Optionally, the scheduling data amount determining module determines the current data amount to be scheduled of the terminal by the following steps:
step 21: obtaining the minimum data volume Throughput of the terminal service bearing to be scheduled at present minLeft And maximum amount of data Throughput maxLeft ；
Step 22: obtaining the service buffer size B of each terminal service bearing on the CU sideufferSize cu And DC side traffic buffer size BufferSize du And according to the obtained BufferSize cu 、BufferSize du Calculating the scheduling proportion alpha required for resource allocation bufferSize The formula is as follows:
step 23: according to a scheduling ratio alpha bufferSize Determining the data volume BufferSize additionally allocated on the basis of the lowest flow of the current bearer Δ The formula is as follows:
BufferSize Δ ＝α bufferSize ·(Throughput maxLeft -Throughput minLeft )；
step 24: determining the final data volume buffer size to be scheduled according to the CU side service buffer size, the additionally distributed data volume and the lowest data volume sch The formula is as follows:
BufferSize sch ＝MIN(BufferSize du ，Throughput minLeft +BufferSize Δ )。
in addition, the present invention also provides an electronic device including:
a memory for storing a computer program;
a processor for executing the computer program stored in the memory, and when executed, implementing the above method for 5G NR system scheduling optimization.
The invention has the advantages and beneficial effects that: compared with the situation that resource scheduling in the existing NR system is inaccurate and unreasonable, the invention provides a method and a device for scheduling and optimizing a 5G NR system. When determining the scheduling priority and the data volume to be scheduled, the invention not only considers various factors related to the traditional 4G scheduling algorithm, but also newly considers the service cache difference brought by the CU-DU separation architecture. Under the new 5G architecture, the invention dynamically tracks the traffic caching condition of the terminal to be scheduled on both sides of the CU and the DU, adjusts the scheduling priority and the resource allocation of different terminals in real time, can provide more reasonable resource scheduling and allocation for the terminal, gives consideration to scheduling fairness and good user perception, and improves the network performance.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only part of the descriptions of some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a schematic flow chart illustrating the determination of scheduling priority in a method for scheduling optimization of a 5G NR system according to an embodiment;
FIG. 2 is a schematic flow chart illustrating resource allocation determination in a method for scheduling optimization of a 5G NR system according to an embodiment;
fig. 3 schematically shows an apparatus for scheduling optimization of a 5G NR system in an embodiment.
Detailed Description
The following description of the embodiments of the present invention will be made with reference to the accompanying drawings. It is understood that these embodiments are given solely for the purpose of enabling those skilled in the art to better understand and to practice the invention, and are not intended to limit the scope of the invention in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As will be appreciated by one skilled in the art, embodiments of the present invention may be embodied as a method, system, apparatus, device, or computer program product. Accordingly, the present disclosure may be embodied in the form of: entirely hardware, entirely software (including firmware, resident software, micro-code, etc.), or a combination of hardware and software.
In one embodiment, the invention provides a method for scheduling optimization of a 5G NR system, which is applied to a 5G communication system. As shown in fig. 1 and 2, the present invention mainly performs optimized scheduling from two aspects, namely, the determination of the scheduling priority of the 5G system and the determination of the resource allocation of the 5G system. The invention not only considers various factors related to the traditional 4G scheduling algorithm, but also newly considers the service cache difference brought by the CU-DU separation architecture. Under the new 5G architecture, more reasonable resource scheduling and allocation can be provided for the terminal.
In this embodiment, there is provided a method for scheduling optimization of a 5G NR system, comprising the steps of:
s1: acquiring various influence factors of the scheduling priority, and determining the scheduling priority of each terminal;
s2: and acquiring service bearing information of the terminal, and determining the current data volume to be scheduled of the terminal so as to allocate resources.
In the above embodiment, when determining the scheduling priority and the data amount to be scheduled, not only various factors involved in the conventional 4G scheduling algorithm are considered, but also the service cache difference caused by the CU-DU separation architecture is additionally considered. Under the new 5G architecture, more reasonable resource scheduling and allocation can be provided for the terminal, and the network performance and the user perception are improved.
Preferably, as shown in fig. 1, step S1 further includes the following process:
step S11: acquiring service type, bearing grade, service rate, distribution and retention priority, waiting time delay, DU side service cache, CU side service cache, channel condition and historical scheduling statistics of current service bearing of a terminal;
step S12: determining various factor values corresponding to the service level factor, the bearing level factor, the rate factor, the ARP factor, the time delay factor, the DU cache factor, the CU cache factor, the channel condition factor and the historical flow factor according to the obtained items;
step S13: determining an adjustment coefficient of each factor according to the proportion of each factor in the scheduling priority;
step S14: and determining the service bearing scheduling priority according to all the factor values and the corresponding adjusting coefficients.
Through the steps S11-14, a method for determining the scheduling priority of the 5G system is provided, wherein various influence factors of the scheduling priority are obtained firstly, and the method comprises the following steps: the method comprises the steps of service category, bearing level, service rate, allocation and retention priority, waiting time delay, channel condition, historical scheduling condition, DU side service buffer memory and CU side service buffer memory. Secondly, determining a corresponding factor value according to the influence factor, wherein the determining comprises the following steps: a traffic class factor value, a bearer class factor value, a rate factor value, an ARP factor value, a delay factor value, a channel condition factor value, a historical traffic factor value, a DU cache factor value, and a CU cache factor value. Then, according to the proportion of each influence factor in the scheduling, the adjusting coefficient is determined. And finally, determining the scheduling priority of each terminal according to the factor value and the corresponding adjusting coefficient.
In step S11, the service class is mapped according to the requirement of the operator, and the mapping level supports a maximum 4-level configuration including platinum, gold, silver, and bronze; the bearing grade is a default priority corresponding to 5QI according to different bearings; the service rate is the flow rate of the QoS corresponding to different loads; allocating and reserving the priority as ARP according to different load corresponding QoS; the waiting time delay is the time length when the data loaded on the DU side arrives or enqueues and is scheduled by the scheduler; the DU side cache is the size of the unscheduled accumulated cache accumulated on the DU side according to the load; the CU side service cache is the size of the accumulated cache which is not sent to the DU according to the load at the CU side; determining the MCS of the current UE according to the CQI reported by the UE, the actual measurement SINR of the physical layer to the channel and the downlink HARQ feedback condition by the channel condition; the historical scheduling statistics is that the traffic is counted according to the history of the load in the previous t TTIs, and t is a natural number.
The above terms are specifically interpreted as:
5QI:5G QoS indicator, used to index a 5G QoS characteristic.
QoS: quality of Service, qoS is an agreement between the network and the users and between users communicating with each other on the network about the Quality of information transmission and sharing, and can measure the overall performance of the Service experienced by the network users.
ARP: allocation and Retention Priority for performing a differentiated function in terms of resource Allocation and Retention Priority, the main purpose of ARP is to decide whether to accept or reject a bearer establishment or modification request in case of resource shortage. Meanwhile, ARP is used for special resource restrictions (e.g. at handover), to decide which bearer to drop. For example, in some scenarios, when some low-priority resources need to be released in the event of resource congestion, it is necessary to determine who releases who reservation according to the setting of ARP.
CQI: channel Quality Indication, CQI is measured by the UE, and thus, the CQI generally refers to downlink Channel Quality.
SINR: signal to Interference plus Noise Ratio, which is understood to be a Signal to Noise Ratio, refers to the Ratio of the strength of a received desired Signal to the strength of a received interfering Signal (Noise and Interference).
HARQ: hybrid Automatic Repeat Request (harq), a technique that combines forward error correction coding (FEC) and Automatic Repeat Request (ARQ).
MCS: modulation and Coding Scheme, modulation and Coding strategy, mainly implements the configuration of 802.11n radio frequency rates.
TTI: transmission time-interval, scheduling period, scheduling TTI length in 5G NR is 1 slot.
UE: user Equipment, user Equipment/User terminal.
Preferably, in step S12, the respective factor values are obtained by:
1) The service level factor value can be mapped into different values according to the requirements of operators, and the white metal property is recorded as V Platinum Metallic is described as V Gold Silver attribute is denoted as V Silver And the copper attribute is denoted as V Bronze The formula is as follows:
2) The bearer level factor value is obtained from the default priority of the standard or extended 5QI mapping corresponding to the bearer, and is denoted as V 5QI ＝Default Priority Level；
3) The rate factor value is obtained from the flow rate in the QoS attribute corresponding to the load, and the GBR flow is marked as V GBR non-GBR is denoted as V nonGBR The formula is as follows:
GBR: guaranteed Bit Rate refers to the minimum Bit Rate that the system guarantees to bear. The corresponding bit rate can be maintained even in the case of a tight network resource. In contrast, non-GBR refers to the requirement that traffic (or bearers) be subjected to a reduced rate in the event of network congestion.
4) The ARP factor value is obtained from the ARP value in the QoS attribute corresponding to the load bearing and is marked as V ARP The range is 1 to 15. Where the arp value is a priority parameter in the QoS attribute, defining the importance of the UE resource request.
5) The Delay factor value is obtained from the bearer waiting scheduling duration Delay and the target maximum waiting Delay DelayTarget, and is recorded as V delay The formula is as follows:
the DelayTarget needs to consider the processing delay of the core network and the base station protocol stack.
6) The channel condition factor value is obtained from the size of a Transport Block (TB) that the current MCS of the UE can support, and is denoted as V TBSize . The formula is as follows:
TBmax is the number of bits of the maximum code block of the UE, that is, the maximum TBSize (transport block size) of a single stream is taken for single stream, and the maximum TBSize that the UE can support is taken for dual stream. TBSize is obtained by table look-up mapping according to MCS and the maximum RB number of the corresponding bandwidth; single stream n =1 and double stream n =2.RB: resource Block, which belongs to the smallest physical Resource unit that the data channel on the wireless side can be scheduled, is also the smallest scheduling unit of the system, and the uplink and downlink traffic channels are scheduled by taking RB as the unit.
7) The CU and DU cache factor values respectively represent service caches on both sides of the CU and DU, and comprehensively reflect the size of the carried service volume, and the priority of the CU and DU should be properly increased if the service volume is larger, and otherwise, the priority of the CU and DU should be decreased. Is marked as V CuBuffer ，V DuBuffer ；
8) The historical traffic factor value is obtained from the load history scheduling statistics conversion and is marked as V History The formula is as follows:
wherein, V History (t-1) is the historical traffic of the last TTI statistics, TBSize (t-1) is the maximum TBSize that can be supported by the channel condition of the last TTI, and theta is a parameter less than 1.
Preferably, the adjustment coefficient of each factor in step S13 is respectively denoted as w service 、w 5QI 、w flowspeed 、w ARP 、w TISize 、w delay 、w CuBuffer 、w DuBuffer 、w History 。
Preferably, in step S14, the service bearer scheduling priority is determined according to all the factor values and the corresponding adjustment coefficients, and the calculation formula is as follows:
if there are multiple service bearers in a single UE, the highest priority in all the bearers is taken as the scheduling priority of the UE.
As shown in fig. 2, step S2 is a method for determining resource allocation of a 5G system, and first obtains a minimum data size and a maximum data size of a terminal service bearer to be currently scheduled; secondly, determining a scheduling proportion required by resource allocation according to the acquired CU and DU service buffer storage amount; then, determining the data volume which can be additionally scheduled on the basis of the lowest flow of the current load according to the scheduling proportion; thirdly, determining the final data volume to be scheduled according to the DU service buffer memory, the extra scheduling data volume and the minimum data volume; and finally, resource allocation is carried out by combining the current channel condition, the system residual resource and other necessary conditions. The step S2 specifically includes the following steps:
step 21, obtaining the minimum data volume Throughput of the terminal service bearer to be scheduled at present minLeft And maximum amount of data Throughput maxLeft (ii) a If the GBR bearer is the GBR bearer, equally dividing the configured GBR and MBR (Maximum Bit Rate) into N windows, and maintaining the window residual traffic; if the bearer is a non-guaranteed Bit Rate (non-GBR) bearer, the configured AMBR (Aggregate Maximum Bit Rate) and PBR (Policy Based Routing) are equally divided into N windows, and window residual traffic is maintained.
Step 22, obtaining the service buffer size of each terminal service bearer on the CU side cu And DC side traffic buffer size BufferSize du And according to the obtained BufferSize cu 、BufferSize du Calculating a scheduling ratio alpha required for resource allocation bufferSize The formula is as follows:
step 23, according to the scheduling proportion alpha bufferSize Determining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flow Δ The formula is as follows:
BufferSize Δ ＝α bufferSize ·(Throughput maxLeft -Throughput minLeft )。
step 24, determining the final data volume buffer size to be scheduled according to the CU side service buffer size, the additionally distributed data volume and the lowest data volume sch The formula is as follows:
BufferSize sch ＝MIN(BufferSize du ，Throughput minLeft +BufferSize Δ )。
the method carries out sequencing according to the determined scheduling priority and the data volume to be scheduled, combines the current channel condition and the system residual resource, and carries out resource allocation in sequence, thereby realizing the purpose of resource optimization.
In addition, in an embodiment, as shown in fig. 3, the present invention further provides an apparatus for scheduling optimization of a 5G NR system, where the apparatus includes a CU and DU traffic buffer amount determining module 31, a scheduling priority determining module 32, a scheduling data amount determining module 33, a resource allocating module 34, and a scheduling maintenance module 35, where:
the CU and DU service buffer memory determining module 31 is configured to obtain a service bearer service buffer memory size from a CU side and a DC side, update and send a CU and DU service buffer memory condition to the scheduling priority determining module and the scheduling data amount determining module in real time, and receive a processing result of another module and locally update the processing result;
a scheduling priority determining module 32, configured to determine a scheduling priority of the terminal according to each priority factor value and the adjustment coefficient; if a plurality of service bearers exist in a single UE, taking the highest priority in all the bearers as the scheduling priority of the UE;
a scheduling data amount determining module 33, configured to determine a current data amount to be scheduled of the terminal;
a resource allocation module 34, configured to determine the number of RBs and the size of TB according to the amount of data to be scheduled by the terminal, the current channel condition, and the system remaining resource condition;
and a scheduling maintenance module 35, configured to maintain, in real time, each priority factor and adjustment coefficient of the scheduling priority determining module and information required by the scheduling data amount determining module according to historical scheduling statistics, channel conditions, service bearer changes, service cache changes, a current scheduling result, and scene demand changes.
Preferably, the scheduling priority determining module 32 determines the service bearer scheduling priority according to the priority factor values and the adjustment coefficients by using the following calculation formula:
if there are multiple service bearers in a single UE, the highest priority in all the bearers is taken as the scheduling priority of the UE.
Wherein the priority factor values are obtained by:
1) The service level factor value can be mapped into different values according to the requirements of operators, and the white metal property is recorded as V Platinum Metallic is described as V Gold Silver attribute is denoted as V Silver And the copper attribute is denoted as V Bronze The formula is as follows:
2) The bearer level factor value is obtained from the default priority of the standard or extended 5QI mapping corresponding to the bearer, and is denoted as V 5QI ＝Default Priority Level；
3) The rate factor value is obtained from the flow rate in the QoS attribute corresponding to the load, and the GBR flow is marked as V GBR non-GBR is denoted as V nonGBR The formula is as follows:
GBR: guaranteed Bit Rate refers to the minimum Bit Rate that the system guarantees to bear. The corresponding bit rate can be maintained even in the case of a tight network resource. In contrast, non-GBR refers to the requirement that traffic (or bearers) be subjected to a reduced rate in the event of network congestion.
4) The ARP factor value is obtained from the ARP value in the QoS attribute corresponding to the load bearing and is marked as V ARP In the range of 1 to 15. Where the arp value is a priority parameter in the QoS attribute, defining the importance of the UE resource request.
5) The Delay factor value is obtained from the bearer waiting scheduling duration Delay and the target maximum waiting Delay DelayTarget, and is recorded as V delay The formula is as follows:
the DelayTarget needs to consider the processing delay of the core network and the base station protocol stack.
6) The channel condition factor value is obtained from the size of a Transport Block (TB) that the current MCS of the UE can support, and is denoted as V TBSize . The formula is as follows:
TBmax is the number of bits of the maximum code block of the UE, that is, the maximum TBSize (transport block size) of a single stream is taken for single stream, and the maximum TBSize that the UE can support is taken for dual stream. TBSize is obtained by table look-up mapping according to MCS and the maximum RB number of the corresponding bandwidth; single stream n =1 and double stream n =2.RB: resource Block, which belongs to the smallest physical Resource unit that the data channel on the wireless side can be scheduled, is also the smallest scheduling unit of the system, and the uplink and downlink traffic channels are scheduled by taking RB as the unit.
7) The CU and DU cache factor values respectively represent service caches on both sides of the CU and DU, and comprehensively reflect the size of the carried service volume, and the priority of the CU and DU should be properly increased if the service volume is larger, and otherwise, the priority of the CU and DU should be decreased. Is marked as V CuBuffer ，V DuBuffer ；
8) The historical traffic factor value is obtained from the load history scheduling statistics conversion and is marked as V History The formula is as follows:
wherein, V History (t-1) is the historical traffic for the last TTI statistic,TBSize (t-1) is the maximum TBSize that can be supported by the last TTI channel condition, and θ is a parameter less than 1.
The adjustment coefficient corresponding to each factor is w service 、w 5QI 、w flowspeed 、w ARP 、w TISize 、w delay 、w CuBuffer 、w DuBuffer 、w History 。
Preferably, the scheduling data amount determining module 33 determines the current data amount to be scheduled of the terminal by the following steps:
step 21: obtaining the minimum data volume Throughput of the terminal service bearing to be scheduled at present minLeft And maximum amount of data Throughput maxLeft (ii) a If the GBR bearer is the GBR bearer, equally dividing the configured GBR and MBR (Maximum Bit Rate) into N windows, and maintaining the remaining flow of the windows; if the bearer is a non-guaranteed Bit Rate (non-GBR) bearer, the configured AMBR (Aggregate Maximum Bit Rate) and PBR (Policy Based Routing) are equally divided into N windows, and window residual traffic is maintained.
Step 22: obtaining the service buffer size of each terminal service bearer on the CU side cu And DC side traffic buffer size BufferSize du And according to the obtained BufferSize cu 、BufferSize du Calculating the scheduling proportion alpha required for resource allocation bufferSize The formula is as follows:
step 23: according to a scheduling ratio alpha bufferSize Determining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flow Δ The formula is as follows:
BufferSize Δ ＝α bufferSize ·(Throughput maxLeft -Throughput minLeft )。
and step 24: determining the final data volume to be adjusted according to the CU side service buffer size, the additionally distributed data volume and the lowest data volumeMeasure data volume buffer size sch The formula is as follows:
BufferSize sch ＝MIN(BufferSize du ，Throughput minLeft +BufferSize Δ )。
furthermore, in an embodiment, the present invention also provides an electronic device, including:
a memory for storing a computer program;
a processor for executing a computer program stored in the memory, and when the computer program is executed, implementing the above method for 5G NR system scheduling optimization.
The electronic device of this embodiment may be an integrated circuit board, a PC (Personal Computer), or may be a portable Computer or other electronic device with a processor.
The memory may include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM) and/or cache memory. The processor executes various functional applications and data processing by executing a computer program stored in the memory, and in particular, the processor may execute the computer program stored in the memory, and when the computer program is executed, at least the following instructions are executed:
s1: acquiring various influence factors of the scheduling priority, and determining the scheduling priority of each terminal;
s2: and acquiring service bearing information of the terminal, and determining the current data volume to be scheduled of the terminal so as to allocate resources.
Preferably, step S1 is implemented by the following instructions:
step S11: acquiring service type, bearing grade, service rate, distribution and retention priority, waiting time delay, DU side service cache, CU side service cache, channel condition and historical scheduling statistics of current service bearing of a terminal;
step S12: determining various factor values corresponding to the service level factor, the bearing level factor, the rate factor, the ARP factor, the time delay factor, the DU cache factor, the CU cache factor, the channel condition factor and the historical flow factor according to the obtained items;
step S13: determining an adjustment coefficient of each factor according to the proportion of each factor in the scheduling priority;
step S14: and determining the service bearing scheduling priority according to all the factor values and the corresponding adjusting coefficients.
Preferably, step S2 is implemented by:
step 21: obtaining the minimum data volume Throughput of the terminal service bearing to be scheduled at present minLeft And a maximum amount of data Throughput maxLeft ；
Step 22: obtaining the service buffer size of each terminal service bearer on the CU side cu And DC side traffic buffer size BufferSize du And according to the obtained BufferSize cu 、BufferSize du Calculating the scheduling proportion alpha required for resource allocation bufferSize The formula is as follows:
step 23: according to a scheduling ratio alpha bufferSize Determining the data volume BufferSize additionally allocated on the basis of the lowest flow of the current bearer Δ The formula is as follows:
BufferSize Δ ＝α bufferSize ·(Throughput maxLeft -Throughput minLeft )；
step 24: determining the final data volume buffer size to be scheduled according to the CU side service buffer size, the additionally distributed data volume and the lowest data volume sch The formula is as follows:
BufferSize sch ＝MIN(BufferSize du ，Throughput minLeft +BufferSize Δ )。
moreover, while the operations of the method of the invention are depicted in the drawings in a particular order, this does not require or imply that the operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
While the spirit and principles of the invention have been described with reference to the above specific embodiments, it is to be understood that the invention is not limited to the specific embodiments disclosed, nor is the division of the aspects which are presented solely for the purpose of illustration, which is intended to convey the benefit of the description. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
Claims (9)
1. A method for scheduling optimization for a 5G NR system, comprising the steps of:
s1: acquiring various influence factors of the scheduling priority, and determining the scheduling priority of each terminal;
s2: acquiring service bearing information of a terminal, and determining the current data volume to be scheduled of the terminal so as to allocate resources;
wherein, step S1 further includes the following steps: step S11: acquiring service type, bearing grade, service rate, distribution and retention priority, waiting time delay, DU side service cache, CU side service cache, channel condition and historical scheduling statistics of current service bearing of a terminal;
step S12: determining various factor values corresponding to the service level factor, the bearing level factor, the rate factor, the ARP factor, the delay factor, the DU cache factor, the CU cache factor, the channel condition factor and the historical flow factor according to the acquisition items in the step S11;
step S13: determining an adjustment coefficient of each factor according to the proportion of each factor in the scheduling priority;
step S14: and determining the service bearing scheduling priority according to all the factor values and the corresponding adjusting coefficients.
2. The method for scheduling optimization of 5G NR system according to claim 1, wherein the step S2 further comprises the following steps:
step 21: obtaining the minimum data volume Throughput to be dispatched of the terminal service bearer at present minLeft And maximum amount of data Throughput maxLeft ；
Step 22: obtaining the service buffer size of each terminal service bearer on the CU side cu And the size of the DU side service buffer size du And according to the obtained BufferSize cu 、BufferSize du Calculating the scheduling proportion alpha required for resource allocation bufferSize The formula is as follows:
step 23: according to a scheduling ratio alpha bufferSize Determining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flow △ The formula is as follows:
BufferSize △ ＝α bufferSize ·(Throughput maxLeft -Throughput minLeft )；
step 24: determining the final data volume buffer size to be scheduled according to the CU side service buffer size, the additionally distributed data volume and the lowest data volume sch The formula is as follows:
BufferSize sch ＝MIN(BufferSize du ，Throughput minLeft +BufferSize △ )。
3. the method of claim 1, wherein in step S11, the service classes are mapped according to the needs of the operator, and the mapping level supports a maximum of 4 levels of configuration, including platinum, gold, silver, bronze; the bearing grade is a default priority corresponding to 5QI according to different bearings; the service rate is the flow rate of the QoS corresponding to different loads; allocating and reserving the priority as ARP according to different load corresponding QoS; the waiting time delay is the time length when the data loaded on the DU side arrives or enqueues and is scheduled by the scheduler; the DU side service cache is the size of the unscheduled accumulated cache accumulated on the DU side according to the load; the CU side service cache is the size of the accumulated cache which is not sent to the DU according to the load at the CU side; determining the MCS of the current UE according to the CQI reported by the UE, the actual measurement SINR of the physical layer to the channel and the downlink HARQ feedback condition by the channel condition; the historical scheduling statistics is that the traffic is counted according to the history of the load in the previous t TTIs, and t is a natural number.
4. The method of claim 1, wherein the value of the traffic class factor is mapped to different values according to operator requirements, and the white metal property is denoted as V Platinum Metallic is described as V Gold Silver attribute is denoted as V Silver And the copper attribute is denoted as V Bronze The formula is as follows:
the bearer level factor value is obtained from the default priority of the standard or extended 5QI mapping corresponding to the bearer, and is denoted as V 5QI ＝Default Priority Level；
The rate factor value is obtained from the flow rate in the QoS attribute corresponding to the load, and the GBR flow is marked as V GBR non-GBR is denoted as V nonGBR The formula is as follows:
the ARP factor value is obtained from the ARP value in the QoS attribute corresponding to the load bearing and is marked as V ARP The range is 1 to 15;
the Delay factor value is obtained from the bearer wait scheduling duration Delay and the target maximum wait Delay DelayTarget, and is recorded as V delay The formula is as follows:
the DelayTarget needs to consider the processing time delay of a core network and a base station protocol stack;
the channel condition factor value is obtained from the TB block size that the current MCS of the UE can support, and is marked as V TBSize (ii) a The formula:
wherein, TBmax is the bit number of the maximum code block of the UE, namely, the maximum TBSize of a single stream is taken in the case of a single stream, and the maximum TBSize which can be supported by the UE is taken in the case of a double stream; TBSize is obtained by table look-up mapping according to MCS and the maximum RB number of the corresponding bandwidth; n =1 for single flow and n =2 for double flow;
the CU and DU buffer factor values respectively represent service buffers at two sides of the CU and DU, the size of the loaded service volume is comprehensively reflected, the priority of the CU and DU should be properly improved when the service volume is larger, otherwise, the priority of the CU and DU should be reduced and is marked as V CuBuffer ，V DuBuffer ；
The historical traffic factor value is obtained from the load history scheduling statistics conversion and is marked as V History The formula is as follows:
wherein, V History (t-1) is the historical flow counted in the last TTI, and TBSize (t-1) is the maximum TBSize which can be supported by the channel condition in the last TTI; θ is a parameter less than 1.
5. The method of claim 4, wherein the calculation formula for determining the scheduling priority of the traffic bearer in step S14 is as follows:
wherein if there are multiple services in a single UECarrying, wherein the highest priority in all the carrying is taken as the scheduling priority of the UE; w is a service 、w 5QI 、w flowspeed 、w ARP 、w delay 、w TBSize 、w History 、w CuBuffer 、w DuBuffer The adjustment coefficients corresponding to the factor values are all smaller than 1.
6. An apparatus for scheduling optimization for a 5G NR system, comprising:
the CU and DU service cache amount determining module is used for acquiring the service bearing service cache size from the CU side and the DU side, updating and sending the CU and DU service cache condition to the scheduling priority determining module and the scheduling data amount determining module in real time, and receiving the processing results of other modules and updating locally;
the scheduling priority determining module is used for determining the scheduling priority of the terminal according to the priority factor values and the adjusting coefficients; the scheduling priority determining module determines various factor values corresponding to a service level factor, a bearing level factor, a rate factor, an ARP factor, a delay factor, a DU cache factor, a CU cache factor, a channel condition factor and a historical flow factor according to the acquired service type, bearing level, service rate, allocation and retention priority, waiting delay, DU side service cache, CU side service cache, channel condition and historical scheduling statistics of the current service of the terminal; determining an adjustment coefficient of each factor according to the proportion of each factor in the scheduling priority; then determining the service bearing scheduling priority according to all the factor values and the corresponding adjustment coefficients;
the scheduling data volume determining module is used for determining the current data volume to be scheduled of the terminal;
the resource allocation module is used for confirming the number of RBs and the size of the TB according to the data volume to be scheduled of the terminal, the current channel condition and the condition of the residual resources of the system;
and the scheduling maintenance module is used for maintaining various priority factors and adjustment coefficients of the scheduling priority determination module and information required by the scheduling data amount determination module in real time according to historical scheduling statistics, channel conditions, service bearing changes, service cache changes, current scheduling results and scene demand changes.
7. The apparatus of claim 6, wherein the scheduling priority determining module determines the traffic bearer scheduling priority by the following calculation formula:
if there are multiple service bearers in a single UE, the highest priority in all the bearers is taken as the scheduling priority of the UE.
8. The apparatus of claim 6, wherein the scheduling data amount determining module determines the current data amount to be scheduled of the terminal by:
step 21: obtaining the minimum data volume Throughput of the terminal service bearing to be scheduled at present minLeft And maximum amount of data Throughput maxLeft ；
Step 22: obtaining the service buffer size of each terminal service bearer on the CU side cu And the size of the DU side service buffer size du And according to the obtained BufferSize cu 、BufferSize du Calculating the scheduling proportion alpha required for resource allocation bufferSize The formula is as follows:
step 23: according to a scheduling ratio alpha bufferSize Determining whether current bearer can be additionally allocated based on minimum trafficData amount of (1) BufferSize △ The formula is as follows:
BufferSize △ ＝α bufferSize ·(Throughput maxLeft -Throughput minLeft )；
step 24: determining the final data volume buffer size to be scheduled according to the CU side service buffer size, the additionally distributed data volume and the lowest data volume sch The formula is as follows:
BufferSize sch ＝MIN(BufferSize du ，Throughput minLeft +BufferSize △ )。
9. an electronic device, comprising:
a memory for storing a computer program;
a processor for executing a computer program stored in a memory, and when the computer program is executed, implementing the method of any of claims 1-5 for scheduling optimization for a 5G NR system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110819157.7A CN113490281B (en) | 2021-07-20 | 2021-07-20 | Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110819157.7A CN113490281B (en) | 2021-07-20 | 2021-07-20 | Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113490281A CN113490281A (en) | 2021-10-08 |
| CN113490281B true CN113490281B (en) | 2023-03-14 |
Family
ID=77941496
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110819157.7A Active CN113490281B (en) | 2021-07-20 | 2021-07-20 | Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113490281B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115460713A (en) * | 2022-09-02 | 2022-12-09 | 中国电信股份有限公司 | Resource scheduling method, device, electronic equipment, storage medium and base station |
| CN117858263A (en) * | 2022-09-27 | 2024-04-09 | 中兴通讯股份有限公司 | Resource processing method, terminal scheduling method, electronic device and medium |
Family Cites Families (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006109131A2 (en) * | 2005-04-11 | 2006-10-19 | Nokia Corporation, | Method and apparatus to facilitate real-time packet scheduling in a wireless communications system |
| CN101686196B (en) * | 2008-09-26 | 2012-04-25 | 电信科学技术研究院 | Service scheduling method and service scheduling device |
| ES2429663B1 (en) * | 2012-02-28 | 2015-04-13 | Telefónica, S.A. | METHOD AND SYSTEM FOR PLANNING THE DESCENDING LINK IN LONG-TERM EVOLUTION NETWORKS (LTE) BASED ON QUALITY OF SERVICE (QOS) |
| CN103428870B (en) * | 2012-05-22 | 2017-04-12 | 中兴通讯股份有限公司 | Method and device for determining priority of access service |
| CN105517168B (en) * | 2015-12-16 | 2019-04-19 | 东莞酷派软件技术有限公司 | A kind of D2D data pack transmission method, transfer resource distribution method and device |
| CN107734703B (en) * | 2016-08-11 | 2020-11-17 | 华为技术有限公司 | Resource scheduling method and device |
| CN106850147B (en) * | 2017-02-28 | 2019-12-27 | 重庆邮电大学 | Wireless resource scheduling method and device for interference coordination system |
| FR3080969B1 (en) * | 2018-05-03 | 2022-12-02 | Thales Sa | METHOD AND SYSTEM FOR TRANSMITTING DATA PACKETS THROUGH A RANDOM ACCESS TRANSMISSION CHANNEL (RA) |
| CN110475341B (en) * | 2018-05-09 | 2022-05-17 | 大唐移动通信设备有限公司 | Method and device for resource allocation |
| CN110858958B (en) * | 2018-08-23 | 2021-09-07 | 华为技术有限公司 | Communication method and device of V2X |
| CN111148224B (en) * | 2018-11-01 | 2022-11-18 | 大唐移动通信设备有限公司 | Resource allocation method and communication equipment |
| CN111867114B (en) * | 2019-04-28 | 2022-08-26 | 华为技术有限公司 | Method and device for determining scheduling priority |
| CN111918328A (en) * | 2019-05-09 | 2020-11-10 | 大唐移动通信设备有限公司 | User equipment resource scheduling method and device |
| CN112996114B (en) * | 2019-12-17 | 2023-01-31 | 成都鼎桥通信技术有限公司 | Resource scheduling method, device, equipment and storage medium |
| WO2021134298A1 (en) * | 2019-12-30 | 2021-07-08 | Oppo广东移动通信有限公司 | Resource indication method and device, and communication apparatus |
-
2021
- 2021-07-20 CN CN202110819157.7A patent/CN113490281B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113490281A (en) | 2021-10-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10136354B2 (en) | Apparatus and methods for improved packet flow mobility | |
| US8565170B2 (en) | Method and apparatus for scheduling data transmission on multiple carriers | |
| Sadiq et al. | Downlink scheduling for multiclass traffic in LTE | |
| US10834614B2 (en) | Quality of service in wireless backhauls | |
| US10123233B2 (en) | Base station apparatus and communication system | |
| JP4397928B2 (en) | A method for allocating resources of a wireless communication network to traffic to be transmitted to user equipment over a network channel | |
| CN101902817B (en) | Uplink radio resource dispatching method and device for wireless communication system | |
| KR100749847B1 (en) | Apparatus and method for downlink packet scheduling in base station of the Portable Internet System | |
| CA2790671C (en) | Method for scheduling guaranteed bit rate service based on quality of service | |
| CN113490281B (en) | Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system | |
| KR100798854B1 (en) | Method for Adaptive Delay Threshold-based Priority Queueing Scheme for Packet Scheduling in Mobile Broadband Wireless Access System | |
| US8289852B2 (en) | Setting token bucket parameters for scheduling of air-interface resources | |
| JPWO2005039229A1 (en) | Method and system for capacity scheduling | |
| CN112637911A (en) | Resource allocation method and system for eMB and urllc in coexistence in 5G system | |
| US20110218006A1 (en) | Base station, radio communication system, and radio communication method | |
| CN102045853B (en) | A kind of information transmitting methods, equipment and system | |
| JP5359888B2 (en) | Communication system and method, radio control station and base station | |
| WO2010084705A1 (en) | Communication apparatus in wireless communication system and transmission power control method of same | |
| KR20060038786A (en) | System and method for between physical layer and medium access control of resource allocation in a radio connection protocol | |
| KR20160140098A (en) | Method and Apparatus of scheduling for wireless packet network | |
| Shrivastava et al. | Performance analysis of persistent scheduling for VoIP in WiMAX networks | |
| CN112055414B (en) | Uplink service scheduling method and device | |
| Lee et al. | Performance analysis of adaptive QoS handoff mechanism using service degradation and compensation | |
| CN118020370A (en) | Electronic device and method for providing scheduling information by learning in wireless communication system | |
| KR20240087611A (en) | Method to assign MCS and Resource Block for Uplink Transmission in 5G NR System without closed-loop power control |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |