By Topic

Trying Linear Network Coding on a Network Flow Processor

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Peng Cao ; Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China ; Long Zheng ; Yanchao Lu ; Feilong Tang
more authors

Nowadays network coding has attracted a lot of attentions from researchers in fields of information and coding theory, wireless communications, P2P, etc, as it has enormous potential to improve network throughput and to utilize the maximum bandwidth in networks. Whereas due to its high computation complexity, it is not easy to implement network coding in a real network environment. Network Flow Processor (NFP) is a multi-core specific processor, widely used in switches, routers. NPF has a powerful computation capacity, since it is composed of 40 cores and each core can concurrently executes up to 8 threads. In this paper, we discuss about the network coding fundamental and the NFP architecture in order to make NFP support the encoding function of network coding. During the implementation of network coding on NFP, we use loop-based and table-based approaches for multiplication in finite field. With our experimental results, a single card of NFP can offer a throughput of encoding up to 43.9Mbps.

Published in:

Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), 2011 Fifth International Conference on

Date of Conference:

June 30 2011-July 2 2011