36 research outputs found

    Service quality assurance for the IPTV networks

    Get PDF
    The objective of the proposed research is to design and evaluate end-to-end solutions to support the Quality of Experience (QoE) for the Internet Protocol Television (IPTV) service. IPTV is a system that integrates voice, video, and data delivery into a single Internet Protocol (IP) framework to enable interactive broadcasting services at the subscribers. It promises significant advantages for both service providers and subscribers. For instance, unlike conventional broadcasting systems, IPTV broadcasts will not be restricted by the limited number of channels in the broadcast/radio spectrum. Furthermore, IPTV will provide its subscribers with the opportunity to access and interact with a wide variety of high-quality on-demand video content over the Internet. However, these advantages come at the expense of stricter quality of service (QoS) requirements than traditional Internet applications. Since IPTV is considered as a real-time broadcast service over the Internet, the success of the IPTV service depends on the QoE perceived by the end-users. The characteristics of the video traffic as well as the high-quality requirements of the IPTV broadcast impose strict requirements on transmission delay. IPTV framework has to provide mechanisms to satisfy the stringent delay, jitter, and packet loss requirements of the IPTV service over lossy transmission channels with varying characteristics. The proposed research focuses on error recovery and channel change latency problems in IPTV networks. Our specific aim is to develop a content delivery framework that integrates content features, IPTV application requirements, and network characteristics in such a way that the network resource utilization can be optimized for the given constraints on the user perceived service quality. To achieve the desired QoE levels, the proposed research focuses on the design of resource optimal server-based and peer-assisted delivery techniques. First, by analyzing the tradeoffs on the use of proactive and reactive repair techniques, a solution that optimizes the error recovery overhead is proposed. Further analysis on the proposed solution is performed by also focusing on the use of multicast error recovery techniques. By investigating the tradeoffs on the use of network-assisted and client-based channel change solutions, distributed content delivery frameworks are proposed to optimize the error recovery performance. Next, bandwidth and latency tradeoffs associated with the use of concurrent delivery streams to support the IPTV channel change are analyzed, and the results are used to develop a resource-optimal channel change framework that greatly improves the latency performance in the network. For both problems studied in this research, scalability concerns for the IPTV service are addressed by properly integrating peer-based delivery techniques into server-based solutions.Ph.D

    Survey of Transportation of Adaptive Multimedia Streaming service in Internet

    Full text link
    [DE] World Wide Web is the greatest boon towards the technological advancement of modern era. Using the benefits of Internet globally, anywhere and anytime, users can avail the benefits of accessing live and on demand video services. The streaming media systems such as YouTube, Netflix, and Apple Music are reining the multimedia world with frequent popularity among users. A key concern of quality perceived for video streaming applications over Internet is the Quality of Experience (QoE) that users go through. Due to changing network conditions, bit rate and initial delay and the multimedia file freezes or provide poor video quality to the end users, researchers across industry and academia are explored HTTP Adaptive Streaming (HAS), which split the video content into multiple segments and offer the clients at varying qualities. The video player at the client side plays a vital role in buffer management and choosing the appropriate bit rate for each such segment of video to be transmitted. A higher bit rate transmitted video pauses in between whereas, a lower bit rate video lacks in quality, requiring a tradeoff between them. The need of the hour was to adaptively varying the bit rate and video quality to match the transmission media conditions. Further, The main aim of this paper is to give an overview on the state of the art HAS techniques across multimedia and networking domains. A detailed survey was conducted to analyze challenges and solutions in adaptive streaming algorithms, QoE, network protocols, buffering and etc. It also focuses on various challenges on QoE influence factors in a fluctuating network condition, which are often ignored in present HAS methodologies. Furthermore, this survey will enable network and multimedia researchers a fair amount of understanding about the latest happenings of adaptive streaming and the necessary improvements that can be incorporated in future developments.Abdullah, MTA.; Lloret, J.; Canovas Solbes, A.; García-García, L. (2017). Survey of Transportation of Adaptive Multimedia Streaming service in Internet. Network Protocols and Algorithms. 9(1-2):85-125. doi:10.5296/npa.v9i1-2.12412S8512591-

    Network overload avoidance by traffic engineering and content caching

    Get PDF
    The Internet traffic volume continues to grow at a great rate, now driven by video and TV distribution. For network operators it is important to avoid congestion in the network, and to meet service level agreements with their customers. This thesis presents work on two methods operators can use to reduce links loads in their networks: traffic engineering and content caching. This thesis studies access patterns for TV and video and the potential for caching. The investigation is done both using simulation and by analysis of logs from a large TV-on-Demand system over four months. The results show that there is a small set of programs that account for a large fraction of the requests and that a comparatively small local cache can be used to significantly reduce the peak link loads during prime time. The investigation also demonstrates how the popularity of programs changes over time and shows that the access pattern in a TV-on-Demand system very much depends on the content type. For traffic engineering the objective is to avoid congestion in the network and to make better use of available resources by adapting the routing to the current traffic situation. The main challenge for traffic engineering in IP networks is to cope with the dynamics of Internet traffic demands. This thesis proposes L-balanced routings that route the traffic on the shortest paths possible but make sure that no link is utilised to more than a given level L. L-balanced routing gives efficient routing of traffic and controlled spare capacity to handle unpredictable changes in traffic. We present an L-balanced routing algorithm and a heuristic search method for finding L-balanced weight settings for the legacy routing protocols OSPF and IS-IS. We show that the search and the resulting weight settings work well in real network scenarios

    Improved Iptv Channel Change times Through Multicast Caching of Pre-selected Channels

    Get PDF
    Name: RAY, THOMAS Date of Degree: DECEMBER, 2014 Title of Study: IMPROVED IPTV CHANNEL CHANGE TIMES THROUGH MULTICAST CACHING OF PRE-SELECTED CHANNELSMajor Field: ELECTRICAL ENGINEERINGAbstract: IPTV has grown in recent years to an estimated 100 million users worldwide. IPTV uses IGMP processes to stream an individual channel to a user until the next channel change when the current channel is stopped and the new selection begins streaming. One of the critical factors determining customer satisfaction is the requirement to have reasonably rapid channel change times of 2 seconds or less, but current channel change times are frequently above that threshold. Numerous research efforts have been ongoing to reduce these times including edge servers, I-frame management, buffering improvements, dynamic video coding, and pre-selecting channels. Channel pre-selection involves sending additional channels in hopes that the user's next selection will already be present at the user's set top box to reduce the channel change time. While this pre-selection technique has previously been proposed, the proposals have been limited in scope, typically based on set top box replacement, and lack specific details regarding the expected channel change reductions attained. This research addressed all of these shortcomings beginning with laboratory testing to verify that the channel change time reduction for successful pre-selection is two times the network delay plus the IGMP processing time which equates to an average of 320 millisecond reduction per channel change. Several pre-selection models were developed and evaluated using theoretical calculations, functional testing, and performance simulations. Sample data was generated to reflect a wide range of user IPTV viewing behavior for use in the performance simulations. The top two models resulted in an average of well over 70% success rates in accurately pre-streaming the user's next selection in the multicast cache output. This approach also has the benefit of being implemented on IPTV provider equipment and would typically only require firmware upgrades without the need for expensive new equipment or changes to existing standards. Operational considerations were also discussed to reduce problems and delays during the implementation phase of the system. Additional applications and future improvements were also presented.Electrical Engineerin

    Policy-Based Radio Resource Management in Multicast OFDMA Systems

    Get PDF
    Η ασύρματηφασματική αποδοτικότητα είναι ένας, όλο και περισσότερο, σημαντικός παράγοντας εξαιτίας της ταχείας ανάπτυξης των ασύρματων υπηρεσιών ευρείας ζώνης. Η σχεδίαση ενός συστήματος με πολλά φέροντα, όπως είναι ένα σύστημα OFDMA,επιτρέπει στα συστήματα να έχουν υψηλή χωρητικότητα για να ικανοποιήσουν τις απαιτήσεις των υπηρεσιών ευρείας ζώνης.Αυτή η αυξημένη χωρητικότητα των συστημάτων μπορεί να βελτιστοποιηθεί περαιτέρω εκμεταλλευόμενοι καλύτερα τα χαρακτηριστικά των ασύρματων καναλιών. Ηθεμελιώδηςιδέα ενός σχήματος κατανομής πόρων είναι η αποτελεσματική κατανομή των διαθέσιμων ασύρματων πόρων, όπως είναι οι υποφορείς και η ισχύς εκπομπής, μεταξύ των χρηστών του συστήματος. Σχετικά με τα προβλήματα της κατανομής πόρων σε ασύρματα συστήματα τηλεπικοινωνιών βασισμένα στην τεχνική OFDMA, η περισσότερη έρευνα επικεντρώνεται στην αναζήτηση πολιτικών ανάθεσης υποφορέων και ισχύος. Οι διαθέσιμες τεχνικές της βιβλιογραφίας δεν μπορούν να εφαρμοστούν όπως είναι σε συστήματα πολυεκπομπής. Επιπλέον, οι υπάρχουσες τεχνικές δεν μπορούν να εφαρμοστούν αμετάβλητες σε πραγματικά συστήματα στα οποία υπάρχει μεγάλος αριθμός OFDMυποφορέων, καθώς η υπολογιστική πολυπλοκότητα είναι πολύ μεγάλη. Ο βασικός στόχος της παρούσας διπλωματικής εργασίας είναι η πρόταση ικανών μηχανισμών κατανομής των διαθέσιμων υποφορέων σε ασύρματα συστήματα πολυεκπομπής χρησιμοποιώντας την τεχνολογία OFDMA. Πιο συγκεκριμένα, σχετικά με τα συστήματα πολυεκπομπής, θεωρούμε ότι τόσο ο σταθμός βάσης όσο και κάθε χρήστης είναι εφοδιασμένοι με μοναδική κεραία και η μονάδα κατανομής δεν είναι ο υποφορέας, όπως στα συμβατικά συστήματα OFDMA, αλλά μία ομάδα γειτονικώνυποφορέων, η οποία ονομάζεται τεμάχιο, με σκοπό τη μείωση της μεγάλης υπολογιστικής πολυπλοκότητας. Ένας αποτελεσματικός αλγόριθμος προτείνεται του οποίου ο στόχος είναι η μεγιστοποίηση του συνολικού ρυθμού μετάδοσης δεδομένων με περιορισμούς στη συνολική διαθέσιμη ισχύ, στο BERανά τεμάχιο και στους αναλογικούς περιορισμούς μεταξύ των ρυθμών μετάδοσης δεδομένων των ομάδων χρηστών. Η προσομοίωση και η ανάλυση της πολυπλοκότητας που παρουσιάζονται, υποστηρίζουν τα πλεονεκτήματα της κατανομής πόρων σε συστήματα πολυεκπομπήςOFDMA τα οποία βασίζονται σε κατανομή τεμαχίων και έχουν ως στόχος την εξασφάλιση της αναλογικότητας μεταξύ των ρυθμών μετάδοσης δεδομένων των ομάδων χρηστών.Wireless spectral efficiency is increasingly important due to the rapid growth of demand for high data rate wideband wireless services. The design of a multi-carrier system, such as an OFDMA system, enables high system capacity suited for these wideband wireless services. This system capacity can be further optimized with a resource allocation scheme by exploiting the characteristics of the wireless fading channels. The fundamental idea of a resource allocation scheme is to efficiently distribute the available wireless resources, such as the subcarriers and transmission power, among all admitted users in the system. Regarding the problems of resource allocation in OFDMA-based wireless communicationsystems, much of the research effort mainly focuses on finding efficient power controland subcarrier assignment policies. With systems employing multicast transmission,the available schemes in literature are not always applicable. Moreover, the existing approachesare particularly inaccessible in practical systems in which there are a large numberof OFDM subcarriers being utilized, as the required computational burden is prohibitivelyhigh. The ultimate goal of this Thesis is therefore to propose affordable mechanisms toflexibly and effectively share out the available resources in multicast wireless systems deployingOFDMA technology. Specifically, according to multicast system, it is assumed thatboth the BS and each user are equipped witha single antenna and the allocation unit is not the subcarrier,as in conventional OFDMA systems, but a set of contiguoussubcarriers, which is called chunk, in order to alleviate the heavy computational burden. An efficient algorithmis proposed whose aim is to maximize the total throughput subject to constraints on totalavailable power,BER over a chunk, and proportional data rates constraints among multicast groups. Simulation and complexity analysis are provided to support thebenefits of chunk-based resource allocation to multicast OFDMA systems with targeting proportional data rates among multicast groups

    Peer-to-peer television for the IP multimedia subsystem

    Get PDF
    Peer-to-peer (P2P) video streaming has generated a significant amount of interest in both the research community and the industry, which find it a cost-effective solution to the user scalability problem. However, despite the success of Internet-based applications, the adoption has been limited for commercial services, such as Internet Protocol Television (IPTV). With the advent of the next-generation-networks (NGN) based on the IP Multimedia Subsystem (IMS), advocating for an open and inter-operable architecture, P2P emerges as a possible alternative in situations where the traditional mechanisms are not possible or economically feasible. This work proposes a P2P IPTV architecture for an IMS-based NGN, called P2PTV, which allows one or more service providers to use a common P2P infrastructure for streaming the TV channels to their subscribers. Instead of using servers, we rely on the uploading capabilities of the user equipments, like set-top boxes, located at the customers’ premise. We comply with the existing IMS and IPTV standards from the 3rd Generation Partnership Project (3GPP) and the Telecommunications and Internet converged Services and Protocols for Advanced Networking (TISPAN) bodies, where a centralized P2PTV application server (AS) manages the customer access to the service and the peer participation. Because watching TV is a complex and demanding user activity, we face two significant challenges. The first is to accommodate the mandatory IMS signaling, which reserves in the network the necessary QoS resources during every channel change, establishing a multimedia session between communicating peers. The second is represented by the streaming interruptions, or churn, when the uploading peer turns off or changes its current TV channel. To tackle these problems, we propose two enhancements. A fast signaling method, which uses inactive uploading sessions with reserved but unused QoS, to improve the tuning delay for new channel users. At every moment, the AS uses a feedback based algorithm to compute the number of necessary sessions that accommodates well the demand, while preventing the over-reservation of resources. We approach with special care mobility situations, where a proactive transfer of the multimedia session context using the IEEE 802.21 standard offers the best alternative to current methods. The second enhancement addresses the peer churn during channel changes. With every TV channel divided into a number of streams, we enable peers to download and upload streams different from their current channel, increasing the stability of their participation. Unlike similar work, we benefit from our estimation of the user demand and propose a decentralized method for a balanced assignment of peer bandwidth. We evaluate the performance of the P2PTV through modeling and large-scale computer simulations. A simpler experimental setting, with pure P2P streaming, indicates the improvements over the delay and peer churn. In more complex scenarios, especially with resource-poor peers having a limited upload capacity, we envision P2P as a complementary solution to traditional approaches like IP multicast. Reserving P2P for unpopular TV channels exploits the peer capacity and prevents the necessity of a large number of sparsely used multicast trees. Future work may refine the AS algorithms, address different experimental scenarios, and extend the lessons learned to non-IMS networks. ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------La transmisión de vídeo con tecnologías peer-to-peer (P2P) ha generado un gran interés, tanto en la industria como en la comunidad científica, quienes han encontrado en dicha unión la solución para afrontar los problemas de escalabilidad de la transmisión de vídeo, reduciendo al mismo tiempo sus costes. A pesar del éxito de estos mecanismos en Internet, la transmisión de vídeo mediante técnicas P2P no se ha utilizado en servicios comerciales como puede ser el de televisión por IP (IPTV). Con la aparición de propuestas de redes de próxima generación basadas en el IP Multimedia Subsystem (IMS), que permite una arquitectura abierta e interoperable, los mecanismos basados en P2P emergen como posibles alternativas en situaciones donde los mecanismos tradicionales de transmisión de vídeo no se pueden desplegar o no son económicamente viables. Esta tesis propone una arquitectura de servicio de televisión peer-to-peer para una red de siguiente generación basada en IMS, que abreviaremos como P2PTV, que permite a uno o más proveedores de servicio utilizar una infraestructura P2P común para la transmisión de canales de TV a sus suscriptores. En vez de utilizar varios servidores, proponemos utilizar la capacidad de envío de los equipos de usuario, como los set-top boxes, localizados en el lado del cliente. En esta tesis extendemos los trabajos de estandarización sobre IMS IPTV de los organismos 3rd Generation Partnership Project (3GPP) y del Telecommunications and Internet converged Services and Protocols for Advanced Networking (TISPAN), donde un servidor de aplicación (AS) central de P2PTV administra el acceso de los clientes al servicio y permite compartir los recursos de los equipos. Debido a que el acceso a los canales de TV por parte de los usuarios es una actividad compleja, nos enfrentamos a dos retos importantes. El primero es administrar la señalización de IMS, con la cual se reservan los recursos de QoS necesarios durante cada cambio de canal, estableciendo una sesión multimedia entre los diferentes elementos de la comunicación. El segundo está representado por las interrupciones de la reproducción de video, causado por los equipos que sirven dicho vídeo cuando estos se desconectan del sistema o cuando cambian de canal. Para afrontar estos retos, proponemos dos mejoras al sistema. La primera mejora introduce el método de señalización rápida, en la cual se utilizan sesiones multimedia inactivas pero con recursos reservados para acelerar las conexiones entre usuarios. En cada momento, el AS utiliza la información extraída del algoritmo propuesto, que calcula el número de sesiones necesarias para administrar la demanda de conexiones, pero sin realizar una sobre-estimación, manteniendo bajo el uso de los recursos. Hemos abordado con especial cuidado la movilidad de los usuarios, donde se ha propuesto una transferencia de sesión pro-activa utilizando el estándar IEEE 802.21, el cual brinda una mejor alternativa que los métodos propuestos hasta la fecha. La segunda mejora se enfoca en las desconexiones de usuarios durante cambios de canal. Dividiendo los canales de TV en varios segmentos, permitimos a los equipos descargar o enviar diferentes partes de cualquier canal, aumentando la estabilidad de su participación. A diferencia de otros trabajos, nuestra propuesta se beneficia de la estimación de la demanda futura de los usuarios, proponiendo un método descentralizado para una asignación balanceada del ancho de banda de los equipos. Hemos evaluado el rendimiento del sistema P2PTV a través de modelado y de simulaciones de ordenador en sistemas IPTV de gran escala. Una configuración simple, con envío P2P puro, indica mejoras en el retardo y número de desconexiones de usuarios. En escenarios más complejos, especialmente con equipos con pocos recursos en la subida, sugerimos el uso de P2P como una solución complementaria a las soluciones tradicionales de multicast IP. Reservando el uso de P2P para los canales de TV poco populares, se permite explotar los recursos de los equipos y se previene la necesidad de un alto número de árboles multicast dispersos. Como trabajo futuro, se propone refinar los algoritmos del AS, abordar diferentes escenarios experimentales y también extender las lecciones aprendidas en esta tesis a otros sistemas no basados en IMS

    The Role of Caching in Future Communication Systems and Networks

    Get PDF
    This paper has the following ambitious goal: to convince the reader that content caching is an exciting research topic for the future communication systems and networks. Caching has been studied for more than 40 years, and has recently received increased attention from industry and academia. Novel caching techniques promise to push the network performance to unprecedented limits, but also pose significant technical challenges. This tutorial provides a brief overview of existing caching solutions, discusses seminal papers that open new directions in caching, and presents the contributions of this special issue. We analyze the challenges that caching needs to address today, also considering an industry perspective, and identify bottleneck issues that must be resolved to unleash the full potential of this promising technique

    Potentzia domeinuko NOMA 5G sareetarako eta haratago

    Get PDF
    Tesis inglés 268 p. -- Tesis euskera 274 p.During the last decade, the amount of data carried over wireless networks has grown exponentially. Several reasons have led to this situation, but the most influential ones are the massive deployment of devices connected to the network and the constant evolution in the services offered. In this context, 5G targets the correct implementation of every application integrated into the use cases. Nevertheless, the biggest challenge to make ITU-R defined cases (eMBB, URLLC and mMTC) a reality is the improvement in spectral efficiency. Therefore, in this thesis, a combination of two mechanisms is proposed to improve spectral efficiency: Non-Orthogonal Multiple Access (NOMA) techniques and Radio Resource Management (RRM) schemes. Specifically, NOMA transmits simultaneously several layered data flows so that the whole bandwidth is used throughout the entire time to deliver more than one service simultaneously. Then, RRM schemes provide efficient management and distribution of radio resources among network users. Although NOMA techniques and RRM schemes can be very advantageous in all use cases, this thesis focuses on making contributions in eMBB and URLLC environments and proposing solutions to communications that are expected to be relevant in 6G

    Diseño centrado en calidad para la difusión Peer-to-Peer de video en vivo

    Get PDF
    El uso de redes Peer-to-Peer (P2P) es una forma escalable para ofrecer servicios de video sobre Internet. Este documento hace foco en la definición, desarrollo y evaluación de una arquitectura P2P para distribuir video en vivo. El diseño global de la red es guiado por la calidad de experiencia (Quality of Experience - QoE), cuyo principal componente en este caso es la calidad del video percibida por los usuarios finales, en lugar del tradicional diseño basado en la calidad de servicio (Quality of Service - QoE) de la mayoría de los sistemas. Para medir la calidad percibida del video, en tiempo real y automáticamente, extendimos la recientemente propuesta metodología Pseudo-Subjective Quality Assessment (PSQA). Dos grandes líneas de investigación son desarrolladas. Primero, proponemos una técnica de distribución de video desde múltiples fuentes con las características de poder ser optimizada para maximizar la calidad percibida en contextos de muchas fallas y de poseer muy baja señalización (a diferencia de los sistemas existentes). Desarrollamos una metodología, basada en PSQA, que nos permite un control fino sobre la forma en que la señal de video es dividida en partes y la cantidad de redundancia agregada, como una función de la dinámica de los usuarios de la red. De esta forma es posible mejorar la robustez del sistema tanto como sea deseado, contemplando el límite de capacidad en la comunicación. En segundo lugar, presentamos un mecanismo estructurado para controlar la topología de la red. La selección de que usuarios servirán a que otros es importante para la robustez de la red, especialmente cuando los usuarios son heterogéneos en sus capacidades y en sus tiempos de conexión.Nuestro diseño maximiza la calidad global esperada (evaluada usando PSQA), seleccionado una topología que mejora la robustez del sistema. Además estudiamos como extender la red con dos servicios complementarios: el video bajo demanda (Video on Demand - VoD) y el servicio MyTV. El desafío en estos servicios es como realizar búsquedas eficientes sobre la librería de videos, dado al alto dinamismo del contenido. Presentamos una estrategia de "caching" para las búsquedas en estos servicios, que maximiza el número total de respuestas correctas a las consultas, considerando una dinámica particular en los contenidos y restricciones de ancho de banda. Nuestro diseño global considera escenarios reales, donde los casos de prueba y los parámetros de configuración surgen de datos reales de un servicio de referencia en producción. Nuestro prototipo es completamente funcional, de uso gratuito, y basado en tecnologías bien probadas de código abierto
    corecore