1 FARIMA(p,d,q) Model and Application n FARIMA Models -- fractional autoregressive integrated moving average n Generating FARIMA Processes n Traffic Modeling.

Slides:



Advertisements
Similar presentations
Copyright © 2005 Department of Computer Science CPSC 641 Winter Self-Similar Network Traffic The original paper on network traffic self-similarity.
Advertisements

Fast Algorithms For Hierarchical Range Histogram Constructions
Sampling: Final and Initial Sample Size Determination
Part II – TIME SERIES ANALYSIS C5 ARIMA (Box-Jenkins) Models
Network and Service Assurance Laboratory Analysis of self-similar Traffic Using Multiplexer & Demultiplexer Loaded with Heterogeneous ON/OFF Sources Huai.
2014 Examples of Traffic. Video Video Traffic (High Definition) –30 frames per second –Frame format: 1920x1080 pixels –24 bits per pixel  Required rate:
R. Werner Solar Terrestrial Influences Institute - BAS Time Series Analysis by means of inference statistical methods.
Properties of the estimates of the parameters of ARMA models.
STAT 497 APPLIED TIME SERIES ANALYSIS
2  Something “feels the same” regardless of scale 4 What is that???
1 Self-Similar Ethernet LAN Traffic Carey Williamson University of Calgary.
On the Self-Similar Nature of Ethernet Traffic - Leland, et. Al Presented by Sumitra Ganesh.
Modeling Cycles By ARMA
Error Propagation. Uncertainty Uncertainty reflects the knowledge that a measured value is related to the mean. Probable error is the range from the mean.
Point estimation, interval estimation
Bootstrap in Finance Esther Ruiz and Maria Rosa Nieto (A. Rodríguez, J. Romo and L. Pascual) Department of Statistics UNIVERSIDAD CARLOS III DE MADRID.
Evaluating Hypotheses
A Nonstationary Poisson View of Internet Traffic T. Karagiannis, M. Molle, M. Faloutsos University of California, Riverside A. Broido University of California,
Self-Similarity in Network Traffic Kevin Henkener 5/29/2002.
Connection Admission Control Schemes for Self-Similar Traffic Yanping Wang Carey Williamson University of Saskatchewan.
Self-Similar through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level Walter Willinger, Murad S. Taqqu, Robert Sherman,
CS 6401 Network Traffic Characteristics Outline Motivation Self-similarity Ethernet traffic WAN traffic Web traffic.
BOX JENKINS METHODOLOGY
Self-Similarity of Network Traffic Presented by Wei Lu Supervised by Niclas Meier 05/
Informational Network Traffic Model Based On Fractional Calculus and Constructive Analysis Vladimir Zaborovsky, Technical University, Robotics Institute,
Traffic modeling and Prediction ----Linear Models
1 Chapters 9 Self-SimilarTraffic. Chapter 9 – Self-Similar Traffic 2 Introduction- Motivation Validity of the queuing models we have studied depends on.
Traffic Modeling.
Statistical Methods For Engineers ChE 477 (UO Lab) Larry Baxter & Stan Harding Brigham Young University.
ARMA models Gloria González-Rivera University of California, Riverside
STAT 497 LECTURE NOTES 2.
Confidence Interval Estimation
Basic Business Statistics, 11e © 2009 Prentice-Hall, Inc. Chap 8-1 Confidence Interval Estimation.
QBM117 Business Statistics Estimating the population mean , when the population variance  2, is known.
Chap 20-1 Statistics for Business and Economics, 6e © 2007 Pearson Education, Inc. Chapter 20 Sampling: Additional Topics in Sampling Statistics for Business.
Population All members of a set which have a given characteristic. Population Data Data associated with a certain population. Population Parameter A measure.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
1 Statistical Distribution Fitting Dr. Jason Merrick.
Various topics Petter Mostad Overview Epidemiology Study types / data types Econometrics Time series data More about sampling –Estimation.
COMPSAC'14 - N. Larrieu /07/ How to generate realistic network traffic? Antoine VARET and Nicolas LARRIEU COMPSAC – Vasteras – July the 23.
Link Dimensioning for Fractional Brownian Input Chen Jiongze PhD student, Electronic Engineering Department, City University of Hong Kong Supported by.
Applications of Neural Networks in Time-Series Analysis Adam Maus Computer Science Department Mentor: Doctor Sprott Physics Department.
Stat 112: Notes 2 Today’s class: Section 3.3. –Full description of simple linear regression model. –Checking the assumptions of the simple linear regression.
Time Series Basics (2) Fin250f: Lecture 3.2 Fall 2005 Reading: Taylor, chapter , 3.9(skip 3.6.1)
1 Self Similar Traffic. 2 Self Similarity The idea is that something looks the same when viewed from different degrees of “magnification” or different.
Reserve Variability – Session II: Who Is Doing What? Mark R. Shapland, FCAS, ASA, MAAA Casualty Actuarial Society Spring Meeting San Juan, Puerto Rico.
Chapter 8: Confidence Intervals based on a Single Sample
ECE-7000: Nonlinear Dynamical Systems Overfitting and model costs Overfitting  The more free parameters a model has, the better it can be adapted.
Time Series Basics Fin250f: Lecture 8.1 Spring 2010 Reading: Brooks, chapter
Estimation Method of Moments (MM) Methods of Moment estimation is a general method where equations for estimating parameters are found by equating population.
STATISTICS 12.0 Correlation and Linear Regression “Correlation and Linear Regression -”Causal Forecasting Method.
1 Probability and Statistics Confidence Intervals.
10.1 – Estimating with Confidence. Recall: The Law of Large Numbers says the sample mean from a large SRS will be close to the unknown population mean.
Computacion Inteligente Least-Square Methods for System Identification.
ESTIMATION OF THE MEAN. 2 INTRO :: ESTIMATION Definition The assignment of plausible value(s) to a population parameter based on a value of a sample statistic.
Introduction to stochastic processes
1 Ka-fu Wong University of Hong Kong A Brief Review of Probability, Statistics, and Regression for Forecasting.
1 Autocorrelation in Time Series data KNN Ch. 12 (pp )
Bias-Variance Analysis in Regression  True function is y = f(x) +  where  is normally distributed with zero mean and standard deviation .  Given a.
1 Interesting Links. On the Self-Similar Nature of Ethernet Traffic Will E. Leland, Walter Willinger and Daniel V. Wilson BELLCORE Murad S. Taqqu BU Analysis.
Applied Econometric Time Series Third Edition
Chapter 6: Autoregressive Integrated Moving Average (ARIMA) Models
Internet Traffic Modeling
Minimal Envelopes.
CHAPTER 16 ECONOMIC FORECASTING Damodar Gujarati
Introduction to Inference
Confidence Intervals Chapter 10 Section 1.
Presented by Chun Zhang 2/14/2003
CH2 Time series.
BOX JENKINS (ARIMA) METHODOLOGY
Presentation transcript:

