Traffic Flows Analysis in High-Speed Computer Networks Using Time Series

by   G. Millán, et al.

This article explores the required amount of time series points from a high-speed traffic network to accurately estimate the Hurst exponent. The methodology consists in designing an experiment using estimators that are applied to time series, followed by addressing the minimum amount of points required to obtain accurate estimates of the Hurst exponent in real-time. The methodology addresses the exhaustive analysis of the Hurst exponent considering bias behavior, standard deviation, mean square error, and convergence using fractional gaussian noise signals with stationary increases. Our results show that the Whittle estimator successfully estimates the Hurst exponent in series with few points. Based on the results obtained, a minimum length for the time series is empirically proposed. Finally, to validate the results, the methodology is applied to real traffic captures in a high-speed network based on the IEEE 802.3ab standard.



There are no comments yet.


page 7

page 9

page 11

page 13


Preliminaries on the Accurate Estimation of the Hurst Exponent Using Time Series

This article explores the required amount of time series points from a h...

On the Time Series Length for an Accurate Fractal Analysis in Network Systems

It is well-known that fractal signals appear in many fields of science. ...

A Simplified Multifractal Model for Self-Similar Traffic Flows in High-Speed Computer Networks Revisited

In the context of the simulations carried out using a simplified multifr...

The Associative Multifractal Process: A Novel Model for Computer Network Traffic Flows

A novel constructive mathematical model based on the multifractal formal...

The Hurst roughness exponent and its model-free estimation

We say that a continuous real-valued function x admits the Hurst roughne...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.