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

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).

[1]  A. Beimel,et al.  RT Oblivious Erasure Correcting , 2004, IEEE/ACM Transactions on Networking.

[2]  Emin Martinian,et al.  Dynamic information and constraints in source and channel coding , 2004 .

[3]  Devavrat Shah,et al.  ARQ for network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[4]  L. Keller,et al.  Online Broadcasting with Network Coding , 2008, 2008 Fourth Workshop on Network Coding, Theory and Applications.

[5]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[6]  Jeffrey J. Hunter Discrete Time Models : Techniques and Applications , 1983 .

[7]  Thinh Nguyen,et al.  A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks , 2008, 2008 Fourth Workshop on Network Coding, Theory and Applications.

[8]  Christina Fragouli,et al.  Towards Reliable Broadcasting using ACKs , 2007, 2007 IEEE International Symposium on Information Theory.

[9]  Christina Fragouli,et al.  On Feedback for Network Coding , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[10]  Jeffrey J. Hunter,et al.  Mathematical techniques of applied probability , 1985 .

[11]  Sujay Sanghavi Intermediate Performance of Rateless Codes , 2007, 2007 IEEE Information Theory Workshop.