CN107105505B - Multi-service dynamic dispatching method based on QCI - Google Patents

Multi-service dynamic dispatching method based on QCI Download PDF

Info

Publication number
CN107105505B
CN107105505B CN201710218950.5A CN201710218950A CN107105505B CN 107105505 B CN107105505 B CN 107105505B CN 201710218950 A CN201710218950 A CN 201710218950A CN 107105505 B CN107105505 B CN 107105505B
Authority
CN
China
Prior art keywords
user
qci
rate
factor
business
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710218950.5A
Other languages
Chinese (zh)
Other versions
CN107105505A (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.)
Huaxin Consulting Co Ltd
Original Assignee
Huaxin Consulting 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 Huaxin Consulting Co Ltd filed Critical Huaxin Consulting Co Ltd
Priority to CN201710218950.5A priority Critical patent/CN107105505B/en
Publication of CN107105505A publication Critical patent/CN107105505A/en
Application granted granted Critical
Publication of CN107105505B publication Critical patent/CN107105505B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

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 }；Include the following steps: that (1-1) formulates QCI criterion；(1-2) adjusts queuing delay；(1-3) rate matched factor；(1-4) normalized；(1-5) multi-service dynamic dispatching.The present invention has and can dynamically track multiple services QCI index and time delay, take into account cell handling capacity and system fairness under the premise of, the characteristics of its dispatching priority is adjusted flexibly to different rate users in real time.

Description

