Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
End-to-end arguments in system design
ACM Transactions on Computer Systems (TOCS)
On the long-run behavior of equation-based rate control
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The Interrelation of TCP Responsiveness and Smoothness in Heterogeneous Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
TCP-Friendly SIMD Congestion Control and Its Convergence Behavior
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the properties of an additive increase rate accelerator
Computer Networks: The International Journal of Computer and Telecommunications Networking
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Experimenting with τ-AIMD over wireless asynchronous networks
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
AIRA: additive increase rate accelerator
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Performance evaluation of τ-AIMD over wireless asynchronous networks
WWIC'05 Proceedings of the Third international conference on Wired/Wireless Internet Communications
Some open issues on internetworking for the next generation
Computer Communications
| Hi-index | 0.00 |
Additive increase multiplicative decrease (AIMD) is the dominant algorithm for congestion avoidance and control in the Internet. The major goal of AIMD is to achieve fairness and efficiency in allocating resources. In the context of packet networks, AIMD attains its goal partially. We exploit here a property of AIMD-based data sources to share common knowledge, yet in a distributed manner; we use this as our departing point to achieve better efficiency and faster convergence to fairness.Our control model is based on the assumptions of the original AIMD algorithm; we show that both efficiency and fairness of AIMD can be improved. We call our approach AIMD with fast convergence (AIMD-FC). We present experimental results with TCP that match the expectations of our theoretical analysis.