Journal of Optimization Theory and Applications
Performance analysis of a feedback congestion control policy under non-negligible propagation delay
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Feedback control of congestion in packet switching networks: the case of a single congested node
IEEE/ACM Transactions on Networking (TON)
Intelligent congestion control for ABR service in ATM networks
ACM SIGCOMM Computer Communication Review
The ERICA switch algorithm for ABR traffic management in ATM networks
IEEE/ACM Transactions on Networking (TON)
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Stability and performance analysis of rate-based feedback flow controlled ATM networks
Queueing Systems: Theory and Applications
ATM rate based congestion control using a smith predictor: an EPRCA implementation
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Congestion control in high-speed communication networks using the Smith principle
Automatica (Journal of IFAC)
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A control theoretical approach to congestion control in packet networks
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Hi-index | 0.01 |
Optimal structured feedback control policies for rate-based flow control of available bit rate service in asynchronous transfer mode networks are obtained in the presence of information and propagation delays, using a numerically efficient two-timescale simultaneous perturbation stochastic approximation algorithm. Models comprising both a single bottleneck node and a network with multiple bottleneck nodes are considered. A convergence analysis of the algorithm is presented. Numerical experiments demonstrate fast convergence even in the presence of significant delays. We also illustrate performance comparisons with the well-known Explicit Rate Indication for Congestion Avoidance (ERICA) algorithm and describe another algorithm (based on ERICA) that does not require estimating available bandwidth (as in ERICA).