Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
Observing TCP dynamics in real networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Some observations on the dynamics of a congestion control algorithm
ACM SIGCOMM Computer Communication Review
Towards a Rate-Based TCP Protocol for the Web
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Why TCP timers (still) don't work well
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
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.