IBM Israel Research Seminars

The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in a changing environment. However, these objectives are contradicting in particular situations since the algorithm constantly has to 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.

Joint work with Yishay Mansour.

About the Speaker
Alex Kesselman completed his B.Sc. in Math & Computer Science and M.Sc. in Computer Science at the Ben Gurion University in 1995 and 1998, respectively. He received his Ph.D. in Computer Science from the Tel Aviv University in 2003. Subsequently, Alex was a postdoc at Universita di Roma La Sapienza and Max-Plank Institut fur Informatik. Following that, he worked as a Network Scientist at Corvil Networks (Dublin) and Zeus Technology (Cambridge). His research mainly focuses on algorithms for network optimization including QoS Internet Switches, Network Protocols, Wireless Ad Hoc and Sensor Networks and Game Theory in Computer Networks.