Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages
| Autor: | Michael Rudow, K.V. Rashmi |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| DOI: | 10.48550/arxiv.2205.08521 |
| Popis: | Real-time streaming communication requires a high quality of service despite contending with packet loss. Streaming codes are a class of codes best suited for this setting. A key challenge for streaming codes is that they operate in an "online" setting in which the amount of data to be transmitted varies over time and is not known in advance. Mitigating the adverse effects of variability requires spreading the data that arrives at a time slot over multiple future packets, and the optimal strategy for spreading depends on the arrival pattern. Algebraic coding techniques alone are therefore insufficient for designing rate-optimal codes. We combine algebraic coding techniques with a learning-augmented algorithm for spreading to design the first approximately rate-optimal streaming codes for a range of parameter regimes that are important for practical applications. Comment: 13 pages, 8 figures, this is an extended version of the IEEE ISIT 2022 paper with the same title |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|