Collaborative video streaming with Raptor network coding

We investigate the problem of collaborative video streaming with Raptor network coding over overlay networks. We exploit path and source diversity, as well as basic processing capabilities of network nodes to increase the overall throughput and improve the video quality at the clients. We consider an architecture where several streaming servers simultaneously deliver video information to a set of clients. The servers apply Raptor coding on the video packets for error resiliency, and the forwarding peer nodes further combine the Raptor coded video packets in order to increase the packet diversity in the network. We find the optimal source and channel rate allocation in such a collaborative streaming system. The resulting scheme efficiently exploits the available network resources for improved video quality. The experimental evaluation demonstrates that it typically outperforms Raptor video streaming systems that do not use network coding

Random Linear Network Coding for 5G Mobile Video Delivery

An exponential increase in mobile video delivery will continue with the demand for higher resolution, multi-view and large-scale multicast video services. Novel fifth generation (5G) 3GPP New Radio (NR) standard will bring a number of new opportunities for optimizing video delivery across both 5G core and radio access networks. One of the promising approaches for video quality adaptation, throughput enhancement and erasure protection is the use of packet-level random linear network coding (RLNC). In this review paper, we discuss the integration of RLNC into the 5G NR standard, building upon the ideas and opportunities identified in 4G LTE. We explicitly identify and discuss in detail novel 5G NR features that provide support for RLNC-based video delivery in 5G, thus pointing out to the promising avenues for future research.Comment: Invited paper for Special Issue "Network and Rateless Coding for Video Streaming" - MDPI Informatio

Band Codes for Energy-Efficient Network Coding with Application to P2P Mobile Streaming

A key problem in random network coding (NC) lies in the complexity and energy consumption associated with the packet decoding processes, which hinder its application in mobile environments. Controlling and hence limiting such factors has always been an important but elusive research goal, since the packet degree distribution, which is the main factor driving the complexity, is altered in a non-deterministic way by the random recombinations at the network nodes. In this paper we tackle this problem proposing Band Codes (BC), a novel class of network codes specifically designed to preserve the packet degree distribution during packet encoding, ecombination and decoding. BC are random codes over GF(2) that exhibit low decoding complexity, feature limited and controlled degree distribution by construction, and hence allow to effectively apply NC even in energy-constrained scenarios. In particular, in this paper we motivate and describe our new design and provide a thorough analysis of its performance. We provide numerical simulations of the performance of BC in order to validate the analysis and assess the overhead of BC with respect to a onventional NC scheme. Moreover, peer-to-peer media streaming experiments with a random-push protocol show that BC reduce the decoding complexity by a factor of two, to a point where NC-based mobile streaming to mobile devices becomes practically feasible.Comment: To be published in IEEE Transacions on Multimedi

Scalable Video Streaming with Prioritised Network Coding on End-System Overlays

PhDDistribution over the internet is destined to become a standard approach for live broadcasting of TV or events of nation-wide interest. The demand for high-quality live video with personal requirements is destined to grow exponentially over the next few years. Endsystem multicast is a desirable option for relieving the content server from bandwidth bottlenecks and computational load by allowing decentralised allocation of resources to the users and distributed service management. Network coding provides innovative solutions for a multitude of issues related to multi-user content distribution, such as the coupon-collection problem, allocation and scheduling procedure. This thesis tackles the problem of streaming scalable video on end-system multicast overlays with prioritised push-based streaming. We analyse the characteristic arising from a random coding process as a linear channel operator, and present a novel error detection and correction system for error-resilient decoding, providing one of the first practical frameworks for Joint Source-Channel-Network coding. Our system outperforms both network error correction and traditional FEC coding when performed separately. We then present a content distribution system based on endsystem multicast. Our data exchange protocol makes use of network coding as a way to collaboratively deliver data to several peers. Prioritised streaming is performed by means of hierarchical network coding and a dynamic chunk selection for optimised rate allocation based on goodput statistics at application layer. We prove, by simulated experiments, the efficient allocation of resources for adaptive video delivery. Finally we describe the implementation of our coding system. We highlighting the use rateless coding properties, discuss the application in collaborative and distributed coding systems, and provide an optimised implementation of the decoding algorithm with advanced CPU instructions. We analyse computational load and packet loss protection via lab tests and simulations, complementing the overall analysis of the video streaming system in all its components

