By Topic

Convergence rates of perturbation-analysis-Robbins-Monro-single-run algorithms for single server queues

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

3 Author(s)
Qian-Yu Tang ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Han-Fu Chen ; Zeng-Jin Han

In this paper the perturbation-analysis-Robbins-Monro-single-run algorithm is applied to estimating the optimal parameter of a performance measure for the GI/G/1 queueing systems, where the algorithm is updated after every fixed-length observation period. Our aim is to analyze the limiting behavior of the algorithm. The almost sure convergence rate of the algorithm is established. It is shown that the convergence rate depends on the second derivative of the performance measure at the optimal point

Published in:

Automatic Control, IEEE Transactions on  (Volume:42 ,  Issue: 10 )