Network coding meets TCP
Name
Sundararajan-2009-Network coding meets TCP.pdf
Size
250.28 KB
Format
Adobe PDF
Checksum (MD5)
7347dc4a0006d57c45c43e8d8e698d5d
Author(s)
Barros, Joao
Mitzenmacher, Michael
Sundararajan, Jay-Kumar
Shah, Devavrat
Medard, Muriel
Date Issued
June 2009
Journal
IEEE INFOCOM 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Sundararajan, J.K. et al. “Network Coding Meets TCP.” INFOCOM 2009, IEEE. 2009. 280-288. © 2009 IEEE
Version
Final published version
Abstract
We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the source transmits random linear combinations of packets currently in the congestion window. At the heart of our scheme is a new interpretation of ACKs - the sink acknowledges every degree of freedom (i.e., a linear combination that reveals one unit of new information) even if it does not reveal an original packet immediately. Such ACKs enable a TCP-compatible sliding-window approach to network coding. Our scheme has the nice property that packet losses are essentially masked from the congestion control algorithm. Our algorithm therefore reacts to packet drops in a smooth manner, resulting in a novel and effective approach for congestion control over networks involving lossy links such as wireless links. Our scheme also allows intermediate nodes to perform re-encoding of the data packets. Our simulations show that our algorithm, with or without re-encoding inside the network, achieves much higher throughput compared to TCP over lossy wireless links. We also establish the soundness and fairness properties of our algorithm. Finally, we present queuing analysis for the case of intermediate node re-encoding.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2009.5061931
