Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Voice over IP performance monitoring
ACM SIGCOMM Computer Communication Review
IEEE Transactions on Parallel and Distributed Systems
Scheduling solution for the IEEE 802.16 base station
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hybrid Broadband Access with IEEE 802.16e: An Economic Approach for Rural Areas
MWS '09 Proceedings of the 2009 IEEE Mobile WiMAX Symposium
Scheduling in IEEE 802.16e Mobile WiMAX networks: key issues and a survey
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
A game theoretical formulation for proportional fairness in LTE uplink scheduling
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Future U.S. wireless landscape and IMS rollout
WOCC'09 Proceedings of the 18th international conference on Wireless and Optical Communications Conference
Radio-aware scheduler for WiMAX systems based on time-utility function and game theory
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Scheduling alternatives for mobile WiMAX end-to-end simulations and analysis
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Quality of service support in IEEE 802.16 networks
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
In WiMAX systems the Base Station scheduler plays a key role as it controls the sharing of the radio resources among the users. The goal of the scheduler is multiple: achieve fair usage of the resources, satisfy the QoS requirements of the users, maximize goodput, and minimize power consumption, and at the same time ensuring feasible algorithm complexity and system scalability. Since most of these goals are contrasting, scheduler designers usually focus their attention on optimizing one aspect only. In this scenario, we propose a scheduling algorithm (called $$\mathrm{GTS_N}$$ ) whose goal is to contemporaneously achieve efficiency and fairness, while also taking into account the QoS requirements and the channel state. $$\mathrm{GTS_N}$$ exploits the properties of Time Utility Functions (TUFs) and Game Theory. Simulations prove that the performance of $$\mathrm{GTS_N},$$ when compared to that of several well-known schedulers, is remarkable. $$\mathrm{GTS_N}$$ provides the best compromise between the two contrasting objectives of fairness and efficiency, while QoS requirements are in most cases guaranteed. However, the exponential complexity introduced by the game theory technique makes it rather impractical and not computationally scalable for a large number of users. Thus we developed a suboptimal version, named sub- $$\mathrm{GTS_N}.$$ We show that this version retains most of the features and performance figures of its brother, but its complexity is linear with the number of users.