Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

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

Version 1 : Received: 5 March 2021 / Approved: 10 March 2021 / Online: 10 March 2021 (10:33:30 CET)

How to cite: Millán, G. Traffic Flows Analysis in High-Speed Computer Networks Using Time Series. Preprints 2021, 2021030275 (doi: 10.20944/preprints202103.0275.v1). Millán, G. Traffic Flows Analysis in High-Speed Computer Networks Using Time Series. Preprints 2021, 2021030275 (doi: 10.20944/preprints202103.0275.v1).

Abstract

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.

Keywords

Computer networks, Hurst exponent, IEEE 802.3ab standard, Time series analysis, Traffic flows analysis.

Subject

MATHEMATICS & COMPUTER SCIENCE, Computational Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.