The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Network Coding Meets TCP: Theory and Implementation
Open accessAbstract
The theory of network coding promises significant benefits in network performance, especially in lossy networks and in multicast and multipath scenarios. To realize these benefits in practice, we need to understand how coding across packets interacts with the acknowledgment (ACK)-based flow control mechanism that forms a central part of today's Internet protocols such as transmission control protocol (TCP). Current approaches such as rateless codes and batch-based coding are not compatible with TCP's retransmission and sliding-window mechanisms. In this paper, we propose a new mechanism called TCP/NC 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. Thus, our new TCP ACK rule takes into account the network coding operations in the lower layer and enables a TCP-compatible sliding-window approach to network coding. Coding essentially masks losses from the congestion control algorithm and allows TCP/NC to react smoothly to losses, resulting in a novel and effective approach for congestion control over lossy networks such as wireless networks. An important feature of our solution is that it allows intermediate nodes to perform re-encoding of packets, which is known to provide significant throughput gains in lossy networks and multicast scenarios. Simulations show that our scheme, with or without re-encoding inside the network, achieves much higher throughput compared to TCP over lossy wireless links. We present a real-world implementation of this protocol that addresses the practical aspects of incorporating network coding and decoding with TCP's window management mechanism. We work with TCP-Reno, which is a widespread and practical variant of TCP. Our implementation significantly advances the goal of designing a deployable, general, TCP-compatible protocol that provides the benefits of network coding.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.807285 · Cited by 3,378
Luby, M. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181950 · Cited by 2,757
A Random Linear Network Coding Approach to Multicast
Ho, T., Medard, M., Koetter, R., Karger, D. R., Effros, M., Shi, J., & Leong, B. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881746 · Cited by 2,553
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,413
An algebraic approach to network coding
Koetter, R., & Medard, M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818197 · Cited by 2,356
XORs in the Air: Practical Wireless Network Coding
Katti, S., Rahul, H., Hu, W., Katabi, D., Medard, M., & Crowcroft, J. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.923722 · Cited by 2,252
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
Chung, S.-Y., Forney, G. D., Richardson, T. J., & Urbanke, R. (2001) · IEEE Communications Letters · doi:10.1109/4234.905935 · Cited by 1,539
ExOR: opportunistic multi-hop routing for wireless networks
Biswas, S., & Morris, R. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080108 · Cited by 1,349
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190317 · Cited by 1,198
Trading structure for randomness in wireless opportunistic routing
Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282400 · Cited by 1,082
Bertsekas, D. P., & Gallager, R. G. (1992) · Prentice-Hall, Inc eBooks · Cited by 852
Stevens, W. R. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 766
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190317 · Cited by 698
Improving reliable transport and handoff performance in cellular wireless networks
Balakrishnan, H., Seshan, S., & Katz, R. H. (1995) · Wireless Networks · doi:10.1007/bf01985757 · Cited by 677
A digital fountain approach to asynchronous reliable multicast
Byers, J. W., Luby, M., & Mitzenmacher, M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803996 · Cited by 580
Self-citationOn coding for reliable communication over packet networks
Lun, D. S., Médard, M., Koetter, R., & Effros, M. (2008) · Physical Communication · doi:10.1016/j.phycom.2008.01.006 · Cited by 559
Self-citationTrading structure for randomness in wireless opportunistic routing
Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282400 · Cited by 485
Capacity of wireless erasure networks
Dana, A. F., Gowaikar, R., Palanki, R., Hassibi, B., & Effros, M. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864424 · Cited by 389
Mathematical techniques of applied probability
Hunter, J. J. (1983) · Cited by 260
Throughput performance of transport-layer protocols over wireless LANs
DeSimone, A., Chuah, M. C., & Yue, O.-C. (2002) · Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference · doi:10.1109/glocom.1993.318140 · Cited by 205
Hengartner, U., Bolliger, J., & Gross, T. R. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832553 · Cited by 134
Networking from a network coding perspective
Ho, T. (2004) · Cited by 55
Cited by
NC-MAC: Network Coding-based Distributed MAC Protocol for Reliable Beacon Broadcasting in V2X
Mosavat-Jahromi, H., Li, Y., Cai, L., & Lu, L. (2020) · GLOBECOM 2020 - 2020 IEEE Global Communications Conference · doi:10.1109/globecom42002.2020.9348080 · Cited by 11
Metadata
- Authors
- Sundararajan, J. K., Shah, D., Médard, M., Jakubczak, S., Mitzenmacher, M., & Barros, J.
- Venue
- Proceedings of the IEEE
- Published
- 2011-03
- Volume
- 99
- Issue
- 3
- Pages
- 490-512
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2134795104
- Cited by
- 277
- References
- 24
- FWCI
- 38.39
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.