CN113490281A - 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 PDF

Info

Publication number
CN113490281A
CN113490281A CN202110819157.7A CN202110819157A CN113490281A CN 113490281 A CN113490281 A CN 113490281A CN 202110819157 A CN202110819157 A CN 202110819157A CN 113490281 A CN113490281 A CN 113490281A
Authority
CN
China
Prior art keywords
scheduling
service
priority
buffersize
factor
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.)
Granted
Application number
CN202110819157.7A
Other languages
Chinese (zh)
Other versions
CN113490281B (en
Inventor
俞强生
陈步荣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Zhongxing Yilian Communication Co ltd
Original Assignee
Shanghai Zhongxing Yilian Communication Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shanghai Zhongxing Yilian Communication Co ltd filed Critical Shanghai Zhongxing Yilian Communication Co ltd
Priority to CN202110819157.7A priority Critical patent/CN113490281B/en
Publication of CN113490281A publication Critical patent/CN113490281A/en
Application granted granted Critical
Publication of CN113490281B publication Critical patent/CN113490281B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system
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 of mobile traffic, a fifth Generation (5th Generation, 5G) mobile communication network has been developed. 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 a 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, while the DU equipment mainly processes a physical layer function and a layer function with real-time requirement. 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, the variations in the service bearer type, the size of the traffic and the differences in the performance of the schedulers themselves 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.
MAC: media Access Control english primary: media access control layer, Chinese paraphrase: 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 at two 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 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 of the terminal service bearing to be scheduled at presentminLeftAnd maximum amount of data ThroughputmaxLeft；
Step 22: obtaining the service buffer size of each terminal service bearer on the CU sidecuAnd DC side traffic buffer size BufferSizeduAnd according to the obtained BufferSizecu、BufferSizeduCalculating the scheduling proportion alpha required for resource allocationbufferSizeThe formula is as follows:
Figure BDA0003171233620000031
Figure BDA0003171233620000032
step 23: according to a scheduling ratio alphabufferSizeDetermining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flowΔThe formula is as follows:
BufferSizeΔ＝αbufferSize·(ThroughputmaxLeft-ThroughputminLeft)；
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 volumeschThe formula is as follows:
BufferSizesch＝MIN(BufferSizedu，ThroughputminLeft+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 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.
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 VPlatinumMetallic is described as VGoldSilver attribute is denoted as VSilverCopper property is denoted as VBronzeThe formula is as follows:
Figure BDA0003171233620000041
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 V5QI＝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 VGBRnon-GBR is denoted as VnonGBRThe formula is as follows:
Figure BDA0003171233620000042
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 V5QI＝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 VGBRnon-GBR is denoted as VnonGBRThe formula is as follows:
Figure BDA0003171233620000051
the ARP factor value is obtained from the ARP value in the QoS attribute corresponding to the load bearing and is marked as VARPThe range is 1-15;
the Delay factor value is obtained from the bearer waiting scheduling duration Delay and the target maximum waiting Delay DelayTarget, and is recorded as VdelayThe formula is as follows:
Figure BDA0003171233620000052
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 VTBSize(ii) a The formula:
Figure BDA0003171233620000053
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 is 1 in the case of single flow, and n is 2 in the case of 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 VCuBuffer，VDuBuffer；
The historical traffic factor value is obtained from the load history scheduling statistics conversion and is marked as VHistoryThe formula is as follows:
Figure BDA0003171233620000054
wherein, VHistory(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:
Figure BDA0003171233620000055
(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 steps:
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 changes, service cache changes, current scheduling results and scene demand changes.
Optionally, the scheduling priority determining module determines the service bearer scheduling priority by using the following calculation formula:
Figure BDA0003171233620000061
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 presentminLeftAnd maximum amount of data ThroughputmaxLeft；
Step 22: obtaining the service buffer size of each terminal service bearer on the CU sidecuAnd DC side traffic buffer size BufferSizeduAnd according to the obtained BufferSizecu、BufferSizeduCalculating the scheduling proportion alpha required for resource allocationbufferSizeThe formula is as follows:
Figure BDA0003171233620000071
Figure BDA0003171233620000072
step 23: according to a scheduling ratio alphabufferSizeDetermining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flowΔThe formula is as follows:
BufferSizeΔ＝αbufferSize·(ThroughputmaxLeft-ThroughputminLeft)；
step 24: according to the above CU side service bufferThe storage size, the additionally distributed data volume and the minimum data volume are stored, and the final data volume to be scheduled BufferSize is determinedschThe formula is as follows:
BufferSizesch＝MIN(BufferSizedu，ThroughputminLeft+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 the resource scheduling in the existing NR system is inaccurate and unreasonable, the invention provides a method and a device for scheduling optimization of 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, firstly, determining the scheduling priority of the 5G system, and then determining 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 above steps S11-14, a method for determining scheduling priority of a 5G system is provided, which first obtains various impact factors of the scheduling priority, including factors related to a traditional scheduling algorithm and newly added factors of the present invention: 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 category 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 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:
5 QI: a 5G QoS Indicator, for indexing one 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 case of resource congestion, it is necessary to confirm who releases the 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 Signal to Noise Ratio, refers to the Ratio of the received strength of a desired Signal to the strength of the 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 VPlatinumMetallic is described as VGoldSilver attribute is denoted as VSilverCopper property is denoted as VBronzeThe formula is as follows:
Figure BDA0003171233620000101
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 V5QI＝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 VGBRnon-GBR is denoted as VnonGBRThe formula is as follows:
Figure BDA0003171233620000111
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 VARPThe 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 VdelayThe formula is as follows:
Figure BDA0003171233620000112
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 VTBSize. The formula is as follows:
Figure BDA0003171233620000113
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; and n is 1 in the case of single flow and 2 in the case of double flow. RB: resource Block, belonging to the smallest schedulable physical Resource unit of the data channel at the wireless side, which is also the smallest scheduling unit of the system, and the uplink and downlink traffic channels are all scheduled by taking RB as a 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 VCuBuffer，VDuBuffer；
8) The historical traffic factor value is obtained from the load history scheduling statistics conversion and is marked as VHistoryThe formula is as follows:
Figure BDA0003171233620000121
wherein, VHistory(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 coefficients of each factor in step S13 are respectively denoted as wservice、w5QI、wflowspeed、wARP、wTISize、wdelay、wCuBuffer、wDuBuffer、wHistory。
Preferably, in step S14, the service bearer scheduling priority is determined according to all factor values and corresponding adjustment coefficients, and the calculation formula is as follows:
Figure BDA0003171233620000122
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 buffer storage volume of the DU service, 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. Step S2 specifically includes the following steps:
step 21, obtaining the minimum data volume Throughput of the terminal service bearer to be scheduled at presentminLeftAnd maximum amount of data ThroughputmaxLeft(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 it is nonGBR (non-guaranteed stream Bit Rate) bearer, the configured AMBR (Aggregate Maximum Bit Rate) and PBR (Policy Based Routing) are divided equally into N windows, and window residual traffic is maintained.
Step 22, obtaining the service buffer size of each terminal service bearer on the CU sidecuAnd DC side traffic buffer size BufferSizeduAnd according to the obtained BufferSizecu、BufferSizeduCalculating a scheduling ratio alpha required for resource allocationbufferSizeThe formula is as follows:
Figure BDA0003171233620000131
step 23, according to the scheduling proportion alphabufferSizeDetermining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flowΔThe formula is as follows:
BufferSizeΔ＝αbufferSize·(ThroughputmaxLeft-ThroughputminLeft)。
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 volumeschThe formula is as follows:
BufferSizesch＝MIN(BufferSizedu，ThroughputminLeft+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 the scheduling maintenance module 35 is configured to maintain, in real time, each priority factor and adjustment coefficient of the scheduling priority determination module and information required by the scheduling data amount determination 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:
Figure BDA0003171233620000141
(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.
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 VPlatinumMetallic is described as VGoldSilver attribute is denoted as VSilverCopper property is denoted as VBronzeThe formula is as follows:
Figure BDA0003171233620000142
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 V5QI＝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 VGBRnon-GBR is denoted as VnonGBRThe formula is as follows:
Figure BDA0003171233620000143
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 VARPThe 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 VdelayThe formula is as follows:
Figure BDA0003171233620000151
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 VTBSize. The formula is as follows:
Figure BDA0003171233620000152
wherein TBmax is the number of bits of the maximum code block of the UE, i.e., the maximum TBSize (transport block size) of a single stream when the single stream is received, and dualAnd taking the maximum TBSize which can be supported by the UE when flowing. TBSize is obtained by table look-up mapping according to MCS and the maximum RB number of the corresponding bandwidth; and n is 1 in the case of single flow and 2 in the case of double flow. RB: resource Block, belonging to the smallest schedulable physical Resource unit of the data channel at the wireless side, which is also the smallest scheduling unit of the system, and the uplink and downlink traffic channels are all scheduled by taking RB as a 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 VCuBuffer，VDuBuffer；
8) The historical traffic factor value is obtained from the load history scheduling statistics conversion and is marked as VHistoryThe formula is as follows:
Figure BDA0003171233620000153
wherein, VHistory(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.
The adjustment coefficient corresponding to each factor is wservice、w5QI、wflowspeed、wARP、wTISize、wdelay、wCuBuffer、wDuBuffer、wHistory。
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 presentminLeftAnd maximum amount of data ThroughputmaxLeft(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 stream Bit Rate (non-GBR) bearer, the configured AMBR (Aggregate Maximum Bit Rate) and PBR (Policy Based Routing) are divided equally into N windows,and maintains the window remaining traffic.
Step 22: obtaining the service buffer size of each terminal service bearer on the CU sidecuAnd DC side traffic buffer size BufferSizeduAnd according to the obtained BufferSizecu、BufferSizeduCalculating the scheduling proportion alpha required for resource allocationbufferSizeThe formula is as follows:
Figure BDA0003171233620000161
step 23: according to a scheduling ratio alphabufferSizeDetermining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flowΔThe formula is as follows:
BufferSizeΔ＝αbufferSize·(ThroughputmaxLeft-ThroughputminLeft)。
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 volumeschThe formula is as follows:
BufferSizesch＝MIN(BufferSizedu，ThroughputminLeft+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 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 the following instructions:
step 21: obtaining the minimum data volume Throughput of the terminal service bearing to be scheduled at presentminLeftAnd maximum amount of data ThroughputmaxLeft；
Step 22: obtaining the service buffer size of each terminal service bearer on the CU sidecuAnd DC side traffic buffer size BufferSizeduAnd according to the obtained BufferSizecu、BufferSizeduCalculating the scheduling proportion alpha required for resource allocationbufferSizeThe formula is as follows:
Figure BDA0003171233620000171
step 23: according to a scheduling ratio alphabufferSizeDetermining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flowΔThe formula is as follows:
BufferSizeΔ＝αbufferSize·(ThroughputmaxLeft-ThroughputminLeft)；
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 volumeschThe formula is as follows:
BufferSizesch＝MIN(BufferSizedu，ThroughputminLeft+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 is for convenience only as the features in these aspects cannot be combined to advantage. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims (10)

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: 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.
2. The method for scheduling optimization of 5G NR system according to claim 1, wherein the step S1 further comprises 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 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.
3. 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 of the terminal service bearing to be scheduled at presentminLeftAnd maximum amount of data ThroughputmaxLeft；
Step 22: obtaining the service buffer size of each terminal service bearer on the CU sidecuAnd DC side traffic buffer size BufferSizeduAnd according to the obtained BufferSizecu、BufferSizeduCalculating the scheduling proportion alpha required for resource allocationbufferSizeThe formula is as follows:
Figure FDA0003171233610000011
Figure FDA0003171233610000012
step 23: according to a scheduling ratio alphabufferSizeDetermining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flowΔThe formula is as follows:
BufferSizeΔ＝αbufferSize·(ThroughputmaxLeft-ThroughputminLeft)；
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 volumeschThe formula is as follows:
BufferSizesch＝MIN(BufferSizedu，ThroughputminLeft+BufferSizeΔ)。
4. the method for scheduling optimization of 5G NR system according to claim 2, wherein in step S11, the service classes are mapped according to the needs of the operator, and the mapping level supports maximum 4-level 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.
5. The method of claim 2, wherein the traffic class factor values are mapped to different values according to operator requirements, and the white metal property is denoted as VPlatinumGold, goldThe attribute is denoted as VGoldSilver attribute is denoted as VSilverCopper property is denoted as VBronzeThe formula is as follows:
Figure FDA0003171233610000021
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 V5QI＝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 VGBRnon-GBR is denoted as VnonGBRThe formula is as follows:
Figure FDA0003171233610000031
the ARP factor value is obtained from the ARP value in the QoS attribute corresponding to the load bearing and is marked as VARPThe range is 1-15;
the Delay factor value is obtained from the bearer waiting scheduling duration Delay and the target maximum waiting Delay DelayTarget, and is recorded as VdelayThe formula is as follows:
Figure FDA0003171233610000032
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 VTBSize(ii) a The formula:
Figure FDA0003171233610000033
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 is 1 in the case of single flow, and n is 2 in the case of double flow;
CU and DU buffer factor values respectively representing service buffer at both sides of CU and DU, and comprehensively reflecting loadThe priority of the traffic is properly increased when the traffic is larger, and is reduced otherwise, which is recorded as VCuBuffer，VDuBuffer；
The historical traffic factor value is obtained from the load history scheduling statistics conversion and is marked as VHistoryThe formula is as follows:
Figure FDA0003171233610000034
wherein, VHistory(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.
6. The method of claim 5, wherein the calculation formula for determining the scheduling priority of the traffic bearer in step S14 is as follows:
Figure FDA0003171233610000035
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.
7. An apparatus for scheduling optimization for a 5G NR system, comprising:
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 changes, service cache changes, current scheduling results and scene demand changes.
8. The apparatus of claim 6, wherein the scheduling priority determining module determines the traffic bearer scheduling priority by the following calculation formula:
Figure FDA0003171233610000041
(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.
9. The apparatus of claim 7, 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 presentminLeftAnd maximum amount of data ThroughputmaxLeft；
Step 22: obtaining the service buffer size of each terminal service bearer on the CU sidecuAnd DC side traffic buffer size BufferSizeduAnd according to the obtained BufferSizecu、BufferSizeduCalculating the scheduling proportion alpha required for resource allocationbufferSizeThe formula is as follows:
Figure FDA0003171233610000051
Figure FDA0003171233610000052
step 23: according to a scheduling ratio alphabufferSizeDetermining the data volume BufferSize additionally allocated to the current bearer on the basis of the lowest flowΔThe formula is as follows:
BufferSizeΔ＝αbufferSize·(ThroughputmaxLeft-ThroughputminLeft)；
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 volumeschThe formula is as follows:
BufferSizesch＝MIN(BufferSizedu，ThroughputminLeft+BufferSizeΔ)。
10. 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-6 for 5G NR system scheduling optimization.
CN202110819157.7A 2021-07-20 2021-07-20 Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system Active CN113490281B (en)

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 true CN113490281A (en) 2021-10-08
CN113490281B 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)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2024066453A1 (en) * 2022-09-27 2024-04-04 中兴通讯股份有限公司 Resource processing method, terminal scheduling method, electronic device, and medium

Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060227796A1 (en) * 2005-04-11 2006-10-12 Nokia Corporation Method and apparatus to facilitate real-time packet scheduling in a wireless communications system
CN101686196A (en) * 2008-09-26 2010-03-31 大唐移动通信设备有限公司 Service scheduling method and service scheduling device
WO2013127665A1 (en) * 2012-02-28 2013-09-06 Telefónica, S.A. A method and a system for scheduling the downlink in long term evolution (lte) networks based on quality of service (qos)
CN103428870A (en) * 2012-05-22 2013-12-04 中兴通讯股份有限公司 Method and device for determining priority of access service
CN106850147A (en) * 2017-02-28 2017-06-13 重庆邮电大学 A kind of scheduling method for wireless resource and device for interference coordination system
WO2017101207A1 (en) * 2015-12-16 2017-06-22 宇龙计算机通信科技(深圳)有限公司 D2d data packet transmission method, and transmission resource allocation method and apparatus
WO2018028269A1 (en) * 2016-08-11 2018-02-15 华为技术有限公司 Resource scheduling method and device
WO2019211351A1 (en) * 2018-05-03 2019-11-07 Thales Method and system for transmitting data packets via a random access (ra) transmission channel
WO2019214553A1 (en) * 2018-05-09 2019-11-14 电信科学技术研究院有限公司 Resource allocation method and apparatus
CN110858958A (en) * 2018-08-23 2020-03-03 华为技术有限公司 Communication method and device of V2X
CN111148224A (en) * 2018-11-01 2020-05-12 电信科学技术研究院有限公司 Resource allocation method and communication equipment
WO2020220954A1 (en) * 2019-04-28 2020-11-05 华为技术有限公司 Scheduling priority determination method and apparatus
CN111918328A (en) * 2019-05-09 2020-11-10 大唐移动通信设备有限公司 User equipment resource scheduling method and device
CN112996114A (en) * 2019-12-17 2021-06-18 成都鼎桥通信技术有限公司 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

Patent Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060227796A1 (en) * 2005-04-11 2006-10-12 Nokia Corporation Method and apparatus to facilitate real-time packet scheduling in a wireless communications system
CN101686196A (en) * 2008-09-26 2010-03-31 大唐移动通信设备有限公司 Service scheduling method and service scheduling device
WO2013127665A1 (en) * 2012-02-28 2013-09-06 Telefónica, S.A. A method and a system for scheduling the downlink in long term evolution (lte) networks based on quality of service (qos)
CN103428870A (en) * 2012-05-22 2013-12-04 中兴通讯股份有限公司 Method and device for determining priority of access service
WO2017101207A1 (en) * 2015-12-16 2017-06-22 宇龙计算机通信科技(深圳)有限公司 D2d data packet transmission method, and transmission resource allocation method and apparatus
WO2018028269A1 (en) * 2016-08-11 2018-02-15 华为技术有限公司 Resource scheduling method and device
CN107734703A (en) * 2016-08-11 2018-02-23 华为技术有限公司 A kind of resource regulating method and device
CN106850147A (en) * 2017-02-28 2017-06-13 重庆邮电大学 A kind of scheduling method for wireless resource and device for interference coordination system
WO2019211351A1 (en) * 2018-05-03 2019-11-07 Thales Method and system for transmitting data packets via a random access (ra) transmission channel
WO2019214553A1 (en) * 2018-05-09 2019-11-14 电信科学技术研究院有限公司 Resource allocation method and apparatus
CN110858958A (en) * 2018-08-23 2020-03-03 华为技术有限公司 Communication method and device of V2X
CN111148224A (en) * 2018-11-01 2020-05-12 电信科学技术研究院有限公司 Resource allocation method and communication equipment
WO2020220954A1 (en) * 2019-04-28 2020-11-05 华为技术有限公司 Scheduling priority determination method and apparatus
CN111918328A (en) * 2019-05-09 2020-11-10 大唐移动通信设备有限公司 User equipment resource scheduling method and device
CN112996114A (en) * 2019-12-17 2021-06-18 成都鼎桥通信技术有限公司 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

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
INTEL CORPORATION: ""R1-1910646"", 《3GPP TSG_RAN\WG1_RL1》 *
QUALCOMM INCORPORATED: "R3-170165 "Impacts of CU/DU split on NG and Xn interfaces"", 《3GPP TSG_RAN\WG3_IU》 *
SAMSUNG: "R3-195814 "NR V2X resource management in CU-DU split architecture"", 《3GPP TSG_RAN\WG3_IU》 *
ZTE: ""R3-193647 Support of NR V2X in case of CU-DU split"", 《3GPP TSG_RAN\WG3_IU》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2024066453A1 (en) * 2022-09-27 2024-04-04 中兴通讯股份有限公司 Resource processing method, terminal scheduling method, electronic device, and medium

Also Published As

Publication number Publication date
CN113490281B (en) 2023-03-14

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
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
US10123233B2 (en) Base station apparatus and communication system
KR100798854B1 (en) Method for Adaptive Delay Threshold-based Priority Queueing Scheme for Packet Scheduling in Mobile Broadband Wireless Access System
EP2432289A1 (en) Method and apparatus for scheduling uplink radio resources in radio communication system
US8289852B2 (en) Setting token bucket parameters for scheduling of air-interface resources
US20090017836A1 (en) Capacity Scheduling Method and System
CN112637911A (en) Resource allocation method and system for eMB and urllc in coexistence in 5G system
CN113490281B (en) Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system
CN112492689A (en) Resource preemption method, device, equipment and computer readable storage medium
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
WO2012048542A1 (en) Group schedule method and device
US8699423B1 (en) Wireless slot allocation
Shrivastava et al. Performance analysis of persistent scheduling for VoIP in WiMAX networks
JP4506139B2 (en) Mobile communication system, radio base station, scheduling apparatus, and scheduling method used therefor
CN112055414B (en) Uplink service scheduling method and device
KR101450192B1 (en) Apparatus and method for uplink scheduling in broadband wireless communication system
CN118020370A (en) Electronic device and method for providing scheduling information by learning in wireless communication system
CN117255354A (en) Service delay optimization method, device, equipment and storage medium
KR20070052536A (en) Method for controlling transmission power in cellular mobile communication system

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