RAUU: rate adaptation for unreliable unicast traffic in high speed networks

  • Authors:
  • Lihua Song;Haitao Wang;Ming Chen

  • Affiliations:
  • Institute of Command Automation, PLA Univ. of Sci. & Tech., Nanjing, China;Institute of Communication Engineering, PLA Univ. of Sci. & Tech., Nanjing, China;Institute of Command Automation, PLA Univ. of Sci. & Tech., Nanjing, China

  • Venue:
  • IPOM'07 Proceedings of the 7th IEEE international conference on IP operations and management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

While long term throughput not exceeding TCP with Reno congestion control algorithm is widely accepted as the criterion of weighing TCP friendliness, this may lead to resource waste in high speed networks due to Reno's known performance limits. Inspired by FAST TCP, a congestion control algorithm named Rate Adaptation for Unreliable Unicast traffic (RAUU) is proposed for unreliable unicast traffic in high speed networks to improve its efficiency while still holding friendliness to TCP. Being a rate-based approach to best fit unreliable unicast traffic, RAUU has made special design choices to alleviate the inherent contiguous loss problem of rate adaptation algorithms. Like FAST, it also tries to maintain appropriate number of extra packets in networks, and for that purpose it combines loss and delay as congestion signals. Theoretical analysis shows that in ideal networks RAUU has and will converge to its one and only equilibrium state where the number of extra packets is equal to the preset value. Plentiful simulation experiments confirmed that it could achieve similar performance to FAST as well as comparable throughput smoothness to TFRC while keeping TCP-friendliness at the same time.