Accumulation-based congestion control

  • Authors:

  • Yong Xia;David Harrison;Shivkumar Kalyanaraman;Kishore Ramachandran;Arvind Venkatesan

  • Affiliations:

  • Microsoft Corporation, Redmond, WA;Electrical Engineering and Computer Science Department, University of California, Berkeley, CA;Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY;WINLAB, Rutgers, The State University of New Jersey, Piscataway, NJ;Bloomberg L.P., New York, NY

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper generalizes the TCP Vegas congestion avoidance mechanism and uses accumulation, buffered packets of a flow inside network routers, as a congestion measure based on which a family of congestion control schemes can be derived. We call this model Accumulation-based Congestion Control (ACC), which fits into the nonlinear optimization framework proposed by Kelly. The ACC model serves as a reference for packet-switching network implementations. We show that TCP Vegas is one possible scheme under this model. It is well known that Vegas suffers from round trip propagation delay estimation error and reverse path congestion. We therefore design a new Monaco scheme that solves these problems by employing an out-of-band, receiver-based accumulation estimator, with the support of two FIFO priority queues from the (congested) routers. Comparisons between these two schemes demonstrate that Monaco does not suffer from the problems mentioned above and achieves better performance than Vegas. We use ns-2 simulations and Linux implementation experiments to show that the static and dynamic performance of Monaco matches the theoretic results. One key issue regarding the ACC model in general, i.e., the scalability of bottleneck buffer requirement, and a solution using a virtual queueing algorithm are discussed and evaluated.