Comparison of Parallelized Network Coding Performance


KIPS Transactions on Computer and Communication Systems, Vol. 19, No. 4, pp. 247-252, Aug. 2012
10.3745/KIPSTC.2012.19.4.247,   PDF Download:

Abstract

Network coding has been shown to improve various performance metrics in network systems. However, if network coding is implemented as software a huge time delay may be incurred at encoding/decoding stage so it is imperative for network coding to be parallelized to reduce time delay when encoding/decoding. In this paper, we compare the performance of parallelized decoders for random linear network coding (RLC) and pipeline network coding (PNC), a recent development in order to alleviate problems of RLC. We also compare multi-threaded algorithms on multi-core CPUs and massively parallelized algorithms on GPGPU for PNC/RLC.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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]
J. S. Park, S. M. Choi and S. H. Ahn, "Comparison of Parallelized Network Coding Performance," KIPS Journal C (2001 ~ 2012) , vol. 19, no. 4, pp. 247-252, 2012. DOI: 10.3745/KIPSTC.2012.19.4.247.

[ACM Style]
Joon Sang Park, Seong Min Choi, and Sang Hyun Ahn. 2012. Comparison of Parallelized Network Coding Performance. KIPS Journal C (2001 ~ 2012) , 19, 4, (2012), 247-252. DOI: 10.3745/KIPSTC.2012.19.4.247.