CN104918333A - Scheduling method for Non-GBR service - Google Patents
Scheduling method for Non-GBR service Download PDFInfo
- Publication number
- CN104918333A CN104918333A CN201410091575.9A CN201410091575A CN104918333A CN 104918333 A CN104918333 A CN 104918333A CN 201410091575 A CN201410091575 A CN 201410091575A CN 104918333 A CN104918333 A CN 104918333A
- Authority
- CN
- China
- Prior art keywords
- business
- priority
- gbr
- rate
- gbr 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.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a scheduling method for a Non-GBR service. When the Non-GBR service is built, according to the type of the Non-GBR service, the lowest satisfactory rate of the Non-GBR service is set; the average service rate of all to-be-scheduled services is calculated, whether the average service rate is larger than the lowest satisfactory rate of the Non-GBR service is judged, if yes, first priority algorithm is used for calculating the priority of the Non-GBR services, or otherwise, second priority algorithm is used for calculating the priority of the Non-GBR services; and according to the order of the priority from high to low, resource allocation is sequentially carried out on all to-be-scheduled services. Through applying the technical scheme of the invention, on the basis of ensuring each Non-GBR service in different channel conditions to obtain certain service, balance between the system throughput and user fairness can be ensured as much as possible.
Description
Technical field
The application relates to wireless communication technology field, particularly relates to a kind of dispatching method for Non-GBR business.
Background technology
In LTE system, the basic granularity that service quality (QoS) controls is radio bearer, namely all data flow in same bearer ensure obtaining identical QoS (as scheduling strategy, buffering queue management, link layer configuration etc.), different QoS ensures needs dissimilar Evolved Packet System (EPS) carrying to provide.
According to the difference of QoS, radio bearer can be divided into two large classes: ensure bit rate (GBR) and non-guaranteed bit rate (Non-GBR).So-called GBR, refer to that the bit rate of load bearing requirements is distributed consistently by network " forever ", even if when Internet resources anxiety, corresponding bit rate also can keep.Maximum bit rate (MBR) parameter defines under GBR is carried on the condition of resource abundance, the rate-limit that can reach.The value of MBR is likely more than or equal to the value of GBR.Contrary, Non-GBR refers to when network congestion, and business (or carrying) needs the requirement of bearing changing down, because Non-GBR carrying does not need to take fixing Internet resources, thus can set up for a long time.And GBR carrying is generally just just set up when needed.
In Access Network, the QoS of upper carrying of eating dishes without rice or wine is controlled by base station (eNodeB), and each carrying has corresponding qos parameter service quality rating to indicate (QCI) and distributes reserved priority (ARP).
QCI is applied to GBR and Non-GBR carrying simultaneously.A QCI is a value, and comprise the indexs such as priority, packet delay and acceptable Packet Error Ratio, each QCI is associated with a priority, and priority 1 is the highest priority level.The value of the QCI of radio bearer determines its processing policy at eNB.
Define the value of nine kinds of different QCI in standard, what interface transmitted is the value of QCI instead of the QoS attribute of its correspondence.By the standardization to QCI, can the different producer of specification for the understanding of corresponding QoS business and process, convenient interconnection and interflow in multi-vendor interconnection environment and roaming environments between distinct device/system.
In current LTE system scheduling mechanism, because Non-GBR business itself is not to the requirement of speed, usually adopt the dispatching algorithm dispatching servicess such as poll, max carrier to interference, Proportional Fair.Poll and max carrier to interference all do not consider the characteristic of business itself, and just inquiry or foundation channel condition are dispatched successively.And for Proportional-Fair algorithm, exactly because Non-GBR business does not have rate requirement, so Proportional-Fair algorithm cannot be used to carry out calculating priority level.Therefore, common dispatching algorithm cannot ensure that each Non-GBR business all can obtain required QoS service.
Summary of the invention
This application provides a kind of dispatching method for Non-GBR business, under guarantee different channels condition, each Non-GBR business obtains on the basis of certain service, maximizes the balance ensureing throughput of system and user fairness as far as possible.
A kind of dispatching method for Non-GBR business that the embodiment of the present application provides, comprising:
A, when Non-GBR business is set up, according to the type of this Non-GBR business, set the minimum satisfactory rate of this Non-GBR business;
B, add up the business Mean Speed of all Non-GBR business to be scheduled, judge whether described business Mean Speed is greater than the minimum satisfactory rate of this Non-GBR business, if, the priority of this Non-GBR business is calculated with the first priority algorithm, otherwise, the priority of this Non-GBR business is calculated with the second priority algorithm; Adopt in all Non-GBR business of the first priority algorithm, business Mean Speed is directly proportional to channel condition to the ratio of the minimum satisfactory rate of this corresponding class Non-GBR business; Adopt in all Non-GBR business of the second priority algorithm, the priority of the Non-GBR business that business Mean Speed is lower is higher;
C, according to priority order from high to low, carry out Resourse Distribute successively to there being Non-GBR business to be scheduled.
Preferably, described minimum satisfactory rate is that this Non-GBR type of service is in the most not good enough desired speed in edge.
Preferably, the computing formula of described first priority algorithm is:
wherein, priority is the priority of this Non-GBR business; Rate_ave is that statistics obtains business Mean Speed; CQI_Index is the current channel quality index of this business, and span is (0,15); SBR is minimum satisfactory rate.
Preferably, the computing formula of described second priority algorithm is:
Wherein, priority is the priority of this Non-GBR business; Rate_ave is that statistics obtains business Mean Speed; SBR is minimum satisfactory rate; N is the Priority Base ensureing that Mean Speed sets higher than the priority reaching SBR business lower than the priority of SBR business, span (16,1000).
Preferably, described N equals 100.
As can be seen from the above technical solutions, for dissimilar Non-GBR traffic differentiation satisfaction, to being satisfied with business, dissatisfied business adopts different priority computational methods, the priority of dissatisfied business is made to reduce along with Mean Speed and raise, thus the business making Mean Speed lower is preferentially dispatched, and the business that is satisfied with adopts the Proportional Fair dispatching algorithm improved, thus maximize the balance ensureing throughput of system and user fairness.
Accompanying drawing explanation
The dispatching method flow chart for Non-GBR business that Fig. 1 provides for the embodiment of the present application.
Embodiment
This application provides a kind of dispatching method for Non-GBR business, the design philosophy of the method is: for dissimilar Non-GBR traffic differentiation satisfaction, and to being satisfied with business, dissatisfied business adopts different priority computational methods.Specifically, for the Non-GBR type of service of different QoS requirements defines minimum satisfactory rate, the Non-GBR business of different QoS requirements type has different minimum satisfactory rate; When computing service priority, obtain the Mean Speed of each business according to statistics, for the business of Mean Speed lower than the minimum satisfactory rate of Non-GBR business, the service priority that Mean Speed is lower is higher, is preferentially dispatched; For the business of Mean Speed higher than the minimum satisfactory rate of Non-GBR business, then adopt the Proportional Fair dispatching algorithm of improvement, business Mean Speed is directly proportional, to maximize the balance ensureing throughput of system and user fairness to channel condition to the ratio of the minimum satisfactory rate of this corresponding class Non-GBR business.
For making the know-why of technical scheme, feature and technique effect clearly, below in conjunction with specific embodiment, technical scheme is described in detail.
The dispatching method flow process for Non-GBR business that the embodiment of the present application provides as shown in Figure 1, comprises the steps:
Step 101: when Non-GBR business is set up, is in the minimum satisfactory rate (SBR, atisfied Bit Rate) of the most not good enough desired this business of rate setting in edge according to different types of service.
For reaching present techniques object, requiring that dissimilar Non-GBR business has different minimum satisfactory rate, but the concrete mode arranging minimum satisfactory rate is not construed as limiting.What the embodiment of the present application proposed arranges minimum satisfactory rate be only example, not in order to limit the application's scheme according to being in the most not good enough desired speed in edge.
Step 102: the priority calculating each Non-GBR business.
For the business of Rate_ave<=SBR, be defined as dissatisfied business, priority is:
For the business of Rate_ave>SBR, be defined as the business of satisfaction, priority computing formula is:
Wherein:
Priority is the priority of this business;
Rate_ave is that statistics obtains business Mean Speed;
CQI_Index is the current channel quality index of this business, for defining in LTE protocol, and span
For (0,15);
N is the Priority Base ensureing that Mean Speed sets higher than the priority reaching SBR business lower than the priority of SBR business, recommendation 100, span (16,1000).
For being satisfied with in the computing formula of business, molecular moiety also can be deformed into other parameters associated with channel quality, such as: map the channel quality parameter obtained according to CQI_Index, the data meeting certain proportion or requirement can be designed to, can reach and the speed of the business of different channels quality is controlled.
Step 103: according to priority order from high to low, carries out Resourse Distribute successively to there being Non-GBR business to be scheduled.
The foregoing is only the preferred embodiment of the application; not in order to limit the protection range of the application; within all spirit in technical scheme and principle, any amendment made, equivalent replacements, improvement etc., all should be included within scope that the application protects.
Claims (5)
1. for a dispatching method for Non-GBR business, it is characterized in that, comprising:
A, when Non-GBR business is set up, according to the type of this Non-GBR business, set the minimum satisfactory rate of this Non-GBR business;
B, add up the business Mean Speed of all Non-GBR business to be scheduled, judge whether described business Mean Speed is greater than the minimum satisfactory rate of this Non-GBR business, if, the priority of this Non-GBR business is calculated with the first priority algorithm, otherwise, the priority of this Non-GBR business is calculated with the second priority algorithm; Adopt in all Non-GBR business of the first priority algorithm, business Mean Speed is directly proportional to channel condition to the ratio of the minimum satisfactory rate of this corresponding class Non-GBR business; Adopt in all Non-GBR business of the second priority algorithm, the priority of the Non-GBR business that business Mean Speed is lower is higher;
C, according to priority order from high to low, carry out Resourse Distribute successively to there being Non-GBR business to be scheduled.
2. method according to claim 1, is characterized in that, described minimum satisfactory rate is that this Non-GBR type of service is in the most not good enough desired speed in edge.
3. method according to claim 1, is characterized in that, the computing formula of described first priority algorithm is:
wherein, priority is the priority of this Non-GBR business; Rate_ave is that statistics obtains business Mean Speed; CQI_Index is the current channel quality index of this business, and span is (0,15); SBR is minimum satisfactory rate.
4. method according to claim 1, is characterized in that, the computing formula of described second priority algorithm is:
Wherein, priority is the priority of this Non-GBR business; Rate_ave is that statistics obtains business Mean Speed; SBR is minimum satisfactory rate; N is the Priority Base ensureing that Mean Speed sets higher than the priority reaching SBR business lower than the priority of SBR business, span (16,1000).
5. method according to claim 4, is characterized in that, described N equals 100.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410091575.9A CN104918333B (en) | 2014-03-13 | 2014-03-13 | A kind of dispatching method for Non-GBR business |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410091575.9A CN104918333B (en) | 2014-03-13 | 2014-03-13 | A kind of dispatching method for Non-GBR business |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104918333A true CN104918333A (en) | 2015-09-16 |
CN104918333B CN104918333B (en) | 2019-02-05 |
Family
ID=54086921
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410091575.9A Expired - Fee Related CN104918333B (en) | 2014-03-13 | 2014-03-13 | A kind of dispatching method for Non-GBR business |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104918333B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108023836A (en) * | 2017-10-31 | 2018-05-11 | 上海华为技术有限公司 | A kind of resource allocation methods and access network equipment |
CN109982390A (en) * | 2017-12-28 | 2019-07-05 | ***通信集团湖北有限公司 | Customer service support method, device, equipment and medium |
CN111629435A (en) * | 2019-02-27 | 2020-09-04 | 大唐移动通信设备有限公司 | Service scheduling method and device |
CN112261694A (en) * | 2020-09-29 | 2021-01-22 | 上海擎昆信息科技有限公司 | Method and device for reserving resources |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6950399B1 (en) * | 2000-07-06 | 2005-09-27 | Matsushita Electric Industrial Co., Ltd. | System and associated method for scheduling transport of variable bit-rate data over a network |
CN1996794A (en) * | 2006-06-21 | 2007-07-11 | 华为技术有限公司 | Uplink scheduling method for the media access control layer in the broadband code division multi-address system |
CN101610551A (en) * | 2008-06-20 | 2009-12-23 | 普天信息技术研究院有限公司 | The resource regulating method of a kind of HSUPA |
CN101686497A (en) * | 2008-09-24 | 2010-03-31 | 华为技术有限公司 | Cell load equalization method, and cell load evaluation method and device |
-
2014
- 2014-03-13 CN CN201410091575.9A patent/CN104918333B/en not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6950399B1 (en) * | 2000-07-06 | 2005-09-27 | Matsushita Electric Industrial Co., Ltd. | System and associated method for scheduling transport of variable bit-rate data over a network |
CN1996794A (en) * | 2006-06-21 | 2007-07-11 | 华为技术有限公司 | Uplink scheduling method for the media access control layer in the broadband code division multi-address system |
CN101610551A (en) * | 2008-06-20 | 2009-12-23 | 普天信息技术研究院有限公司 | The resource regulating method of a kind of HSUPA |
CN101686497A (en) * | 2008-09-24 | 2010-03-31 | 华为技术有限公司 | Cell load equalization method, and cell load evaluation method and device |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108023836A (en) * | 2017-10-31 | 2018-05-11 | 上海华为技术有限公司 | A kind of resource allocation methods and access network equipment |
CN108023836B (en) * | 2017-10-31 | 2022-03-11 | 上海华为技术有限公司 | Resource allocation method and access network equipment |
CN109982390A (en) * | 2017-12-28 | 2019-07-05 | ***通信集团湖北有限公司 | Customer service support method, device, equipment and medium |
CN109982390B (en) * | 2017-12-28 | 2022-10-04 | ***通信集团湖北有限公司 | User service guarantee method, device, equipment and medium |
CN111629435A (en) * | 2019-02-27 | 2020-09-04 | 大唐移动通信设备有限公司 | Service scheduling method and device |
CN112261694A (en) * | 2020-09-29 | 2021-01-22 | 上海擎昆信息科技有限公司 | Method and device for reserving resources |
Also Published As
Publication number | Publication date |
---|---|
CN104918333B (en) | 2019-02-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10834614B2 (en) | Quality of service in wireless backhauls | |
CN106716955B (en) | System and method for the transfer management in software defined network | |
JP4819907B2 (en) | Flow-based fair scheduling in multihop wireless networks | |
CN102037688B (en) | For dividing division entity and the method for capacity | |
US9717016B2 (en) | Method for ensuring uplink quality of service, base station and user equipment | |
US9374807B2 (en) | Uplink transmission scheduling for wireless communication networks | |
CN103428870B (en) | Method and device for determining priority of access service | |
EP2862387B1 (en) | Node and method for resource booking for admission control and scheduling using drx | |
US8289852B2 (en) | Setting token bucket parameters for scheduling of air-interface resources | |
US20150271087A1 (en) | Evolved node-b and mobility management entity and user equipment and methods for supporting attended and unattended services | |
CN107113851A (en) | The method and apparatus for selecting upstream data | |
Jang et al. | QoS-constrained resource allocation scheduling for LTE network | |
CN104619034B (en) | Towards the grouping scheduling method of real time business in a kind of LTE communication system | |
CN104918333A (en) | Scheduling method for Non-GBR service | |
Rezende et al. | An adaptive network slicing for LTE radio access networks | |
US8995259B2 (en) | Systems and methods for resource booking for admission control and scheduling using DRX | |
WO2015131611A1 (en) | Method and device for scheduling service of quality of service classification identifier (qci) | |
CN105391746A (en) | Central control equipment for nested network and resource allocation method thereof | |
Cai et al. | QoS-guaranteed radio resource scheduling in 5G V2X heterogeneous systems | |
Mansouri et al. | Radio resource management for heterogeneous wireless networks: Schemes and simulation analysis | |
CN102970757B (en) | Long-term evolution (LTE) downlink filling resource distribution method based on real-time service | |
Astudillo et al. | LTE time-domain uplink scheduler for QoS provisioning | |
CN104581968B (en) | A method of dispatching non-guaranteed bit rate traffic | |
WO2012048542A1 (en) | Group schedule method and device | |
CN104272683A (en) | Dynamic profiling for transport networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190205 |