1 FARIMA(p,d,q) Model and Application n FARIMA Models -- fractional autoregressive integrated moving average n Generating FARIMA Processes n Traffic Modeling Using FARIMA Models n Traffic Prediction Using FARIMA Models n Prediction-based Admission Control n Prediction-based Bandwidth Allocation

2 Self-similar feature of traffic n Fractal characteristics u order of dimension = fractal n Self-similar feature u across wide range of time scales n Burstness: across wide range of time scales n Long-range dependence u ACF (autocorrelation function) n Power law spectral density n Hurst (self-similarity) parameter 0.5<H<1 n [LTWW94] Will E. Leland, Murad S. Taqqu, Walter Willinger, and Daniel V. Wilson, “On the Self-Similar Nature of Ethernet Traffic (Extended Version),” IEEE/ACM Transactions on Networking. Vol 2, No 1, February 1994.

A FARIMA(p,d,q) process {X t : t =...,-1, 0, 1,...} is defined to be (2-1) where {a t } is a white noise and d  (-0.5, 0.5), (2-2) B -- backward-shift operator, BX t = X t-1 FARIMA Models

FARIMA Models (Cont.) For d  (0, 0.5), p  0 and q  0, a FARIMA(p,d,q) process can be regarded as an ARMA(p,q) process driven by FDN. From (2-1), we obtain (2-3) where (2-4) Here, Y t is a FDN (fractionally differenced noise) --FARIMA(0,d,0)

