By Topic

Heuristic Approach of Optimal Code Allocation in High Speed Downlink Packet Access Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hussein Al-Zubaidy ; SCE-Carleton University, Canada ; Jerome Talim ; Ioannis Lambadaris

In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete stochastic dynamic programming model for the HSDPA downlink scheduler is presented. The model then is solved numerically using value iteration. The system performance when using the resulted optimal policy as compared to Round Robin (RR) is studied using simulation. The behaviour of the value function was observed then used to develop a heuristic scheduling policy. The devised heuristic policy performs very close to the optimal policy. It has much less computational complexity which makes it easy to deploy and with only slight reduction in performance compared to the optimal policy.

Published in:

Networking, 2007. ICN '07. Sixth International Conference on

Date of Conference:

22-28 April 2007