On randomizing the sending times in TCP and other window based algorithms

Current implementations of TCP suffer from serious performance problems like unfairness to flows with higher round trip times (RTTs), synchronization of windows and phase effects in flows and correlated losses leading to throughput degradations under a wide range of scenarios. In this paper we show that by randomizing the packet sending times at TCP sources (called Randomized TCP) we can address a majority of these issues. Specifically, we propose to space successive packet transmissions with a time interval Δ = RTT(1 + x)/cwnd, where x is a zero mean random number drawn from an Uniform distribution. We find that an Uniform distribution on U[-1,1] is optimal with respect to metrics like throughput, fairness, timeouts, losses and de-synchronization. We show that the scheme is better than Paced as well as TCP Reno in a large number of scenarios. The proposed scheme is also fair with TCP Reno. We show through simple simulations that Randomized TCP reduces phase effects and synchronization even when multiplexed with TCP Reno. Also, we extend randomization to other window based schemes like the binomial schemes and show that fairness to TCP Reno increases dramatically.

[1]  Pravin Varaiya,et al.  The entropy of traffic streams in ATM virtual circuits , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[2]  Martin May,et al.  Analytic evaluation of RED performance , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Christophe Diot,et al.  Reasons not to deploy RED , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[4]  Eman Salaheddin Hashem,et al.  Analysis of Random Drop for Gateway Congestion Control , 1989 .

[5]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[6]  Amit Aggarwal,et al.  Understanding the performance of TCP pacing , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

[8]  Alhussein A. Abouzeid,et al.  Analytic understanding of RED gateways with multiple competing TCP flows , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[9]  Carey L. Williamson,et al.  Towards a rate-based TCP protocol for the Web , 2000, Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728).

[10]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.

[11]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[12]  Scott Shenker,et al.  Some observations on the dynamics of a congestion control algorithm , 1990, CCRV.

[13]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[14]  Jeffrey C. Mogul,et al.  Observing TCP dynamics in real networks , 1992, SIGCOMM '92.

[15]  Biplab Sikdar,et al.  Scalable configuration of RED queue parameters , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[16]  Deepak Bansal,et al.  Binomial congestion control algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).