Modeling And Dynamic Resource Allocation For High Definition And Mobile Video Streams

Video streaming traffic has been surging in the last few years, which has resulted in an increase of its Internet traffic share on a daily basis. The importance of video streaming management has been emphasized with the advent of High Definition: HD) video streaming, as it requires by its nature more network resources. In this dissertation, we provide a better support for managing HD video traffic over both wireless and wired networks through several contributions. We present a simple, general and accurate video source model: Simplified Seasonal ARIMA Model: SAM). SAM is capable of capturing the statistical characteristics of video traces with less than 5% difference from their calculated optimal models. SAM is shown to be capable of modeling video traces encoded with MPEG-4 Part2, MPEG-4 Part10, and Scalable Video Codec: SVC) standards, using various encoding settings. We also provide a large and publicly-available collection of HD video traces along with their analyses results. These analyses include a full statistical analysis of HD videos, in addition to modeling, factor and cluster analyses. These results show that by using SAM, we can achieve up to 50% improvement in video traffic prediction accuracy. In addition, we developed several video tools, including an HD video traffic generator based on our model. Finally, to improve HD video streaming resource management, we present a SAM-based delay-guaranteed dynamic resource allocation: DRA) scheme that can provide up to 32.4% improvement in bandwidth utilization

Queuing Modelling and Performance Analysis of Content Transfer in Information Centric Networks

With the rapid development of multimedia services and wireless technology, new generation of network traffic like short-form video and live streaming have put tremendous pressure on the current network infrastructure. To meet the high bandwidth and low latency needs of this new generation of traffic, the focus of Internet architecture has moved from host-centric end-to-end communication to requester-driven content retrieval. This shift has motivated the development of Information-Centric Networking (ICN), a promising new paradigm for the future Internet. ICN aims to improve information retrieval on the Internet by identifying and routing data using unified names. In-network caching and the use of a pending interest table (PIT) are two key features of ICN that are designed to efficiently handle bulk data dissemination and retrieval, as well as reduce bandwidth consumption. Performance analysis has been and continues to be key research interests of ICN. This thesis starts with the evaluation of content delivery delays in ICN. The main component of delay is composed of propagation delay, transmission delay,processing delay and queueing delay. To characterize the main components of content delivery delay, queueing network theory has been exploited to coordinate with cache miss rate in modelling the content delivery time in ICN. Moreover, different topologies and network conditions have been taken into account to evaluate the performance of content transfer in ICN. ICN is intrinsically compatible with wireless networks. To evaluate the performance of content transfer in wireless networks, an analytical model to evaluate the mean service time based on consumer and provider mobility has been proposed. The accuracy of the analytical model is validated through extensive simulation experiments. Finally, the analytical model is used to evaluate the impact of key metrics, such as the cache size, content size and content popularity on the performance of PIT and content transfer in ICN. Pending interest table (PIT) is one of the essential components of the ICN forwarding plane, which is responsible for stateful routing in ICN. It also aggregates the same interests to alleviate request flooding and network congestion. The aggregation feature of PIT improves performance of content delivery in ICN. Thus, having an analytical model to characterize the impact of PIT on content delivery time could allow for a more precise evaluation of content transfer performance. In parallel, if the size of the PIT is not properly determined, the interest drop rate may be too high, resulting in a reduction in quality of service for consumers as their requests have to be retransmitted. Furthermore, PIT is a costly resource as it requires to operate at wirespeed in the forwarding plane. Therefore, in order to ensure that interests drop rate less than the requirement, an analytical model of PIT occupancy has been developed to determine the minimum PIT size. In this thesis, the proposed analytical models are used to efficiently and accurately evaluate the performance of ICN content transfer and investigate the key component of ICN forwarding plane. Leveraging the insights discovered by these analytical models, the minimal PIT size and proper interest timeout can be determined to enhance the performance of ICN. To widen the outcomes achieved in the thesis, several interesting yet challenging research directions are pointed out

TCP performance enhancement in wireless networks via adaptive congestion control and active queue management

