Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control.

DOI10.1016/S1389-1286(03)00269-XMaRDI QIDQ1426534zbMATH OpenFDO

Authors A. Lahanas, Vassilis Tsaoussidis

Publication date 15 March 2004

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1389-1286(03)00269-X

zbMATH Keywords

AIMDCongestion controlEfficiencyFairnessTCP

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Analysis and design of AIMD congestion control algorithms in communication networks
• An ergodic AIMD algorithm with application to high-speed networks
• Adaptive AIMD congestion control
• Adaptive AIMD congestion control
• On the competitiveness of AIMD-TCP within a general network

Cited in

(11)

• On the properties of an additive increase rate accelerator
• Analysis and design of AIMD congestion control algorithms in communication networks
• Distributed resource management with heterogeneous linear controls
• Optimization based AIMD saturated algorithms for public charging of electric vehicles
• A decentralized adaptive algorithm for fair allocation of a shared resource
• Nonlinear AIMD congestion control and contraction mappings
• TAIMD: a TCP-friendly rate controlling algorithm using two-step AIMD
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• An ergodic AIMD algorithm with application to high-speed networks
• Adaptive AIMD congestion control
• Adaptive AIMD congestion control

This page was built for publication: Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426534)