CN101175064B - Forwarding periodic line scheduling method based on service quality - Google Patents
Forwarding periodic line scheduling method based on service quality Download PDFInfo
- Publication number
- CN101175064B CN101175064B CN2006101657800A CN200610165780A CN101175064B CN 101175064 B CN101175064 B CN 101175064B CN 2006101657800 A CN2006101657800 A CN 2006101657800A CN 200610165780 A CN200610165780 A CN 200610165780A CN 101175064 B CN101175064 B CN 101175064B
- Authority
- CN
- China
- Prior art keywords
- user
- stream
- service quality
- throughput
- clients
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention discloses a forward link dispatching method based on service quality, which is invented in order to resolve the problem that the prior art can not improve system throughput index while fulfilling the QOS of clients. The method of the invention comprises the following procedures: judging whether TS current clients and DS steam clients coexist in the system, if so, a base station will calculate the TS steam average throughput of all clients and the TS stream average throughput of the TS stream request of each client, so as to judge whether the TS stream service quality grade needs to be raised for each client. If the judgment result is yes, then raising the TS stream service quality grade for the clients who need service quality upgrade, and transferring the data of clients according to the priority arrangement of the data in clients application array, the priority arrangement is made by a dispatching device according to service quality grade, throughput, and time delay. The invention is capable of fulfilling service quality to clients with simultaneous increase of system throughput.
Description
Technical field
The present invention relates to the forward link scheduling method in the computer network communication, particularly quality-of-service based forward link scheduling method.
Background technology
In high-speed grouped data system (HRPD) system, the packet scheduling technology is the technology of a key in the existing Packet Service solution, so this technology also becomes the focus that a lot of technical staff pay close attention to.
In data communication, for reverse link, the forward packet service needed takies the more bandwidth resource.Based on this asymmetric property of Packet Service, in the HRPD system, forward channel has adopted high speed shared channels, serves all user AT (Access Terminal mobile phone terminal) with the mode of time division multiplexing mode (TDM).Forward link is divided into the time slot of 1.66ms, and at any given time slot, AN can only serve a user AT (if not considering the mode that the multi-user wraps).How each time slot of decision forward link distributes to different user AT, forward direction dispatching algorithm that Here it is.Scheduler when transmitting grouped data, the grouped data of the user AT that always the prioritised transmission priority is the highest.
Two kinds of dispatching methods are more typically arranged in the existing scheduling strategy: a kind of is Proportional Fair algorithm (P-R); A kind of in addition dispatching algorithm that just is based on QOS.
For (P-R) dispatching algorithm, dispatching priority P confirms through following method: follow the estimation of user's current time forward link quality and report the data rate DRC of application to be directly proportional, be inversely proportional at the average throughput T before the current time with the user.Like this, (request transmission rate DRC value is bigger) can obtain more transmission opportunity when user channel quality is better, thereby improves the throughput of system; When user's channel quality is relatively poor,, can make P increase the transmission opportunity of acquisition equally because average throughput T is lower.Utilize the dispatching priority of this method decision grouping user to embody the fairness between each user, guaranteed the capacity of system simultaneously, but satisfied not the requirement of QOS.Along with the continuous development of mobile communication technology, people are also increasingly high to the requirement of wireless data service.High Rate Packet Data system (HRPD) also develops into the system that increasing otherness service can the user be provided thereupon, and for example: file is downloaded (ftp), web page browsing (http), game on line or VOIP etc.The QOS dispatching algorithm has been proposed again therefore.
For existing QOS dispatching algorithm; Its main thought is following: according to the user difference of QOS demand is divided into other set of different priorities respectively with each user's different application (Flow); If set owner is divided for the requirement of QOS grade, time delay and throughput (MC, DelayBound and TargetThroughput) according to the user.According to MC the priority of Flow being carried out one-level divides; Can be divided into 7～8 kinds of MC grades according to service needed, these several kinds of grades generally all belong to following two kinds of types of service: delay sensitive type (DS), like VOIP; Or throughput sensitive type (TS); Like FTP, usually, the DS type has absolute high priority (MC is bigger) with respect to the TS type.Flow for each type passes through CurrentDelay and AvgThroughput calculation of parameter again, priority is carried out secondary divide.At first for each user creates a transmission instances, choose from the formation of each Flow successively according to the order of priority by the data bit of transmission instances before scheduling for scheduler; Calculate the priority of each transmission instances then.The priority of this transmission instances based on each Flow and each user can be described through following multinomial:
P＝[MC0]+[MC1]x+[MC2]x
2+[MC3]x
3+[MC4]x
4+[MC5]x
5+[MC6]x
6+[MC7]x
7
MC0 wherein, MC1, MC2 ..., MC7 is called measure coefficient, is called the tolerance priority state again; P is used for describing the priority of each Flow or transmission instances.For each Flow, because the state of the MC of same data flow always confirms, so has only one not to be 0 in the corresponding above-mentioned multinomial of the priority of each Flow of user, P value is calculated acquisition through CurrentDelay and the AvgThroughput of Flow.For user's transmission instances, its priority is represented with above-mentioned polynomial form through the priority of each stream of comprising in this instance.The comparison criterion of Metric is identical with polynomial comparison criterion: the earlier the highest coefficient, a relatively lower successively then coefficient.The priority level that therefore can reflect tolerance: MC0 through metric states corresponding the Flow of minimum priority, MC7 corresponding the Flow of the highest priority limit priority.
Scheduler always is chosen as user's service of high priority transfer instance earlier when scheduling.If there is the identical transmission instances of a plurality of priority, can re-uses the maximum principle of P-R algorithm or C/I so and serve each user successively.This algorithm biggest advantage is to have satisfied user's QOS requirement, can realize Intra-QOS and Inter-QOS.
But also there is certain defective in QOS dispatching algorithm recited above: because DS stream is in the MC of higher level than TS stream, so DS stream has absolute priority with respect to TS stream, exists when system under the situation of DS stream, and the throughput of TS stream will be affected.Cite a plain example: we know that the speed of the general application of VOIP is lower; And data volume is less; If the VOIP business of system DS type is more, because the priority of VOIP is higher, the scheduling VOIP that system will be more frequent is professional; This moment, the ftp business of TS just can not get scheduling fully, thereby will influence the throughput index of system.
Summary of the invention
For defective and the deficiency that overcomes prior art, the object of the invention can improve the quality-of-service based forward link scheduling method of system throughput figureofmerit when being to provide a kind of user of satisfying QOS.
In order to achieve the above object, the present invention is based on the forward link scheduling method of service quality, may further comprise the steps:
(1) judges whether exist TS stream user and DS to flow the user in the system simultaneously, if judged result is for being then to get into step (2); If judged result then gets into step (4) for not;
(2) base station calculates the average throughput of all user TS stream and the average throughput of each user TS stream request, comes to judge respectively whether each user need promote its TS stream service quality rating, if judged result is for being then to get into step (3); If judged result then gets into step (4) for not;
(3) this TS stream that need promote the service quality rating user is promoted service quality rating after, get into step (4);
(4) scheduler, transmits user's data according to priority after data are carried out the arrangement of priority in user's application queue according to service quality rating, throughput and time delay.
Said step (2) is specially:
(21) TS stream user rate request is collected in the base station, and calculates the average throughput of all user TS streams and the average transmission rate of each user TS stream request through filtering;
(22) judge whether to satisfy formula
if satisfy; Judge that then this user need promote its TS stream service quality rating, gets into step (3); Otherwise, get into step (4);
Wherein, described DRC
K_Average[n] is the n average transmission rate of K user TS stream request constantly, and described M is TS stream user's a sum, and described α is a load factor, and said T [n] is the average throughput of all user TS streams in the system.
As further improvement of the present invention; Definite method of said load factor size is: TS stream number of users in the statistical system of base station; Estimating system DS stream load situation, and choose suitable load factor according to the heavy degree of DS stream load, to the DS load heavy choose little load factor.
As further improvement of the present invention, the method that promotes service quality rating described in the step (3) is: the configuration through the system manager is accomplished.
After adopting above-mentioned method; Can flow when existing simultaneously at TS stream and DS; Each user is judged whether to need to promote TS stream service quality rating, and the user of needs is promoted its TS stream service quality rating, can when satisfying QoS of customer, improve the index of throughput of system.
Description of drawings
Fig. 1 is the flow chart of quality-of-service based forward link scheduling method among the present invention.
Embodiment
The present invention is that the base station is according to user radio channel condition and change in throughput; Adjustment TS flows dispatching priority in real time; Then according to the priority of adjusted each Flow of QOS calculation of parameter, and select the data bit of the higher Flow of priority to generate candidate's transmission instances, select the highest user of priority to dispatch again for each user; This dispatching method can satisfy user's QOS demand, and can overcome the loss of the throughput that the DS overload because of system causes.
The base station be factors such as average throughput through the DRC value of utilizing in the system user's request of using TS stream and TS stream as decision threshold, adjust TS in real time and flow dispatching priority MC; Can establish DRC
K_Average[n] is the n average transmission rate of K user TS stream request constantly, and supposing the system has M TS stream user, if the average throughput T [n] of TS stream is satisfied in the system:
The time, the QOS grade MC of the TS stream of user k will rise to the level of DS stream or than the higher priority of existing DS stream, the grade of lifting can be disposed by the system manager; Otherwise the MC of the TS stream of user k will keep original state.
Wherein, the load of the value of α and DS stream has relation, and the DS stream load is heavy more, and the value of α is just more little.According to the situation of the load of the DS of system stream, and the situation of TS stream user request service, the grade of service of TS stream is dynamically adjusted, DS stream user and TS stream user can both be served preferably, and can improve the forward-link capacity of system on the whole.
Do further explain below in conjunction with the accompanying drawing specific embodiments of the invention.
Scheduler gets into this dispatching algorithm when (101) need be dispatched new Packet;
(102) judge in the system whether have TS user and DS user simultaneously, if exist simultaneously, then get into step (103), the TS flow priority that each TS stream user is carried out proposing among this paper promotes judgement; If not having TS user and DS user simultaneously, then directly change step (108) over to;
(103) TS stream number of users in the base station side statistical system; Estimating system DS stream load situation is chosen suitable load factor alpha according to the heavy degree of DS stream load, if the DS load is heavier, just chooses less α.The concrete value of alpha parameter can be disposed by the system manager, also can be confirmed according to specific algorithm by the base station; Calculate the total average throughput of all TS streams through filtering algorithm;
(104) base station side is collected TS user's rate request DRC, and calculates the average DRC of this TS stream user request through filtering algorithm;
(105) judge whether to satisfy formula
if satisfy; Judge that then this user need promote the QOS grade of TS stream; Otherwise, get into step (107);
(106), promote the QOS grade of this user's TS stream according to system manager's configuration;
(107) algorithm that provides to (106) with indoor traversal step (104) at TS; If traversal is not accomplished then is changed step (104) over to; Otherwise get into step (108);
(108) scheduler is according to the priority that requires in various computing this user Flow formation data of different Flow to time delay and throughput, and the calculating of order of priority can be adopted following manner;
(109) produce candidate's transmission instances for each user; The principle that candidate's transmission instances generates is exactly from the data queue of all Flow of user; The bit of the data flow that the priority of selecting step (108) to calculate is maximum is filled a Packet, and the form of Packet is relevant with the DRC of current channel;
(110) scheduler calculates the priority of transmission instances according to the result of step (109) according to following formula
P＝[MC0]+[MC1]x+[MC2]x
2+[MC3]x
3+[MC4]x
4+[MC5]x
5+[MC6]x
6+[MC7]x
7
(111) when scheduling arrives constantly, scheduler selects all users' the highest instance of candidate's transmission instances medium priority to transmit according to step (110) result calculated.If there is the identical transmission instances of a plurality of priority, can re-uses the maximum principle of P-R algorithm or C/I so and serve each user successively;
(112) scheduler finishes the scheduling of epicycle.
The present invention can flow when existing simultaneously at TS stream and DS; Each user is judged whether to need to promote TS stream service quality rating; And the user of needs promoted its TS stream service quality rating, can when satisfying QoS of customer, improve the index of throughput of system.
Above embodiment is only unrestricted in order to technical scheme of the present invention to be described; Although the present invention is specified with reference to preferred embodiment; Those of ordinary skill in the art is to be understood that; Can make amendment or be equal to replacement technical scheme of the present invention, and not break away from the spirit and the scope of technical scheme of the present invention, it all should be encompassed in the middle of the scope of claim protection of the present invention.
Claims (3)
1. a quality-of-service based forward link scheduling method is characterized in that, may further comprise the steps:
(1) judges whether exist throughput sensitive type (TS) stream user and delay sensitive type (DS) to flow the user in the system simultaneously, if judged result is for being then to get into step (2); If judged result then gets into step (4) for not;
(2) base station calculates the average throughput of all user TS streams in the system and the average transmission rate of each user TS stream request; Judge whether to satisfy formula
if satisfy; Judge that then this user need promote its TS stream service quality rating, gets into step (3); Otherwise, get into step (4);
Wherein, described DRC
K_Average[n] is the n average transmission rate of K user TS stream request constantly, and described M is TS stream user's a sum, and described α is a load factor, and said T [n] is the average throughput of all user TS streams in the system;
(3) this TS stream that need promote the service quality rating user is promoted service quality rating after, get into step (4);
(4) scheduler, transmits user's data according to priority after data are carried out the arrangement of priority in user's application queue according to service quality rating, throughput and time delay.
2. according to the described quality-of-service based forward link scheduling method of claim 1; It is characterized in that; Definite method of said load factor size is: TS stream number of users in the statistical system of base station; Estimating system DS stream load situation, and choose suitable load factor according to the heavy degree of DS stream load, to the DS load heavy choose little load factor.
3. according to the described quality-of-service based forward link scheduling method of claim 2, it is characterized in that the method that promotes service quality rating described in the step (3) is: the configuration through the system manager is accomplished.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101657800A CN101175064B (en) | 2006-12-18 | 2006-12-18 | Forwarding periodic line scheduling method based on service quality |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101657800A CN101175064B (en) | 2006-12-18 | 2006-12-18 | Forwarding periodic line scheduling method based on service quality |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101175064A CN101175064A (en) | 2008-05-07 |
| CN101175064B true CN101175064B (en) | 2012-01-11 |
Family
ID=39423323
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006101657800A Expired - Fee Related CN101175064B (en) | 2006-12-18 | 2006-12-18 | Forwarding periodic line scheduling method based on service quality |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101175064B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741620B (en) * | 2009-12-18 | 2012-11-28 | 南京大学 | Ontology rule description-based service quality grade verifying method |
| CN113612685B (en) * | 2018-06-29 | 2023-03-28 | 华为技术有限公司 | Network optimization method, system and network equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003043273A1 (en) * | 2001-11-16 | 2003-05-22 | Nortel Networks Limited | Scheduler with fairness control and quality of service support |
| CN1507756A (en) * | 2001-04-12 | 2004-06-23 | �����ɷ� | Method and apparatus for scheduling packet data transmissions in a wireless communication system |
| CN1551539A (en) * | 2003-05-20 | 2004-12-01 | Lg������ʽ���� | Forward channel schedule algorithm for HDR system |
| WO2005109792A1 (en) * | 2004-05-05 | 2005-11-17 | Qualcomm Incorporated | Method and apparatus for adaptive delay management in a wireless communication system |
-
2006
- 2006-12-18 CN CN2006101657800A patent/CN101175064B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1507756A (en) * | 2001-04-12 | 2004-06-23 | �����ɷ� | Method and apparatus for scheduling packet data transmissions in a wireless communication system |
| WO2003043273A1 (en) * | 2001-11-16 | 2003-05-22 | Nortel Networks Limited | Scheduler with fairness control and quality of service support |
| CN1613234A (en) * | 2001-11-16 | 2005-05-04 | 北方电讯网络有限公司 | Scheduler with fairness control and quality of service support |
| CN1551539A (en) * | 2003-05-20 | 2004-12-01 | Lg������ʽ���� | Forward channel schedule algorithm for HDR system |
| WO2005109792A1 (en) * | 2004-05-05 | 2005-11-17 | Qualcomm Incorporated | Method and apparatus for adaptive delay management in a wireless communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101175064A (en) | 2008-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Song et al. | Joint channel-aware and queue-aware data scheduling in multiple shared wireless channels | |
| CN101828361B (en) | Method and arrangement for scheduling data packets in a communication network system | |
| RU2364039C2 (en) | Access authorisation management and resource distribution in communication system maintaining service quality | |
| CN101390349B (en) | Distributed forward link schedulers for multi-carrier communication systems | |
| CN104301933B (en) | A kind of method for being used for computation bandwidth and distribution bandwidth in wireless self-networking | |
| CN100466505C (en) | Method and apparatus for realizing high-speed downlink packet dispatching | |
| JP5630443B2 (en) | BAND CONTROL DEVICE, BAND CONTROL METHOD, AND RADIO NETWORK SYSTEM | |
| CN101686196A (en) | Service scheduling method and service scheduling device | |
| CN103596224A (en) | Resource scheduling method based on multistage mapping in high-speed mobile environment | |
| CN101061681B (en) | Communication time fair transmission management without explicit traffic specifications for wireless networks | |
| WO2009074095A1 (en) | A method, system and apparatus for adjusting users' quality of service | |
| CN103327542B (en) | A kind of QoS support method and device that is applied to MANET network | |
| US20140362698A1 (en) | Methods and systems for adaptive buffer allocations in systems with adaptive resource allocation | |
| CN102724763A (en) | Time domain group scheduling method on basis of two-dimensional priority level | |
| CN101175064B (en) | Forwarding periodic line scheduling method based on service quality | |
| Johansson et al. | Performance of different scheduling strategies in a packet radio system | |
| Rhee et al. | A wireless fair scheduling algorithm for 1/spl times/EV-DO system | |
| KR100523996B1 (en) | Packet scheduling system and a packet scheduling method in a mobile communication system | |
| Saul | Wireless resource allocation with perceived quality fairness | |
| Belghith et al. | Pricing of differentiated-QoS services WiMAX networks | |
| CN102387597B (en) | Method for scheduling downlink data transmission | |
| RU2335085C1 (en) | Method for organisation and control of data burst transmission and device for its implementation | |
| CN101335935B (en) | Method for mobile terminal to select transmission format combination in 3rd generation mobile communication system | |
| KR101364569B1 (en) | Apparatus and method for opportunistic packet scheduling with frequency reuse and quality of service guarantee in wideband wireless access communication system based multi-hop relay | |
| CN100356748C (en) | Equalizing ring selecting method for elastic block ring flow |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120111 Termination date: 20151218 |
|
| EXPY | Termination of patent right or utility model |