The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in changing environment. However, these objectives are contradicting in particular situations since the algorithm has to constantly probe available bandwidth, which may affect its stability, This paper proposes a novel congestion control algorithm that achieves high bandwidth utilization providing fairness among competing connections and, on the other hand, is sufficiently responsive to changes of available bandwidth. The main idea of the algorithm is to use adaptive setting for the additive increase/multiplicative decrease (AIMD) congestion control scheme, where parameters may change dynamically, with respect to the current network conditions.
|Number of pages||8|
|State||Published - 2003|
|Event||Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 - Boston, MA, United States|
Duration: 13 Jul 2003 → 16 Jul 2003
|Conference||Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003|
|Period||13/07/03 → 16/07/03|