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 decodi...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
| Online Access: | http://hdl.handle.net/1721.1/90429 https://orcid.org/0000-0003-4059-407X |
| _version_ | 1826206097466195968 |
|---|---|
| author | Karafillis, P. Fouli, Kerim ParandehGheibi, Ali Medard, Muriel |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Karafillis, P. Fouli, Kerim ParandehGheibi, Ali Medard, Muriel |
| author_sort | Karafillis, P. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T13:24:03Z |
| format | Article |
| id | mit-1721.1/90429 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:24:03Z |
| publishDate | 2014 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/904292022-10-01T14:59:24Z An algorithm for improving Sliding window Network Coding in TCP Karafillis, P. Fouli, Kerim ParandehGheibi, Ali Medard, Muriel Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Fouli, Kerim ParandehGheibi, Ali Medard, Muriel 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. 2014-09-29T15:10:57Z 2014-09-29T15:10:57Z 2013-03 Article http://purl.org/eprint/type/ConferencePaper 978-1-4673-5239-0 978-1-4673-5237-6 978-1-4673-5238-3 http://hdl.handle.net/1721.1/90429 Karafillis, P., K. Fouli, A. ParandehGheibi, and M. Medard. “An Algorithm for Improving Sliding Window Network Coding in TCP.” 2013 47th Annual Conference on Information Sciences and Systems (CISS) (March 2013). https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1109/CISS.2013.6552263 Proceedings of the 2013 47th Annual Conference on Information Sciences and Systems (CISS) Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
| spellingShingle | Karafillis, P. Fouli, Kerim ParandehGheibi, Ali Medard, Muriel An algorithm for improving Sliding window Network Coding in TCP |
| title | An algorithm for improving Sliding window Network Coding in TCP |
| title_full | An algorithm for improving Sliding window Network Coding in TCP |
| title_fullStr | An algorithm for improving Sliding window Network Coding in TCP |
| title_full_unstemmed | An algorithm for improving Sliding window Network Coding in TCP |
| title_short | An algorithm for improving Sliding window Network Coding in TCP |
| title_sort | algorithm for improving sliding window network coding in tcp |
| url | http://hdl.handle.net/1721.1/90429 https://orcid.org/0000-0003-4059-407X |
| work_keys_str_mv | AT karafillisp analgorithmforimprovingslidingwindownetworkcodingintcp AT foulikerim analgorithmforimprovingslidingwindownetworkcodingintcp AT parandehgheibiali analgorithmforimprovingslidingwindownetworkcodingintcp AT medardmuriel analgorithmforimprovingslidingwindownetworkcodingintcp AT karafillisp algorithmforimprovingslidingwindownetworkcodingintcp AT foulikerim algorithmforimprovingslidingwindownetworkcodingintcp AT parandehgheibiali algorithmforimprovingslidingwindownetworkcodingintcp AT medardmuriel algorithmforimprovingslidingwindownetworkcodingintcp |