Non-Asymptotic Analysis of Network Coding Delay

We present an expression for the delay distribution of Random Linear Network Coding over an erasure channel with a given loss probability. In contrast with previous contributions, our analysis is non- asymptotic in the sense that it is valid for any field size and any number of symbols. The results...

Full description

Saved in:
Bibliographic Details
Main Authors: Nistor, M, Costa, R A, Vinhoza, T T V, Barros, J
Format: Conference Proceeding
Language:eng ; jpn
Subjects:
Added delay
Automatic repeat request
Decoding
Feedback
Galois fields
Network coding
Peer to peer computing
Probability distribution
Telecommunication network reliability
Wireless networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present an expression for the delay distribution of Random Linear Network Coding over an erasure channel with a given loss probability. In contrast with previous contributions, our analysis is non- asymptotic in the sense that it is valid for any field size and any number of symbols. The results confirm that GF(16) already offers near-optimal decoding delay, whereas smaller field sizes (e.g. requiring only XOR operations) induce heavy tails in the delay distribution. A comparison with Automatic Repeat reQuest (ARQ) techniques (with perfect feedback) is also included.
ISSN:2374-9660
DOI:10.1109/NETCOD.2010.5487665