Practical Implementation and Performance Evaluation of Random Linear Network Coding 


Vol. 40,  No. 9, pp. 1786-1792, Sep.  2015


PDF
  Abstract

Random linear network coding (RLNC) is widely employed to enhance the reliability of wireless multicast. In RLNC encoding/decoding, Galois Filed (GF) arithmetic is typically used since all the operations can be performed with symbols of finite bits. Considering the architecture of commercial computers, the complexity of arithmetic operations is constant regardless of the dimension of GF m, if m is smaller than 32 and pre-calculated tables are used for multiplication/division. Based on this, we show that the complexity of RLNC inversely proportional to m. Considering additional overheads, i.e., the increase of header length and memory usage, we determine the practical value of m. We implement RLNC in a commercial computer and evaluate the codec throughput with respect to the type of the tables for multiplication/division and the number of original packets to encode with each other.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

G. Lee, Y. Shin, J. Koo, S. Choi, "Practical Implementation and Performance Evaluation of Random Linear Network Coding," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 9, pp. 1786-1792, 2015. DOI: .

[ACM Style]

Gyujin Lee, Yeonchul Shin, Jonghoe Koo, and Sunghyun Choi. 2015. Practical Implementation and Performance Evaluation of Random Linear Network Coding. The Journal of Korean Institute of Communications and Information Sciences, 40, 9, (2015), 1786-1792. DOI: .

[KICS Style]

Gyujin Lee, Yeonchul Shin, Jonghoe Koo, Sunghyun Choi, "Practical Implementation and Performance Evaluation of Random Linear Network Coding," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 9, pp. 1786-1792, 9. 2015.