CN101111070B - Fair resource scheduling method based on resource scheduling in broadband wireless access system - Google Patents

Fair resource scheduling method based on resource scheduling in broadband wireless access system Download PDF

Info

Publication number
CN101111070B
CN101111070B CN2006101124399A CN200610112439A CN101111070B CN 101111070 B CN101111070 B CN 101111070B CN 2006101124399 A CN2006101124399 A CN 2006101124399A CN 200610112439 A CN200610112439 A CN 200610112439A CN 101111070 B CN101111070 B CN 101111070B
Authority
CN
China
Prior art keywords
bandwidth
service
res
business
services
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
CN2006101124399A
Other languages
Chinese (zh)
Other versions
CN101111070A (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.)
Tsinghua University
Original Assignee
Tsinghua University
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 Tsinghua University filed Critical Tsinghua University
Priority to CN2006101124399A priority Critical patent/CN101111070B/en
Publication of CN101111070A publication Critical patent/CN101111070A/en
Application granted granted Critical
Publication of CN101111070B publication Critical patent/CN101111070B/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 relates to the resource dispatch of a broadband wireless access system based on an IEEE802.16, the present invention is characterized in that the reserved bandwidth required by mutual necessity is calculated according to the Qos parameter of the different business, the admission and control is performed to the newly achieved business according to the reserved bandwidth, and the bandwidth is distributed by the means of a secondary dispatching mode according to bandwidth required by each business and the bandwidth required by a system, the reserved bandwidth is distributed according to each business firstly, the secondary dispatch is performed to the insufficient part of the bandwidth required by the means of the weighted recycle transfer method according to the residual bandwidth after a primary dispatch is performed to the system, the secondary dispatch distributes the different priority factors among the different businesses according to the business priority, meanwhile, the distribution performed according to the actual scale of the bandwidth required by the business residue accounting for the bandwidth required by residue also shall be taken into account. The present invention has the advantage of the equity, the high efficiency, the simplicity and the flexibility on the basis of ensuring the Qos quality.

Description

宽带无线接入系统中基于资源调度的公平性资源调度方法 Fair resource scheduling method based on resource scheduling in broadband wireless access system

技术领域technical field

本发明设计一种IEEE 802.16宽带无线接入(BWA)系统中资源调度的方法,属于无线通信技术领域。The invention designs a resource scheduling method in an IEEE 802.16 broadband wireless access (BWA) system, and belongs to the technical field of wireless communication.

背景技术Background technique

IEEE 802.16标准是无线城域网的空中接口规范,在未来的宽带无线接入中有着十分重要的意义和广阔的应用前景。802.16标准不但允许非视距连接、支持大容量用户,而且可以提供电信级的QoS保证,全面支持语音、视频、数据等丰富的多媒体业务的应用。The IEEE 802.16 standard is the air interface specification of the wireless metropolitan area network, which has very important significance and broad application prospects in the future broadband wireless access. The 802.16 standard not only allows non-line-of-sight connections and supports large-capacity users, but also provides carrier-level QoS guarantees and fully supports the application of rich multimedia services such as voice, video, and data.

有效的QoS保证体系必须对无线资源进行合理分配,尤其是针对无线通信环境下的复杂环境,无线接入系统的QoS体系面临很多挑战。802.16标准在MAC层实施了一系列的机制。资源调度算法是宽带无线接入系统QoS保证体系中不可缺少的一环。而802.16标准仅仅提出由基站或用户根据各业务的QoS请求和优先级进行资源调度,没有规定具体的资源调度算法。而现有的资源调度算法都没有考虑算法的公平性问题,在高优先级业务负载很重的情况下,容易造成低优先级业务长时间得不到带宽而“饿死”。本算法通过采用一定的平衡机制,在首先保证各业务服务质量的前提下对资源进行合理分配,从而改善算法的公平性。An effective QoS guarantee system must allocate wireless resources reasonably, especially for the complex environment of wireless communication environment, the QoS system of the wireless access system faces many challenges. The 802.16 standard implements a series of mechanisms at the MAC layer. The resource scheduling algorithm is an indispensable link in the QoS guarantee system of the broadband wireless access system. However, the 802.16 standard only proposes that the base station or the user perform resource scheduling according to the QoS request and priority of each service, without specifying a specific resource scheduling algorithm. However, the existing resource scheduling algorithms do not consider the fairness of the algorithm. When the high-priority business load is heavy, it is easy to cause the low-priority business to "starve to death" without bandwidth for a long time. This algorithm uses a certain balance mechanism to allocate resources reasonably on the premise of first ensuring the service quality of each business, so as to improve the fairness of the algorithm.

IEEE 802.16系统有四种不同服务等级的业务,分别是非申请授予业务(unsolicitedgrant service,UGS)、实时轮询业务(real-time polling service,rtPS)、非实时轮询业务(non-real-time polling service,nrtPS)、尽力而为的业务(best effort service,BE)。The IEEE 802.16 system has four different service levels of services, namely unsolicited grant service (unsolicited grant service, UGS), real-time polling service (real-time polling service, rtPS), non-real-time polling service (non-real-time polling service, nrtPS), best effort service (best effort service, BE).

现有的资源调度算法是基于严格优先级的调度算法,其具体的实现流程如下:The existing resource scheduling algorithm is a scheduling algorithm based on strict priority, and its specific implementation process is as follows:

一级调度算法:在各个不同优先级种类的业务之间,采用SPQ(strict priority queue:严格优先级队列)策略,先满足优先级高的业务的带宽请求,在带宽还有剩余的情况下再依次满足低优先级业务的带宽请求;First-level scheduling algorithm: among services of different priority types, the SPQ (strict priority queue: strict priority queue) strategy is adopted to satisfy the bandwidth requests of high-priority services first, and then when there is remaining bandwidth. Satisfy the bandwidth requests of low-priority services in turn;

