Convergence rates of perturbation-analysis-Robbins-Monro-single-run algorithms for single server queues
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...
Saved in:
Published in | IEEE transactions on automatic control Vol. 42; no. 10; pp. 1442 - 1447 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.10.1997
Institute of Electrical and Electronics Engineers |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0018-9286 1558-2523 |
DOI: | 10.1109/9.633835 |