Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Approximation algorithms
IEEE Transactions on Mobile Computing
IEEE Transactions on Computers
The design and implementation of WiMAX module for ns-2 simulator
WNS2 '06 Proceeding from the 2006 workshop on ns-2: the IP network simulator
IEEE Communications Surveys & Tutorials
Quality of service support in IEEE 802.16 networks
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Using GI-G-1 queuing model for rtPS performance evaluation in 802.16 networks
International Journal of Communication Systems
Hi-index | 0.00 |
IEEE 802.16 networks are designed based on differentiated services concept to provide better Quality of Service (QoS) support for a wide range of applications, from multimedia to typical web services, and therefore they require a fair and efficient scheduling scheme. However, this issue is not addressed in the standard. In this paper we present a new fair scheduling scheme which fulfills the negotiated QoS parameters of different connections while providing fairness among the connections of each class of service. This scheme models scheduling as a knapsack problem, where a fairness parameter reflecting the specific requirements of the connections is defined to be used in the optimization criterion. The proposed scheduler is evaluated through simulation in terms of delay, throughput and fairness index. The results show fairness of the scheduling scheme to all connections while the network guarantees for those connections are fulfilled.