二级调度算法:在同一优先级种类的业务之间,根据业务的特点采用不同的带宽分配策略:对于rtPS业务,采用EDF(earliest deadline first)策略;对于nrtPS业务,采用WFQ(weightedfair queue)策略;对于BE业务,采用RR(round robin)策略或均分带宽策略。Two-level scheduling algorithm: between services of the same priority type, different bandwidth allocation strategies are adopted according to the characteristics of the services: for rtPS services, the EDF (earliest deadline first) strategy is adopted; for nrtPS services, the WFQ (weighted fair queue) strategy is adopted ; For BE business, adopt RR (round robin) strategy or equal bandwidth strategy.

由于第一级调度使用SPQ策略,在高优先级业务负载很重的情况下,容易造成高优先级业务过多的占用低优先级业务资源,从而使低优先级业务得不到必要的带宽而出现“饿死”的情况,无法满足低优先级业务的服务质量要求,对低优先级业务来说失去公平性;Because the first-level scheduling uses the SPQ policy, when high-priority services are heavily loaded, it is easy to cause high-priority services to occupy too many resources of low-priority services, so that low-priority services cannot obtain the necessary bandwidth. In the case of "starving to death", it cannot meet the service quality requirements of low-priority services, and loses fairness for low-priority services;

资源预留,就是系统在业务接入时预留一部分资源(如带宽、缓冲区或处理器能力等等)来保证业务的Qos需求。基于资源预留的思想,在业务接入时,就为预留它一部分带宽,并对剩余的带宽按一定的算法在各业务之间实施灵活而公平的分配,这样既可以有效的保证业务的QoS需求,又实现了各业务之间带宽分配的公平性。Resource reservation means that the system reserves a part of resources (such as bandwidth, buffer or processor capacity, etc.) during service access to ensure the QoS requirements of the service. Based on the idea of resource reservation, when a service is accessed, a part of its bandwidth is reserved, and the remaining bandwidth is flexibly and fairly allocated among various services according to a certain algorithm, so that the service can be effectively guaranteed. The QoS requirement also realizes the fairness of bandwidth allocation among various services.

发明内容:Invention content:

本发明的目的是提出一种应用在IEEE 802.16宽带无线接入系统中的基于资源预留的公平性资源调度算法,可以在保证各业务服务质量的前提下减少高优先级业务过多占用低优先级业务带宽的情况,改善公平性,获得更好的系统性能。The purpose of the present invention is to propose a fair resource scheduling algorithm based on resource reservation applied in the IEEE 802.16 broadband wireless access system, which can reduce the excessive occupation of high-priority services and low-priority services on the premise of ensuring the service quality of each business. In the case of high-level service bandwidth, fairness is improved and better system performance is obtained.

本发明的特性在于,依次会有以下步骤:The characteristic of the present invention is that following steps are arranged successively:

步骤(1),当新业务到来后,该基于IEEE802.16宽带无线接入系统的基站根据不同业务的QoS参数,计算为满足不同的QoS参数的预留带宽,设为rres,其中包括已建立连接预留的带宽和新建立连接所需的预留带宽。若∑rres≤rtotal,则允许接入,否则,拒绝接入,rtotal为系统总带宽;Step (1), when a new service arrives, the base station based on the IEEE802.16 broadband wireless access system calculates the reserved bandwidth satisfying different QoS parameters according to the QoS parameters of different services, which is set to r res , which includes the The bandwidth reserved for establishing a connection and the reserved bandwidth required for a newly established connection. If ∑r res ≤ r total , access is allowed, otherwise, access is denied, and r total is the total bandwidth of the system;

对于非申请授予业务,rres=rmax,rmax为最大输入数据率,设定值;For non-application grant services, r res = r max , where r max is the maximum input data rate, a set value;

对尽力而为的业务,rres=0;For best-effort traffic, r res = 0;

对于实时轮询业务, r res = r max + r min 2 P 0 e - λ ( t - T S ) , For real-time polling services, r res = r max + r min 2 P 0 e - λ ( t - T S ) ,

其中,rmin为最小输入数据率,设定值;Among them, r min is the minimum input data rate, the set value;

P0为丢包率门限,设定值;P 0 is the packet loss rate threshold, a set value;

λ为实施轮询业务的包的到达率,已知值;λ is the arrival rate of packets implementing the polling service, a known value;

为最大时延,TS为一帧的时间,均为设定值;is the maximum delay, and T S is the time of one frame, both of which are set values;

对于非实时轮询业务,rres=rminFor non-real-time polling service, r res = r min ;

步骤(2),基站根据IEEE802.16规定的媒体访问控制层机制,周期性的根据各业务所要求的带宽和系统已有带宽要下达方式对系统带宽进行分配,并把分配结果在下行子帧的媒体访问控制信息UL-MAP中通知各用户站:Step (2), the base station allocates the system bandwidth periodically according to the bandwidth required by each service and the existing bandwidth of the system according to the media access control layer mechanism stipulated in IEEE802.16, and sends the allocation result in the downlink subframe Each user station is notified in the media access control information UL-MAP:

第一步:一级调度Step 1: Level 1 Scheduling

先把系统预留带宽满足优先级从高到低的业务的带宽请求,若业务所要求的带宽rreq小于预留带宽,则使一级调度的带宽rallo_1=rreq,否则使rallo_1=rres,所述优先级最高的业务是指非申请授予业务,其余依次为实时轮询、非实时轮询以及尽力而为业务;First, the reserved bandwidth of the system is used to meet the bandwidth requests of services with priority from high to low. If the bandwidth r req required by the service is smaller than the reserved bandwidth, then the bandwidth r allo_1 of the first-level scheduling = r req , otherwise, r allo_1 = r res , the business with the highest priority refers to non-application grant business, and the rest are real-time polling, non-real-time polling and best-effort business;

第二步:二级调度Step Two: Secondary Scheduling

再把一级调度之后的剩余带宽按加权循环转移法分配给各个业务,各业务的权重因子为:ki=λi·diThen allocate the remaining bandwidth after the first-level scheduling to each service according to the weighted cyclic transfer method, and the weight factor of each service is: k ii ·d i ;