Generating FARIMA Process for Model-driven Simulation

Table 1: H and d of generated FARIMA(0,d,0) and after fractional differencing

7 Network delay on FARIMA models

8 Network delay on FARIMA models with non-Gaussian distribution

Building a FARIMA(p,d,q) Model to Describe a Trace For a given time series X t, we can obtain from (2-1) ( 3-1 ) where ( 3-2 ) Fractional differencing Using the known ways for fitting ARMA models

Building a FARIMA(p,d,q) Model to Describe a Trace(Cont.) Steps of Fitting Traffic:  Step 1: Pre-processing the measured traffic trace to get a zero-mean time series X t.  Step 2: Obtaining an approximate value of d according to the relationship d = H Three method to obtain H: - Variance-time plots - R/S analysis - Periodogram-based method

Building a FARIMA(p,d,q) Model to Describe a Trace(Cont.)  Step 3: Doing fractional differencing on X t. From (2-4) we can get the precise expression (3-3) where (3-4)  Step 4: Model identification: Determining p and q using known ways for fitting ARMA models.  Step 5: Model estimation: Estimating parameters (1+ p + q): d,,

Feasibility Study Constructing FARIMA Models for Actual Traffic: u Traces C1003 and C1008 from CERNET (The Chinese Education and Research Network) u Traces pAug.TL and pOct.TL from Bellcore Lab

Table 1: Fitted FARIMA models of CERNET and Bellcore traces Feasibility Study (Cont.)

Simplification Methods of Modeling Feasibility Study (Cont.)  Fixed order (sample about 100s)  Simplifying the modeling procedure  Experiments

Conclusions of Building FARIMA Model  Building a FARIMA model to the actual traffic trace  Reduce the time of traffic modeling, techniques included - fractal de-filter (fractional differencing) -a combination of rough estimation and accurate estimation - backward-prediction

Prediction Using FARIMA Models to Forecast Time Series -- optimal forecasting Assumptions of causality and invertibility allow us to write, where

Prediction (Cont.)  Minimum mean square error forecasts (h-step) where  The mean squared error of the h-step forecast

Prediction for Actual Traffic Feasibility Study the h-step forecasts, FARIMA(1,d,1) vs. AR(4)

Prediction for Actual Traffic (Cont.) Feasibility Study (Cont.) one-step forecasts vs. actual values, time unit = 0.1s

Traffic Prediction  adapted h-step forecast by adding a bias where e t (h) the forecast errors, and u the upper probability limit.

Traffic Prediction (Cont.) Adaptive traffic prediction of trace  Normal confident interval forecast error <=  t (1) when probability limit = (~32%) forecast error <= 2  t (1) when probability limit = (~4.5%)  Adapted confident interval bias  u = 0 when u = 0.5 bias  u =  t (1) when u = (~16%) bias  u = 2  t (1) when u = (~2%)

Traffic Prediction Procedure  Step1:Building a FARIMA(p,d,q) model to describe the traffic.  Step2: Doing minimum mean square error forecasts.  Step3:Determining the value of upper probability limit u according to the QoS necessary in the particular network.  Step4:Doing traffic predictions by the adapted prediction method with upper probability limit.

Prediction for Actual Traffic Example A daptive traffic prediction of trace, time unit = 0. 1s

Conclusions  FARIMA(p,d,q) models are more superior than other models in capturing the properties of real traffic  Less parameters required  Possible to simplify the fitting procedure and reduce the modeling time  Good result of adapted traffic prediction for real traffic