TCP flow control in lossy networks: analysis and enhancement
NETWORKS '92 Proceedings of the IFIP TC6 Working Conference on Computer Networks, Architecture, and Applications. on Computer networks, architecture and applications
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
A comparison of mechanisms for improving TCP performance over wireless links
IEEE/ACM Transactions on Networking (TON)
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Microwave Mobile Communications
Microwave Mobile Communications
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Analysis and design of a reliable wireless transport protocol and fair network mechanisms for the internet
Improving the performance of reliable transport protocols in mobile computing environments
IEEE Journal on Selected Areas in Communications
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
An analytical model of fast retransmission and recovery in TCP-SACK
Performance Evaluation
Interactive transparent networking-modeling examples of snoop and WTCP protocols
Computer Communications
Interactive Transparent Networking: Protocol meta modeling based on EFSM
Computer Communications
Hi-index | 0.01 |
In this paper, we investigate the behavior of the various Transmission Control Protocol (TCP) algorithms over wireless links with correlated packet losses. For such a scenario, we show that the performance of NewReno is worse than the performance of Tahoe in many situations and even OldTahoe in a few situations because of the inefficient fast recovery method of NewReno. We also show that random loss leads to significant throughput deterioration when either the product of the square of the bandwidth-delay ratio and the loss probability when in the good state exceeds one, or the product of the bandwidth-delay ratio and the packet success probability when in the bad state is less than two. The performance of Sack is always seen to be the best and the most robust, thereby arguing for the implementation of TCP Sack over the wireless channel. We also show that under certain conditions the performance depends not only on the bandwidth-delay product but also on the nature of timeout, coarse or fine. We have also investigated the effects of reducing the fast retransmit threshold.