Modeling network coded TCP throughput: a simple model and its validation

We analyze the performance of TCP and TCP with network coding (TCP/NC) in lossy wireless networks. We build upon the simple framework introduced by Padhye et al. and characterize the throughput behavior of classical TCP as well as TCP/NC as a function of erasure rate, round-trip time, maximum window size, and duration of the connection. Our analytical results show that network coding masks random erasures from TCP, thus preventing TCP's performance degradation in lossy networks (e.g. wireless networks). It is further seen that TCP/NC has significant throughput gains over TCP. Our analysis and simulation results show very close concordance and support that TCP/NC is robust against erasures. TCP/NC is not only able to increase its window size faster but also to maintain a large window size despite the random losses, whereas TCP experiences window closing because losses are mistakenly attributed to congestion. Note that network coding only masks random erasures, and allows TCP to react to congestion; thus, when there are correlated losses, TCP/NC also closes its window.

[1]  Devavrat Shah,et al.  Network Coding Meets TCP , 2008, IEEE INFOCOM 2009.

[2]  Sally Floyd,et al.  An Extension to the Selective Acknowledgement (SACK) Option for TCP , 2000, RFC.

[3]  Muriel Médard,et al.  Interfacing network coding with TCP: an implementation , 2009, ArXiv.

[4]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[5]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

[6]  Fernando Paganini,et al.  Internet congestion control , 2002 .

[7]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[8]  J. Limb,et al.  Editorial on the IEEE/OSA Journal of Lightwave Technology and the IEEE Journal on Selected Areas in Communications , 1986 .

[9]  François Baccelli,et al.  Impact of TCP-like congestion control on the throughput of multicast groups , 2002, TNET.

[10]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[11]  R. Srikant,et al.  Exponential-RED: a stabilizing AQM scheme for low- and high-speed TCP protocols , 2005, IEEE/ACM Trans. Netw..

[12]  Nirwan Ansari,et al.  TCP in wireless environments: problems and solutions , 2005, IEEE Communications Magazine.

[13]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[14]  Liviu Iftode,et al.  Improving the Performance of Reliable Transport Protocols in Mobile Computing Environments , 1994, IEEE J. Sel. Areas Commun..

[15]  Baochun Li,et al.  CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding , 2008, 2008 IEEE International Conference on Network Protocols.

[16]  Jörg Widmer,et al.  Effective Delay Control in Online Network Coding , 2009, IEEE INFOCOM 2009.

[17]  Srinivasan Seshan,et al.  A comparison of mechanisms for improving TCP performance over wireless links , 1996, SIGCOMM 1996.

[18]  Marco Ajmone Marsan,et al.  Modeling short-lived TCP connections with open multiclass queuing networks , 2004, Comput. Networks.

[19]  Eitan Altman,et al.  Analysis of two competing TCP/IP connections , 2002, Perform. Evaluation.

[20]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[21]  Larry L. Peterson,et al.  Understanding TCP Vegas: a duality model , 2001, JACM.