Multi-service dynamic dispatching method based on QCI
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 the more of QCI Service dynamic dispatching method.
Background technique
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 can guarantee business service quality as one kind The wireless broadband communication technology of QoS (Quality of Service) and user fairness, are increasingly used widely.To mention High resource utilization ratio, LTE take 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.Currently used dispatching algorithm such as RR (Round Robin, polling dispatching), (Short Job First, most short operation are excellent by PF (Proportion Fair, ratio are fair) and SJF The dispatching methods such as first), merely emphasize throughput of system or fairness, do not account for how realizing therebetween it is balanced or How person, which is directed to multiple services collaboration, optimizes.
2016.6.7 a kind of LTE tune based on loaded self-adaptive that Chinese Patent Application No. is CN10528279.2 is disclosed Degree method, method includes the following steps: step 1: physical resource is calculated；Step 2: cell load evaluation；Step 3: handling capacity Priority is extracted；Step 4: establishing loaded self-adaptive model.The resulting LTE dispatching method based on loaded self-adaptive of the invention, Start with from analysis physical resource, establishes the load module of subdistrict self-adaptive, it can be according to actual loading size dynamic adjustment user Priority, to realize the equilibrium of system.Unfortunately, this method does not consider the practical business that each user carries out in cell Type does not consider the perception of practical scheduled user, will affect dispatching party although having calculated the load of cell on the whole The fairness of method.LMA (the improved M-LWDF algorithm of LTE Modified M-LWDF Algorithm, LTE) algorithm although it is contemplated that Multi-service, but can maximum probability lead to the behavior of suffering from hunger of user.
Summary of the invention
Goal of the invention of the invention is to overcome LMA algorithm meeting maximum probability in the prior art that user is caused to suffer from hunger not Foot, provides a kind of multi-service dynamic dispatching method based on QCI being dynamically adapted.
To achieve the goals above, the invention adopts the 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 }； Include the following steps:
(1-1) formulates QCI criterion；
(1-2) adjusts queuing delay；
(1-3) rate matched factor:
(1-3-1) computation rate impact factor；
(1-3-2) implements rate rewarding and punishing；
(1-4) normalized；
(1-5) multi-service dynamic dispatching.
Goal of the invention of the invention is to overcome LTE system scheduling user in the prior art not take multiple services shadow into account It rings, also cannot be considered in terms of 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 waiting time delay of each business of user, counts the transmission rate of user's any time, carries out to low-rate users Compensation carries out appropriate punishment to high rate user, 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 value, according to The length of time delay is waited, dynamic adjusts the dispatching priority of user.On this basis, it for low-rate users, is mended by forward direction It repays to distribute more resources, for high rate user, carries out appropriateness punishment and avoid user from suffering from hunger to realize.Scheduling of the invention Mechanism combines the handling capacity of cell, and service delay is lower, and system fairness is higher.
The present invention dynamically can wait time delay according to multiple services QCI parameter and queue, use in real time different rates Dispatching priority is adjusted flexibly in family, advantageously ensures that the fairness of system, keeps system equalization.
Preferably, step (1-1) includes the following steps:
(2-1) sets the 1st underlying table, and the 1st underlying table includes QCI value, resource type, time delay, packet loss, typical case and Priority；
Set ρijFor user uiThe priority of middle business j, in the GBR traffic and Non-GBR in the 1st underlying table IMS signaling calculates the QCI impact factor of the customer service Wherein, e(·)It indicates using e as the index at bottom Function；
(2-2) for other Non-GBR business in the 1st underlying table in addition to IMS signaling, calculate its QCI influence because
(2-3) utilizes formulaCalculate user uiThe QCI factor
Preferably, step (1-2) includes the following steps:
(3-1) sets user uiBusiness j waiting time in the 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) includes the following steps:
(4-1) sets BiFor user uiApplied bandwidth, SINRiFor user uiThe signal-to-noise ratio of locating channel, BERiFor with Family uiBlock Error Rate, utilize formula Vi=Bi*log2(1+SINRi/(-ln(5BERi/ 1.5) user u) is calculatediTransmission rate；
(4-2) utilizes formulaCalculate user uiRate factor
(4-3) sets VLFor rate low threshold, VHFor high threshold, TVFor rewarding and punishing maximum value,
Meeting Case1 condition Vi< VL< VHWhen, utilize formula Computation rate Impact factor
Meeting Case2 condition Vi∈[VL, VH] when, make rate impact factorIt does not adjust；
Meeting Case3 condition Vi> VH> VLWhen, utilize formula Computation rate shadow Ring the factor
(4-4) is calculatedAs the recombination rate factor.
Preferably, step (1-4) includes the following steps:
(0,1] on section it is right respectivelyIt is normalized, obtains
Preferably, step (1-5) includes the following steps:
(6-1) utilizes formulaCalculate comprehensive priority pi, piAs 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 and is scheduled.
Therefore, the invention has the following beneficial effects: can dynamically track multiple services QCI index and time delay, simultaneous Under the premise of the handling capacity of Gu little Qu and the fairness of system, its dispatching priority is adjusted flexibly to different rate users in real time Grade.
Detailed description of the invention
Fig. 1 is a kind of flow chart of the invention；
Fig. 2 is that the present invention and a kind of throughput ratio of RR, SJF and LMA are relatively schemed；
Fig. 3 is a kind of present invention figure compared with cell load of RR, SJF and LMA；
Fig. 4 is a kind of present invention figure compared with scheduling fairness of RR, SJF and LMA.
Specific 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 }；Include the following steps:
Step 1:QCI Standard-making；
Step 1-1: the 1st underlying table of setting, the 1st underlying table includes QCI value, resource type, time delay, packet loss, and typical case answers With and priority；Set ρijFor user uiThe priority of middle business j, in the GBR traffic and Non-GBR in the 1st underlying table IMS signaling, calculate the QCI impact factor of the customer serviceWherein, e(·)It indicates 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 signaling, calculate its QCI influence because
Step 1-3: formula is utilizedCalculate user uiThe QCI factor；
Step 2: queuing delay adjustment；
Step 2-1: setting user uiBusiness j waiting time in the queue beThe maximum delay that the business allows ForCalculate the time delay influence factor of the customer service
Step 2-2: it calculatesAs user uiTime delay factor；
Step 3: rate factor matching；
Step 3-1: setting BiFor user uiApplied bandwidth, SINRiFor the signal-to-noise ratio of channel locating for the user, BERi For user's Block Error Rate, formula V is utilizedi=Bi*log2(1+SINRi/(-ln(5BERi/ 1.5) user u) is calculatediTransmission speed Rate；
Step 3-2: formula is utilizedCalculate user uiRate factor
Step 3-3: setting VLFor rate low threshold, VHFor high threshold, TVFor rewarding and punishing maximum value, meeting Case1 condition Vi < VL< VHWhen, utilize formulaComputation rate impact factor
Meeting Case2 condition Vi∈[VL, VH] when, make rate impact factorIt does not adjust；
Meeting Case3 condition Vi> VH> VLWhen, utilize formula Computation rate shadow Ring the factor
Step 3-4: it calculatesAs the recombination rate factor；
Step 4: normalized；
(0,1] on section it is right respectivelyIt is normalized, obtains
Step 5: multi-service dynamic dispatching；
Step 5-1: comprehensive priority is calculatedAs user uiFinally scheduling it is excellent First grade；
Step 5-2: by each user according to priority PiDescending arrangement is carried out, and is sequentially placed into scheduler and is scheduled.
Example:
The present invention is specifically described by taking U=5 as an example below, standard QCI value is as shown in the 1st underlying table of table 1:
1 standard QCI value of table
Each user commences business as shown in table 2:
Each customer service of table 2
Basic data is as shown in table 3:
3 basic data of table
Project Data
RB occupied bandwidth BW (kHz) 180
Cell RB sum 80
Rate low threshold VL(kbps) 100
Rate 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, includes the following steps: QCI Standard-making, is lined up Time delay adjustment, rate factor matching and multi-service dynamic dispatching.
Step 1:QCI Standard-making；
Calculate each user's
It calculates on this basis
Step 2: queuing delay adjustment；
Calculate each user's
It calculates on this basis
Step 3: rate factor matching；
Step 3-1:
It calculates
Step 3-2: the computation rate factor
Step 3-3: user { u1, u3, u4Meet Case2 condition, it is not necessarily to rewards and punishments, user u2Meet Case1 condition, needs Rate compensation is carried out, is calculated User u5 Meet Case3 condition, need to carry out appropriate rate punishment, calculatesAs rate impact factor；
Step 3-4: the recombination rate factor after calculating rewarding and punishing
Step 4: normalized；
(0,1] on section it is right respectivelyIt is normalized, obtains
Step 5: multi-service dynamic dispatching；
Step 5-1: the comprehensive priority of each user is calculated
Step 5-2: by user uiAccording to priority PiDescending arrangement is carried out, and is sequentially placed into QMDS scheduler and is scheduled, Dispatching sequence is followed successively by { u1, u5, u4, u3, u2}。
Emulation experiment:
By QMDS method of the invention and RR, SJF, the methods of LMA carry out simulation comparison, dispatch number of users from 10 gradually Increase to 30, resulting LTE system handling capacity, the packet loss and method fairness in scheduling process are respectively referring to attached drawing 2 Shown in 4.
As shown in Fig. 2, throughput of system is best for LMA algorithm, main reason is that there is no to transmission rate by LMA Excessively high user inhibits, although generally improving the handling capacity of system, also can maximum probability bring the shape of suffering from hunger of user State leads to packet loss rising and the reduction of algorithm fairness.And QMDS is under the premise of guaranteeing fairness with system performance, it is most Possibly lifting system handling capacity.
As shown in figure 3, LMA is to improve throughput of system based on promoting packet loss, QMDS then to multi-service into Row subdivision, distinguishes scheduling according to QCI and rate, totally ensure that lower packet loss.And since SJF is always with most short work Industry is preferentially used as dispatching criterion, and 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, the fairness of RR be it is highest in all algorithms, this is to be determined by its criterion, and SJF does not have at all Consider fairness, fairness is also relatively low.LMA does not meet with an accident, and fairness and SJF are similar.And the algorithm of QMDS is fair Property is only second to RR algorithm, illustrates to sacrifice certain fairness to exchange handling capacity for be desirable.All algorithms are with scheduling user Several increases, fairness gradually drop.
It should be understood that this embodiment is only used to illustrate the invention but not to limit the scope of the invention.In addition, it should also be understood that, After having read the content of the invention lectured, those skilled in the art can make various modifications or changes to the present invention, these etc. Valence form is also fallen within the scope of the appended claims of the present application.

Claims (1)

1. a kind of multi-service dynamic dispatching method based on QCI, 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, set j as one of business, j ∈ 1, 2 ..., S }；Include the following steps:
(1-1) formulates QCI criterion；
(1-1-1) sets the 1st underlying table, and the 1st underlying table includes QCI value, resource type, time delay, packet loss, typical case and excellent First grade；Set ρijFor user uiThe priority of middle business j believes the IMS in the GBR traffic and Non-GBR in the 1st underlying table It enables, calculates the QCI impact factor of the customer service Wherein, e(·)It indicates using e as the exponential function at bottom；
(1-1-2) calculates its QCI impact factor for other Non-GBR business in the 1st underlying table in addition to IMS signaling
(1-1-3) utilizes formulaCalculate user uiThe QCI factor
(1-2) adjusts queuing delay；
(1-2-1) sets user uiBusiness j waiting time in the queue beBusiness j allow maximum delay be Calculate the time delay influence factor of the customer service
(1-2-2) is calculatedAs user uiTime delay factor；
(1-3) rate matched factor:
(1-3-1) sets BiFor user uiApplied bandwidth, SINRiFor user uiThe signal-to-noise ratio of locating channel, BERiFor user uiBlock Error Rate, utilize formula Vi=Bi*log2(1+SINRi/(-ln(5BERi/ 1.5) user u) is calculatediTransmission rate Vi；
(1-3-2) utilizes formulaCalculate user uiRate factor
(1-3-3) sets VLFor rate low threshold, VHFor high threshold, TVFor rewarding and punishing maximum value, meeting Casel condition Vi< VL< VHWhen, utilize formula Computation rate impact factor
Meeting Case2 condition Vi∈[VL, VH] when, make rate impact factorIt does not adjust；
Meeting Case3 condition Vi> VH> VLWhen, utilize formulaVH, TV) computation rate impact factor
(1-3-4) is calculatedAs the recombination rate factor；
(1-4) normalized；
(0,1] on section it is right respectivelyIt is normalized, obtains
(1-5) multi-service dynamic dispatching
(1-5-1) utilizes formulaCalculate comprehensive priority pi, piAs user uiIt is final Dispatching priority；
(1-5-2) is by each user according to priority piDescending arrangement is carried out, and is sequentially placed into scheduler and is scheduled.
CN201710218950.5A 2017-04-05 2017-04-05 Multi-service dynamic dispatching method based on QCI Active CN107105505B (en)

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 CN107105505A (en) 2017-08-29
CN107105505B true 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)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109951329B (en) * 2019-03-12 2022-02-18 中国联合网络通信集团有限公司 Network resource scheduling method and device
CN112243255B (en) * 2020-10-14 2023-06-09 中国联合网络通信集团有限公司 Determination method and device for scheduling priority
CN113709888B (en) * 2021-10-27 2022-01-18 华信咨询设计研究院有限公司 5G fairness scheduling method and device considering time delay under eMB scene

