Abstract

In this paper, a discrete stochastic dynamic programming model for the high speed downlink packet access (HSDPA) downlink scheduler when using finite-state Markov channel (FSMC) model is presented. The model then solved numerically (using value iteration) to find the optimal policy for the case of two users sharing the same cell using a 3-state channel. The optimal policy is the one that maximizes the system throughput while maintaining a level of fairness between users. Simulation is used to study the performance of the resulted optimal policy and compared with Round Robin (RR) scheduler. The effects of the allowable number of channel states and the fairness factor on the optimal policy performance were also studied.

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 call

Disclaimer: 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.