Abdulla, Mohammed Shahid ; Bhatnagar, Shalabh (2007) Network flow-control using asynchronous stochastic approximation In: 46th IEEE Conference on Decision and Control, 12-14 Dec. 2007, New Orleans, LA, USA.
Full text not available from this repository.
Official URL: http://doi.org/10.1109/CDC.2007.4434593
Related URL: http://dx.doi.org/10.1109/CDC.2007.4434593
Abstract
We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discrete- time implementations of Kelly's dual algorithm and primal- dual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 116720 |
| Deposited On: | 12 Apr 2021 07:27 |
| Last Modified: | 12 Apr 2021 07:27 |
Repository Staff Only: item control page
