Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 6 May 2021 in eess.SP and cs.NI | (2105.02920v1)

Abstract: It is well-known that fractal signals appear in many fields of science. LAN and WWW traces, wireless traffic, VBR resources, etc. are among the ones with this behavior in computer networks traffic flows. An important question in these applications is how long a measured trace should be to obtain reliable estimates of de Hurst index (H). This paper addresses this question by first providing a thorough study of estimator for short series based on the behavior of bias, standard deviation (s), Root-Mean-Square Error (RMSE), and convergence when using Gaussian H-Self-Similar with Stationary Increments signals (H-sssi signals). Results show that Whittle-type estimators behave the best when estimating H for short signals. Based on the results, empirically derived the minimum trace length for the estimators is proposed. Finally for testing the results, the application of estimators to real traces is accomplished. Immediate applications from this can be found in the real-time estimation of H which is useful in agent-based control of Quality of Service (QoS) parameters in the high-speed computer network traffic flows.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.