Provided by: Cornell University
Date Added: Jul 2012
In this paper, the authors analyze the coding delay and the average coding delay of random linear network codes (a.k.a. dense codes) and Chunked Codes (CC), which are an attractive alternative to dense codes due to their lower complexity, over line networks with Bernoulli losses and deterministic regular or Poisson transmissions. Their results, which include upper bounds on the delay and the average delay, are for dense codes, in some cases more general, and in some other cases tighter, than the existing bounds, and provide a more clear picture of the speed of convergence of dense codes to the (min-cut) capacity of line networks; and the first of their kind for CC over networks with such probabilistic traffics.