CS244 ’18: Reproducing Compound TCP

Jaspreet Kaur, Tucker Leavitt

Original Paper: Kun Tan et al. “A compound TCP approach for high-speed and long distance networks”. In: Proceedings-IEEE INFOCOM. 2006.

As the world becomes more interconnected, the importance of high speed and long distance networks is increasing. There is more focus on scalability than ever before. The standard TCP is unable to utilize the network capacity fully due to its conservative ”Additive Increase Multiplicative Decrease”(AIMD) algorithm. This project is based on reproducing the results of the paper on Compound TCP algorithm. Compound TCP overcomes the conservative nature of the TCP algorithm by combining the loss and delay based congestion control approaches. Hence, it can perform much better for high speed and long distance networks. This can be achieved by adding a scalable delay based component to the standard TCP. In this reproduction paper, we reproduce Table 1 and Figure 8 from the CTCP paper [8]. These figures describe the throughput of CTCP under different network conditions, and compare its performance to TCP. Our results are qualitatively consistent with the original paper, though our throughput measurements for both CTCP and TCP are lower.

Full Report.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s