其中,λi为各业务剩余要求带宽占总剩余要求带宽的比例:即 &lambda; i = ( r req , i - r res , i ) / &Sigma; j = 1 n ( r req , j - r res , j ) , 若rreq,i<rres,i,令rreq,i-rres,i=0;Among them, λi is the ratio of the remaining required bandwidth of each service to the total remaining required bandwidth: namely &lambda; i = ( r req , i - r res , i ) / &Sigma; j = 1 no ( r req , j - r res , j ) , If r req, i < r res, i , let r req, i - r res, i = 0;

j=1,2,...,n,为要求分配剩余带宽的业务数,j=1, 2,..., n, is the number of services requiring allocation of remaining bandwidth,

di为优先级因子,设定值,实时业务的优先级因子应大于非实时业务的优先级因子,对于各非实时业务应设定不同的优先级因子;d i is a priority factor, set value, the priority factor of real-time business should be greater than the priority factor of non-real-time business, should set different priority factors for each non-real-time business;

二级调度所得到的带宽为:rallo_2=(rtotal-∑rallo_1)·ki/∑kiThe bandwidth obtained by the second-level scheduling is: r allo_2 = (r total -∑r allo_1 ) · k i /∑ k i ,

经过两级分配,各业务获得的带宽为rallo=rallo_1+rallo_2After two-level allocation, the bandwidth obtained by each service is r allo =r allo_1 +r allo_2 .

这种基于资源预留的调度方法有以下优点:This scheduling method based on resource reservation has the following advantages:

1.QoS保证:接纳控制和一级调度中的分配预留带宽的策略,使业务的QoS参数能得到保证;1. QoS guarantee: the strategy of allocating reserved bandwidth in admission control and first-level scheduling, so that the QoS parameters of the service can be guaranteed;

2.公平性:二级调度中采用加权循环转移WRR算法,提高了调度的公平性;2. Fairness: The WRR algorithm is adopted in the second-level scheduling to improve the fairness of scheduling;

3.效率:由于计算rtPS业务的预留带宽rres时,将rtPS业务的时延要求也考虑进去,而不是以最大数据输入率rmax作为判断标准,因此在保证QoS的条件下,减少了带宽的浪费,可以接入更多的业务,从而提高了带宽利用率;3. Efficiency: When calculating the reserved bandwidth r res of the rtPS service, the time delay requirement of the rtPS service is also taken into account instead of the maximum data input rate r max as the judgment standard, so under the condition of guaranteeing QoS, it reduces The waste of bandwidth allows access to more services, thereby improving bandwidth utilization;

4.简单性:与赤字公平优先级队列DFPQ等算法相比,这种算法更直观,无论理解还是操作都更简单;4. Simplicity: Compared with algorithms such as deficit fair priority queue DFPQ, this algorithm is more intuitive, and it is easier to understand and operate;

5.灵活性:可对不同的业务根据负载等情况设定不同的WRR算法中的优先级因子,这体现了算法的灵活性。5. Flexibility: Different priority factors in the WRR algorithm can be set for different services according to the load and other conditions, which reflects the flexibility of the algorithm.

附图说明Description of drawings

图1.IEEE 802.16系统的QoS保证体系;Figure 1. QoS guarantee system of IEEE 802.16 system;

图2.现有资源调度算法流程图;Figure 2. The flow chart of the existing resource scheduling algorithm;

图3.本发明提出的资源调度算法流程图;Fig. 3. The flow chart of the resource scheduling algorithm proposed by the present invention;

图4.rtPS业务增长时各业务获得带宽的变化图;Figure 4. Changes in the bandwidth obtained by each service when the rtPS service grows;

图5.nrtPS业务增长时各业务获得带宽的变化图;Figure 5. Changes in the bandwidth obtained by each service when the nrtPS service grows;

图6.采用本发明前后的公平性指数对比图。Fig. 6. Comparison chart of fairness index before and after adopting the present invention.

具体实施方式Detailed ways

为实现本发明要解决的技术问题,本发明采用一种引入资源预留思想并与接纳控制算法相结合的资源调度算法,包括如下步骤:In order to realize the technical problem to be solved by the present invention, the present invention adopts a resource scheduling algorithm that introduces the idea of resource reservation and combines it with an admission control algorithm, including the following steps:

(1)在每个业务申请接入时,用户站SS向基站BS报告业务所要求的QoS参数,BS根据这些参数确定业务所需的预留带宽,若已接入业务的预留带宽总和加上申请接入业务的预留带宽之和小于系统总的带宽,则允许业务接入,否则拒绝接入;(1) When applying for access to each service, the subscriber station SS reports the QoS parameters required by the service to the base station BS, and the BS determines the reserved bandwidth required by the service according to these parameters. If the sum of the reserved bandwidth of the online application for access service is less than the total bandwidth of the system, the service access is allowed, otherwise the access is refused;

(2)BS在每一帧开始前对系统带宽进行动态分配,分配方法是:(2) The BS dynamically allocates the system bandwidth before the start of each frame, and the allocation method is:

一级调度:先给各个业务分配预留带宽,从而使各业务的服务质量得到保证;First-level scheduling: allocate reserved bandwidth to each business first, so that the service quality of each business is guaranteed;

二级调度:对系统剩余带宽按WRR算法在各业务间进行分配,WRR的权重因子由业务所要求带宽以及业务本身的特性决定;Second-level scheduling: The remaining bandwidth of the system is allocated among various services according to the WRR algorithm, and the weight factor of WRR is determined by the bandwidth required by the service and the characteristics of the service itself;

下面对本发明的具体实施方式作进一步的描述。Specific embodiments of the present invention will be further described below.

图3给出了新算法的流程图,具体说明如下:Figure 3 shows the flow chart of the new algorithm, which is described in detail as follows:

(1)新业务到来后,首先根据业务的QoS参数,计算业务的预留带宽(1) After the arrival of a new service, first calculate the reserved bandwidth of the service according to the QoS parameters of the service

我们的算法是:当一个业务要求建立连接时,BS根据它的QoS参数,计算为满足这些参数的预留带宽,设为rres,若所有为已建立连接预留的带宽加上新连接所需的预留带宽之和小于总带宽rtotal,即∑rres≤rtotal,则允许接入。rres的计算如下:Our algorithm is: when a service requires to establish a connection, the BS calculates the reserved bandwidth to meet these parameters according to its QoS parameters, and set it as r res , if all the bandwidth reserved for the established connection plus the bandwidth for the new connection If the sum of the required reserved bandwidth is less than the total bandwidth r total , that is, ∑r res ≤ r total , access is allowed. r res is calculated as follows:

