Improving Fairness and Stability in Best-Effort Service: A New Congestion Control Algorithm for SACK-TCP

Yukio ATSUMI  Eiichi KONDOH  Onur ALTINTA  Teruaki YOSHIDA  

IEICE TRANSACTIONS on Communications   Vol.E81-B   No.11   pp.2023-2033
Publication Date: 1998/11/25
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Performance and Quality of Service (QoS) of Multimedia Networks)
Category: IP Networks
TCP,  selective acknowledgement,  congestion control,  RED,  

Full Text: PDF>>
Buy this Article

In order to improve fairness and stability of TCP best-effort service we propose a new congestion control algorithm using packet loss information obtained from Selective Acknowledgments (SACK), and evaluate its effectiveness by simulation. The proposed scheme is for an environment consisting of Random Early Detection (RED) routers which drop each arriving packet with a certain probability after a threshold. The proposed mechanism adjusts the decrease in congestion window for Fast Recovery and the increase in congestion window per ACK during the congestion avoidance phase according to the number of lost packets. Simulation results show that not only the bandwidth allocation fairness is improved but also throughput deviation is markedly reduced resulting in more stable transport capability.