Analysis of adaptive video streaming for users with demand heterogeneity

The revolution of smart phones and other electronic gadgets have increased the attention given to video streaming phenomena. The demand of video quality has also augmented as the number of users keeps on growing. This has toughened the distribution of bandwidth. It is becoming more challenging for service providers to cope with varied demand of video quality. In real life, users change frequently their demand of video quality. To mitigate these problems, an adaptive streaming approach was proposed to solve the problem related to users’ heterogeneous demands. A linear programing approach based on demand and supply was used to analyse and sustain user with low bandwidth. Enhancement Fractional Participative Scheme (EFPS) based on bandwidth contribution was explored. Using JSVM9.14 software, the simulated result shows that the optimized algorithms and enhancement structure improve the performance

Simulation and performance of a statistical multiplexer in an ATM network

This report examines some of the issues arising m the implementation of statistical multiplexing in a broadband Integrated digital services network (B-ISDN) by analysis and simulation The BISDN concept is introduced and described. A review o f the current areas of research is given along with some of the important issues as they relate to telephone traffic. The report then focuses on the problem o f multiplexing voice traffic. A typical voice source is analysed and the traffic characteristics which result are described. The concept of statistical multiplexing is mtroduced. A review of the current literature studies relating to the problems of analysing multiplexed sources is given, with particular reference to the concept of cell level and burst level queues being separate and disparate components requiring different analytical approaches. Several models are mtroduced including the 3-state model not previously described in the literature. The queue behaviour resulting from a large number of superposed lmes is analysed as a simplified Markov process and the results are used to argue that it is not feasible to provide buffers for nodes which multiplex a large number of low intensity sources. The problem of scaling small models up to realistic situations is discussed. An approach to simulating the problem is described along with algorithms for implementing the basic elements. A senes of results derived from the described simulation are presented and analysed. The report concludes that statistical multiplexing is feasible, but with certain limits as to the type of traffic which can be supported

Modelos analíticos para la evaluación de mecanismos de control de tráfico en redes ATM

Se presentan una serie de modelos analíticos que son de utilidad para la evaluación de mecanismos de control de tráfico en redes digitales de servicios integrados de alta velocidad que usan conmutación de paquetes. En concreto se estudia el caso de redes ATM (Asynchronous Transfer Mode).Por un lado se ha desarrollado un modelo para evaluar la perturbación que se introduce al multiplexar un flujo individual de tasa constante que tráfico a ráfagas. Por otro lado, se ha estudiado mecanismos que permiten discriminar entre células ATM que ocupan un buffer de memoria en un mutiplexor o conmutador, estableciendo una prioridad de pérdidas.En el desarrollo de los modelos se ha tenido en cuenta las correlaciones que aparecen en los flujos de tráfico de dichas redes. Para ello se han usado modelos markovianos, en los que el estado de una cadena de Markov permite caracterizar la intensidad del tráfico. Los modelos de colas resultantes se han resuelto usando la metodología de análisis matricial de colas desarrollada principalmente por M. F. Neuts y modelos de aproximación de fluido.We study analytical models for the performance evaluation of traffic control mechanisms in high-speed packet switching digital integrated services networks. In particular, we focus our study on the case of ATM networks.The main contributions of this work are two: (i) An analytical model to evaluate the Cell Delay Variation introduced on a CBR flow, and (ii) several analytical models to study Space Priority mechanism, which introduce a priority among cells in the occupancy of multiplexers and switch buffers.These models take into account the traffic correlation present in this type of networks. We have used markovian models, where each state of the Markov chain characterizes the intensity of the traffic. The obtained queueing models where solved using the Matrix Analysis methodology developed by M. F. Neuts, and a fluid-flow approximation