Efficient Interlayer Network Codes for Fair Layered Multicast Streaming
Multilayer video streaming allows to provide different video qualities to a group of multicast receivers with heterogeneous receive rates. The number of layers received (and thus the receive rate) determines the quality of the decoded video stream. For such layered multicast streaming, network codin...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | IMDEA Networks Institute |
| Repositorio: | IMDEA Networks Institute Digital Repository |
| Idioma: | inglés |
| OAI Identifier: | oai:dspace.networks.imdea.org:20.500.12761/1407 |
| Acceso en línea: | http://hdl.handle.net/20.500.12761/1407 https://dx.doi.org/http://dx.doi.org/10.1109/TNET.2014.2326523 |
| Access Level: | acceso abierto |
| Palabra clave: | Interlayer network coding layered multicast network coding video streaming |
| Sumario: | Multilayer video streaming allows to provide different video qualities to a group of multicast receivers with heterogeneous receive rates. The number of layers received (and thus the receive rate) determines the quality of the decoded video stream. For such layered multicast streaming, network coding provides higher capacity than multicast routing. Network coding can be performed within a layer or across layers, and in general, interlayer coding outperforms intralayer coding. An optimal solution to a network-coded layered multicast problem may require decoding of the network code at interior nodes to extract information to be forwarded. However, decoding consumes resources and introduces delay, which is particularly undesirable at interior nodes (the routers) of the network. In this paper, we thus focus on the interlayer network coding problem without decoding at interior nodes. We show that the problem is NP-hard and propose a heuristic algorithm for rate allocation and coding based on the Edmonds–Karp maximum flow algorithm. We prove that our algorithm ensures decodability of the information received and provides some fairness properties. Finally, we perform extensive simulations and show that our algorithm may even outperform other heuristics that do require decoding at interior nodes. |
|---|