Internet protocol TV (IPTV) is predicted to be the key technology winner in the future. Efforts to accelerate the deployment of IPTV centralized model which is combined of VHO, encoders, controller, access network and Home network. Regardless of whether the network is delivering live TV, VOD, or Time-shift TV, all content and network traffic resulting from subscriber requests must traverse the entire network from the super-headend all the way to each subscriber's Set-Top Box (STB).IPTV services require very stringent QoS guarantees When IPTV traffic shares the network resources with other traffic like data and voice, how to ensure their QoS and efficiently utilize the network resources is a key and challenging issue. For QoS measured in the network-centric terms of delay jitter, packet losses and bounds on delay. The main focus of this thesis is on the optimized bandwidth allocation and smooth datatransmission. The proposed traffic model for smooth delivering video service IPTV network with its QoS performance evaluation. According to Maglaris et al [5] First, analyze the coding bit rate of a single video source. Various statistical quantities are derived from bit rate data collected with a conditional replenishment inter frame coding scheme. Two correlated Markov process models (one in discrete time and one incontinuous time) are shown to fit the experimental data and are used to model the input rates of several independent sources into a statistical multiplexer. Preventive control mechanism which is to be include CAC, traffic policing used for traffic control.QoS has been evaluated of common bandwidth scheduler( FIFO) by use fluid models with Markovian queuing method and analysis the result by using simulator andanalytically, Which is measured the performance of the packet loss, overflow and mean waiting time among the network users.

Internet protocol TV (IPTV) is predicted to be the key technology winner in the future. Efforts to accelerate the deployment of IPTV centralized model which is combined of VHO, encoders, controller, access network and Home network. Regardless of whether the network is delivering live TV, VOD, or Time-shift TV, all content and network traffic resulting from subscriber requests must traverse the entire network from the super-headend all the way to each subscriber's Set-Top Box (STB). IPTV services require very stringent QoS guarantees When IPTV traffic shares the network resources with other traffic like data and voice, how to ensure their QoS and efficiently utilize the network resources is a key and challenging issue. For QoS measured in the network-centric terms of delay jitter, packet losses and bounds on delay. The main focus of this thesis is on the optimized bandwidth allocation and smooth data transmission. The proposed traffic model for smooth delivering video service IPTV network with its QoS performance evaluation. According to Maglaris et al [5] first, analyze the coding bit rate of a single video source. Various statistical quantities are derived from bit rate data collected with a conditional replenishment inter frame coding scheme. Two correlated Markov process models (one in discrete time and one in continuous time) are shown to fit the experimental data and are used to model the input rates of several independent sources into a statistical multiplexer. Preventive control mechanism which is to be including CAC, traffic policing used for traffic control. QoS has been evaluated of common bandwidth scheduler( FIFO) by use fluid models with Markovian queuing method and analysis the result by using simulator and analytically, Which is measured the performance of the packet loss, overflow and mean waiting time among the network users.

The U.S. Coast Guard maintains a network structure to connect its nation-wide assets. This paper analyzes and models four highly aggregate traces of the traffic to/from the Coast Guard Data Network ship-shore nodes, so that the models may be used to predict future system demand. These internet traces (polled at 5â 40â intervals) are shown to adhere to a Gaussian distribution upon detrending, which imposes limits to the exponential distribution of higher time-resolution traces. Wavelet estimation of the Hurst-parameter is shown to outperform estimation by another common method (Sample-Variances). The First Differences method of detrending proved problematic to this analysis and is shown to decorrelate AR(1) processes where 0.65< phi1 <1.35 and correlate AR(1) processes with phi1 <-0.25. The Hannan-Rissanen method for estimating (phi,theta) is employed to analyze this series and a one-step ahead forecast is generated. / Master of Science

