By Topic

An approximate dynamic programming approach to admission control in WCDMA 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
$31 $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

2 Author(s)
Pietrabissa, A. ; Â¿Dipartimento di Informatica e Sistemistica¿ of the Univ. of Rome ¿La Sapienza¿, via Eudossiana 18, 00184, Italy ; Borza, Daniele Anticoli

This paper presents a Connection Admission Control (CAC) algorithm for Wide-CDMA (WCDMA) networks based on an Approximate Dynamic Programming (ADP) approach: the network is modeled as a Markov Decision Process (MDP), and ADP algorithms are used to compute the optimal admission policy. Two innovative concept are introduced: i) by formulating the problem as a linear programming problem, the blocking probabilities of the different classes of service supported by the network are controlled by appropriately modifying the reward function; ii) on the ground of practical considerations on the CAC problem, a restricted structure policy is determined, based on the reduction of the action space for low load conditions. Numerical simulation results show the effectiveness of the approach.

Published in:

Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control, 2006 IEEE

Date of Conference:

4-6 Oct. 2006