Online network coding for optimal throughput and delay -- the three-receiver case
| dc.creator | Sundararajan, Jay Kumar | |
| dc.creator | Shah, Devavrat | |
| dc.creator | Médard, Muriel | |
| dc.date | 2008-06-26 | |
| dc.date | 2008-09-29 | |
| dc.date.accessioned | 2026-07-07T10:05:36Z | |
| dc.date.available | 2026-07-07T10:05:36Z | |
| dc.description | 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 ρapproaches 1 from below with either the arrival rate (λ) or the channel parameter (μ) 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-ρ)). | |
| dc.description | This is the final version. The content has been changed to incorporate reviewer comments and recent results | |
| dc.identifier | https://arxiv.org/abs/0806.4264 | |
| dc.identifier | http://arxiv.org/abs/0806.4264 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/170053 | |
| dc.subject | Information Theory | |
| dc.title | Online network coding for optimal throughput and delay -- the three-receiver case | |
| dc.type | text |