Functioning of TCP Algorithms over a Wireless Link
Abstract
In this paper, the authors investigate the behavior of the various algorithms of Transmission Control Protocol (TCP), the internet data transport protocol, over wireless links with correlated packet losses. For such a scenario, they show that the performance of NewReno is worse than the performance of Tahoe in many situations, and even OldTahoe in a few situations, on account of the inefficient fast recovery method of NewReno. They 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 1, 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. They also show that, under certain conditions, the performance depends not only on the bandwidth-delay product, but also on the nature of timeout, whether coarse or fine. They also have investigated the effects of reducing the fast retransmit threshold.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 28, 1999
- Accession Number
- ADA439655
Entities
People
- Farooq M. Anjum
- Leandros Tassiulas
Organizations
- University of Maryland