LT Network Codes

This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast belief propagation decoding instead of high complexity Gauss reduction used by random linear network coding (RLNC). In the context of a peer-to-peer content dissemination application, we observe that LTNC trades advantageously communication optimality of RLNC with decoding cost as it incurs only 38.5% of bandwidth overhead for a gain of almost 99% in CPU cycles. Categories and Subject Descriptors C.2.4 [Computer Systems Organization]: ComputerCommunications NetworksDistributed Systems General Terms Algorithms, Design, Performance, Theory Keywords LT Codes, Network Coding, Peer-to-peer Networks

• Type: Conference
• Year: 2010
• Where: ICDCS
• Authors: Mary-Luc Champel, Kévin Huguenin, Anne-Marie Kermarrec, Nicolas Le Scouarnec
• Keywords: Complexity Network Codes, Distributed And Parallel Computing, ICDCS 2010, LT Codes, Network Coding