Online network coding for optimal throughput and delay -- the three-receiver case

Details Online network coding for optimal throughput and delay -- the three-receiver case Online network coding for optimal throughput and delay -- the three-receiver case

2008-06-26

arxiv.org/abs/0806.4264v2

Computer Science

Information Theory

This is the final version. The content has been changed to incorporate reviewer comments and recent results

Scientific paper

For a packet erasure broadcast channel with three receivers, we propose a new coding algorithm that makes use of feedback to dynamically adapt the code. Our algorithm is throughput optimal, and we conjecture that it also achieves an asymptotically optimal average decoding delay at the receivers. We consider heavy traffic asymptotics, where the load factor \rho approaches 1 from below with either the arrival rate (\lambda) or the channel parameter (\mu) being fixed at a number less than 1. We verify through simulations that our algorithm achieves an asymptotically optimal decoding delay of O(1/(1-\rho)).

Affiliated with

Also associated with

No associations

Rating

Online network coding for optimal throughput and delay -- the three-receiver case 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 Online network coding for optimal throughput and delay -- the three-receiver case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online network coding for optimal throughput and delay -- the three-receiver case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-246025