\tau-AIMD for Asynchronous Receiver Feedback

  • Authors:
  • Adrian Lahanas;Vassilis Tsaoussidis

  • Affiliations:
  • -;-

  • Venue:
  • ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work we first describe an asynchronous-feedbackmodel which corresponds to the diverse round-trip times(RTTs) of competing flows within the same communicationchannel. We show that even when the feedback of the receivers/network is asynchronous, the duration of a congestionepoch represents "common knowledge" for the competingflows. Based on this property, we propose a diverselinear increase scheme in proportion to the RTT of eachflow and we adjust periodically the windows of the competingflows accordingly, in order to enhance fairness ofasynchronous-feedback environments. We name this scheme\tau-AIMD and show that fairness of flows in asynchronoussystems is improved since the increase-rate diversity of longand short RTT flows is largely canceled. We use the maxminnotion of fairness to show that \tau-AIMD can constitutethe foundation for other window-based, end-to-end algorithmsthat target a good balance between efficiency andfairness.