Estudos mostraram que o tráfego nas redes de dados tanto locais quanto de grande área, possui propriedades fractais como dependência de longa duração - Long-Range Dependence (LRD) e auto-similaridade. Devido à heterogeneidade de aplicações nessas redes, os traces de tráfego podem apresentar dependência de longa duração - Long Range Dependence (LRD), dependência de curta duração - Short Range Dependence (SRD) ou uma mistura de LRD com SRD. Sendo assim, este trabalho tem como objetivo sintetizar séries temporais gaussianas com flexibilidade de processamento no plano tempo-frequência a serem inseridas num gerador de tráfego com as características estatísticas específicas do tráfego encontrado em redes por comutação de pacotes reais, como autossimilaridade, LRD e SRD. Para isto foram desenvolvidos dois métodos para síntese de séries temporais gaussianas com LRD e simultânea introdução de SRD em diferentes faixas de frequência: Discrete Wavelet Tansform (DWT) com mapa de variâncias e Discrete Wavelet Packet Tansform (DWPT). Estes métodos utilizaram o mapa de variâncias cujo conceito foi desenvolvido neste trabalho. A validação dos métodos foi feita através de análise estatística e comparação com resultados de séries geradas pelo método Discrete Wavelet Transfom (DWT) de Backar utilizado em [1]. Além disso, também foi validada a ideia de que a DWPT é mais interessante que a DWT por ser mais flexível e prover uma maior flexibilidade de processamento no plano tempo-frequência. / Studies demonstrated that the data network traffic of Local Area Network (LAN) and Wide Area Network has fractal properties as long range dependence (LRD) and self-similarity. The traffic traces can show long range dependence, short range dependence or the both behaviors because of applications heterogeneity in these networks. This work objective is to synthetisize gaussian time series with processor flexibility in the time-frequency plan to be inserted in a traffic generator with the specific statistical traffic characteristics of real packet networks such as selfsimilarity, long range dependence (LRD) and short range dependence (SRD). Two methods were developed for the gaussian time series with LRD and SRD synthesis: Discrete Wavelet Tansform (DWT) with variance map and Discrete Wavelet Packet Tansform (DWPT). These methods used the variance map which concept was developed in this work. The methods validation was done by statistic analysis and comparison with the time series generated by the B¨ackar Discrete Wavelet Transfom (DWT) used by [1]. Besides of this, the idea that the DWPT is more because of its processing flexibility in the time-frequency plan was validated.

Estudos mostraram que o tráfego nas redes de dados tanto locais quanto de grande área, possui propriedades fractais como dependência de longa duração - Long-Range Dependence (LRD) e auto-similaridade. Devido à heterogeneidade de aplicações nessas redes, os traces de tráfego podem apresentar dependência de longa duração - Long Range Dependence (LRD), dependência de curta duração - Short Range Dependence (SRD) ou uma mistura de LRD com SRD. Sendo assim, este trabalho tem como objetivo sintetizar séries temporais gaussianas com flexibilidade de processamento no plano tempo-frequência a serem inseridas num gerador de tráfego com as características estatísticas específicas do tráfego encontrado em redes por comutação de pacotes reais, como autossimilaridade, LRD e SRD. Para isto foram desenvolvidos dois métodos para síntese de séries temporais gaussianas com LRD e simultânea introdução de SRD em diferentes faixas de frequência: Discrete Wavelet Tansform (DWT) com mapa de variâncias e Discrete Wavelet Packet Tansform (DWPT). Estes métodos utilizaram o mapa de variâncias cujo conceito foi desenvolvido neste trabalho. A validação dos métodos foi feita através de análise estatística e comparação com resultados de séries geradas pelo método Discrete Wavelet Transfom (DWT) de Backar utilizado em [1]. Além disso, também foi validada a ideia de que a DWPT é mais interessante que a DWT por ser mais flexível e prover uma maior flexibilidade de processamento no plano tempo-frequência. / Studies demonstrated that the data network traffic of Local Area Network (LAN) and Wide Area Network has fractal properties as long range dependence (LRD) and self-similarity. The traffic traces can show long range dependence, short range dependence or the both behaviors because of applications heterogeneity in these networks. This work objective is to synthetisize gaussian time series with processor flexibility in the time-frequency plan to be inserted in a traffic generator with the specific statistical traffic characteristics of real packet networks such as selfsimilarity, long range dependence (LRD) and short range dependence (SRD). Two methods were developed for the gaussian time series with LRD and SRD synthesis: Discrete Wavelet Tansform (DWT) with variance map and Discrete Wavelet Packet Tansform (DWPT). These methods used the variance map which concept was developed in this work. The methods validation was done by statistic analysis and comparison with the time series generated by the B¨ackar Discrete Wavelet Transfom (DWT) used by [1]. Besides of this, the idea that the DWPT is more because of its processing flexibility in the time-frequency plan was validated.