1.对于UGS业务,由于所有QoS参数均需满足,因而rres=rmax1. For UGS services, since all QoS parameters need to be satisfied, r res = r max ;

2.对于rtPS业务,rres应为介于rmin和rmax之间的一个值,当BS提供给此业务rres的带宽时,可使此业务的时延和丢包率满足要求;可通过一定的数学方法计算出来,也可跟根据实际系统进行测量;2. For the rtPS service, r res should be a value between r min and r max . When the BS provides the bandwidth of this service r res , the delay and packet loss rate of this service can meet the requirements; Calculated by a certain mathematical method, it can also be measured according to the actual system;

3.对于nrtPS业务,由于没有时延要求,rres=rmin3. For nrtPS services, since there is no delay requirement, r res = r min ;

4.对于BE业务,由于没有任何Qos要求,rres=0;4. For the BE service, since there is no Qos requirement, r res =0;

(2)根据IEEE 802.16系统规定的MAC层机制,BS将周期性的根据各业务所要求的带宽和系统已有带宽对系统带宽进行分配,并将分配结果在下行子帧的MAC控制信息UL_MAP中通知各个SS;(2) According to the MAC layer mechanism specified in the IEEE 802.16 system, the BS will periodically allocate the system bandwidth according to the bandwidth required by each service and the existing bandwidth of the system, and record the allocation result in the MAC control information UL_MAP of the downlink subframe Notify each SS;

带宽分配方法是:The bandwidth allocation method is:

a.一级调度:a. First-level scheduling:

先将预留带宽按优先级从高到低的顺序分配给各个业务,但若业务所要求的带宽rreq小于预留带宽rres,则只需要分配预留带宽rres;即若rreq<rres,则一级调度得到的带宽rallo_1=rreq;否则rallo_1=rresFirst allocate the reserved bandwidth to each business in order of priority from high to low, but if the bandwidth r req required by the business is less than the reserved bandwidth r res , then only the reserved bandwidth r res needs to be allocated; that is, if r req < r res , then the bandwidth r allo_1 = r req obtained by level one scheduling; otherwise r allo_1 = r res ;

b.二级调度:b. Secondary scheduling:

将一级调度之后的剩余带宽按WRR算法分配给各个业务;Allocate the remaining bandwidth after the first-level scheduling to each service according to the WRR algorithm;

各业务的权重因子为:The weighting factors for each business are:

ki=λi·dik ii · d i ;

其中,λi为各业务剩余要求带宽占总剩余要求带宽的比例:即 &lambda; i = ( r req , i - r res , i ) / &Sigma; j = 1 n ( r req , j - r res , j ) (若rreq,i<rres,i,令rreq,i-rres,i=0;rreq,i和rres,i分别表示第i个业务的所要求的带宽和预留带宽;rreq,j和rres,j分别表示第j个业务的所要求的带宽和预留带宽)Among them, λi is the ratio of the remaining required bandwidth of each service to the total remaining required bandwidth: namely &lambda; i = ( r req , i - r res , i ) / &Sigma; j = 1 no ( r req , j - r res , j ) (If r req, i <r res, i , let r req, i -r res, i = 0; r req, i and r res, i respectively represent the required bandwidth and reserved bandwidth of the i-th business; r req, j and r res, j represent the required bandwidth and reserved bandwidth of the jth business respectively)

di为优先级因子,具体值可根据系统实际各业务流的业务量多少来决定,同时应满足以下两条原则:d i is the priority factor, the specific value can be determined according to the actual business volume of each business flow in the system, and the following two principles should be met at the same time:

1.实时业务的优先级因子应大于非实时业务的优先级因子,以减少因时延超过QoS要求而丢包的概率;1. The priority factor of real-time services should be greater than that of non-real-time services to reduce the probability of packet loss due to delay exceeding QoS requirements;

2.对于非实时业务,也可以对不同业务设定不同的优先级因子,以保证优先级高的业务获得更大的带宽。2. For non-real-time services, different priority factors can also be set for different services, so as to ensure that services with high priority can obtain greater bandwidth.

二级调度得到的带宽为:rallo_2=(rtotal-∑rallo_1)·ki/∑ki The bandwidth obtained by the second-level scheduling is: r allo_2 = (r total -∑r allo_1 )·k i /∑k i

于是,经过两级分配,各业务获得的带宽为:rallo,i=rallo_1,i+rallo_2,i,其中rallo_1,i为第i个业务通过一级调度得到的带宽,rallo_2,i为第i个业务通过二级调度得到的带宽。Therefore, after two-level allocation, the bandwidth obtained by each service is: r allo, i = r allo_1, i + r allo_2, i , where r allo_1, i is the bandwidth obtained by the i-th service through one-level scheduling, r allo_2, i is the bandwidth obtained by the i-th service through two-level scheduling.

为了对比本发明实施前后的效果,对本发明的算法进行了仿真,仿真参数如下:总带宽B=10Mbps,帧长tf=10msIn order to compare the effects before and after the implementation of the present invention, the algorithm of the present invention has been simulated, and the simulation parameters are as follows: total bandwidth B=10Mbps, frame length t f =10ms

  业务类型 business type   平均带宽average bandwidth   最大带宽Maximum bandwidth   最小带宽Minimum bandwidth   预留带宽Reserved bandwidth   UGSUGS   \\   1.6Mbps1.6Mbps   \\   1.6Mbps1.6Mbps   rtPSrtPS   4.3Mbps4.3Mbps   5.2Mbps5.2Mbps   3.4Mbps3.4Mbps   4Mbps4Mbps   nrtPSnrtPS   2.8Mbps2.8Mbps   3.6Mbps3.6Mbps   2Mbps2Mbps   2Mbps2Mbps   BEBE   \\   \\   1.6Mbps1.6Mbps   00

