Similar articles

Abstract: End-to-end TCP (transmission control protocol) congestion control can cause unfairness among multiple TCP connections with different RTT (Round Trip Time). The throughput of TCP connection is inversely proportional to its RTT. To resolve this problem, researchers have proposed many methods. The existing proposals for RTT-aware conditioner work well when congestion level is low. However, they over-protect long RTT flows and starve short RTT flows when congestion level is high. Due to this reason, an improved method based on adaptive thought is proposed. According to the congestion level of networks, the mechanism can adaptively adjust the degree of the protection to long RTT flows. Extensive simulation experiments showed that the proposed mechanism can guarantee the bandwidth fairness of TCP flows effectively and outperforms the existing methods.

[1] Allman, M., 2000. A web server’s view of transport layer. ACM Communication Review, 30(5):10-20.

[2] Chiu, D., Jain, R., 1989. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. ACM computer networks and ISDN systems, 17:1-14.

[3] Feng, W.C., Shin, K.G., Kandlur, D.D., Debanjan, S., 2002. The blue active queue management algorithms. IEEE/ACM Transactions on Networking, 10(4):513-528.

[4] Golestani, S.J., Sabnani, K.K., 1999. Fundamental observations on multicast congestion control in the Internet. IEEE In Proc. INFOCOM’99, 1:990-1000.

[5] Habib, A., Bhargava, B., Fahmy, S., 2002. A Round Trip Time and Time-out Aware Traffic Conditioner for Differentiated Service Networks. IEEE In Proc. ICC’02, p.981-985.

[6] Jeonghoon, M., Richard, J.L., Venkat, A., Jean, W., 1999. Analysis and comparison of TCP Reno and Vegas. IEEE In Proc. INFOCOM’99, 3:1556-1563.

[7] Mathis, M., Semke, J., Mahdavi, J., Ott, T., 1997. The macroscopic behavior of the TCP congestion avoidance algorithm. ACM Computer Communication Review, 27(3):67-82.

[8] Matsuda, T., Nagata, A., Yamamoto, M., 2002. TCP Rate Control Using Active ECN Mechanism with RTT-based Marking Probability. IEEE In Proc. CQR’02, p.112-116.

[9] Nandy, B., Seddigh, N., Pieda, P., Ethridge, J., 2000. Intelligent Traffic Conditions for Assured Forwarding Based Differentiated Service Networks. IFIP. High Performance Networking, p.187-198.

[10] Padhye, J., Firoiu,V., Towsley, D., 1998. Modeling TCP Throughput: A Simple Model and Its Empirical Validation. ACM In Proc SIGCOMM’88, p.303-314.

[11] Seddigh, N., Nandy, B., Pieda, P., 1999. Bandwidth assurance issues for TCP flows in a differentiated service network. IEEE GLOBECOM’99, 3:1792-1798.

[12] Stoica, I., Shenker, S., Zhang, H., 1998. Core-stateless Fair Queuing: Achieving Approximately Fair Bandwidth Allocations in High-Speed Networks. ACM In Proc. SIGCOMM’98, p.118-130.