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)

zbMATH Keywords

TCPAIMDEfficiencyFairnessCongestion control

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

(10)

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

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)