An algorithm for improving Sliding window Network Coding in TCP

Sliding-window Network Coding (NC) is a variation of Network Coding that is an addition to TCP/IP and improves the throughput of TCP on wireless networks. In this article, two implementations of a new algorithm are proposed in order to decrease the total transmission time, and to increase the decoding throughput throughout the transmission. The algorithm's main process identifies then retransmits the number of outstanding lost packets and is implemented in two different ways. The End of Transmission (EOT) implementation applies the process only once at the end of the transmission, whereas the “Pseudo-block” (PB) implementation applies the process at regular intervals throughout file transmission. The discrete event simulator ns-2 is used to implement and test the benefits of the proposed algorithm. Our extensive simulation results show that both implementations provide a sizeable decrease in average transmission time. For the first implementation (EOT), the average time to receive data decreased by 8.04% for small files (under 1 MB) compared to TCP/NC. The second implementation, PB, reduces file transmission times by up to 70% for larger files (GB range). Furthermore, PB creates a more even decoding throughput and allows for a smoother transmission. In this work, PB is shown to decrease the average standard deviation of the decoding throughput by over 60%. This decrease in decoding delay demonstrates the potential of sliding window NC in future streaming applications.

[1]  Yasir Saleem,et al.  Network Simulator NS-2 , 2015 .

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

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

[4]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[5]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[6]  Larry Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM 1994.

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

[8]  Jean C. Walrand,et al.  Analysis and comparison of TCP Reno and Vegas , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[9]  Shugong Xu,et al.  Comparison of TCP Reno and Vegas in wireless mobile ad hoc networks , 2000, Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000.

[10]  Muriel Médard,et al.  Modeling network coded TCP throughput: a simple model and its validation , 2011, VALUETOOLS.

[11]  G. Lusztig.  The algebra ℋ , 2003 .

[12]  Debashis Saha,et al.  A survey of tcp enhancements for last-hop wireless networks , 2006, IEEE Communications Surveys & Tutorials.

[13]  Baochun Li,et al.  R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming , 2007, IEEE Journal on Selected Areas in Communications.