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


Autoria(s): Bhatnagar, Shalabh; Reddy, I Bala Bhaskar
Data(s)

01/05/2005

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/27556/1/therd.pdf

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.

Publicador

Springer

Relação

http://www.springerlink.com/content/h8341g548m435278/

http://eprints.iisc.ernet.in/27556/

Palavras-Chave #Computer Science & Automation (Formerly, School of Automation)
Tipo

Journal Article

PeerReviewed