Performance of TCP on wireless fading links with memory

In this paper, the bulk throughput performance of TCP NewReno over wireless fading links having memory is studied. Like TCP Tahoe, the NewReno version of TCP implements a fast retransmit procedure, but it uses a different congestion window adaptation algorithm. In this study, we show that, for the d...

Full description

Saved in:
Bibliographic Details
Published in1998 IEEE International Conference on Communications Vol. 1; pp. 595 - 600 vol.1
Main Authors Chockalingam, A., Zorzi, M., Rao, R.R.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1998
Subjects
Electronic mail
Error analysis
Fading
Random access memory
Rayleigh channels
TCPIP
Throughput
Transport protocols
Web and internet services
Wireless communication
Online AccessGet full text

Cover

More Information
Summary:In this paper, the bulk throughput performance of TCP NewReno over wireless fading links having memory is studied. Like TCP Tahoe, the NewReno version of TCP implements a fast retransmit procedure, but it uses a different congestion window adaptation algorithm. In this study, we show that, for the default parameters of the BSD implementation of TCP over a 1.5 Mbps wireless link having a very small bandwidth-delay product, and as long as sufficiently large advertised window sizes are used, the burstiness in packet errors caused by slow multipath fading (experienced by slow moving users) significantly benefits NewReno compared to i.i.d. packet errors (experienced at vehicular user speeds). We further show that, in such slow fading conditions, NewReno performs no better than Tahoe, mainly due to the high degree of correlation in the fading process.
ISBN:0780347889
9780780347885
DOI:10.1109/ICC.1998.682956