Delay constrained uplink scheduling policy for rtPS/ertPS service in IEEE 802.16e BWA systems

WiMAX is a promising broadband wireless networking technology and is expected to take the place of broadband access solutions such as DSL and cable. Owing to its superior support in mobility, it is expected to provide integrated voice and data service to realize broadband mobile computing. In order to reach better quality‐of‐service (QoS) requirements for real‐time applications, the IEEE 802.16e standard defines five different services among traffic categories with different multimedia requirements. However, the problem of choosing the right set of medium access control parameters and packet scheduling policy to provide strict QoS guaranteed in IEEE 802.16e Broadband Wireless Access (BWA) systems remains unsolved and left as an open issue. In this paper, we propose a novel polling‐based uplink packet scheduling policy for real‐time Polling Service and extended real‐time Polling Service (rtPS/ertPS) traffic to support real‐time applications, with strict delay requirements, such as variable bit rate (VBR) traffic in IEEE 802.16e BWA systems. The proposed transmit‐permission policy can derive sufficient conditions such that all the rtPS/ertPS sources satisfy their time constraints to provide deterministic QoS guarantees. In addition to theoretical analysis, simulations are conducted to evaluate the performance of the proposed scheme. As it turns out, our design provides a good quality performance in the IEEE 802.16e BWA systems. Copyright © 2008 John Wiley & Sons, Ltd.     

WiMAX上行链路实时业务改进调度算法

针对WiMAX建议的rtPS和ertPS调度机制处理变速率实时业务时MAC层开销大,导致时延增大的缺点,提出了一种能够有效调度多用户变速率实时业务的上行链路调度算法。该算法在SS端实时监控数据率,减少发送带宽请求的次数,从而提高整体的上行链路资源利用率,并在BS上行调度器中优化调度策略,使得最急迫的用户优先得到服务。仿真结果表明该算法与ertPS相比,在不影响系统吞吐量的情况下上行时延减少了约15%。     

Using GI‐G‐1 queuing model for rtPS performance evaluation in 802.16 networks

Among the scheduling services, rtPS (real‐time polling service) is designated for real‐time applications. Among three packet delay intervals, performance effect on polling interval has been widely studied, but less on the intervals of scheduling and delivery. To evaluate the performance of delay‐sensitive rtPS applications, instead of using continuous queueing model, a discrete‐time GI‐G‐1 model, which considers intervals of polling, scheduling, and delivery, is proposed. By taking VoIP as a typical rtPS application, the transmission latency under different QoS settings, polling probability, and traffic load are presented. The latency is also compared among various codec schemes. The results indicate that when the codec rate is either fulfilled or dissatisfied by the promised bandwidth of service levels, the performance is highly dependent upon the polling probability, no matter what the traffic condition is. However, if the codec rate is in between the promised bandwidth of various service levels, the polling probability is a dominant factor in light traffic environment, while the settings on QoS parameters will strongly determine the performance in heavy traffic situation. In addition to the verification using simulation, the bandwidth utilization derived from the GI‐G‐1 model can be applied to improve the serving capacity of base stations. Copyright © 2011 John Wiley & Sons, Ltd.