Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Improving TCP performance over wireless networks at the link layer
Mobile Networks and Applications
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Improving explicit congestion notification with the mark-front strategy
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding TCP Vegas: a duality model
Journal of the ACM (JACM)
Passive estimation of TCP round-trip times
ACM SIGCOMM Computer Communication Review
Improving TCP Congestion Control over Internets with Heterogeneous Transmission Media
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
A duality model of TCP and queue management 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-friendly congestion control to guarantee smoothness by Slack Term
Computer Communications
WF2Q-M: Worst-case fair weighted fair queueing with maximum rate control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Active Queue Management for Fair Resource Allocation in Wireless Networks
IEEE Transactions on Mobile Computing
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
In this paper, we propose a dynamic optimization approach to end-to-end flow control in data networks. The objective is to maximize the aggregate utilities of the data sources over soft transmission rate bounds and delay constraints. The network links and data sources are considered as processors of a distributed computational system that has a global objective function. The presented model works with different shapes of utility curves under the proposition of elastic data traffic. The approach relies on real-time observations of the delay as a measure of the data network congestion at the routers (network nodes). A primal-dual algorithm carried out by the data sources is used to solve the optimization problem in a decentralized manner. The calculated transmission rates are bounded and the sources are subjected to a maximum number of data packets that can be queued downstream of each transmission session. The algorithm solves for the rates without the access to any network global information while each source calculates its transmission rate that should maximize the global objective function. The calculated optimal rates conform to rate-to-queue proportionality. Finally, we present an extensive simulation results to demonstrate the reliability of the algorithm.