Determination of optimal policy for code allocation in high speed downlink packet access networks with multi-state channel model

  • Authors:
  • Hussein Al-Zubaidy;Ioannis Lambadaris;Jerome Talim;Ioannis Marmorkos

  • Affiliations:
  • Carleton University, Ottawa, ON, Canada;Carleton University, Ottawa, ON, Canada;Carleton University, Ottawa, ON, Canada;Larisa Institute of Technology, Larisa, Greece

  • Venue:
  • Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a discrete stochastic dynamic programming model for the High Speed Downlink Packet Access (HSDPA) downlink scheduler with multi-state Markov channel model is presented. The model then solved numerically (using Markov Decision Process and Dynamic Programming) to find the optimal policy for the case of two users sharingthe same cell using a 3-state channel. The optimal policy is the one that maximizes the system through put 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.