The transmission control protocol (TCP) exhibits poor performance when used in error-prone wireless networks. Remedy to this problem has been an active research area. However, a widely accepted and adopted solution is yet to emerge. Difficulties of an acceptable solution lie in the areas of compatibility, scalability, computational complexity and the involvement of intermediate routers and switches. This dissertation rexriews the current start-of-the-art solutions to TCP performance enhancement, and pursues an end-to-end solution framework to the problem. The most noticeable cause of the performance degradation of TCP in wireless networks is the higher packet loss rate as compared to that in traditional wired networks. Packet loss type differentiation has been the focus of many proposed TCP performance enhancement schemes. Studies conduced by this dissertation research suggest that besides the standard TCP\u27s inability of discriminating congestion packet losses from losses related to wireless link errors, the standard TCP\u27s additive increase and multiplicative decrease (AIMD) congestion control algorithm itself needs to be redesigned to achieve better performance in wireless, and particularly, high-speed wireless networks. This dissertation proposes a simple, efficient, and effective end-to-end solution framework that enhances TCP\u27s performance through techniques of adaptive congestion control and active queue management. By end-to-end, it means a solution with no requirement of routers being wireless-aware or wireless-specific . TCP-Jersey has been introduced as an implementation of the proposed solution framework, and its performance metrics have been evaluated through extensive simulations. TCP-Jersey consists of an adaptive congestion control algorithm at the source by means of the source\u27s achievable rate estimation (ARE) —an adaptive filter of packet inter-arrival times, a congestion indication algorithm at the links (i.e., AQM) by means of packet marking, and a effective loss differentiation algorithm at the source by careful examination of the congestion marks carried by the duplicate acknowledgment packets (DUPACK). Several improvements to the proposed TCP-Jersey have been investigated, including a more robust ARE algorithm, a less computationally intensive threshold marking algorithm as the AQM link algorithm, a more stable congestion indication function based on virtual capacity at the link, and performance results have been presented and analyzed via extensive simulations of various network configurations. Stability analysis of the proposed ARE-based additive increase and adaptive decrease (AJAD) congestion control algorithm has been conducted and the analytical results have been verified by simulations. Performance of TCP-Jersey has been compared to that of a perfect , but not practical, TCP scheme, and encouraging results have been observed. Finally the framework of the TCP-Jersey\u27s source algorithm has been extended and generalized for rate-based congestion control, as opposed to TCP\u27s window-based congestion control, to provide a design platform for applications, such as real-time multimedia, that do not use TCP as transport protocol yet do need to control network congestion as well as combat packet losses in wireless networks. In conclusion, the framework architecture presented in this dissertation that combines the adaptive congestion control and active queue management in solving the TCP performance degradation problem in wireless networks has been shown as a promising answer to the problem due to its simplistic design philosophy complete compatibility with the current TCP/IP and AQM practice, end-to-end architecture for scalability, and the high effectiveness and low computational overhead. The proposed implementation of the solution framework, namely TCP-Jersey is a modification of the standard TCP protocol rather than a completely new design of the transport protocol. It is an end-to-end approach to address the performance degradation problem since it does not require split mode connection establishment and maintenance using special wireless-aware software agents at the routers. The proposed solution also differs from other solutions that rely on the link layer error notifications for packet loss differentiation. The proposed solution is also unique among other proposed end-to-end solutions in that it differentiates packet losses attributed to wireless link errors from congestion induced packet losses directly from the explicit congestion indication marks in the DUPACK packets, rather than inferring the loss type based on packet delay or delay jitter as in many other proposed solutions; nor by undergoing a computationally expensive off-line training of a classification model (e.g., HMM), or a Bayesian estimation/detection process that requires estimations of a priori loss probability distributions of different loss types. The proposed solution is also scalable and fully compatible to the current practice in Internet congestion control and queue management, but with an additional function of loss type differentiation that effectively enhances TCP\u27s performance over error-prone wireless networks. Limitations of the proposed solution architecture and areas for future researches are also addressed

Towards enabling cross-layer information sharing to improve today's content delivery systems

