ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation

Bhatnagar, Shalabh and Reddy, I Bala Bhaskar (2005) Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation. In: Telecommunication Systems, 29 (1). pp. 9-31.

[img] PDF
therd.pdf - Published Version
Restricted to Registered users only

Download (163Kb) | Request a copy
Official URL: http://www.springerlink.com/content/h8341g548m4352...

Abstract

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.

Item Type: Journal Article
Additional Information: Copyright of this article beliongs to Springer.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 04 Jun 2010 10:11
Last Modified: 19 Sep 2010 06:01
URI: http://eprints.iisc.ernet.in/id/eprint/27556

Actions (login required)

View Item View Item