On coding capacity of delay-constrained network information flow: An algebraic approach
| Autor: | Minghua Chen, Chih-Chun Wang, Ye Tian |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Network information flow
Theoretical computer science Multicast Computer science Linear network coding 0202 electrical engineering electronic engineering information engineering 020206 networking & telecommunications Throughput 02 engineering and technology Unicast Algebraic number Computer Science::Information Theory Coding (social sciences) |
| Zdroj: | ISIT |
| DOI: | 10.1109/isit.2016.7541831 |
| Popis: | Recently, Wang and Chen [1] showed that network coding (NC) can double the throughput as compared to routing in delay-constrained single-unicast communication. This is in sharp contrast to its delay-unconstrained counterpart where coding has no throughput gain. The result reveals that the landscape of delay-constrained communication is fundamentally different from the well-understood delay-unconstrained one and calls for investigation participation. In this paper, we generalize the Koetter-Medard algebraic approach [2] for delay-unconstrained network coding to the delay-constrained setting. The generalized approach allows us to systematically model deadline-induced interference, which is the unique challenge in studying network coding for delay-constrained communication. Using this algebraic approach, we characterize the coding capacity for single-source unicast and multicast, as the rank difference between an information space and a deadline-induced interference space. The results allow us to numerically compute the NC capacity for any given graph, serving as a benchmark for existing and future solutions on improving delay-constrained throughput. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|