We present an analytic model and a methodology to determine the optimal packet scheduling policy in a High-Speed Downlink Packet Access (HSDPA) system. The optimal policy is the one that maximizes cell throughput while maintaining a level of fairness between the users in the cell. A discrete stochastic dynamic programming model for the HSDPA downlink scheduler is presented. Value iteration is then used to solve for the optimal scheduling policy. We use a FSMC (Finite State Markov Channel) to model the HSDPA downlink channel. A near-optimal heuristic scheduling policy is developed. Simulation is used to study the performance of the resulting heuristic policy and compare it to the computed optimal policy. The results show that the performance of the heuristic policy is very close to that of the optimal policy. The heuristic policy has much less computational complexity, which makes it easy to deploy, with only slight reduction in performance compared to the optimal policy.

Additional Metadata
Keywords 3G wireless networks, Cross-layer design, Dynamic programming, HSDPA systems, Markov decision process, Optimal scheduling, Resource allocation
Persistent URL dx.doi.org/10.1145/1870085.1870088
Journal ACM Transactions on Modeling and Computer Simulation
Al-Zubaidy, H. (Hussein), Lambadaris, I, & Talim, J. (2010). Optimal scheduling in High-Speed Downlink Packet Access networks. ACM Transactions on Modeling and Computer Simulation, 21(1). doi:10.1145/1870085.1870088