DSEP Fulcrum: Dynamic Sparsity and Expansion Packets for Fulcrum Network Coding

Abstract

Fulcrum coding combines a high-field outer Random Linear Network Coding (RLNC) that generates outer coding expansion packets with a small-field inner RLNC that combines the source packets and the outer coding expansion packets. This two-layer Fulcrum coding allows flexible decoding in receivers with heterogeneous computational capabilities. Fulcrum coding has so far only been studied for conventional dense RLNC, which randomly selects all coding coefficients, and only for a statically fixed number of outer expansion packets. However, the probability that the coding coefficient row of a newly received packet is linearly independent of prior received coding coefficient rows (a prerequisite for successful decoding) is highly dynamic. We propose to exploit the dynamics of this probability to reduce the computational complexity of Fulcrum coding. In particular, we vary the density of non-zero coding coefficients, i.e., equivalently, the sparsity of coding coefficients, and the number of outer expansion packets to keep the complexity low while maintaining a reasonably high decoding probability. We introduce the general principles of dynamic sparsity and expansion packets (DSEP) for Fulcrum coding as well as two specific example DSEP policies. Our evaluations indicate that DSEP Fulcrum can increase the encoding throughput tenfold and increase the decoding throughput 1.4 to 4.3 fold while achieving decoding probabilities that are typically less than 1% lower than the conventional Fulcrum decoding probabilities. We also find that DSEP achieves somewhat higher encoding and decoding throughputs than the CodornicesRq (Release 2.1) implementation of RaptorQ block coding for small blocks (generations) of source packets, while RaptorQ is substantially faster for large generation sizes. Furthermore, we develop and evaluate an elementary DSEP recoding mechanism that achieves a recoding throughput more than double the decoding throughput.

Real-Time Compression for Tactile Internet Data Streams

“…Another direction is to explore combinations of the source compression of the tactile Internet data stream with channel coding to make the tactile data stream transmissions robust against network impairments, e.g., wireless network errors. One potential approach is to explore flexible low-delay network coding that may interleave the tactile data stream with related data streams [ 53 , 54 , 55 , 56 ]. A broad future research direction is to explore how tactile data stream compression can cooperate with distributed computing, e.g., through multi-access edge computing or fog computing [ 57 , 58 , 59 , 60 ], of the tactile signals close to the sensing and actuation sites to achieve ultra-short round-trip computing for tactile applications.…”

Hardware-Accelerated Platforms and Infrastructures for Network Functions: A Survey of Enabling Technologies and Research Studies

“…The IS extensions have been utilized to accelerate hashing NFs [109], [110] and dynamic task scheduling [111]. Similar IS extensions have accelerated the complex network coding function [112], [113], [193] in a hardware design [114].…”

Super Generation Network Coding for Peer-to-Peer Content Distribution Networks

“…Fulcrum network coding (FNC) proposed by D. Lucani et al [29]- [31] is another variation of generation network coding that aims to alleviate the decoding complexity for heterogeneous small devices with limited power. This is accomplished by reducing the coding coefficients overhead, and allowing recoding at the intermediate nodes and decoding at the end nodes using GF (2).…”