Based on five scheduling types and their QoS requirements defined in IEEE 802.16e specification, this paper proposes a new scheduring algorithm for non-real-time or real-time multimedia services. Taking the performanc...Based on five scheduling types and their QoS requirements defined in IEEE 802.16e specification, this paper proposes a new scheduring algorithm for non-real-time or real-time multimedia services. Taking the performances of efficiency, fairness and complexity into consideration, the proposed algorithm enhances the efficiency of air interface resource at the expense of the short-time unfairness, but ensures the long-time fairness. Moreover, the proposed algorithm introduces an efficient QoS assurance mechanism, which implements the functions of congestion control, queuing management and traffic management. The simulation results based on a simplified traffic model show that the proposed algorithm guarantees better performances of efficiency and fairness than conventional algorithms, without increasing the algorithm complexity. Especially on the occasion of heavy-traffic requirement, the performance of efficiency and fairness can be improved by 50% at most.展开更多
基金DONG Guojun, born in 1976,male, doctorate student,E-mail:zjrobindong@163.com.
文摘Based on five scheduling types and their QoS requirements defined in IEEE 802.16e specification, this paper proposes a new scheduring algorithm for non-real-time or real-time multimedia services. Taking the performances of efficiency, fairness and complexity into consideration, the proposed algorithm enhances the efficiency of air interface resource at the expense of the short-time unfairness, but ensures the long-time fairness. Moreover, the proposed algorithm introduces an efficient QoS assurance mechanism, which implements the functions of congestion control, queuing management and traffic management. The simulation results based on a simplified traffic model show that the proposed algorithm guarantees better performances of efficiency and fairness than conventional algorithms, without increasing the algorithm complexity. Especially on the occasion of heavy-traffic requirement, the performance of efficiency and fairness can be improved by 50% at most.
