CN100454892C - Schedling method of packet system - Google Patents

Schedling method of packet system Download PDF

Info

Publication number
CN100454892C
CN100454892C CNB2005100552686A CN200510055268A CN100454892C CN 100454892 C CN100454892 C CN 100454892C CN B2005100552686 A CNB2005100552686 A CN B2005100552686A CN 200510055268 A CN200510055268 A CN 200510055268A CN 100454892 C CN100454892 C CN 100454892C
Authority
CN
China
Prior art keywords
buffer memory
upper limit
service
transmissions
buffer area
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
Application number
CNB2005100552686A
Other languages
Chinese (zh)
Other versions
CN1835472A (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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CNB2005100552686A priority Critical patent/CN100454892C/en
Publication of CN1835472A publication Critical patent/CN1835472A/en
Application granted granted Critical
Publication of CN100454892C publication Critical patent/CN100454892C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention discloses a scheduling method of packet systems, which comprises the following steps that a base station system is switched on for operation, buffer memory upper limits of various data services are respectively calculated according to predetermined initial parameters; a base station judges whether or not a currently scanned time and a continuous transmission time of a user to transmit a relevant buffer memory area achieve the upper limit of the continuous transmission times starting from scheduling of each time; if the upper limit of the continuous transmission times is achieved, the continuous transmission time is arranged into zero; then, a scan is continuously carried out; otherwise, the base station continuously judges whether or not the buffer memory capacity of the buffer memory area exceeds the upper limit of buffer memory; if the buffer memory capacity of the buffer memory area exceeds the upper limit of buffer memory, code marks of the buffer memory area are placed in a preferable queue; otherwise, the code marks are placed in a spare queue; after the base station finishes the scan, the data of the buffer memory area with the highest weighting value in the preferable queue is transmitted; if the preferable queue is empty, the data of the buffer memory area with the highest buffer memory capacity and the highest weighting value in the spare queue is transmitted; meanwhile, the continuous transmission time of the buffer memory area is added by one. The scheduling method of packet systems not only can ensure that a system obtains high throughput, but also can enhance scheduling fairness.

Description

The dispatching method of grouping system
Technical field
The present invention relates to the communications field, especially relate to the data service dispatching method in a kind of grouping (Packet Switched is hereinafter to be referred as PS) system.
Background technology
In communication system, two types channel is arranged, a kind of is the channel corresponding with unique user, all only is user's service at any time; Another kind is the channel that a plurality of users share, and each user only exclusively enjoys channel resource in a period of time.So how rationally be the shared channel user resource allocation, this just relates to the problem of scheduling.
At present, some relatively more classical dispatching methods have been arranged, as fair throughput scheduling, the position that this dispatching method is not considered the user how, must provide identical throughput to all users, therefore the CU more resources of the user Yao Bigao C/I of low carrier/interface ratio (Carrier Interfere Ratio is hereinafter to be referred as C/I) (refer to take time or power), thus the throughput of sub-district integral body reduced.
Fair time scheduling is also referred to as the link coupling, distributes identical power and identical holding time between different user, and promptly all users obtain the resource of equivalent.At this moment, the user of cell boarder is lower than the resultant throughput of the user of close base station, so each quality of services for users (Quality of Service is hereinafter to be referred as QoS) is not fair fully distribution.Yet this dispatching method is compared with fair throughput method, and the cell throughout that it obtained increases, and this is that the user can be assigned to identical resource because of the C/I regardless of the user.
The C/I scheduling, under this dispatching algorithm, the user of the relatively lower C/I value of the user of higher C/I value has higher transmitted in packets priority.Because all channel resources will be distributed to the user of single best channel condition, the C/I scheduling is that cost reaches bigger power system capacity to sacrifice fairness.
More than three kinds of dispatching methods, fair throughput scheduling method can reach 100% justice, but the throughput of sub-district integral body is not too high; The equitable degree of fair time scheduling method descends to some extent, but throughput increases; The C/I scheduling method is very unfair, but whole throughput is very high.Therefore, can see that throughput and fairness exist certain contradiction each other.Reasonably dispatching method should be under the prerequisite that guarantees high-throughput, improves fairness as far as possible.
Chinese patent specification " horizontal sliding wheel changes packet scheduling control method and control device " (number of patent application: 01127114.0, patent announcement number: 1126333C, the day for announcing: on October 29th, 2003) disclose a kind of dispatching method, this invention utilizes transformation approach to realize equity dispatching, promptly in a cycle period, the chance that each user is scheduled is identical, the order of scheduling comes conversion according to the weight that each scheduling is calculated, also be equivalent to fair time scheduling in fact, can't obtain higher throughput.
Chinese patent specification " downlink data dispatching method under the wireless packet data transmission system " (number of patent application: 02110592.8, patent announcement number: 1184835C, the day for announcing: on January 12nd, 2005) also provide a kind of grouping scheduling method, this method is the qos parameter calculating priority valve according to the user, the user is divided into different set according to weights, the priority scheduling user of the highest C/I in the highest weight value set; All users in this set after the finishing scheduling, are being selected the user in time high set again.This invention is traded off on fairness and throughput, but the cycle of scheduling is longer, is equivalent to all users have been dispatched, and just carries out the scheduling of next round.Because it is sudden that non-real-time service all has usually, so the weight of first calculated can not truly reflect the situation that next sends the cycle, so just can not go out user's QoS demand by real embodiment.
Summary of the invention
The technical issues that need to address of the present invention provide a kind of dispatching method of grouping system, adopt this method the assurance system to obtain high throughput, and can also improve scheduling fairness, satisfy the QoS requirement of different user well.
In order to solve the problems of the technologies described above, the invention provides a kind of dispatching method of grouping system, comprise the steps:
(a) the base station system operation that powers on, the initial parameter of Various types of data business is set, each sends the continuous the number of transmissions of relevant buffer area with the user to construct preferred formation, alternative formation and initialization, and calculate the buffer memory upper limit of corresponding service respectively according to initial parameter, described initial parameter includes maximum traffic delay, buffer memory upper limit percentage and the number of transmissions upper limit continuously;
When (b) each scheduling begins, base station system scans all and sends relevant buffer area with the user, whether the continuous the number of transmissions of judging current scanning buffer area reaches the corresponding the number of transmissions upper limit continuously, if reach, then with the continuous the number of transmissions zero setting of this buffer area, continue the next buffer area of scanning, otherwise, base station system judges further whether the buffer memory capacity of this buffer area surpasses the corresponding buffer memory upper limit, if surpass, then the numbering in current cache district is put into preferred formation, otherwise the numbering in current cache district is put into alternative formation;
(c) after base station system has scanned all and the user has sent relevant buffer area, judge whether preferred formation is empty, if be not empty, the buffer area data that transmission weights is the highest, otherwise send the highest buffer area data of weights of the senior middle school of buffer memory capacity in the alternative formation, simultaneously the continuous the number of transmissions of the buffer area of this scheduling is added 1.
Further, the present invention also has following characteristics: the product that is limited to maximum traffic delay, shared channel bandwidth and the buffer memory upper limit percentage of this data service on the buffer memory of described data service.
Further, the present invention also has following characteristics: the weights of described buffer area determine that by the QoS parameter of professional assignment request QoS parameter comprises type of service and service priority.
Further, the present invention also has following characteristics: described data service comprises stream class, interactive class and background business, the maximum traffic delay of stream class service is according to the related protocol setting of 3G (Third Generation) Moblie partner plan, the maximum traffic delay of interaction service is set to 3～5 times of stream class service, and the maximum traffic delay of background business is set to 10～20 times of stream class service.
Further, the present invention also has following characteristics: the initial value of the buffer memory upper limit percentage of described different pieces of information business can be set to identical numerical value, and this buffer memory upper limit percentage can be adjusted according to user's number of retransmissions, when certain user's number of retransmissions is too much, base station system will reduce and this user-dependent buffer memory upper limit percentage, and upgrade the corresponding buffer memory upper limit.
Further, the present invention also has following characteristics: the continuous the number of transmissions upper limit of described different pieces of information business all is set to 1; Perhaps, the set initial value difference of the continuous the number of transmissions upper limit of described different pieces of information business, wherein the initial value of the continuous the number of transmissions upper limit of stream class service is greater than interaction service, the initial value of the continuous the number of transmissions upper limit of interaction service is greater than background business, and this continuous the number of transmissions upper limit can be adjusted according to the variation of Various types of data business proportion in total business.
Compared with prior art, the dispatching method of grouping system of the present invention has the following advantages:
A, when each scheduling, this method always selects the buffer area data of largest buffered capacity to send, made full use of the shared channel bandwidth, guarantee the high business throughput of sub-district, but also determine the buffer memory upper limit that each is professional according to qos parameters such as type of service, maximum traffic delay, fully satisfied quality of services for users.
B, this method also are provided with the continuous the number of transmissions upper limit of miscellaneous service, avoid small number of users to take resource in a large number, can dynamically adjust buffer memory upper limit percentage simultaneously, guarantee that paroxysmal data service can access rational management, thereby have improved scheduling fairness.
Description of drawings
Fig. 1 is that buffer queue is determined schematic flow sheet in the dispatching method of grouping system of the present invention;
Fig. 2 is the dispatching method packet scheduling schematic flow sheet of grouping system among the present invention.
Embodiment
For understanding the dispatching method of grouping system of the present invention in depth, the present invention is described in detail below in conjunction with drawings and the specific embodiments.
The dispatching method of grouping system of the present invention is mainly by definite buffer queue with carry out packet scheduling two parts and forms, buffer queue definite as shown in Figure 1, it comprises the steps:
The operation that powers on of step 101, base station system is provided with the initial parameter of Various types of data business, and described initial parameter includes maximum traffic delay, buffer memory upper limit percentage and the number of transmissions upper limit continuously; Each sends the continuous the number of transmissions of relevant buffer area with the user to construct preferred formation, alternative formation and initialization simultaneously, and calculates the buffer memory upper limit of corresponding service respectively according to initial parameter.
Sorting technique according to 3GPP (3G (Third Generation) Moblie partner plan) agreement, with various PS territory traffic differentiation is following a few class: stream, alternately, background, wherein the maximum traffic delay of regulation stream class service will be set with reference to the regulation of agreement, and interactive class, background classes does not have this parameter request, consider business characteristic, can set longerly relatively, for example the maximum traffic delay of interaction service is set to 3～5 times of stream class service, the maximum traffic delay of background business is set to 10～20 times of stream class service, the maximum traffic delay that is stream class service is set at 250 milliseconds, the maximum traffic delay of interaction service just is set at 1000 milliseconds, and the maximum traffic delay of background business is set at 4000 milliseconds.
Simultaneously in order to prevent that small number of users from taking resource all the time, and other user can not get scheduling, at all kinds of different business, the continuous the number of transmissions upper limit is set, if consider from throughput, it is best to be set to endless, but considers that from fairness 1 time best; The number of transmissions upper limit can be set a value earlier continuously, for example can all be set to 1, and perhaps the initial value of the continuous the number of transmissions upper limit of stream class service is made as 4, and interactive class is made as 3, and background classes is made as 2; In the actual schedule process, can also adjust according to the variation of throughput and Various types of data business proportion in total business, for example, all business all are background classes, because non-real-time service is sudden, the business that has data volume in certain period is very high, and other user service data amount is very low, so only allow continuous transmission primaries obviously just not too reasonable, consideration can be adjusted by step-length, and step-length just can be, also can be negative.
Buffer memory upper limit percentage is mainly used in and calculates the buffer memory upper limit, be limited to three's product of maximum traffic delay, shared channel bandwidth and the buffer memory upper limit percentage of this data service on the buffer memory of Various types of data business, wherein the initial setting of buffer memory upper limit percentage can be provided with respectively according to professional difference, for a value simply also can be set, as 80%; In addition, this buffer memory upper limit percentage also can be adjusted according to user's number of retransmissions, and when certain user's number of retransmissions is too much, base station system will reduce and this user-dependent buffer memory upper limit percentage, and recalculate the corresponding buffer memory upper limit.
Step 102, each scheduling arrive (i.e. during scheduling beginning) constantly, and base station system begins to scan each and sends relevant buffer area with the user.
Step 103, base station system judge whether the buffer area of current scanning is last buffer area, if not, and execution in step 104, otherwise execution in step 110.
Step 104 judges whether the continuous the number of transmissions of buffer area of current scanning reaches the corresponding the number of transmissions upper limit continuously, if reach execution in step 108, otherwise execution in step 105.
Step 105, base station system judge further whether the buffer memory capacity of this buffer area surpasses the corresponding buffer memory upper limit, if surpass execution in step 106, otherwise execution in step 107.
Step 106 is put into preferred formation with the numbering in current cache district, execution in step 109.
Step 107 is put into alternative formation with the numbering in current cache district, execution in step 109.
Step 108 is with the continuous the number of transmissions zero setting of this buffer area.
Step 109, base station system continue the next buffer area of scanning, return step 103.
Step 110 enters the packet scheduling flow process.
As shown in Figure 2, the packet scheduling flow process mainly is to determine the object of this scheduling in preferred formation and alternative formation, and it comprises the steps:
Step 201 judges whether preferred formation is empty, if empty, execution in step 203, otherwise execution in step 202.
Step 202 is selected the highest buffer area numbering of weights, execution in step 204 in preferred formation.
Buffer area the determining of corresponding weights, can comprehensively determine that this qos parameter comprises type of service, service priority etc. according to the qos parameter of professional assignment request.
Step 203, in alternative formation, select, at first carry out the one-level ordering according to the buffer memory capacity size with respectively numbering pairing buffer area in the standby formation, in identical the sorting according to the weights secondary that carries out just again of buffer memory capacity size, finally select the highest buffer area numbering of the big-and-middle weights of buffer memory capacity.
Step 204, with the data transmission of selected buffer area, the continuous the number of transmissions with this buffer area adds 1 simultaneously.
This finishing scheduling.
Grouping scheduling method of the present invention is simple, and logic is reasonable, efficient is high, preferentially sends the high data of buffer memory capacity, and the shared channel bandwidth is fully used, and has guaranteed the business throughput of sub-district.Consider the qos requirement of different business simultaneously, improved quality of services for users.

Claims (9)

1, a kind of dispatching method of grouping system is characterized in that, it comprises the steps:
(a) the base station system operation that powers on, the initial parameter of Various types of data business is set, each sends the continuous the number of transmissions of relevant buffer area with the user to construct preferred formation, alternative formation and initialization, and calculate the buffer memory upper limit of corresponding service respectively according to initial parameter, described initial parameter includes maximum traffic delay, buffer memory upper limit percentage and the number of transmissions upper limit continuously;
When (b) each scheduling begins, base station system scans all and sends relevant buffer area with the user, whether the continuous the number of transmissions of judging current scanning buffer area reaches the corresponding the number of transmissions upper limit continuously, if reach, then with the continuous the number of transmissions zero setting of this buffer area, continue the next buffer area of scanning, otherwise, base station system judges further whether the buffer memory capacity of this buffer area surpasses the corresponding buffer memory upper limit, if surpass, then the numbering in current cache district is put into preferred formation, otherwise the numbering in current cache district is put into alternative formation;
(c) after base station system has scanned all and the user has sent relevant buffer area, judge whether preferred formation is empty, if be not empty, the buffer area data that transmission weights is the highest, otherwise send the highest buffer area data of weights of the senior middle school of buffer memory capacity in the alternative formation, simultaneously the continuous the number of transmissions of the buffer area of this scheduling is added 1.
2, the dispatching method of grouping system according to claim 1 is characterized in that: the product that is limited to maximum traffic delay, shared channel bandwidth and the buffer memory upper limit percentage of this data service on the buffer memory of described data service.
3, the dispatching method of grouping system according to claim 2 is characterized in that: the weights of described buffer area are determined by the QoS parameter of professional assignment request.
4, the dispatching method of grouping system according to claim 3 is characterized in that: described QoS parameter comprises type of service and service priority.
5, the dispatching method of grouping system according to claim 4, it is characterized in that: described data service comprises stream class, interactive class and background business, the maximum traffic delay of stream class service is planned the related protocol setting according to the 3G (Third Generation) Moblie partner, the maximum traffic delay of interaction service is set to 3～5 times of stream class service, and the maximum traffic delay of background business is set to 10～20 times of stream class service.
6, the dispatching method of grouping system according to claim 5 is characterized in that: the initial value of the buffer memory upper limit percentage of described different pieces of information business is set to identical numerical value.
7, the dispatching method of grouping system according to claim 6 is characterized in that: the continuous the number of transmissions upper limit of described different pieces of information business all is set to 1.
8, the dispatching method of grouping system according to claim 6, it is characterized in that: the set initial value difference of the continuous the number of transmissions upper limit of described different pieces of information business, wherein the initial value of the continuous the number of transmissions upper limit of stream class service is greater than interaction service, and the initial value of the continuous the number of transmissions upper limit of interaction service is greater than background business.
9, the dispatching method of grouping system according to claim 8 is characterized in that: the continuous the number of transmissions upper limit of described different pieces of information business is adjusted according to the variation of Various types of data business proportion in total business.
CNB2005100552686A 2005-03-17 2005-03-17 Schedling method of packet system Expired - Fee Related CN100454892C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2005100552686A CN100454892C (en) 2005-03-17 2005-03-17 Schedling method of packet system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2005100552686A CN100454892C (en) 2005-03-17 2005-03-17 Schedling method of packet system

Publications (2)

Publication Number Publication Date
CN1835472A CN1835472A (en) 2006-09-20
CN100454892C true CN100454892C (en) 2009-01-21

Family

ID=37003082

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2005100552686A Expired - Fee Related CN100454892C (en) 2005-03-17 2005-03-17 Schedling method of packet system

Country Status (1)

Country Link
CN (1) CN100454892C (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101340612B (en) * 2007-07-04 2011-07-13 中兴通讯股份有限公司 Packet scheduling method for logic channel of radio communication system
CN101198093B (en) * 2007-12-25 2010-07-14 中兴通讯股份有限公司 Control method for dynamic regulating forward service flux
CN101715235B (en) * 2008-10-08 2012-06-06 中兴通讯股份有限公司 Method for allocating resources and scheduling downlink of LTE FDD system
CN105451336B (en) * 2014-07-04 2019-02-01 京信通信系统（中国）有限公司 A kind of grouped data scheduling method and device

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1336747A (en) * 2001-08-17 2002-02-20 中国人民解放军理工大学通信工程学院 Smoothly turning and grouping scheduling control method and arrangement
CN1434643A (en) * 2002-01-21 2003-08-06 华为技术有限公司 Down data scheduling method for wireless grouping data transmission system
WO2003071740A1 (en) * 2002-02-22 2003-08-28 Linkair Communications, Inc. A method of priority control in wireless packet data communications
CN1564608A (en) * 2004-03-15 2005-01-12 中兴通讯股份有限公司 Forward scheduling method of mobile communication system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1336747A (en) * 2001-08-17 2002-02-20 中国人民解放军理工大学通信工程学院 Smoothly turning and grouping scheduling control method and arrangement
CN1434643A (en) * 2002-01-21 2003-08-06 华为技术有限公司 Down data scheduling method for wireless grouping data transmission system
WO2003071740A1 (en) * 2002-02-22 2003-08-28 Linkair Communications, Inc. A method of priority control in wireless packet data communications
CN1564608A (en) * 2004-03-15 2005-01-12 中兴通讯股份有限公司 Forward scheduling method of mobile communication system

Also Published As

Publication number Publication date
CN1835472A (en) 2006-09-20

Similar Documents

Publication Publication Date Title
JP4510826B2 (en) Method for scheduling uplink transmission of user equipment and base station
CN102868971B (en) Mobile communication system and communication control method
CN100566295C (en) A kind of Packet Service scheduling method for wireless resource based on service quality guarantee
CN1853386B (en) Virtually centralized uplink scheduling
CN100555983C (en) Data flow con-trol of coordinating among the UMTS and buffer are shared
CN1868227B (en) Signaling method, system, base station and mobile station
CN100385963C (en) Two threshold uplink rate control to enable uplink scheduling
CN101053275B (en) A system, arrangements and method allowing for balancing of load between two groups of dedicated uplink channels
CN1653718B (en) Radio resource management for a high speed shared channel
CN101790895B (en) Cellular communication system, apparatus and method for management of backhaul resources
CN100431362C (en) Packet service scheduling method in mobile communication system
EP1517576A2 (en) Apparatus and method for allocating channels in a wireless communication system
CN101043638B (en) Base station dispatcher, resource distribution module and dispatch control method for HSUPA
CN1980480B (en) Apparatus and method for call admission control
CN1868233B (en) Capacity scheduling method and system
RU2007114888A (en) SERVICE QUALITY PLANNING (QOS) FOR TRANSMISSIONS IN THE RISING LINK ON DIVIDED CHANNELS
CN1973497A (en) Packet transmission control device and packet transmission control method
CN101099311A (en) Wireless communication system
CN101523831A (en) Scheduling method and system for hsupa
CN104469957A (en) LTE system base station device downlink resource distribution method and device
CN100454892C (en) Schedling method of packet system
CN104602355B (en) mixed service dispatching method in LTE system
CN101494908B (en) Method for scheduling customer equipment data and packet scheduling device
CN100440871C (en) Packet scheduling method and device for wireless communication system
CN101730243B (en) Centralized resource scheduling method and device

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: 20090121

Termination date: 20150317

EXPY Termination of patent right or utility model