Research Article
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
@INPROCEEDINGS{10.1145/1190095.1190166, author={Shao Liu and Tamer Basar and R. Srikant}, title={TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks}, proceedings={1st International ICST Conference on Performance Evaluation Methodologies and Tools}, publisher={ACM}, proceedings_a={VALUETOOLS}, year={2012}, month={4}, keywords={Congestion Control TCP Reno NewReno SACK AIMD packet loss queueing delay throughput fairness stability}, doi={10.1145/1190095.1190166} }- Shao Liu
Tamer Basar
R. Srikant
Year: 2012
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
VALUETOOLS
ACM
DOI: 10.1145/1190095.1190166
Abstract
We introduce a new congestion control algorithm, called TCP-Illinois, which has many desirable properties for implementation in (very) high-speed networks. TCP-Illinois is a sender side protocol, which modifies the AIMD algorithm of the standard TCP (Reno, NewReno or SACK) by adjusting the increment/decrement amounts based on delay information. By using both loss and delay as congestion signals, TCP-Illinois achieves a better throughput than the standard TCP for high-speed networks. To study its fairness and stability properties, we extend recently developed stochastic matrix models of TCP to accommodate window size backoff probabilities that are proportional to arrival rates when the network is congested. Using this model, TCP-Illinois is shown to allocate the network resource fairly as in the standard TCP. In addition, TCP-Illinois is shown to be compatible with the standard TCP when implemented in today's networks, and is shown to provide the right incentive for transition to the new protocol. We finally perform ns-2 simulations to validate its properties and demonstrate its performance.