Computer Science – Information Theory
Scientific paper
2009-01-30
Computer Science
Information Theory
9 pages, IEEE Infocom 2009
Scientific paper
Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to multiple receivers over independent packet erasure channels, we focus on the case of perfect feedback and heterogeneous erasure probabilities. Based on a general analytical framework for evaluating the decoding delay, we show that existing ARQ schemes fail to ensure that receivers with weak channels are able to recover from packet losses within reasonable time. To overcome this problem, we re-define the encoding rules in order to break the chains of linear combinations that cannot be decoded after one of the packets is lost. Our results show that sending uncoded packets at key times ensures that all the receivers are able to meet specific delay requirements with very high probability.
Barros João
Costa Rui A.
Munaretto Daniele
Widmer Joerg
No associations
LandOfFree
Effective Delay Control in Online 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 Effective Delay Control in Online Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effective Delay Control in Online Network Coding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-425039