图4表示了在rtPS业务量增大的情况下各业务流所得到带宽的情况。在这里,我们把原有算法称为SPQ(严格优先级队列算法),把新算法称为RFPQ(预留式公平优先级队列算法)。由图可知,当总业务量不超过系统总带宽时,两种分配方案所得到的结果一样;当rtPS业务量达到一定程度时,采用现有算法,rtPS业务将挤占BE业务的带宽,造成BE业务线性减少,以致最后达不到QoS要求;而在本发明中,rtPS业务所获得的带宽不再线性增加,其增长趋势变缓;而nrtPS和BE业务的带宽则缓慢减少。与现有算法相比,三种业务的带宽分配趋向均衡,这样即便rtPS业务的流量很重,系统也可以在保证QoS的前提下容纳更多的低优先级业务。Fig. 4 has shown the condition of the bandwidth obtained by each service flow under the condition that the rtPS service volume increases. Here, we call the original algorithm SPQ (Strict Priority Queue Algorithm), and the new algorithm RFPQ (Reserved Fair Priority Queue Algorithm). It can be seen from the figure that when the total traffic volume does not exceed the total system bandwidth, the results obtained by the two allocation schemes are the same; when the rtPS traffic volume reaches a certain level, using the existing algorithm, the rtPS business will occupy the bandwidth of the BE business, resulting in BE The business decreases linearly, so that the QoS requirement cannot be met in the end; and in the present invention, the bandwidth obtained by the rtPS service no longer increases linearly, and its growth trend slows down; while the bandwidth of the nrtPS and BE services decreases slowly. Compared with the existing algorithm, the bandwidth allocation of the three services tends to be balanced, so that even if the traffic of the rtPS service is heavy, the system can accommodate more low-priority services under the premise of ensuring QoS.

图4表示了在nrtPS业务量增大的情况下各业务流所得到带宽的情况。由图可知,采用现有算法,nrtPS业务的增多不会对rtPS业务造成影响,而会使BE业务大幅下降;采用本算法,nrtPS业务量增大时,rtPS所获得的带宽会有小幅下降,但在可接受的范围之内,不会降低业务的服务质量保证;BE业务的带宽下降趋势相对于现有算法明显减缓,这说明本算法可使低优先级业务得到一定的照顾。Fig. 4 has shown the situation of the bandwidth obtained by each business flow under the condition that the nrtPS business volume increases. It can be seen from the figure that using the existing algorithm, the increase of nrtPS services will not affect the rtPS services, but will cause a significant drop in BE services; using this algorithm, when the nrtPS traffic increases, the bandwidth obtained by rtPS will decrease slightly, However, within an acceptable range, the service quality assurance of the business will not be reduced; the bandwidth decline trend of the BE business is significantly slowed down compared with the existing algorithm, which shows that this algorithm can take care of low-priority services to a certain extent.

图5表示了在rtPS业务量增大的情况下公平性指标的变化。公平性指标参照文献,定义为各业务带宽满足度的均方差:Figure 5 shows the change of the fairness index when the rtPS traffic increases. Referring to the literature, the fairness index is defined as the mean square error of the bandwidth satisfaction of each service:

fairnessfairness == (( SS UGSUGS -- SS &OverBar;&OverBar; )) 22 ++ (( SS rtPSrtPS -- SS &OverBar;&OverBar; )) 22 ++ (( SS nrtPSwxya -- SS &OverBar;&OverBar; )) 22 ++ (( SS BEBE -- SS &OverBar;&OverBar; )) 22

其中,S=rallo/rreq,为业务的带宽满足度;S=(SUGS+SrtPS+SnrtPS+SBE)/4各业务带宽满足度的均值;由图可知,采用现有算法,可有效降低各业务带宽满足度的均方差,使各业务获得的带宽趋向一致,从而提高资源调度算法对各业务的公平性。Among them, S=r allo /r req is the bandwidth satisfaction degree of the service; S=(S UGS +S rtPS +S nrtPS +S BE )/4 the average value of the bandwidth satisfaction degree of each service; it can be seen from the figure that the existing algorithm is adopted , which can effectively reduce the mean square error of the bandwidth satisfaction degree of each service, and make the bandwidth obtained by each service tend to be consistent, thereby improving the fairness of the resource scheduling algorithm for each service.

rtPS业务预留带宽计算方法如下:The method for calculating the reserved bandwidth for rtPS services is as follows:

首先我们建立一个近似的数学模型。从最保守的情况考虑,假定系统每帧分配给某个rtPS业务的带宽均为rres,设数据输入率为rin,rmin≤rin≤rmax,数据输出率为rres,rtPS业务数据包到达是泊松过程,到达率为λ,则在一段时间[t0,t0+t]内到达的字节数为 X ( t ) = &Sigma; i = 1 N ( t ) l i , 其中N(t)为[t0,t0+t]内到达的包的个数,li为包的长度。由于li独立同分布,且与N(t)统计独立,因此X(t)是一个复合泊松过程,设li的母函数为F(S),泊松过程{N(t)}的母函数为G(S),G(S)=eλt[S-1],其中t为时间参数,S为拉普拉斯算子,则:X(t)的母函数为G(F(S))=eλt[F(S)-1],由此可得到X(t)的期望和方差:E(X(t))=λtE(li),D(X(t))=λtE(li 2);当t足够大时,N(t)也足够大,由于li独立同分布,由大数定理,X(t)服从正态分布:X(t)~N(λtE(li),λtE(li 2))。平均数据率 r in ( t ) = X ( t ) t , 也服从正态分布:rin(t)~N(λE(li),λE(li 2)/t),rmax与rmin作为rin(t)的上限与下限,应有:(rmax+rmin)/2=E(rin(t))=λE(li);First we build an approximate mathematical model. Considering the most conservative situation, it is assumed that the bandwidth allocated to a certain rtPS service in each frame of the system is r res , the data input rate is r in , r min ≤ r in ≤ r max , the data output rate is r res , and the rtPS service The arrival of data packets is a Poisson process, and the arrival rate is λ, so the number of bytes arriving within a period of time [t 0 , t 0 +t] is x ( t ) = &Sigma; i = 1 N ( t ) l i , Where N(t) is the number of packets arriving within [t 0 , t 0 +t], and l i is the length of the packet. Since l i is independent and identically distributed and statistically independent from N(t), X(t) is a composite Poisson process. Let the generating function of l i be F(S), and the Poisson process {N(t)} The generating function is G(S), G(S)=e λt[S-1] , where t is the time parameter and S is the Laplacian operator, then: the generating function of X(t) is G(F( S))=e λt[F(S)-1] , thus the expectation and variance of X(t) can be obtained: E(X(t))=λtE(l i ), D(X(t))= λtE(l i 2 ); when t is large enough, N(t) is also large enough, because l i is independent and identically distributed, and by the law of large numbers, X(t) obeys normal distribution: X(t)~N(λtE (l i ), λtE(l i 2 )). average data rate r in ( t ) = x ( t ) t , Also obey the normal distribution: r in (t) ~ N (λE (l i ), λE (l i 2 )/t), r max and r min as the upper and lower limits of r in (t), should have: ( r max +r min )/2=E(r in (t))=λE(l i );