Content is omnipresent and without content the Internet would not be what it is today. End users consume content throughout the day, from checking the latest news on Twitter in the morning, to streaming music in the background (while working), to streaming movies or playing online games in the evening, and to using apps (e.g., sleep trackers) even while we sleep in the night. All of these different kinds of content have very specific and different requirements on a transport—on one end, online gaming often requires a low latency connection but needs little throughput, and, on the other, streaming a video requires high throughput, but it performs quite poorly under packet loss. Yet, all content is transferred opaquely over the same transport, adhering to a strict separation of network layers. Even a modern transport protocol such as Multi-Path TCP, which is capable of utilizing multiple paths, cannot take the (above) requirements or needs of that content into account for its path selection. In this work we challenge the layer separation and show that sharing information across the layers is beneficial for consuming web and video content. To this end, we created an event-based simulator for evaluating how applications can make informed decisions about which interfaces to use delivering different content based on a set of pre-defined policies that encode the (performance) requirements or needs of that content. Our policies achieve speedups of a factor of two in 20% of our cases, have benefits in more than 50%, and create no overhead in any of the cases. For video content we created a full streaming system that allows an even finer grained information sharing between the transport and the application. Our streaming system, called VOXEL, enables applications to select dynamically and on a frame granularity which video data to transfer based on the current network conditions. VOXEL drastically reduces video stalls in the 90th-percentile by up to 97% while not sacrificing the stream's visual fidelity. We confirmed our performance improvements in a real-user study where 84% of the participants clearly preferred watching videos streamed with VOXEL over the state-of-the-art.Inhalte sind allgegenwärtig und ohne Inhalte wäre das Internet nicht das, was es heute ist. Endbenutzer konsumieren Inhalte von früh bis spät - es beginnt am Morgen mit dem Lesen der neusten Nachrichten auf Twitter, dem online hören von Musik während der Arbeit, wird fortgeführt mit dem Schauen von Filmen über Online-Streaming Dienste oder dem spielen von Mehrspieler Online Spielen am Abend, und sogar dem, mit dem Internet synchronisierten, Überwachens des eigenen Schlafes in der Nacht. All diese verschiedenen Arten von Inhalten haben sehr spezifische und unterschiedliche Ansprüche an den Transport über das Internet - auf der einen Seite sind es Online Spiele, die eine sehr geringe Latenz, aber kaum Durchsatz benötigen, auf der Anderen gibt es Video-Streaming Dienste, die einen sehr hohen Datendurchsatz benötigen, aber, sehr nur schlecht mit Paketverlust umgehen können. Jedoch werden all diese Inhalte über den selben, undurchsichtigen, Transportweg übertragen, weil an eine strikte Unterteilung der Netzwerk- und Transportschicht festgehalten wird. Sogar ein modernes Übertragungsprotokoll wie MPTCP, welches es ermöglicht mehrere Netzwerkpfade zu nutzen, kann die (oben genannten) Anforderungen oder Bedürfnisse des Inhaltes, nicht für die Pfadselektierung, in Betracht ziehen. In dieser Arbeit fordern wir die Trennung der Schichten heraus und zeigen, dass ein Informationsaustausch zwischen den Netzwerkschichten von großem Vorteil für das Konsumieren von Webseiten und Video Inhalten sein kann. Hierzu haben wir einen Ereignisorientierten Simulator entwickelt, mit dem wir untersuchten wie Applikationen eine informierte Entscheidung darüber treffen können, welche Netzwerkschnittstellen für verschiedene Inhalte, basierend auf vordefinierten Regeln, welche die Leistungsvorgaben oder Bedürfnisse eines Inhalts kodieren, benutzt werden sollen. Unsere Regeln erreichen eine Verbesserung um einen Faktor von Zwei in 20% unserer Testfälle, haben einen Vorteil in mehr als 50% der Fälle und erzeugen in keinem Fall einen Mehraufwand. Für Video Inhalte haben wir ein komplettes Video-Streaming System entwickelt, welches einen noch feingranulareren Informationsaustausch zwischen der Applikation und des Transportes ermöglicht. Unser, VOXEL genanntes, System ermöglicht es Applikationen dynamisch und auf Videobild Granularität zu bestimmen welche Videodaten, entsprechend der aktuellen Netzwerksituation, übertragen werden sollen. VOXEL kann das stehenbleiben von Videos im 90%-Perzentil drastisch, um bis zu 97%, reduzieren, ohne dabei die visuelle Qualität des übertragenen Videos zu beeinträchtigen. Wir haben unsere Leistungsverbesserung in einer Studie mit echten Benutzern bestätigt, bei der 84% der Befragten es, im vergleich zum aktuellen Stand der Technik, klar bevorzugten Videos zu schauen, die über VOXEL übertragen wurden

Journal of Telecommunications and Information Technology, nr 3

kwartalni

Contribution to design a communication framework for vehicular ad hoc networks in urban scenarios