Citations (3)

* Cited by examiner, † Cited by third party
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

Patent Citations (3)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
吞吐量优先的LTE 公平性调度算法;肖清华;《邮电设计技术》;20170131;全文
基于QCI分层的VoLTE多场景eSRVCC语数业务均衡优化;张建斌等;《电信技术》;20161231;全文

Also Published As

Publication number Publication date
CN107105505A (en) 2017-08-29

Similar Documents

Publication Publication Date Title
CN106793133B (en) Scheduling method for guaranteeing multi-service QoS in electric power wireless communication system
CN106954232B (en) Time delay optimized resource allocation method
WO2017041492A1 (en) Resource allocation method and device, and computer-readable storage medium
CN107105505B (en) Multi-service dynamic dispatching method based on QCI
CN106937393A (en) A kind of scheduling method for wireless resource based on priority
CN103096485B (en) A kind of method of multi-user&#39;s multiple-input, multiple-output frequency selection scheduling in LTE system
CN109195176A (en) The self-adapting dispatching method and system of multi-service fusion in a kind of Home eNodeB
CN104009936B (en) Queue scheduling method based on dynamic weight calculation
CN104619034B (en) Towards the grouping scheduling method of real time business in a kind of LTE communication system
CN103596285A (en) Wireless resource scheduling method, wireless resource scheduler and system thereof
CN106850169A (en) The method and communication equipment of a kind of scheduling of resource distribution
WO2014117347A1 (en) Data scheduling method and apparatus
CN106714323A (en) Priority distinguishing and dispatching method of heterogeneous flow in 4G network
CN104640227B (en) The downlink resource scheduling method of mixed service in LTE system
CN112637911A (en) Resource allocation method and system for eMB and urllc in coexistence in 5G system
CN101707807A (en) Method and device for scheduling service queue
CN103442446A (en) Dynamic and semi-static combined dispatching method in LTE system
CN107872892A (en) A kind of wireless resource allocation methods and device
CN102404862B (en) Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system
CN102724763A (en) Time domain group scheduling method on basis of two-dimensional priority level
CN104602355B (en) mixed service dispatching method in LTE system
CN105120482B (en) A kind of time delay priority scheduling method based on resource utilization
CN103929822A (en) LTE proportional fair scheduling method
CN103987120B (en) Cluster multimedia service downlink radio resource dispatching method under LTE public networks
CN108965168B (en) Internet of vehicles occupation resource fair allocation optimization method based on utility function

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