The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Multi Objective Resource Scheduling in LTE Networks Using Reinforcement Learning
|
|
Author(s): Ioan Sorin Comsa (University of Bedfordshire, UK and University of Applied Sciences of Western Switzerland, Switzerland), Mehmet Aydin (University of Bedfordshire, UK), Sijing Zhang (University of Bedfordshire, UK), Pierre Kuonen (University of Applied Sciences of Western Switzerland, Switzerland)and Jean–Frédéric Wagen (University of Applied Sciences of Western Switzerland, Switzerland)
Copyright: 2012
Volume: 3
Issue: 2
Pages: 19
Source title:
International Journal of Distributed Systems and Technologies (IJDST)
Editor(s)-in-Chief: Nik Bessis (Edge Hill University, UK)
DOI: 10.4018/jdst.2012040103
Purchase
|
Abstract
The use of the intelligent packet scheduling process is absolutely necessary in order to make the radio resources usage more efficient in recent high-bit-rate demanding radio access technologies such as Long Term Evolution (LTE). Packet scheduling procedure works with various dispatching rules with different behaviors. In the literature, the scheduling disciplines are applied for the entire transmission sessions and the scheduler performance strongly depends on the exploited discipline. The method proposed in this paper aims to discuss how a straightforward schedule can be provided within the transmission time interval (TTI) sub-frame using a mixture of dispatching disciplines per TTI instead of a single rule adopted across the whole transmission. This is to maximize the system throughput while assuring the best user fairness. This requires adopting a policy of how to mix the rules and a refinement procedure to call the best rule each time. Two scheduling policies are proposed for how to mix the rules including use of Q learning algorithm for refining the policies. Simulation results indicate that the proposed methods outperform the existing scheduling techniques by maximizing the system throughput without harming the user fairness performance.
Related Content
|
Xu Zhao, Yang Wu, Wentao Zou, Xuhui Wang.
© 2026.
21 pages.
|
|
Jianfeng Chen, Sijing Zhu, Anke Li, Yi Xue.
© 2026.
25 pages.
|
|
Sijing Zhu, Shanshan Zheng, Jiawen Wang, Mingyuan Tao.
© 2026.
24 pages.
|
|
.
© 2026.
|
|
Peng Chen, Tian Tian.
© 2025.
20 pages.
|
|
Jin Xu, Yanna Zhao.
© 2025.
18 pages.
|
|
Tong Liu, Feng Qin.
© 2025.
20 pages.
|
|
|