Abstract

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 can be improved without entailing any performance tradeoff. We present experimental results with TCP SACK that match the expectations of our theoretical analysis.

Download the electronic version of the paper ( aimd-fc.ps.gz - 72 K).

The NS-2 implementation of the algorithm is available in one file: tcp-aimdfc.cc (4 K). See the file header for installation instructions and other info.
Download a quick documentation of the code aimdfcdoc.ps.gz (14 K).

Other references

• A. Lahanas and V. Tsaoussidis, "Additive Increase Multiplicative Decrease - Fast Convergence (AIMD-FC)", In Proccedings of Networks 2002 , Atlanta, Georgia, 26-29 August 2002.
  
• A. Lahanas and V. Tsaoussidis, "Fairness and Efficiency in High Speed Networks: AIMD-FC: Additive Increase Multiplicative Decrease - Fast Convergence", The International Workshop on High Speed Networking (HSN 2002), , New York, June 2002.
  

Back to publications list .

Last updated: 8 July, 2002.