Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A binary feedback scheme for congestion avoidance in computer networks
ACM Transactions on Computer Systems (TOCS)
Necessary Conditions for Optimal Control of Stochastic Systems with Random Jumps
SIAM Journal on Control and Optimization
Kalman filtering for linear systems with coefficients driven by a hidden Markov jump process
Systems & Control Letters
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
A stochastic model of TCP/IP with stationary random losses
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
TCP in presence of bursty losses
Performance Evaluation - Special issue on internet performance modelling
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
TCP/IP modeling and validation
IEEE Network: The Magazine of Global Internetworking
Brief paper: Optimization of queuing system via stochastic control
Automatica (Journal of IFAC)
Finite horizon control problems under partial information
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
| Hi-index | 0.00 |
A nonlinear stochastic control problem related to ow control is considered. It is assumed that the state of a link is described by a controlled hidden Markov process with a finite state set, while the loss ow is described by a counting process with intensity depending on a current transmission rate and an unobserved link state. The control is the transmission rate, and it has to be chosen as a nonanticipating process depending on the observation of the loss process. The aim of the control is to achieve the maximum of some utility function that takes into account losses of the transmitted information. Originally, the problem belongs to the class of stochastic control problems with incomplete information; however, optimal filtering equations that provide estimation of the current link state based on observations of the loss process allow one to reduce the problem to a standard stochastic control problem with full observations. Then a necessary optimality condition is derived in the form of a stochastic maximum principle, which allows us to obtain explicit analytic expressions for the optimal control in some particular cases. Optimal and suboptimal controls are investigated and compared with the ow control schemes used in TCP/IP (Transmission Control Protocols/Internet Protocols) networks. In particular, the optimal control demonstrates a much smoother behavior than the TCP/IP congestion control currently used.