Network Coding Enabled Named Data Networking Architectures

The volume of data traffic in the Internet has increased drastically in the last years, mostly due to data intensive applications like video streaming, file sharing, etc.. This motivates the development of new communication methods that can deal with the growing volume of data traffic. To this aim, Named Data Networking (NDN) has been proposed as a future Internet architecture that changes how the Internet works, from the exchange of content between particular nodes of the network, to retrieval of particular content in the network. The NDN architecture enables ubiquitous in-network caching and naturally supports dynamic selection of content sources, characteristics that fit well with the communication needs of data intensive applications. However, the performance of data intensive applications is degraded by the limited throughput seen by applications, which can be caused by (i) limited bandwidth, (ii) network bottlenecks and (iii) packet losses. In this thesis, we argue that introducing network coding into the NDN architecture improves the performance of NDN-based data intensive applications by alleviating the three issues presented above. In particular, network coding (i) enables efficient multipath data retrieval in NDN, which allows nodes to aggregate all the bandwidth available through their multiple interfaces; (ii) allows information from multiple sources to be combined at the intermediate routers, which alleviates the impact of network bottlenecks; and (iii) enables clients to efficiently handle packet losses. This thesis first provides an architecture that enables network coding in NDN for data intensive applications. Then, a study demonstrates and quantifies the benefits that network coding brings to video streaming over NDN, a particular data intensive application. To study the benefits that network coding brings in a more realistic NDN scenario, this thesis finally provides a caching strategy that is used when the in-network caches have limited capacity. Overall, the evaluation results show that the use of network coding permits to exploit more efficiently available network resources, which leads to reduced data traffic load on the sources, increased cache-hit rate at the in-network caches and faster content retrieval at the clients. In particular, for video streaming applications, network coding enables clients to watch higher quality videos compared to using traditional NDN, while it also reduces the video servers' load. Moreover, the proposed caching strategy for network coding enabled NDN maintains the benefits that network coding brings to NDN even when the caches have limited storage space

COST EFFICIENT PROVISIONING OF MASS MOBILE MULTIMEDIA SERVICES IN HYBRID CELLULAR AND BROADCASTING SYSTEMS

