Experimenting with τ-AIMD over wireless asynchronous networks

  • Authors:
  • Adrian Lahanas;Vassilis Tsaoussidis

  • Affiliations:
  • Department of Computer Science, University of Cyprus, Nicosia, Cyprus;Department of Electrical Engineering, Demokritos University, Xanthi, Greece

  • Venue:
  • Computer Communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.24

Visualization

Abstract

The work describes the performance of two congestion control algorithms: AIMD and @t-AIMD. The first is the default mechanism of TCP; the second is a proposed congestion control algorithm that improves fairness of AIMD. We consider asynchronous networks where TCP flows have different propagation delays, a portion of their link is wireless, and they compete for resources over a single bottleneck link. We show that @t-AIMD improves the performance of flows that have long propagation delay and the fairness of the network. In wireless links @t-AIMD outperforms AIMD and the cost of lost packets (or wasted energy) is the same as that of AIMD.