The constant mobility of people, the growing need to be always connected, the large number of vehicles that nowadays can be found in the roads and the advances in technology make Vehicular Ad hoc Networks (VANETs) be a major area of research. Vehicular Ad hoc Networks are a special type of wireless Mobile Ad hoc Networks (MANETs), which allow a group of mobile nodes configure a temporary network and maintain it without the need of a fixed infrastructure. A vehicular network presents some specific characteristics, as the very high speed of nodes. Due to this high speed the topology changes are frequent and the communication links may last only a few seconds. Smart cities are now a reality and have a direct relationship with vehicular networks. With the help of existing infrastructure such as traffic lights, we propose a scheme to update and analyse traffic density and a warning system to spread alert messages. With this, traffic lights assist vehicular networks to take proper decisions. This would ensure less congested streets. It would also be possible that the routing protocol forwards data packets to vehicles on streets with enough neighbours to increase the possibility of delivering the packets to destination. Sharing updated, reliable and real-time information, about traffic conditions, weather or security alerts, increases the need of algorithms for the dissemination of information that take into account the main beneffits and constraints of these networks. For all this, routing protocols for vehicular networks have the difficult task to select and establish transmission links to send the data packets from source to destination through multiple nodes using intermediate vehicles efficiently. The main objective of this thesis is to provide improvements in the communication framework for vehicular networks to improve decisions to select next hops in the moment to send information, in this way improving the exchange of information to provide suitable communication to minimize accidents, reduce congestion, optimize resources for emergencies, etc. Also, we include intelligence to vehicles at the moment to take routing decisions. Making them map-aware, being conscious of the presence of buildings and other obstacles in urban environments. Furthermore, our proposal considers the decision to store packets for a maximum time until finding other neighbouring nodes to forward the packets before discarding them. For this, we propose a protocol that considers multiple metrics that we call MMMR (A Multimetric, Map-Aware Routing Protocol ). MMMR is a protocol based on geographical knowledge of the environment and vehicle location. The metrics considered are the distance, the density of vehicles in transmission range, the available bandwidth and the future trajectory of the neighbouring nodes. This allows us to have a complete view of the vehicular scenario to anticipate the driver about possible changes that may occur. Thus, a node can select a node among all its neighbours, which is the best option to increase the likelihood of successful packet delivery, minimizing time and offering a level of quality and service. In the same way, being aware of the increase of information in wireless environments, we analyse the possibility of offering anonymity services. We include a mechanism of anonymity in routing protocols based on the Crowd algorithm, which uses the idea of hiding the original source of a packet. This allowed us to add some level of anonymity on VANET routing protocols. The analytical modeling of the available bandwidth between nodes in a VANET, the use of city infrastructure in a smart way, the forwarding selection in data routing byvehicles and the provision of anonymity in communications, are issues that have been addressed in this PhD thesis. In our research work we provide contributions to improve the communication framework for Vehicular Ad hoc Networks obtaining benefits toenhance the everyday of the population.La movilidad constante de las personas y la creciente necesidad de estar conectados en todo momento ha hecho de las redes vehiculares un área cuyo interés ha ido en aumento. La gran cantidad de vehículos que hay en la actualidad, y los avances tecnológicos han hecho de las redes vehiculares (VANETS, Vehicular Ad hoc Networks) un gran campo de investigación. Las redes vehiculares son un tipo especial de redes móviles ad hoc inalámbricas, las cuales, al igual que las redes MANET (Mobile Ad hoc Networks), permiten a un grupo de nodos móviles tanto configurar como mantener una red temporal por si mismos sin la necesidad de una infraestructura fija. Las redes vehiculares presentan algunas características muy representativas, por ejemplo, la alta velocidad que pueden alcanzar los nodos, en este caso vehículos. Debido a esta alta velocidad la topología cambia frecuentemente y la duración de los enlaces de comunicación puede ser de unos pocos segundos. Estas redes tienen una amplia área de aplicación, pudiendo tener comunicación entre los mismos nodos (V2V) o entre los vehículos y una infraestructura fija (V2I). Uno de los principales desafíos existentes en las VANET es la seguridad vial donde el gobierno y fabricantes de automóviles han centrado principalmente sus esfuerzos. Gracias a la rápida evolución de las tecnologías de comunicación inalámbrica los investigadores han logrado introducir las redes vehiculares dentro de las comunicaciones diarias permitiendo una amplia variedad de servicios para ofrecer. Las ciudades inteligentes son ahora una realidad y tienen una relación directa con las redes vehiculares. Con la ayuda de la infraestructura existente, como semáforos, se propone un sistema de análisis de densidad de tráfico y mensajes de alerta. Con esto, los semáforos ayudan a la red vehicular en la toma de decisiones. Así se logrará disponer de calles menos congestionadas para hacer una circulación más fluida (lo cual disminuye la contaminación). Además, sería posible que el protocolo de encaminamiento de datos elija vehículos en calles con suficientes vecinos para incrementar la posibilidad de entregar los paquetes al destino (minimizando pérdidas de información). El compartir información actualizada, confiable y en tiempo real sobre el estado del tráfico, clima o alertas de seguridad, aumenta la necesidad de algoritmos de difusión de la información que consideren los principales beneficios y restricciones de estas redes. Así mismo, considerar servicios críticos que necesiten un nivel de calidad y servicio es otro desafío importante. Por todo esto, un protocolo de encaminamiento para este tipo de redes tiene la difícil tarea de seleccionar y establecer enlaces de transmisión para enviar los datos desde el origen hacia el destino vía múltiples nodos utilizando vehículos intermedios de una manera eficiente. El principal objetivo de esta tesis es ofrecer mejoras en los sistemas de comunicación vehicular que mejoren la toma de decisiones en el momento de realizar el envío de la información, con lo cual se mejora el intercambio de información para poder ofrecer comunicación oportuna que minimice accidentes, reduzca atascos, optimice los recursos destinados a emergencias, etc. Así mismo, incluimos más inteligencia a los coches en el momento de tomar decisiones de encaminamiento de paquetes. Haciéndolos conscientes de la presencia de edificios y otros obstáculos en los entornos urbanos. Así como tomar la decisión de guardar paquetes durante un tiempo máximo de modo que se encuentre otros nodos vecinos para encaminar paquetes de información antes de descartarlo. Para esto, proponemos un protocolo basado en múltiples métricas (MMMR, A Multimetric, Map-aware Routing Protocol ) que es un protocolo geográfio basado en el conocimiento del entorno y localización de los vehículos. Las métricas consideradas son la distancia, la densidad de vehículos en el área de transmisión, el ancho de banda disponible y la trayectoria futura de los nodos vecinos. Esto nos permite tener una visión completa del escenario vehicular y anticiparnos a los posibles cambios que puedan suceder. Así, un nodo podrá seleccionar aquel nodo entre todos sus vecinos posibles que sea la mejor opción para incrementar la posibilidad de entrega exitosa de paquetes, minimizando tiempos y ofreciendo un cierto nivel de calidad y servicio. De la misma manera, conscientes del incremento de información que circula por medios inalámbricos, se analizó la posibilidad de servicios de anonimato. Incluimos pues un mecanismo de anonimato en protocolos de encaminamiento basado en el algoritmo Crowd, que se basa en la idea de ocultar la fuente original de un paquete. Esto nos permitió añadir cierto nivel de anonimato que pueden ofrecer los protocolos de encaminamiento. El modelado analítico del ancho de banda disponible entre nodos de una VANET, el uso de la infraestructura de la ciudad de una manera inteligente, la adecuada toma de decisiones de encaminamiento de datos por parte de los vehículos y la disposición de anonimato en las comunicaciones, son problemas que han sido abordados en este trabajo de tesis doctoral que ofrece contribuciones a la mejora de las comunicaciones en redes vehiculares en entornos urbanos aportando beneficios en el desarrollo de la vida diaria de la población

Performance analysis of an asynchronous transfer mode multiplexer with Markov modulated inputs

Ankara : Department of Electrical and Electronics Engineering and the Institute of Engineering and Science of Bilkent University, 1993.Thesis (Ph.D.) -- Bilkent Iniversity, 1993.Includes bibliographical references leaves 108-113.Asynchronous Transfer Mode (ATM) networks have inputs which consist of superpositions of correlated cell streams. Markov modulated processes are commonly used to characterize this correlation. The first step through gaining an analytical insight in the performance issues of an ATM network is the analysis of a single channel. One objective of this study is the performance analysis of an ATM multiplexer whose input is a Markov modulated periodic arrival process. Based on the transient behavior of the nD/D/1 queue, we present an approximate method to compute the queue length distribution accurately. The method reduces to the solution of a linear differential equation with variable coefficients. Another general traffic model is the Markov Modulated Poisson Process (MMPP). We employ Pade approximations in transform domain for the deterministic service time distribution in an M MPP/D/1 queue so as to compute the distribution of the buffer occupancy. For both models, we also provide algorithms for analysis in the case of finite queue capacities and for computation of effective bandwidth.Akar, NailPh.D