Computer Science – Information Theory
Scientific paper
2010-11-15
Computer Science
Information Theory
To appear in IEEE Transactions on Information Theory Special Issue: Facets of Coding Theory: From Algorithms to Networks, Feb
Scientific paper
To reduce computational complexity and delay in randomized network coded content distribution, and for some other practical reasons, coding is not performed simultaneously over all content blocks, but over much smaller, possibly overlapping subsets of these blocks, known as generations. A penalty of this strategy is throughput reduction. To analyze the throughput loss, we model coding over generations with random generation scheduling as a coupon collector's brotherhood problem. This model enables us to derive the expected number of coded packets needed for successful decoding of the entire content as well as the probability of decoding failure (the latter only when generations do not overlap) and further, to quantify the tradeoff between computational complexity and throughput. Interestingly, with a moderate increase in the generation size, throughput quickly approaches link capacity. Overlaps between generations can further improve throughput substantially for relatively small generation sizes.
Li Yao
Soljanin Emina
Spasojevic Predrag
No associations
LandOfFree
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear 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 Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-462822