Computer Science – Information Theory
Scientific paper
2008-02-13
Computer Science
Information Theory
Submitted to the 2008 IEEE International Symposium on Information Theory (ISIT 2008)
Scientific paper
A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with stochastic arrivals and full feedback, but the proposed scheme is potentially applicable to more general lossy networks with link-by-link feedback. The algorithm guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom (also called the virtual queue size). The new notion of a node "seeing" a packet is introduced. In terms of this idea, our algorithm may be viewed as a natural extension of ARQ schemes to coded networks. Our approach, known as the drop-when-seen algorithm, is compared with a baseline queuing approach called drop-when-decoded. It is shown that the expected queue size for our approach is $O(\frac1{1-\rho})$ as opposed to $\Omega(\frac1{(1-\rho)^2})$ for the baseline approach, where $\rho$ is the load factor.
Medard Muriel
Shah Devavrat
Sundararajan Jay Kumar
No associations
LandOfFree
ARQ for Network Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with ARQ for Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and ARQ for Network Coding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-676288