Coding Delay Analysis of Chunked Codes over Line Networks

TL;DR

This paper provides the first analysis of coding delay and average delay for Chunked network Codes over line networks with probabilistic traffic, demonstrating their efficiency and improved tradeoffs over deterministic traffics.

Contribution

It introduces upper bounds on delay metrics for Chunked codes over networks with Bernoulli losses and probabilistic transmissions, a novel contribution in this context.

Findings

Chunked codes outperform deterministic traffics in delay performance.

Stand-alone and pre-coded Chunked codes offer better complexity-capacity tradeoffs.

Results include the first delay bounds for CC over probabilistic traffics.

Abstract

In this paper, we analyze the coding delay and the average coding delay of Chunked network Codes (CC) over line networks with Bernoulli losses and deterministic regular or Poisson transmissions. Chunked codes are an attractive alternative to random linear network codes due to their lower complexity. Our results, which include upper bounds on the delay and the average delay, are the first of their kind for CC over networks with such probabilistic traffics. These results demonstrate that a stand-alone CC or a precoded CC provides a better tradeoff between the computational complexity and the convergence speed to the network capacity over the probabilistic traffics compared to arbitrary deterministic traffics. The performance of CC over the latter traffics has already been studied in the literature.