事实上,我们可以把包的到达、等待与服务过程看成一个批处理系统,包的到达是泊松过程,服务者每隔一帧(TS)处理一次,一次处理一批数据包,处理包的个数设为Y(t),应满足以下关系: &Sigma; i = 1 Y ( i ) l i < r res &CenterDot; T S ; 处理的时间为TS;现在我们来考虑包的等待时间W(t)的分布:在同时处理的一批包中,我们考虑等待时间最长的那个包;由于队列是先到先服务FCFS系统,所以这一批包中第一个包最先到达,因而等待时间也最长。为了使等待时间不超过规定的QoS参数,我们需要得到第一个包的等待时间W(t)的分布。当这个包到达时,它前面的包是一批一批的处理的,处理时间都是TS,为了求等待时间W(t)的分布,我们可以把前面的包看成是一个一个处理的,在一帧的时间内,处理的字节数是TSrres,因此包的个数是TSrres/E(li),每个包的平均处理时间是TS/(TSrres/E(li))=E(li)/rres,因此这就等效成了一个经典的M/D/1排队系统,可以得到:P(W<t)=1-ρeλt,其中,ρ=λh=λE(li)/rres,又由(1)可知,ρ=(rmax+rmin)/2rres。由ρ<1可知, r res > r max + r min 2 . 当延时超过接入时规定的最大时延td时,数据包将会被丢弃,因此可得到因延时而丢包的概率: P d = P ( W + T S > t ) = &rho;e &lambda; ( t - T S ) ; 由于接入时对实时业务的丢包率有规定:Pd<P0,其中P0为实时业务的丢包率门限。因而可以得到: r res > r max + r min 2 P 0 e - &lambda; ( t - T S ) , 但同时有 r max + r min 2 < r res &le; r max , 所以给rtPS预留的最小带宽为 min ( r max + r min 2 e - &lambda; ( t - T S ) , r max ) . 可得 r res = r max + r min 2 P 0 e - &lambda; ( t - T S ) . In fact, we can regard the packet arrival, waiting, and service process as a batch processing system. The packet arrival is a Poisson process, and the server processes it every other frame (T S ), and processes a batch of data packets at a time. The number of packages is set as Y(t), which should satisfy the following relationship: &Sigma; i = 1 Y ( i ) l i < r res &Center Dot; T S ; The processing time is T S ; now we consider the distribution of the waiting time W(t) of the package: in a batch of packages processed at the same time, we consider the package with the longest waiting time; since the queue is a first-come-first-served FCFS system , so the first packet in this batch arrives first, so the waiting time is also the longest. In order to make the waiting time not exceed the specified QoS parameters, we need to get the distribution of the waiting time W(t) of the first packet. When this packet arrives, the preceding packets are processed batch by batch, and the processing time is T S . In order to find the distribution of the waiting time W(t), we can regard the previous packets as being processed one by one. , in one frame time, the number of processed bytes is T S r res , so the number of packets is T S r res /E(l i ), and the average processing time of each packet is T S /(T S r res /E(l i ))=E(l i )/r res , so this is equivalent to a classical M/D/1 queuing system, which can be obtained: P(W<t)=1-ρe λt , where, ρ=λh=λE(l i )/r res , and from (1), it can be seen that ρ=(r max +r min )/2r res . It can be known from ρ<1, r res > r max + r min 2 . When the delay exceeds the maximum delay t d specified at the time of access, the data packet will be discarded, so the probability of packet loss due to delay can be obtained: P d = P ( W + T S > t ) = &rho;e &lambda; ( t - T S ) ; Since there is a regulation on the packet loss rate of the real-time service during access: P d < P 0 , where P 0 is the packet loss rate threshold of the real-time service. Thus one can get: r res > r max + r min 2 P 0 e - &lambda; ( t - T S ) , but at the same time r max + r min 2 < r res &le; r max , So the minimum bandwidth reserved for rtPS is min ( r max + r min 2 e - &lambda; ( t - T S ) , r max ) . Available r res = r max + r min 2 P 0 e - &lambda; ( t - T S ) .

其中,rmax和rmin分别为最大带宽和最小带宽,λ为RtPS业务的包的到达率,P0为丢包率门限,t为最大时延,TS为一帧的时间。RtPS业务的预留带宽就可以由上式根据业务的各个QoS参数计算得到。Among them, r max and r min are the maximum bandwidth and minimum bandwidth respectively, λ is the packet arrival rate of the RtPS service, P 0 is the packet loss rate threshold, t is the maximum delay, and T S is the time of one frame. The reserved bandwidth of the RtPS service can be calculated by the above formula according to each QoS parameter of the service.

Claims (1)

