Two timescale SPSA algorithms for rate-based ABR flow control (Q2724383)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two timescale SPSA algorithms for rate-based ABR flow control |
scientific article; zbMATH DE number 1617881
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two timescale SPSA algorithms for rate-based ABR flow control |
scientific article; zbMATH DE number 1617881 |
Statements
17 December 2001
0 references
available bit rate service
0 references
time-scale simultaneous perturbation
0 references
stochastic approximation
0 references
asynchronous transfer mode networks
0 references
stochastic dynamic optimization
0 references
optimal structured feedback
0 references
propagation delays
0 references
Two timescale SPSA algorithms for rate-based ABR flow control (English)
0 references
The available bit rate (ABR) service in asynchronous transfer mode networks is designed for data applications. The model that is considered by the authors is a bottleneck node with two input streams, one controlled and the other uncontrolled. The ABR problem is considered as a stochastic dynamic optimization problem with parametrized policies that have several levels of control. Two simultaneous perturbation stochastic approximation algorithms are constructed, both of them use two time-scales. They are used to obtain optimal structured feedback control policies for the rate based flow control in ABR-service mentioned above, in the presence of information and propagation delays. Such algorithms have the advantage that they do not require regeneration for averaging. Numerical experiments demonstrate fast convergence even in the presence of significant delays and large number of parametrized policy levels.NEWLINENEWLINEFor the entire collection see [Zbl 0961.00036].
0 references
0.7638735175132751
0 references
0.7486573457717896
0 references