Abstract
The design of future-generation broadband wireless network introduces a set of challenging technical issues. This paper focuses on the packet scheduling algorithms. The key difficulty of the problem lies in the high variability of wireless channel capacity and the unknown model of packet arrival process. We view the packet scheduling problem as a semi-Markov decision process (SMDP), and approximately solve the problem by using the methodology of neuro-dynamic programming (or reinforcement learning). The proposed algorithm, called neuro-dynamic programming scheduling (NDPS), employs a feature-based linear approximating architecture to produce a near optimal solution of the corresponding SMDP problem. Simulation experiment is carried out to demonstrate that NDPS can simultaneously achieve three performance objectives: (i) QoS differentiation and guarantee, (ii) high bandwidth utilization, and (iii) both short-term and long-term fairness.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
