On the Performance of the Cache Coding Protocol

Maboudi, Behnaz; Sehat, Hadi; Pahlevani, Peyman; Lucani, Daniel E.

doi:10.3390/info9030062

Cited by 2 publications

(1 citation statement)

References 18 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RLNC reduces the number of transmissions needed to achieve a prescribed resilience level (probability of packet delivery) and has the potential to reduce transmission delays. RLNC is well suited for wireless data transmissions [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19], data storage [20][21][22][23], and content distribution [24][25][26][27][28][29][30]. The practical usage of RLNC for the wide range of communication applications in emerging cyber-physical systems (CPS) and the internet of things (IoT) as introduced by fifth generation (5G) wireless systems requires high RLNC encoding and decoding throughput while consuming only low amounts of energy.…”

Section: Introductionmentioning

confidence: 99%

Hardware Acceleration for RLNC: A Case Study Based on the Xtensa Processor with the Tensilica Instruction-Set Extension

et al. 2018

View full text Add to dashboard Cite

Random linear network coding (RLNC) can greatly aid data transmission in lossy wireless networks. However, RLNC requires computationally complex matrix multiplications and inversions in finite fields (Galois fields). These computations are highly demanding for energy-constrained mobile devices. The presented case study evaluates hardware acceleration strategies for RLNC in the context of the Tensilica Xtensa LX5 processor with the tensilica instruction set extension (TIE). More specifically, we develop TIEs for multiply-accumulate (MAC) operations for accelerating matrix multiplications in Galois fields, single instruction multiple data (SIMD) instructions operating on consecutive memory locations, as well as the flexible-length instruction extension (FLIX). We evaluate the number of clock cycles required for RLNC encoding and decoding without and with the MAC, SIMD, and FLIX acceleration strategies. We also evaluate the RLNC encoding and decoding throughput and energy consumption for a range of RLNC generation and code word sizes. We find that for GF ( 2 8 ) and GF ( 2 16 ) RLNC encoding, the SIMD and FLIX acceleration strategies achieve speedups of approximately four hundred fold compared to a benchmark C code implementation without TIE. We also find that the unicore Xtensa LX5 with SIMD has seven to thirty times higher RLNC encoding and decoding throughput than the state-of-the-art ODROID XU3 system-on-a-chip (SoC) operating with a single core; the Xtensa LX5 with FLIX, in turn, increases the throughput by roughly 25% compared to utilizing only SIMD. Furthermore, the Xtensa LX5 with FLIX consumes roughly four orders of magnitude less energy than the ODROID XU3 SoC.

show abstract

Section: Introductionmentioning

confidence: 99%

Hardware Acceleration for RLNC: A Case Study Based on the Xtensa Processor with the Tensilica Instruction-Set Extension

et al. 2018

View full text Add to dashboard Cite

show abstract

Security overhead of random linear network coding in multicast relay networks

Maboudi

Pahlevani

2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

The relays in random linear network coding (RLNC) approach recode and transmit the coded packets to boost the performance against packet loss. However, this can endanger the system to pollution attacks, which can be eliminated by Homomorphic message authentication code (HMAC). Cache coding limits RLNC by coding only the decoded packets in the relays. In the other words, the relay node in cache coding first decodes the coded packets, then recodes and protects them by a MAC‐based scheme that allows the next hop to discover the pollution in the network. This study provides analytical models for cache coding and RLNC to compare their communication overhead. First, we approximate the number of transmissions in a network consisting several relays. The approximation models are for the cases of a few and large number of relays. Then, we validate our analysis using simulation results and illustrate that cache coding can eliminate the pollution attack issue of RLNC with only a slight increase in the bandwidth usage when there are no malicious nodes in the network. Moreover, we conclude that it is more beneficial to employ the cache coding approach at the presence of malicious nodes in the network.

show abstract

On the Performance of the Cache Coding Protocol

Cited by 2 publications

References 18 publications

Hardware Acceleration for RLNC: A Case Study Based on the Xtensa Processor with the Tensilica Instruction-Set Extension

Hardware Acceleration for RLNC: A Case Study Based on the Xtensa Processor with the Tensilica Instruction-Set Extension

Security overhead of random linear network coding in multicast relay networks

Contact Info

Product

Resources

About