Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/2962686.2962692guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
research-article
Free access

NCTCP: a network coded TCP protocol

Published: 03 April 2016 Publication History

Abstract

This paper presents the design of Network Coded TCP (NCTCP). NCTCP is a reliable TCP-like transport protocol that uses network coding to dramatically improve the overall performance in networks with lossy links. By sending datagrams that represent a linear combination of packets, we are able to receive data in an orderless fashion and still push data in byte-correct order to the receiver's application layer. To eliminate round off errors we generate consecutive-ones linear combinations of packets which form totally unimodular matrices. NCTCP has an Additive Increase Multiplicative Decrease (AIMD) congestion control mechanism that uses Round Trip Times to increase the performance on wireless networks without hurting the performance on wired networks. Unlike TCP, NCTCP does not use a congestion window and can be implemented in user space and hence does not need any changes to the kernel. We test our protocol using ns-2 simulator using several performance measurements, namely, throughput, goodput, efficiency and receiver efficiency. Our simulations show that NCTCP performs better than standard TCP implementations and previously proposed network coding protocols; TCP/NC and CTCP in terms of the aforementioned performance measures. We demonstrate that NCTCP is TCP-friendly and maintains the fairness property essential for the health of the Internet.

References

[1]
Jacobson V. "Congestion Avoidance and Control" SIGCOMM Symposium on Communications Architectures and Protocols, pp. 314--329, 1998.
[2]
H. Balakrishnan, V. N. Padmanabhan, S. Seshan, R. H. Katz, "A Comparison of Mechanisms for Improving TCP Performance over Wireless Links," in Proc. ACM SIGCOMM, 1996, pp. 256--269.
[3]
J. K. Sundararajan, D. Shah, M. Medard, M. Mitzenmacher, J. Barros, "Network coding meets TCP," in INFOCOM 2009, IEEE, 2009, pp. 280--288.
[4]
M. Kim, J. Cloud, A. ParandehGheibi, L. Urbina, K. Fouli, D. Leith, M. Medard, "Network Coded TCP (CTCP)," 2013.
[5]
R. Burden, J. D. Faires, "Pivoting Strategies," in Numerical Analysis, Sixth Edition, Pacific Grove, California, Brooks/Cole, 1997, pp. 366--369.
[6]
F. Winkler, "Bareiss's Algorithm," in Polynomial Algorithms in Computer Algebra, New York, Springer Wein, 1996, pp. 157--162.
[7]
Chee-Keng Yap, "Lecture X Linear Systems," in Fundamental Problems in Algorithmic Algebra, New York, Oxford University Press, 1999, pp. 258--266.
[8]
Erwin H. Bareiss, "Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination," in Math. Comp. 22, 1968, pp. 565--578.
[9]
Alexander Schrijver, "Totally Unimodular Matrices: Fundamental Properties and Examples," in Theory of Linear and Integer Programming. Baffins Lane, England, Wiley, 2000, pp. 266--268.
[10]
Jon Lee, "Totally Unimodular Matrices, Figures, and Digraphs," in A First Course in Combinatorial Optimization. Cambridge, Cambridge University Press, 2004, pp. 41--46.
[11]
Deanna Richelle Leggett, "Fraction-Free Methods for Determinants," M.S. thesis, University of Southern Mississippi, Hattiesburg, Mississippi, 2011.
[12]
J. K. Sundararajan, D. Shah, and M. Medard, "ARQ for network coding," in Proc. of 2008 IEEE International Symposium on Information Theory, 2008, pp. 1651--1656.
[13]
"The Network Simulator - ns-2," Available at: http://www.isi.edu/nsnam/ns/
[14]
B. Constantine, G. Forget, R. Geib, R. Schrage, Framework for TCP Throughput Testing, IETF RFC 6349, August 2011; www.rfc-editor.org/info/rfc6349.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
CNS '16: Proceedings of the 19th Communications & Networking Symposium
April 2016
56 pages
ISBN:9781510823174

Publisher

Society for Computer Simulation International

San Diego, CA, United States

Publication History

Published: 03 April 2016

Author Tags

  1. TCP
  2. TCP fairness
  3. TCP friendliness
  4. network coding

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 356
    Total Downloads
  • Downloads (Last 12 months)177
  • Downloads (Last 6 weeks)27
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media