
基于最小速率保证的IEEE 802-16e公平调度算法
史俊财、胡爱群、关艳峰
Minimum Reserved Traffic Rate Based Fair Scheduling Algorithm in IEEE 802.16e
Shi Juncai、Hu Aiqun、Guan Yanfeng
针对IEEE 802-16e协议的特点,提出了一种基于最小速率保证的IEEE 802-16e 公平 调度(MTRFS)算法。算法支持多种业务流类型并可保障业务流的最小预约速率。该算法中 引入了补偿模式,以保障处在恶劣信道条件下的业务流的最小速率。同时,该算法对高级别业务流和信道条件好的业务流提供尽可能多的带宽,以保障其QoS性能和系统吞吐量的最大化。仿真表明,该算法能够保证业务流的最小预约速率,区别对待不同优先级的业务流;无论是其公平性能还是吞吐量性能都优于传统的PF算法。该算法与IE
According to the characteristics of IEEE 802.16-2005, a minimum reserve d traffic rate based fair scheduling algorithm in IEEE 802.16-2005 is proposed in this paper. It can support multiple service types and guarantee every service´s minimum reserved traffic rate. A compensation strategy is introduced to ensure m inimum reserved traffic rate of service which is in bad channel condition. At th e same time, services which have higher priority and are in good channel conditi on are granted more bandwidth to ensure the QoS (quality of service) and maximiz e the throughput performance. The simulation study shows that the algorithm can guar antee the minimum reserved traffic rate and distinguish the services in differen t levels. Furthermore, the algorithm has advantages in both fairness and through p ut performance compared with PF (proportional fair) algorithm. The algorithm pro posed in this paper is in accordance with IEEE 802-16-2005 and has gre at value.
IEEE 802-16e / 调度算法 / QoS / 公平
IEEE 802-16-2005 / scheduling algorithm / QoS / fairness
/
〈 |
|
〉 |