1.宽带无线接入系统中基于资源预留的公平性资源调度算法,其特性在于,依次会有以下步骤:1. The fairness resource scheduling algorithm based on resource reservation in the broadband wireless access system is characterized by the following steps in sequence: 步骤(1),当新业务到来后,基于IEEE802.16宽带无线接入系统的基站根据不同业务的QoS参数,计算为满足不同的QoS参数的预留带宽,设为rres,其中包括已建立连接预留的带宽和新建立连接所需的预留带宽,若∑rres≤rtotal,则允许接入,否则,拒绝接入,rtotal为系统总带宽;Step (1), when a new service arrives, the base station based on the IEEE802.16 broadband wireless access system calculates the reserved bandwidth satisfying different QoS parameters according to the QoS parameters of different services, which is set to r res , including the established If ∑r res ≤ r total , the reserved bandwidth for the connection and the reserved bandwidth required for the newly established connection are allowed, otherwise, the access is denied, and r total is the total bandwidth of the system; 对于非申请授予业务,rres=rmax,rmax为最大输入数据率,设定值;For non-application grant services, r res = r max , where r max is the maximum input data rate, a set value; 对尽力而为的业务,rres=0;For best-effort traffic, r res = 0; 对于实时轮询业务,
Figure FSB00000130858500011
For real-time polling services,
Figure FSB00000130858500011
其中,rmin为最小输入数据率,设定值;Among them, r min is the minimum input data rate, the set value; P0为丢包率门限,设定值;P 0 is the packet loss rate threshold, a set value; λ为实时轮询业务的包的到达率,已知值;λ is the arrival rate of the packets of the real-time polling service, a known value; t为最大时延,TS为一帧的时间,均为设定值;t is the maximum delay, and T S is the time of one frame, both of which are set values; 对于非实时轮询业务,rres=rminFor non-real-time polling service, r res = r min ; 步骤(2),基站根据IEEE802.16规定的媒体访问控制层机制,周期性的根据各业务所要求的带宽和系统已有带宽对系统带宽进行分配,并把分配结果在下行子帧的UL-MAP消息中通知各用户站:Step (2), the base station periodically allocates the system bandwidth according to the bandwidth required by each service and the existing bandwidth of the system according to the media access control layer mechanism stipulated in IEEE802.16, and puts the allocation result in the UL- Each user station is notified in the MAP message: 第一步:一级调度Step 1: Level 1 Scheduling 先把系统预留带宽满足优先级从高到低的业务的带宽请求,若业务所要求的带宽rreq小于预留带宽,则使一级调度的带宽rallo_1=rreq,否则使rallo_1=rres,所述优先级最高的业务是指非申请授予业务,其余依次为实时轮询、非实时轮询以及尽力而为业务;First, the reserved bandwidth of the system is used to meet the bandwidth requests of services with priority from high to low. If the bandwidth r req required by the service is smaller than the reserved bandwidth, then the bandwidth r allo_1 of the first-level scheduling = r req , otherwise, r allo_1 = r res , the business with the highest priority refers to non-application grant business, and the rest are real-time polling, non-real-time polling and best-effort business; 第二步:二级调度Step Two: Secondary Scheduling 再把一级调度之后的剩余带宽按加权循环转移法分配给各个业务,各业务的权重因子为:ki=λi·diThen allocate the remaining bandwidth after the first-level scheduling to each service according to the weighted cyclic transfer method, and the weight factor of each service is: k ii ·d i ; 其中,λi为各业务剩余要求带宽占总剩余要求带宽的比例:即
Figure FSB00000130858500021
若rreq,i<rres,i,令rreq,i-rres,i=0;
Among them, λi is the ratio of the remaining required bandwidth of each service to the total remaining required bandwidth: namely
Figure FSB00000130858500021
If r req, i < r res, i , let r req, i - r res, i = 0;
j=1,2,...,n,为要求分配剩余带宽的业务数,j=1, 2,..., n, is the number of services requiring allocation of remaining bandwidth, rreq,i和rres,i分别为第i个业务的要求带宽和预留带宽,r req, i and r res, i are the required bandwidth and reserved bandwidth of the i-th service respectively, rreq,j和rres,j分别为第j个业务的要求带宽和预留带宽,r req, j and r res, j are the required bandwidth and reserved bandwidth of the jth service respectively, di为优先级因子,设定值,实时业务的优先级因子应大于非实时业务的优先级因子,对于各非实时业务应设定不同的优先级因子;d i is a priority factor, set value, the priority factor of real-time business should be greater than the priority factor of non-real-time business, should set different priority factors for each non-real-time business; 二级调度所得到的带宽为:rallo_2=(rtotal-∑rallo_1)·ki/∑kiThe bandwidth obtained by the second-level scheduling is: r allo_2 = (r total -∑r allo_1 ) · k i /∑ k i , 经过两级分配,各业务获得的带宽为rallo=rallo_1+rallo_2After two-level allocation, the bandwidth obtained by each service is r allo =r allo_1 +r allo_2 .
CN2006101124399A 2006-08-18 2006-08-18 Fair resource scheduling method based on resource scheduling in broadband wireless access system Expired - Fee Related CN101111070B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2006101124399A CN101111070B (en) 2006-08-18 2006-08-18 Fair resource scheduling method based on resource scheduling in broadband wireless access system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2006101124399A CN101111070B (en) 2006-08-18 2006-08-18 Fair resource scheduling method based on resource scheduling in broadband wireless access system

Publications (2)

Publication Number Publication Date
CN101111070A CN101111070A (en) 2008-01-23
CN101111070B true CN101111070B (en) 2010-09-29

Family

ID=39042923

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2006101124399A Expired - Fee Related CN101111070B (en) 2006-08-18 2006-08-18 Fair resource scheduling method based on resource scheduling in broadband wireless access system

Country Status (1)

