본문 바로가기
  • Home

Performance Evaluation of Finite Field Arithmetic Implementations in Network Coding

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2008, 13(2), pp.193-202
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

이철우 1 Joon-Sang Park 1

1홍익대학교

Accredited

ABSTRACT

Using Network Coding in P2P systems yields great benefits, e.g., reduced download delay. The core notion of Network Coding is to allow encoding and decoding at intermediate nodes, which are prohibited in the traditional networking. However, improper implementation of Network Coding may reduce the overall performance of P2P systems. Network Coding cannot work with general arithmetic operations, since its arithmetic is over a Finite Field and the use of an efficient Finite Field arithmetic algorithm is the key to the performance of Network Coding. Also there are other important performance parameters in Network Coding such as Field size. In this paper we study how those factors influence the performance of Network Coding based systems. A set of experiments shows that overall performance of Network Coding can vary 2-5 times by those factors and we argue that when developing a network system using Network Coding those performance parameters must be carefully chosen.

Citation status

* References for papers published after 2023 are currently being built.

This paper was written with support from the National Research Foundation of Korea.