Financial processes may possess long memory and their probability densities may display heavy tails. Many models have been developed to deal with this tail behaviour, which reflects the jumps in the sample paths. On the other hand, the presence of long memory, which contradicts the efficient market hypothesis, is still an issue for further debates. These difficulties present challenges with the problems of memory detection and modelling the co-presence of long memory and heavy tails. This PhD project aims to respond to these challenges. The first part aims to detect memory in a large number of financial time series on stock prices and exchange rates using their scaling properties. Since financial time series often exhibit stochastic trends, a common form of nonstationarity, strong trends in the data can lead to false detection of memory. We will take advantage of a technique known as multifractal detrended fluctuation analysis (MF-DFA) that can systematically eliminate trends of different orders. This method is based on the identification of scaling of the q-th-order moments and is a generalisation of the standard detrended fluctuation analysis (DFA) which uses only the second moment; that is, q = 2. We also consider the rescaled range R/S analysis and the periodogram method to detect memory in financial time series and compare their results with the MF-DFA. An interesting finding is that short memory is detected for stock prices of the American Stock Exchange (AMEX) and long memory is found present in the time series of two exchange rates, namely the French franc and the Deutsche mark. Electricity price series of the five states of Australia are also found to possess long memory. For these electricity price series, heavy tails are also pronounced in their probability densities. The second part of the thesis develops models to represent short-memory and longmemory financial processes as detected in Part I. These models take the form of continuous-time AR(∞) -type equations whose kernel is the Laplace transform of a finite Borel measure. By imposing appropriate conditions on this measure, short memory or long memory in the dynamics of the solution will result. A specific form of the models, which has a good MA(∞) -type representation, is presented for the short memory case. Parameter estimation of this type of models is performed via least squares, and the models are applied to the stock prices in the AMEX, which have been established in Part I to possess short memory. By selecting the kernel in the continuous-time AR(∞) -type equations to have the form of Riemann-Liouville fractional derivative, we obtain a fractional stochastic differential equation driven by Brownian motion. This type of equations is used to represent financial processes with long memory, whose dynamics is described by the fractional derivative in the equation. These models are estimated via quasi-likelihood, namely via a continuoustime version of the Gauss-Whittle method. The models are applied to the exchange rates and the electricity prices of Part I with the aim of confirming their possible long-range dependence established by MF-DFA. The third part of the thesis provides an application of the results established in Parts I and II to characterise and classify financial markets. We will pay attention to the New York Stock Exchange (NYSE), the American Stock Exchange (AMEX), the NASDAQ Stock Exchange (NASDAQ) and the Toronto Stock Exchange (TSX). The parameters from MF-DFA and those of the short-memory AR(∞) -type models will be employed in this classification. We propose the Fisher discriminant algorithm to find a classifier in the two and three-dimensional spaces of data sets and then provide cross-validation to verify discriminant accuracies. This classification is useful for understanding and predicting the behaviour of different processes within the same market. The fourth part of the thesis investigates the heavy-tailed behaviour of financial processes which may also possess long memory. We consider fractional stochastic differential equations driven by stable noise to model financial processes such as electricity prices. The long memory of electricity prices is represented by a fractional derivative, while the stable noise input models their non-Gaussianity via the tails of their probability density. A method using the empirical densities and MF-DFA will be provided to estimate all the parameters of the model and simulate sample paths of the equation. The method is then applied to analyse daily spot prices for five states of Australia. Comparison with the results obtained from the R/S analysis, periodogram method and MF-DFA are provided. The results from fractional SDEs agree with those from MF-DFA, which are based on multifractal scaling, while those from the periodograms, which are based on the second order, seem to underestimate the long memory dynamics of the process. This highlights the need and usefulness of fractal methods in modelling non-Gaussian financial processes with long memory.