CN103501542A - Self adoption proportion fairness method - Google Patents
Self adoption proportion fairness method Download PDFInfo
- Publication number
- CN103501542A CN103501542A CN201310453735.5A CN201310453735A CN103501542A CN 103501542 A CN103501542 A CN 103501542A CN 201310453735 A CN201310453735 A CN 201310453735A CN 103501542 A CN103501542 A CN 103501542A
- Authority
- CN
- China
- Prior art keywords
- chained list
- scheduling
- pong
- ping
- ready
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a self adoption proportion fairness method in an LTE (long term evolution) system in the mobile communication field. According to the method, free CPU (central processing unit) resources are utilized for completing the calculating and sequencing work of dispatching values, and the proportion fairness of N (N is variable) TTIs (transmission time intervals, 1ms) is reached. Compared with the traditional proportion fairness method, the self adoption proportion fairness method has the advantages that the proportion fairness time granularity is variable, the method is applicable to various user quantities, when the user quantity is smaller, the proportion fairness of each TTI can be reached, when the user quantity is great, the proportion fairness of several TTIs can be reached, and the time delay and the business service quality requirement can be possibly ensured.
Description
?
Technical field
The present invention relates to, in moving communicating field LTE system, relate to a kind of method of self adaptation equitable proportion.
Background technology
Along with the LTE technology is constantly ripe, the commercialization paces are accelerated gradually, and the mainstream carrier also progressively improves the requirement of base station equipment, and particularly single contained fan capacity, require excited users more than 400.Just very high to the requirement of scheduler in this case.The equitable proportion method is taken into account the user and is dispatched fairness and throughput of system, is widely adopted.The equitable proportion method is according to user's instantaneous spectrum efficiency, and average spectral efficiency (ase) and QOS calculate the scheduling value, and then the priority according to the scheduling value is sorted, and scheduler carries out the resource distribution according to priority; Traditional equitable proportion method be take each TTI(1ms usually) reach equitable proportion as time granularity, due to instantaneous spectrum efficiency, average spectral efficiency (ase), QOS may can change at each TTI, so need each TTI to upgrade scheduling value and sequence chained list, use for scheduler.Common design is all that the calculating of scheduling value and sequence are operated in scheduler and complete, in the situation that little customer volume, scheduler can also normally be finished the work, in the situation that large user's amount, each logic channel is carried out the calculating of scheduling value and sorts needing to consume the plenty of time, can cause scheduler can't complete normal operation, thereby cause system exception.In the 3GPP agreement, stipulate, the time span of a subframe is 1ms, and MAC can not surpass 1ms to the scheduling of a subframe, and this regulation requires high to the handling property of LTE base station.When customer volume is large, can dispatch because scheduler is overtime abnormal.
Summary of the invention
The present invention is a kind of method of self adaptation equitable proportion, in the situation that do not affect the scheduler normal operation, take full advantage of calculating and sequence work that cpu resource completes the scheduling value, realize that equitable proportion, with the adjustment of excited user number self adaptation, has overcome the bottleneck of original technology.
For solving above technical problem, technical solution of the present invention is:
A kind of method of self adaptation equitable proportion, is characterized in that, based on definition ping-pong chained list, described ping-pong chained list comprises ping chained list and pong chained list, comprises following steps:
The scheduling step of being carried out by scheduler: scheduler replaces scheduling by ping chained list and pong chained list, according to chained list type and the ready state of upper TTI scheduling, judges whether to carry out replacing and whether needing the insertion of the logic channel after scheduling chained list afterbody of chained list; Then the qos information of scheduling is saved in another chained list contrary with the chained list of current scheduling;
The scheduling value treatment step of being carried out by the scheduler handle device: activate the scheduling value of UE logic channel in community and sorted by dispatching priority, and the logic channel sorted is inserted in the current chained list of not dispatched of scheduler, and this chained list is replaced by ready state;
Described scheduling step and scheduling value Processing tasks be at same CPU core, and task priority is lower than the scheduling step, and each TTI always dispatches step and preferentially moves, and scheduling value treatment step is to utilize the scheduling step to move remaining time.
In the method for above-mentioned a kind of self adaptation equitable proportion, the scheduling step that described scheduler is carried out specifically comprises following sub-step:
Step 201: start the scheduler task, then process random access, retransmit;
Step 202: enter the DRB scheduling and judge whether switching scheduling chained list according to the chained list type of upper TTI scheduling:
Determining step 1: if upper TTI scheduling is the ping chained list, judge that whether the pong chained list is ready; And according to the whether ready execution step 2031 of pong chained list;
Determining step 2: if upper TTI scheduling is the pong chained list, judge that whether the ping chained list is ready; And according to the whether ready execution step 2032 of ping chained list;
Step 2031: if the pong chained list is offhand ready, continue to use the ping chained list, the logic channel after scheduling is inserted to the chained list afterbody, and the qos information of scheduling is saved in to the pong chained list; If the pong chained list is ready, use the pong chained list, juxtaposition ping chained list is not-ready state, and the qos information of scheduling is deposited to the ping chained list; Then perform step 204;
Step 2032: if the ping chained list is offhand ready, continue to use the pong chained list, the logic channel after scheduling is inserted to the chained list afterbody, and will dispatch qos information and be saved in the ping chained list; If the ping chained list is ready, use the ping chained list, juxtaposition pong chained list is ready state, and the qos information of scheduling is saved in to the pong chained list; Then perform step 204;
Step 204: dispatched according to the scheduling chained list of selecting, carry out the resource distribution.
Step 205: the large message of interface of assembling MAC layer and physical layer;
Step 206: the scheduler task finishes.
In the method for above-mentioned a kind of self adaptation equitable proportion, the scheduling value treatment step that described scheduler handle device is carried out comprises following sub-step:
Step 301: start scheduling value Processing tasks; Then find in the ping-pong chained list and be set to not ready chained list;
Step 302: travel through all UE logic channels, all logic channels are carried out to the scheduling value and upgrade calculating, and the logic channel calculated is sorted;
Step 303: the logic channel sorted is added to not ready chained list, the chained list sorted is put and is masked as ready state simultaneously; For next TTI scheduling,
Step 304: scheduling value Processing tasks finishes.
Therefore, beneficial features of the present invention is as follows: the time granularity of equitable proportion method can adaptive change, can accomplish 1 TTI equitable proportion when customer volume is little, when customer volume is larger, can accomplish N TTI equitable proportion, and N is variable.
The accompanying drawing explanation
Fig. 1 is scheduler mission flow diagram of the present invention.
Fig. 2 is scheduling value Processing tasks flow chart of the present invention.
Fig. 3 is whole method flow schematic diagram of the present invention.
Embodiment
Below by embodiment, by reference to the accompanying drawings the present invention is described in further detail.
Thinking of the present invention is after utilizing finishing scheduling, and the time of CPU free time completes all logic channel scheduling values and calculates and sequence work.
The concrete enforcement flow process that can see figures.1.and.2 comprises the following steps:
Step 201: start the scheduler task, then process random access, retransmit;
Step 202: enter the DRB scheduling and judge whether switching scheduling chained list according to the chained list type of upper TTI scheduling:
Determining step 1: if upper TTI scheduling is the ping chained list, judge that whether the pong chained list is ready; And according to the whether ready execution step 2031 of pong chained list;
Determining step 2: if upper TTI scheduling is the pong chained list, judge that whether the ping chained list is ready; And according to the whether ready execution step 2032 of ping chained list;
Step 2031: if the pong chained list is offhand ready, continue to use the ping chained list, the logic channel after scheduling is inserted to the chained list afterbody, and the qos information of scheduling is saved in to the pong chained list; If the pong chained list is ready, use the pong chained list, juxtaposition ping chained list is not-ready state, and the qos information of scheduling is deposited to the ping chained list; Then perform step 204;
Step 2032: if the ping chained list is offhand ready, continue to use the pong chained list, the logic channel after scheduling is inserted to the chained list afterbody, and will dispatch qos information and be saved in the ping chained list; If the ping chained list is ready, use the ping chained list, juxtaposition pong chained list is ready state, and the qos information of scheduling is saved in to the pong chained list; Then perform step 204;
Step 204: dispatched according to the scheduling chained list of selecting, carry out the resource distribution.
Step 205: assembling MAC layer and the large message of physical layer interface;
Step 206: the scheduler task finishes.
After the scheduler task finishes, scheduling value Processing tasks starts to start:
Step 301: start scheduling value Processing tasks; Then find in the ping-pong chained list and be set to not ready chained list;
Step 302: travel through all UE logic channels, all logic channels are carried out to the scheduling value and upgrade calculating, and the logic channel calculated is sorted;
Step 303: the logic channel sorted is added to not ready chained list, the chained list sorted is put and is masked as ready state simultaneously; For next TTI scheduling,
Step 304: scheduling value Processing tasks finishes.
Instance analysis:
Access 100 UE, each UE allocating default load is beaten the ftp flow amount simultaneously, after scheduler starts, handle random access, after re-transmission etc., entering the DRB scheduling, if what a upper TTI was used is the ping chained list, judge that whether the pong chained list is ready, vice versa; If the pong chained list is ready, select the pong chained list to be dispatched, juxtaposition ping chained list is not-ready state, the logic channel after scheduling is inserted into to the end of pong chained list, and the qos information of scheduling is saved in to the ping chained list, for scheduling value Processing tasks; If the pong chained list is offhand ready, continue to use the ping chained list to be dispatched, the logic channel after scheduling is inserted into to ping chained list end, and the qos information of scheduling is saved in to the pong chained list, for scheduling value Processing tasks.If what a upper TTI was used is the pong chained list, judge that whether the ping chained list is ready, vice versa; If the ping chained list is ready, select the ping chained list to be dispatched, juxtaposition pong chained list is not-ready state, the logic channel after scheduling is inserted into to the end of ping chained list, and the qos information of scheduling is saved in to the pong chained list, for scheduling value Processing tasks; If the ping chained list is offhand ready, continue to use the pong chained list to be dispatched, the logic channel after scheduling is inserted into to pong chained list end, and the qos information of scheduling is saved in to the ping chained list, for scheduling value Processing tasks; After logic channel has been dispatched, distribute the RB resource, continue to process other affairs of scheduler.After the scheduler task is handled, scheduling value Processing tasks starts to take cpu resource, travel through all logic channels under all UE, carrying out the renewal of scheduling value calculates, sorted according to scheduling value priority, and added not ready scheduling chained list, after having added, putting this not ready chained list is ready state, for next TTI scheduling.
From above instance analysis, can find out, when 100UE does business, the calculating of 100 logic channels and sequence work may complete at 1 TTI, are exactly the equitable proportion of 1 TTI so; If scheduler is consuming time more, when the residue cpu resource can not calculate the scheduling value in a TTI, after next TTI arrives, scheduler can take CPU, and this is that scheduling value Processing tasks can convert ready state to, the waiting for CPU resource, continuing to carry out when again obtaining task, if can complete in 2 TTI, is the equitable proportion of 2 TTI, advantage of the present invention realizes the adaptive equitable proportion algorithm of a kind of time granularity exactly, than the equitable proportion of a fix N TTI, has superiority.
Above content is in conjunction with concrete execution mode further description made for the present invention, can not assert that specific embodiment of the invention is confined to these explanations.For the general technical staff of the technical field of the invention, without departing from the inventive concept of the premise, can also make some simple deduction or replace, all should be considered as belonging to protection scope of the present invention.
Claims (3)
1. the method for a self adaptation equitable proportion, is characterized in that, based on definition ping-pong chained list, described ping-pong chained list comprises ping chained list and pong chained list, comprises following steps:
The scheduling step of being carried out by scheduler: scheduler replaces scheduling by ping chained list and pong chained list, according to chained list type and the ready state of upper TTI scheduling, judges whether to carry out replacing and whether needing the insertion of the logic channel after scheduling chained list afterbody of chained list; Then the qos information of scheduling is saved in another chained list contrary with the chained list of current scheduling;
The scheduling value treatment step of being carried out by the scheduler handle device: activate the scheduling value of UE logic channel in community and sorted by dispatching priority, and the logic channel sorted is inserted in the current chained list of not dispatched of scheduler, and this chained list is replaced by ready state;
Described scheduling step and scheduling value Processing tasks be at same CPU core, and task priority is lower than the scheduling step, and each TTI always dispatches step and preferentially moves, and scheduling value treatment step is to utilize the scheduling step to move remaining time.
2. the method for a kind of self adaptation equitable proportion according to claim 1 is characterized in that: the scheduling step that described scheduler is carried out specifically comprises following sub-step:
Step 201: start the scheduler task, then process random access, retransmit;
Step 202: enter the DRB scheduling and judge whether switching scheduling chained list according to the chained list type of upper TTI scheduling:
Determining step 1: if upper TTI scheduling is the ping chained list, judge that whether the pong chained list is ready; And according to the whether ready execution step 2031 of pong chained list;
Determining step 2: if upper TTI scheduling is the pong chained list, judge that whether the ping chained list is ready; And according to the whether ready execution step 2032 of ping chained list;
Step 2031: if the pong chained list is offhand ready, continue to use the ping chained list, the logic channel after scheduling is inserted to the chained list afterbody, and the qos information of scheduling is saved in to the pong chained list; If the pong chained list is ready, use the pong chained list, juxtaposition ping chained list is not-ready state, and the qos information of scheduling is deposited to the ping chained list; Then perform step 204;
Step 2032: if the ping chained list is offhand ready, continue to use the pong chained list, the logic channel after scheduling is inserted to the chained list afterbody, and will dispatch qos information and be saved in the ping chained list; If the ping chained list is ready, use the ping chained list, juxtaposition pong chained list is ready state, and the qos information of scheduling is saved in to the pong chained list; Then perform step 204;
Step 204: dispatched according to the scheduling chained list of selecting, carry out the resource distribution;
Step 205: the large message of interface of assembling MAC layer and physical layer;
Step 206: the scheduler task finishes.
3. the method for a kind of self adaptation equitable proportion according to claim 1 is characterized in that: the scheduling value treatment step that described scheduler handle device is carried out comprises following sub-step:
Step 301: start scheduling value Processing tasks; Then find in the ping-pong chained list and be set to not ready chained list;
Step 302: travel through all UE logic channels, all logic channels are carried out to the scheduling value and upgrade calculating, and the logic channel calculated is sorted;
Step 303: the logic channel sorted is added to not ready chained list, the chained list sorted is put and is masked as ready state simultaneously; For next TTI scheduling,
Step 304: scheduling value Processing tasks finishes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310453735.5A CN103501542B (en) | 2013-09-29 | 2013-09-29 | A kind of method of self adaptation equitable proportion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310453735.5A CN103501542B (en) | 2013-09-29 | 2013-09-29 | A kind of method of self adaptation equitable proportion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103501542A true CN103501542A (en) | 2014-01-08 |
| CN103501542B CN103501542B (en) | 2016-08-10 |
Family
ID=49866691
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310453735.5A Active CN103501542B (en) | 2013-09-29 | 2013-09-29 | A kind of method of self adaptation equitable proportion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103501542B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104796238A (en) * | 2015-04-28 | 2015-07-22 | 电子科技大学 | Retransmission resource allocation method based on adaptive HARQ (hybrid automatic repeat request) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101034923A (en) * | 2006-03-07 | 2007-09-12 | 松下电器产业株式会社 | Packet scheduling method and system for multi-antenna radio communication system |
| CN102196587A (en) * | 2011-03-10 | 2011-09-21 | 东南大学 | Wireless-resource-dispatching method during multi-cell cooperation in relay-aided communication system |
| EP2627140A1 (en) * | 2012-02-09 | 2013-08-14 | Alcatel Lucent | A method for scheduling of radio resources to user terminals of different network operators, and a base station therefor |
-
2013
- 2013-09-29 CN CN201310453735.5A patent/CN103501542B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101034923A (en) * | 2006-03-07 | 2007-09-12 | 松下电器产业株式会社 | Packet scheduling method and system for multi-antenna radio communication system |
| CN102196587A (en) * | 2011-03-10 | 2011-09-21 | 东南大学 | Wireless-resource-dispatching method during multi-cell cooperation in relay-aided communication system |
| EP2627140A1 (en) * | 2012-02-09 | 2013-08-14 | Alcatel Lucent | A method for scheduling of radio resources to user terminals of different network operators, and a base station therefor |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104796238A (en) * | 2015-04-28 | 2015-07-22 | 电子科技大学 | Retransmission resource allocation method based on adaptive HARQ (hybrid automatic repeat request) |
| CN104796238B (en) * | 2015-04-28 | 2018-09-04 | 电子科技大学 | A kind of retransmission resource distribution method based on adaptive HARQ |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103501542B (en) | 2016-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106961741B (en) | A kind of uplink resource allocating method and device | |
| US8514703B2 (en) | Scheduling of logical channels in a wireless communication system | |
| CN102037688A (en) | Partitioning entity and method for partitioning capacity | |
| CN106998590B (en) | Uplink resource scheduling method and device | |
| CN104469957B (en) | LTE system base station equipment descending resource allocation method and device | |
| CN103931262B (en) | A kind of data dispatching method and equipment | |
| CN101540716B (en) | Service quality-based method and service quality-based device for scheduling non-guaranteed bit rate service | |
| CN102065552A (en) | Method and device for reporting BSR (Buffer Status Report) | |
| CN103428870A (en) | Method and device for determining priority of access service | |
| CN106358295A (en) | Resource distribution method and device | |
| CN102404862B (en) | Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system | |
| CN101494908B (en) | Method for scheduling customer equipment data and packet scheduling device | |
| CN106598727A (en) | Computation resource distribution method and system for communication system | |
| EP1653683B1 (en) | Dynamic setting of transmission scheduler algorithms | |
| CN102186248B (en) | Scheduling method and device used for interference coordination | |
| CN101827446A (en) | Radio bearer scheduling method and device | |
| WO2018099395A1 (en) | Resource scheduling method, apparatus, and system | |
| CN105934970B (en) | Distribution method and distributor, the terminal of network data channels | |
| CN108347315B (en) | Multi-sub-band service scheduling method in electric power wireless private network | |
| CN103501542A (en) | Self adoption proportion fairness method | |
| CN104754753A (en) | Air interface resource control method in cluster system and base station equipment | |
| CN104768228B (en) | Downlink dynamic dispatching resource allocation methods, device and the base station of VOLTE business | |
| CN102202410A (en) | Multi-user and multi-service scheduling method and device of wireless communication network | |
| CN108882383A (en) | A kind of uplink surplus resources distribution method and base station based on modulation and encoding scheme | |
| CN107211445B (en) | Predictive downlink scheduling |
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 | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 430074, No. 88, postal academy road, Hongshan District, Hubei, Wuhan Patentee after: Wuhan post and Telecommunications Science Research Institute Co., Ltd. Address before: 430074, No. 88, postal academy road, Hongshan District, Hubei, Wuhan Patentee before: Wuhan Inst. of Post & Telecom Science |