Country Link
CN (1) CN101111070B (en)

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101534563B (en) * 2008-03-12 2011-01-05 华为技术有限公司 Service scheduling method, system and access relay station thereof
CN101562890B (en) * 2008-04-18 2011-08-24 中国移动通信集团公司 Admission control and method for determining resource allocation priority, and related equipment
CN101917767B (en) * 2008-04-18 2014-07-02 中国移动通信集团公司 Method for determining resource distribution priority and device thereof
CN101662419B (en) * 2008-08-27 2011-12-07 华为技术有限公司 Method, device and system for realizing resource reservation
CN101965032B (en) * 2009-07-22 2013-03-20 中兴通讯股份有限公司 Access control method and device
CN101808033B (en) * 2010-03-09 2013-04-17 杭州华三通信技术有限公司 Method and apparatus for allocating reservation bandwidth of traffic
CN102340842B (en) * 2010-07-21 2015-01-28 中兴通讯股份有限公司 Resource control method and device and base station
CN101964947B (en) * 2010-09-08 2013-03-20 北京航空航天大学 Data scheduling platform of integrated information service broadcasting system
CN101958844A (en) * 2010-11-02 2011-01-26 南京邮电大学 Active Queue Scheduling Method Based on QoS in DiffServ Network
CN102036397B (en) * 2011-01-21 2013-03-20 大唐移动通信设备有限公司 Resource scheduling method and device of TD-LTE (Time Division-Long Term Evolution) system
CN102158420B (en) * 2011-05-25 2013-10-23 杭州华三通信技术有限公司 Service traffic scheduling method based on priority queue and device thereof
CN102333035B (en) * 2011-09-28 2017-11-07 中兴通讯股份有限公司 Router and its rsvp reservation resource regulating method and device
CN102769914B (en) * 2012-04-29 2014-11-26 黄林果 Fair scheduling method based on mixed businesses in wireless network
CN103516623A (en) * 2012-06-25 2014-01-15 中兴通讯股份有限公司 Resource distribution method and system
CN103249164B (en) * 2013-04-08 2015-10-28 江苏物联网研究发展中心 A kind of resource regulating method of chain wireless network and base station
CN105471644B (en) * 2015-11-30 2018-07-27 中电科华云信息技术有限公司 The method of elastically regulating and controlling tenant network flow under cloud environment
CN107959638A (en) * 2017-11-23 2018-04-24 迈普通信技术股份有限公司 File transmitting method and device
CN108768885B (en) * 2018-05-29 2020-05-05 西南交通大学 A network real-time scheduling method based on service type
CN109039953B (en) * 2018-07-24 2022-06-10 新华三技术有限公司 Bandwidth scheduling method and device
CN109195176B (en) * 2018-11-16 2021-06-15 徐州工业职业技术学院 Self-adaptive scheduling method and system for multi-service fusion in home base station
CN109819457B (en) * 2019-01-25 2020-05-22 云南大学 Two-stage threshold polling system based on FPGA
CN115037616B (en) * 2022-04-22 2023-09-29 东北大学 A deterministic flow scheduling and its update method based on TSSDN network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1617521A (en) * 2003-11-11 2005-05-18 三星电子株式会社 Allocate bandwidth using the Resilient Packet Ring (RPR) fair mechanism
CN1620036A (en) * 2003-11-20 2005-05-25 华为技术有限公司 A Method of Allocating Bandwidth Resources of ABIS Interface
WO2006081365A2 (en) * 2005-01-26 2006-08-03 Telcordia Technologies, Inc. Capacity management system for passive optical networks

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1617521A (en) * 2003-11-11 2005-05-18 三星电子株式会社 Allocate bandwidth using the Resilient Packet Ring (RPR) fair mechanism
CN1620036A (en) * 2003-11-20 2005-05-25 华为技术有限公司 A Method of Allocating Bandwidth Resources of ABIS Interface
WO2006081365A2 (en) * 2005-01-26 2006-08-03 Telcordia Technologies, Inc. Capacity management system for passive optical networks

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
JP特開2001-313647A 2001.11.09
Kitti Wongthavarawat ET AL..Packet scheduling for QoS support in IEEE 802.16 broadband wireless access systems.INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS.2003,全文. *
王洪熙等.一种用于IEEE802_16无线城域网TDD模式中的带宽调度方案.电子与信息学报.2006,28(5),全文. *

Also Published As

Publication number Publication date
CN101111070A (en) 2008-01-23

Similar Documents

Publication Publication Date Title
CN101111070B (en) Fair resource scheduling method based on resource scheduling in broadband wireless access system
Chen et al. A service flow management strategy for IEEE 802.16 broadband wireless access systems in TDD mode
CN101262651B (en) Downlink data scheduling method and system for base station in broadband wireless metropolitan area network
CN101621457B (en) Multi-service scheduling method and system
CN106793133B (en) Scheduling method for guaranteeing multi-service QoS in electric power wireless communication system
CN102448147B (en) Method and device for accessing wireless service
CN101155093A (en) A method and device for allocating bandwidth in a wireless communication network
CN101184321A (en) A method, system and device for adjusting user service quality
CN101286949A (en) MAC Layer Resource Scheduling Strategy of Wireless Mesh Network Based on IEEE802.16d Standard
CN101754387A (en) Method for scheduling resources in wireless communication system and base station
CN109618375B (en) UAV Ad Hoc Network Time Slot Scheduling Method Based on Service Priority and Channel Outage Probability
CN103596285A (en) Wireless resource scheduling method, wireless resource scheduler and system thereof
CN100553359C (en) Admission Control Method Based on Measurement and QoS in Broadband Wireless Access System
CN111371701B (en) MAC layer queue scheduling method based on TDMA
CN100589437C (en) A scheduling method for Internet telephony protocol services
Monikandan et al. Channel aware optimized proportional fair scheduler for LTE downlink
CN103619069B (en) The broadband power line communication cross-layer resource allocation that mixed service urgency is preferential
CN101808324B (en) MAC layer architecture design of wireless Mesh network
CN100369524C (en) CDMA system up-bag dispatching method
CN101114988A (en) Flow control algorithm for non-continuous emission based forecasting self-adaption multi-velocity service
CN107197530B (en) Downlink resource allocation algorithm for channel fluctuation perception in LTE system
CN102469602A (en) User multi-service scheduling method
CN110602747A (en) Method for scheduling wide-band and narrow-band mixed service channel resources of power wireless communication system
CN102833786B (en) Independent Carrier Wave dispatching method in a kind of multicarrier system
CN1633097A (en) Quality of Service Scheduler and Method for Voice Service in Broadband Wireless Metropolitan Area Network

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

Termination date: 20150818

EXPY Termination of patent right or utility model