Uno de los retos a los que se enfrenta la industria de las comunicaciones móviles e inalámbricas es proporcionar servicios multimedia masivos a bajo coste, haciéndolos asequibles para los usuarios y rentables a los operadores. El servicio más representativo es el de TV móvil, el cual se espera que sea una aplicación clave en las futuras redes móviles. Actualmente las redes celulares no pueden soportar un consumo a gran escala de este tipo de servicios, y las nuevas redes de radiodifusión móvil son muy costosas de desplegar debido a la gran inversión en infraestructura de red necesaria para proporcionar niveles aceptables de cobertura. Esta tesis doctoral aborda el problema de la provisión eficiente de servicios multimedia masivos a dispositivos móviles y portables utilizando la infraestructura de radiodifusión y celular existente. La tesis contempla las tecnologías comerciales de última generación para la radiodifusión móvil (DVB-H) y para las redes celulares (redes 3G+ con HSDPA y MBMS), aunque se centra principalmente en DVB-H. El principal paradigma propuesto para proporcionar servicios multimedia masivos a bajo coste es evitar el despliegue de una red DVB-H con alta capacidad y cobertura desde el inicio. En su lugar se propone realizar un despliegue progresivo de la infraestructura DVB-H siguiendo la demanda de los usuarios. Bajo este contexto, la red celular es fundamental para evitar sobre-dimensionar la red DVB-H en capacidad y también en áreas con una baja densidad de usuarios hasta que el despliegue de un transmisor o un repetidor DVB-H sea necesario. Como principal solución tecnológica la tesis propone realizar una codificación multi-burst en DVB-H utilizando códigos Raptor. El objetivo es explotar la diversidad temporal del canal móvil para aumentar la robustez de la señal y, por tanto, el nivel de cobertura, a costa de incrementar la latencia de la red.Gómez Barquero, D. (2009). COST EFFICIENT PROVISIONING OF MASS MOBILE MULTIMEDIA SERVICES IN HYBRID CELLULAR AND BROADCASTING SYSTEMS [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/6881Palanci

Game-theoretic Scalable Offloading for Video Streaming Services over LTE and WiFi Networks

This paper presents a game-theoretic scalable offloading system that provides seamless video streaming services by effectively offloading parts of video traffic in all video streaming services to a WiFi network to alleviate cellular network congestion. The system also consolidates multiple physical paths in a cost-effective manner. In the proposed system, the fountain encoding symbols of compressed video data are transmitted through long term evolution (LTE) and WiFi networks concurrently to flexibly control the amount of video traffic through the WiFi network as well as mitigate video quality degradation caused by wireless channel errors. Furthermore, the progressive second price auction mechanism is employed to allocate the limited LTE resources to multiple user equipment in order to maximize social welfare while converging to the epsilon-Nash equilibrium. Specifically, we design an application-centric resource valuation that explicitly considers both the realistic wireless network conditions and characteristics of video streaming services. In addition, the scalability and convergence properties of the proposed system are verified both theoretically and experimentally. The proposed system is implemented using network simulator 3. Simulation results are provided to demonstrate the performance improvement of the proposed system.111Nsciescopu

Application of network coding in satellite broadcast and multiple access channels

Satellite broadcasting and relaying capabilities enable mobile broadcast systems over wide geographical areas, which opens large market possibilities for handheld, vehicular and fixed user terminals. The geostationary (GEO) satellite orbit is highly suited for such applications, as it spares the need for satellite terminals to track the movement of the spacecraft, with important savings in terms of complexity and cost. The large radius of the GEO orbit (more than 40000 km) has two main drawbacks. One is the large free space loss experienced by a signal traveling to or from the satellite, which limits the signal-to-noise ratio (SNR) margins in the link budget with respect to terrestrial systems. The second drawback of the GEO orbit is the large propagation delay (about 250 msec) that limits the use of feedback in both the forward (satellite to satellite terminal) and the reverse (satellite terminal to satellite) link. The limited margin protection causes loss of service availability in environments where there is no direct line of sight to the satellite, such as urban areas. The large propagation delay on its turn, together with the large terminal population size usually served by a GEO satellite, limit the use of feedback, which is at the basis of error-control. In the reverse link, especially in the case of fixed terminals, packet losses are mainly due to collisions, that severely limit the access to satellite services in case a random access scheme is adopted. The need for improvements and further understanding of these setups lead to the development of our work. In this dissertation we study the application of network coding to counteract the above mentioned channel impairments in satellite systems. The idea of using network coding stems from the fact that it allows to efficiently exploit the diversity, either temporal or spatial, present in the system. In the following we outline the original contributions included in each of the chapters of the dissertation. Chapter 3. This chapter deals with channel impairments in the forward link, and specifically with the problem of missing coverage in Urban environments for land mobile satellite (LMS) networks. By applying the Max-flow Min-cut theorem we derive a lower bound on the maximum coverage that can be achieved through cooperation. Inspired by this result, we propose a practical scheme, keeping in mind the compatibility with the DVB-SH standard. We developed a simulator in Matlab/C++ based on the physical layer abstraction and used it to test the performance gain of our scheme with a benchmark relaying scheme that does allow coding at packet level. Chapter 4. The second chapter of contributions is devoted to the information theoretical study of real-time streaming transmissions over fading channels with channel state information at the transmitter only. We introduce this new channel model and propose several transmission schemes, one of which is proved to be asymptotically optimal in terms of throughput. We also provide an upper bound on the achievable throughput for the proposed channel model and compare it numerically with the proposed schemes over a Rayleigh fading channel. Chapter 5. Chapter 5 is devoted to the study of throughput and delay in non-real-time streaming transmission over block fading channels. We derive bounds on the throughput and the delay for this channel and propose different coding techniques based on time-sharing. For each of them we carry out an analytical study of the performance. Finally, we compare numerically the performance of the proposed schemes over a Rayleigh fading channel. Chapter 6. In the last technical chapter we propose a collision resolution method for the return link based on physical layer network coding over extended Galois field (EGF). The proposed scheme extracts information from the colliding signals and achieves important gains with respect to Slotted ALOHA systems as well as with respect to other collision resolution schemes.Una de les característiques mes importants de les plataformes de comunicacions per satèl.lit és la seva capacitat de retransmetre senyals rebuts a un gran número de terminals. Això es fonamental en contextes com la difusió a terminals mòbils o la comunicació entre màquines. Al mateix temps, la disponibilitat d’un canal de retorn permet la creació de sistemes de comunicacions per satèl.lit interactius que, en principi, poden arribar a qualsevol punt del planeta. Els satèl.lits Geoestacionaris son particularment adequats per a complir amb aquesta tasca. Aquest tipus de satèl.lits manté una posició fixa respecte a la Terra, estalviant als terminals terrestres la necessitat de seguir el seu moviment en el cel. Per altra banda, la gran distància que separa la Terra dels satèl.lits Geoestacionaris introdueix grans retrassos en les comunicacions que, afegit al gran número de terminals en servei, limita l’ús de tècniques de retransmissió basades en acknowledgments en cas de pèrdua de paquets. Per tal de sol.lucionar el problema de la pèrdua de paquets, les tècniques més utilitzades son el desplegament de repetidors terrestres, anomenats gap fillers, l’ús de codis de protecció a nivell de paquet i mecanismes proactius de resolució de col.lisions en el canal de retorn. En aquesta tesi s’analitzen i s’estudien sol.lucions a problemes en la comunicació per satèl.lit tant en el canal de baixada com el de pujada. En concret, es consideren tres escenaris diferents. El primer escenari es la transmissió a grans poblacions de terminals mòbils en enorns urbans, que es veuen particularment afectats per la pèrdua de paquets degut a l’obstrucció, per part dels edificis, de la línia de visió amb el satèl.lit. La sol.lució que considerem consisteix en la utilització de la cooperació entre terminals. Una vegada obtinguda una mesura del guany que es pot assolir mitjançant cooperació en un model bàsic de xarxa, a través del teorema Max-flow Min-cut, proposem un esquema de cooperació compatible amb estàndards de comunicació existents. El segon escenari que considerem es la transmissió de vídeo, un tipus de tràfic particularment sensible a la pèrdua de paquets i retards endògens als sistemes de comunicació per satèl.lit. Considerem els casos de transmissió en temps real i en diferit, des de la perspectiva de teoria de la informació, i estudiem diferents tècniques de codificació analítica i numèrica. Un dels resultats principals obtinguts es l’extensió del límit assolible de la capacitat ergòdica del canal en cas que el transmissor rebi les dades de manera gradual, enlloc de rebre-les totes a l’inici de la transmissió. El tercer escenari que considerem es l’accés aleatori al satèl.lit. Desenvolupem un esquema de recuperació dels paquets perduts basat en la codificació de xarxa a nivell físic i en extensions a camps de Galois, amb resultats molt prometedors en termes de rendiment. També estudiem aspectes relacionats amb la implementació pràctica d’aquest esquema