CN107105505A - Multi-service dynamic dispatching method based on QCI - Google Patents
Multi-service dynamic dispatching method based on QCI Download PDFInfo
- Publication number
- CN107105505A CN107105505A CN201710218950.5A CN201710218950A CN107105505A CN 107105505 A CN107105505 A CN 107105505A CN 201710218950 A CN201710218950 A CN 201710218950A CN 107105505 A CN107105505 A CN 107105505A
- Authority
- CN
- China
- Prior art keywords
- user
- qci
- factor
- business
- dynamic dispatching
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
-
- 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/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
-
- 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/52—Allocation or scheduling criteria for wireless resources based on load
-
- 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
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of multi-service dynamic dispatching method based on QCI, including U user { u1, u2..., uU, set uiIt is i-th of user, ui∈{u1, u2..., uU, each user carries out S business, sets j as one of business, j ∈ { 1,2 ..., S }；Comprise the following steps：(1 1) QCI criterions are formulated；(1 2) queuing delay is adjusted；(1 3) rate matched factor；(1 4) normalized；(1 5) multi-service dynamic dispatching.The present invention, which has, can dynamically track multiple services QCI indexs and time delay, on the premise of the handling capacity and the fairness of system for taking into account cell, the characteristics of its dispatching priority is adjusted flexibly to different rate users in real time.
Description
Technical field
The present invention relates to a kind of dispatching method of LTE system, more particularly, to it is a kind of be dynamically adapted based on many of QCI
Service dynamic dispatching method.
Background technology
Multi-service includes voice, real-time game, the interactive class that surfs the web etc., is pushed away in booming mobile Internet tide
Under dynamic, the business that nearly all wireless user carries out all is multiple services.And LTE ensure that QoS as one kind
QoS (Quality of Service) and user fairness wireless broadband communication technology, are increasingly used widely.To carry
High resource utilization ratio, LTE takes shared channel mechanism, according to fast-changing communication environments, external interference and system
The factors such as load, dynamically distribute physical resource between users in time.The dispatching algorithm such as RR (Round commonly used at present
Robin, polling dispatching), (Short Job First, most short operation is excellent by PF (Proportion Fair, equitable proportion) and SJF
First) etc. dispatching method, merely emphasizes throughput of system or fairness, do not account for how realizing therebetween it is balanced or
How person optimizes for multiple services collaboration.
2016.6.7 Chinese Patent Application No. is disclosed to adjust for a kind of CN10528279.2 LTE based on loaded self-adaptive
Degree method, this method comprises the following steps：Step 1：Physical resource is adjusted；Step 2：Cell load evaluation；Step 3：Handling capacity
Priority is extracted；Step 4：Set up loaded self-adaptive model.The LTE dispatching methods based on loaded self-adaptive obtained by the invention,
Start with from analysis physical resource, set up the load module of subdistrict self-adaptive, user can dynamically be adjusted according to actual loading size
Priority, so as to realize the equilibrium of system.Unfortunately, this method does not consider the practical business that each user carries out in cell
Type, although adjusted the load of cell on the whole, but do not consider the perception of actual scheduled user, dispatching party can be influenceed
The fairness of method.LMA (the improved M-LWDF algorithms of LTE Modified M-LWDF Algorithm, LTE) algorithms although it is contemplated that
Multi-service, but can maximum probability cause the behavior of suffering from hunger of user.
The content of the invention
The goal of the invention of the present invention is to cause user to suffer from hunger not to overcome LMA algorithms of the prior art maximum probability
There is provided a kind of multi-service dynamic dispatching method based on QCI being dynamically adapted for foot.
To achieve these goals, the present invention uses following technical scheme：
A kind of multi-service dynamic dispatching method based on QCI, including U user { u1, u2..., uU, set uiIt is i-th
User, ui∈{u1, u2..., uU, each user carries out S business, sets j as one of business, j ∈ { 1,2 ..., S }；
Comprise the following steps：
(1-1) formulates QCI criterions；
(1-2) adjusts queuing delay；
(1-3) rate matched factor：
(1-3-1) computation rate factor of influence；
(1-3-2) implements speed rewarding and punishing；
(1-4) normalized；
(1-5) multi-service dynamic dispatching.
The goal of the invention of the present invention is not take multiple services shadow into account to overcome LTE system of the prior art to dispatch user
Ring, can not also take into account what the deficiency of throughput of system and fairness put forward, the multi-service dynamic dispatching of the invention based on QCI
Method QMDS (QCI based LTE Multi-service Dynamic Scheduling Algorithm), joins by QCI
Number, according to the wait time delay of each business of user, the transmission rate to user's any time is counted, and low-rate users are carried out
Compensation, appropriate punishment is carried out to high rate user, so as to reach the target of dynamic adjustment.
The present invention obtains demand of the different user to resource allocation by the judgement to multi-service QCI a reference values, according to
Wait the length of time delay, the dispatching priority of dynamic adjustment user.On this basis, for low-rate users, forward direction benefit is passed through
Repay to distribute more resources, for high rate user, carry out appropriateness punishment and avoid user from suffering from hunger to realize.The scheduling of the present invention
Mechanism takes into account the handling capacity of cell simultaneously, and service delay is relatively low, and system fairness is higher.
The present invention dynamically can wait time delay according to multiple services QCI parameters and queue, and different speed is used in real time
Dispatching priority is adjusted flexibly in family, advantageously ensures that the fairness of system, keeps system equalization.
Preferably, step (1-1) comprises the following steps：
(2-1) set the 1st underlying table, the 1st underlying table include QCI values, resource type, time delay, packet loss, typical case application with
Priority；
Set ρijFor user uiMiddle business j priority, in the GBR traffic and Non-GBR in the 1st underlying table
IMS signalings, calculate the QCI factors of influence of the customer service Wherein, e(·)Represent the index using e the bottom of as
Function；
(2-2) for other Non-GBR business in the 1st underlying table in addition to IMS signalings, calculate its QCI influence because
(2-3) utilizes formulaCalculate user uiThe QCI factors
Preferably, step (1-2) comprises the following steps：
(3-1) setting user uiStand-by period of the business j in queue beThe maximum delay that business j allows is Tj M,
Calculate the time delay influence factor of the customer service
(3-2) utilizes formulaCalculate user uiTime delay factor
Preferably, step (1-3) comprises the following steps：
(4-1) sets BiFor user uiApllied bandwidth, SINRiFor user uiThe signal to noise ratio of residing channel, BERiFor with
Family uiBlock Error Rate, utilize formula Vi=Bi*log2(1+SINRi/(-ln(5BERi/ 1.5)) calculate user uiTransmission rate；
(4-2) utilizes formulaCalculate user uiRate factor
(4-3) sets VLFor speed low threshold, VHFor high threshold, TVFor rewarding and punishing maximum,
Meeting Case1 conditions Vi＜ VL＜ VHWhen, utilize formula Computation rate
Factor of influence
Meeting Case2 conditions Vi∈[VL, VH] when, make speed factor of influenceDo not adjust；
Meeting Case3 conditions Vi＞ VH＞ VLWhen, utilize formula Computation rate shadow
Ring the factor
(4-4) is calculatedIt is used as the recombination rate factor.
Preferably, step (1-4) comprises the following steps：
(0,1] on interval it is right respectivelyIt is normalized, obtains
Preferably, step (1-5) comprises the following steps：
(6-1) utilizes formulaCalculate comprehensive priority pi, piIt is used as user uiMost
Whole dispatching priority；
(6-2) is by each user according to priority piDescending arrangement is carried out, and is sequentially placed into scheduler being scheduled.
Therefore, the present invention has the advantages that：Multiple services QCI indexs and time delay can be dynamically tracked, simultaneous
On the premise of Gu little Qu handling capacity and the fairness of system, its dispatching priority is adjusted flexibly to different rate users in real time
Level.
Brief description of the drawings
Fig. 1 is a kind of flow chart of the present invention；
Fig. 2 is that the present invention and RR, SJF and LMA a kind of throughput ratio are relatively schemed；
Fig. 3 is that the present invention is compared figure with RR, SJF and LMA a kind of cell load；
Fig. 4 is that the present invention is compared figure with RR, SJF and LMA a kind of scheduling fairness.
Embodiment
The present invention will be further described with reference to the accompanying drawings and detailed description.
Embodiment as shown in Figure 1 is a kind of multi-service dynamic dispatching method based on QCI, including U user { u1,
u2..., uU, set each user uiCarry out j business j ∈ { 1,2 ..., S }；Comprise the following steps：
Step 1：QCI Standard-makings；
Step 1-1：The 1st underlying table is set, the 1st underlying table includes QCI values, resource type, time delay, packet loss, Dian Xingying
With and priority；Set ρijFor user uiMiddle business j priority, in the GBR traffic and Non-GBR in the 1st underlying table
IMS signalings, calculate the QCI factors of influence of the customer serviceWherein, e(·)Represent using e the bottom of as
Exponential function；
Step 1-2：For other Non-GBR business in the 1st underlying table in addition to IMS signalings, calculate its QCI influence because
Step 1-3：Utilize formulaCalculate user uiThe QCI factors；
Step 2：Queuing delay is adjusted；
Step 2-1：Set user uiStand-by period of the business j in queue beThe maximum delay that the business allows
ForCalculate the time delay influence factor of the customer service
Step 2-2：CalculateIt is used as user uiTime delay factor；
Step 3：Rate factor is matched；
Step 3-1：Set BiFor user uiApllied bandwidth, SINRiThe signal to noise ratio of channel, BER residing for the useri
For user's Block Error Rate, formula V is utilizedi=Bi*log2(1+SINRi/(-ln(5BERi/ 1.5)) calculate user uiTransmission speed
Rate；
Step 3-2：Utilize formulaCalculate user uiRate factor
Step 3-3：Set VLFor speed low threshold, VHFor high threshold, TVFor rewarding and punishing maximum, Case1 conditions V is being meti
＜ VL＜ VHWhen, utilize formulaComputation rate factor of influence
Meeting Case2 conditions Vi∈[VL, VH] when, make speed factor of influenceDo not adjust；
Meeting Case3 conditions Vi＞ VH＞ VLWhen, utilize formula Computation rate shadow
Ring the factor
Step 3-4：CalculateIt is used as the recombination rate factor；
Step 4：Normalized；
(0,1] on interval it is right respectivelyIt is normalized, obtains
Step 5：Multi-service dynamic dispatching；
Step 5-1：Calculate comprehensive priorityIt is used as user uiFinally scheduling it is excellent
First level；
Step 5-2：By each user according to priority PiDescending arrangement is carried out, and is sequentially placed into scheduler being scheduled.
Example：
The present invention is specifically described by taking U=5 as an example below, standard QCI values are as shown in the 1st underlying table of table 1：
The standard QCI values of table 1
Each user commences business as shown in table 2：
Each customer service of table 2
Basic data is as shown in table 3：
The basic data of table 3
| Project | Data |
| RB occupied bandwidths BW (kHz) | 180 |
| Cell RB sums | 80 |
| Speed low threshold VL(kbps) | 100 |
| Speed high threshold VH(kbps) | 500 |
| Rewards and punishments maximum of TV | 3 |
The multi-service dynamic dispatching method based on QCI of this example description, comprises the following steps：QCI Standard-makings, queue up
Time delay is adjusted, rate factor matching and multi-service dynamic dispatching.
Step 1：QCI Standard-makings；
Calculate each user's
Calculate on this basis
Step 2：Queuing delay is adjusted；
Calculate each user's
Calculate on this basis
Step 3：Rate factor is matched；
Step 3-1：
Calculate
Step 3-2：The computation rate factor
Step 3-3：User { u1, u3, u4Case2 conditions are met, without rewards and punishments, user u2Meet Case1 conditions, it is necessary to
Rate compensation is carried out, is calculated User u5Meet
Case3 conditions are calculated, it is necessary to carry out appropriate speed punishmentMake
For speed factor of influence；
Step 3-4：Calculate the recombination rate factor after rewarding and punishing
Step 4：Normalized；
(0,1] on interval it is right respectivelyIt is normalized, obtains
Step 5：Multi-service dynamic dispatching；
Step 5-1：Calculate the comprehensive priority of each user
Step 5-2：By user uiAccording to priority PiDescending arrangement is carried out, and is sequentially placed into QMDS schedulers being scheduled,
Dispatching sequence is followed successively by { u1, u5, u4, u3, u2}。
Emulation experiment：
QMDS methods of the present invention and the method such as RR, SJF, LMA are subjected to simulation comparison, scheduling number of users from 10 progressively
Increase to 30, the LTE system handling capacity of gained, the packet loss and method fairness in scheduling process are respectively referring to accompanying drawing 2
Shown in 4.
As shown in Fig. 2 throughput of system is best for LMA algorithms, it is not main reason is that LMA is to transmission rate
Too high user is suppressed, although generally improve the handling capacity of system, but also can maximum probability bring the shape of suffering from hunger of user
State, causes packet loss rising and the reduction of algorithm fairness.It is most and QMDS is on the premise of guaranteeing fairness with systematic function
Possibly lifting system handling capacity.
As shown in figure 3, LMA is to improve throughput of system based on lifting packet loss, QMDS then enters to multi-service
Row subdivision, makes a distinction scheduling according to QCI and speed, totally ensure that relatively low packet loss.And because SJF is made with most short all the time
Industry is preferential as dispatching criterion, without considering user's state in which environment, therefore its packet loss is always positioned at a high position, RR in line with
Fair principle has taken into account each user.
As shown in figure 4, RR fairness is highest in all algorithms, this is determined by its criterion, and SJF does not have at all
Consider fairness, its fairness is also than relatively low.LMA does not meet with an accident, and fairness and SJF are similar.And QMDS algorithm is fair
Property be only second to RR algorithms, illustrate to sacrifice certain fairness to exchange handling capacity for be desirable.All algorithms are with scheduling user
Several increases, its fairness gradually drops.
It should be understood that the present embodiment is only illustrative of the invention and is not intended to limit the scope of the invention.In addition, it is to be understood that
Read after the content of the invention lectured, those skilled in the art can make various changes or modifications to the present invention, these etc.
Valency form equally falls within the application appended claims limited range.
Claims (6)
1. a kind of multi-service dynamic dispatching method based on QCI, it is characterized in that, including U user { u1, u2..., uU, set ui
It is i-th of user, ui∈{u1, u2..., uU, each user carries out S business, sets j as one of business, j ∈ 1,
2 ..., S }；Comprise the following steps：
(1-1) formulates QCI criterions；
(1-2) adjusts queuing delay；
(1-3) rate matched factor：
(1-3-1) computation rate factor of influence；
(1-3-2) implements speed rewarding and punishing；
(1-4) normalized；
(1-5) multi-service dynamic dispatching.
2. the multi-service dynamic dispatching method according to claim 1 based on QCI, it is characterized in that, step (1-1) is included such as
Lower step：
(2-1) sets the 1st underlying table, and the 1st underlying table includes QCI values, and resource type, time delay, packet loss, typical case applies and preferential
Level；Set ρijFor user uiMiddle business j priority, believes for the IMS in the GBR traffic and Non-GBR in the 1st underlying table
Order, calculates the QCI factors of influence of the customer service Wherein, e () represents the index letter using e the bottom of as
Number；
(2-2) calculates its QCI factor of influence for other Non-GBR business in the 1st underlying table in addition to IMS signalings
(2-3) utilizes formulaCalculate user uiThe QCI factors
3. the multi-service dynamic dispatching method according to claim 1 based on QCI, it is characterized in that, step (1-2) is included such as
Lower step：
(3-1) setting user uiStand-by period of the business j in queue beThe maximum delay that business j allows is Tj M, calculate
The time delay influence factor of the customer service
(3-2) is calculatedIt is used as user uiTime delay factor.
4. the multi-service dynamic dispatching method according to claim 1 based on QCI, it is characterized in that, step (1-3) is included such as
Lower step：
(4-1) sets BiFor user uiApllied bandwidth, SINRiFor user uiThe signal to noise ratio of residing channel, BERiFor user ui
Block Error Rate, utilize formula Vi=Bi*log2(1+SINRi/(-ln(5BERi/ 1.5)) calculate user uiTransmission rate Vi；
(4-2) utilizes formulaCalculate user uiRate factor
(4-3) sets VLFor speed low threshold, VHFor high threshold, TVFor rewarding and punishing maximum,
Meeting Casel conditions Vi＜ VL＜ VHWhen, utilize formula Computation rate influences
The factor
Meeting Case2 conditions Vi∈[VL, VH] when, make speed factor of influenceDo not adjust；
Meeting Case3 conditions Vi＞ VH＞ VLWhen, utilize formula Computation rate influence because
Son
(4-4) is calculatedIt is used as the recombination rate factor.
5. the multi-service dynamic dispatching method according to claim 1 based on QCI, it is characterized in that, step (1-4) is included such as
Lower step：
(0,1] on interval it is right respectivelyIt is normalized, obtains
6. the multi-service dynamic dispatching method based on QCI according to claim 1 or 2 or 3 or 4 or 5, it is characterized in that, step
Suddenly (1-5) comprises the following steps：
(6-1) utilizes formulaCalculate comprehensive priority pi, piIt is used as user uiFinal tune
Spend priority；
(6-2) is by each user according to priority piDescending arrangement is carried out, and is sequentially placed into scheduler being scheduled.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710218950.5A CN107105505B (en) | 2017-04-05 | 2017-04-05 | Multi-service dynamic dispatching method based on QCI |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710218950.5A CN107105505B (en) | 2017-04-05 | 2017-04-05 | Multi-service dynamic dispatching method based on QCI |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107105505A true CN107105505A (en) | 2017-08-29 |
| CN107105505B CN107105505B (en) | 2019-09-03 |
Family
ID=59674882
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710218950.5A Active CN107105505B (en) | 2017-04-05 | 2017-04-05 | Multi-service dynamic dispatching method based on QCI |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107105505B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109951329A (en) * | 2019-03-12 | 2019-06-28 | 中国联合网络通信集团有限公司 | A kind of network resource scheduling method and device |
| CN112243255A (en) * | 2020-10-14 | 2021-01-19 | 中国联合网络通信集团有限公司 | Method and device for determining scheduling priority |
| CN113709888A (en) * | 2021-10-27 | 2021-11-26 | 华信咨询设计研究院有限公司 | 5G fairness scheduling method and device considering time delay under eMB scene |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102752763A (en) * | 2012-07-09 | 2012-10-24 | 北京北方烽火科技有限公司 | Realistic type proportional fair scheduling metric calculation method and device in LTE (Long Time Evolution) system |
| CN102858015A (en) * | 2011-06-30 | 2013-01-02 | 普天信息技术研究院有限公司 | Multi-service scheduling method |
| CN104427623A (en) * | 2013-08-30 | 2015-03-18 | 中国移动通信集团设计院有限公司 | Service scheduling method and service scheduling device |
-
2017
- 2017-04-05 CN CN201710218950.5A patent/CN107105505B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102858015A (en) * | 2011-06-30 | 2013-01-02 | 普天信息技术研究院有限公司 | Multi-service scheduling method |
| CN102752763A (en) * | 2012-07-09 | 2012-10-24 | 北京北方烽火科技有限公司 | Realistic type proportional fair scheduling metric calculation method and device in LTE (Long Time Evolution) system |
| CN104427623A (en) * | 2013-08-30 | 2015-03-18 | 中国移动通信集团设计院有限公司 | Service scheduling method and service scheduling device |
Non-Patent Citations (2)
| Title |
|---|
| 张建斌等: "基于QCI分层的VoLTE多场景eSRVCC语数业务均衡优化", 《电信技术》 * |
| 肖清华: "吞吐量优先的LTE 公平性调度算法", 《邮电设计技术》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109951329A (en) * | 2019-03-12 | 2019-06-28 | 中国联合网络通信集团有限公司 | A kind of network resource scheduling method and device |
| CN112243255A (en) * | 2020-10-14 | 2021-01-19 | 中国联合网络通信集团有限公司 | Method and device for determining scheduling priority |
| CN112243255B (en) * | 2020-10-14 | 2023-06-09 | 中国联合网络通信集团有限公司 | Determination method and device for scheduling priority |
| CN113709888A (en) * | 2021-10-27 | 2021-11-26 | 华信咨询设计研究院有限公司 | 5G fairness scheduling method and device considering time delay under eMB scene |
| CN113709888B (en) * | 2021-10-27 | 2022-01-18 | 华信咨询设计研究院有限公司 | 5G fairness scheduling method and device considering time delay under eMB scene |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107105505B (en) | 2019-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101282324B (en) | Method for managing combined wireless resource of self-adaption MIMO-OFDM system based on across layer | |
| Kar et al. | Throughput-optimal scheduling in multichannel access point networks under infrequent channel measurements | |
| WO2017041492A1 (en) | Resource allocation method and device, and computer-readable storage medium | |
| CN106937393A (en) | A kind of scheduling method for wireless resource based on priority | |
| CN103260258A (en) | Resource distribution and resource reuse combination method in cellular terminal device-to-device (D2D) system | |
| CN102158962B (en) | Clustering method, resource allocation method and related equipment for base station cooperation | |
| CN104009936B (en) | Queue scheduling method based on dynamic weight calculation | |
| CN107105505B (en) | Multi-service dynamic dispatching method based on QCI | |
| CN109195176A (en) | The self-adapting dispatching method and system of multi-service fusion in a kind of Home eNodeB | |
| CN109743778A (en) | A kind of resource allocation optimization method and system based on intensified learning | |
| CN103442446B (en) | Dynamic and semi-static combined scheduling method in a kind of LTE system | |
| CN103347304B (en) | For the method and apparatus of MIMO scheduling | |
| CN104640227B (en) | The downlink resource scheduling method of mixed service in LTE system | |
| CN107872892A (en) | A kind of wireless resource allocation methods and device | |
| CN104619034B (en) | Towards the grouping scheduling method of real time business in a kind of LTE communication system | |
| CN106714323A (en) | Priority distinguishing and dispatching method of heterogeneous flow in 4G network | |
| CN103826312A (en) | Improved LTE (Long Term Evolution) scheduling method based on exponential rule | |
| CN102404862B (en) | Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system | |
| CN107846266A (en) | Running time-frequency resource dispatching space division method and apparatus | |
| CN114554614A (en) | Apparatus and method for scheduling data transmission | |
| CN103929822A (en) | LTE proportional fair scheduling method | |
| CN102724763A (en) | Time domain group scheduling method on basis of two-dimensional priority level | |
| CN108777857B (en) | Access control method and system under coexistence scene of URLLC and mMTC | |
| CN111542091B (en) | Wireless and computing resource joint allocation method for network slice | |
| CN107087309B (en) | Proportional fair scheduling method for multi-base-station system under fixed rate constraint of user QoS |
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 |