A simple chaotic map model for fractal traffic generation in high-speed computer networks (Draft 3)

An extension of the models used to generate fractal traffic flows is presented by means of the formulation of a model that considers the use of one-dimensional chaotic maps. Based on the disaggregation of the temporal series generated by the model, a valid explanation of behavior of the values of Hurst exponent is proposed and the feasibility of their control from the parameters of the proposed model is shown.

A simple chaotic map model for fractal traffic generation in high-speed computer networks (Draft 2)

An extension of the models used to generate fractal traffic flows is presented by means of the formulation of a model that considers the use of one-dimensional chaotic maps. Based on the disaggregation of the temporal series generated by the model, a valid explanation of behavior of the values of Hurst exponent is proposed and the feasibility of their control from the parameters of the proposed model is shown.

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

A novel constructive mathematical model based on the multifractal formalism in order to accurately characterizing the localized fluctuations present in the course of traffic flows today high-speed computer networks is presented. The proposed model has the target to analyze self-similar second-order time series representative of traffic flows in terms of their roughness and impulsivity.

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

A novel constructive mathematical model based on the multifractal formalism in order to accurately characterizing the localized fluctuations present in the course of traffic flows today high-speed computer networks is presented. The proposed model has the target to analyze self-similar second-order time series representative of traffic flows in terms of their roughness and impulsivity.

Time Series Analysis of Computer Network Traffic in a Dedicated Link Aggregation

Fractal behavior and long-range dependence are widely observed in measurements and characterization of traffic flow in high-speed computer networks of different technologies and coverage levels. This paper presents the results obtained when applying fractal analysis techniques on a time series obtained from traffic captures coming from an application server connected to the Internet through a high-speed link. The results obtained show that traffic flow in the dedicated high-speed network link have fractal behavior when the Hurst exponent is in the range of 0.5, 1, the fractal dimension between 1, 1.5, and the correlation coefficient between –0.5, 0. Based on these results, it is ideal to characterize both the singularities of the traffic and its impulsiveness during a fractal analysis of temporal scales. Finally, based on the results of the time series analyses, the fact that the traffic flows of current computer networks exhibit fractal behavior with a long-range dependency is reaffirmed.

Time Series Analysis of Computer Network Traffic in a Dedicated Link Aggregation

Fractal behavior and long-range dependence are widely observed in measurements and characterization of traffic flow in high-speed computer networks of different technologies and coverage levels. This paper presents the results obtained when applying fractal analysis techniques on a time series obtained from traffic captures coming from an application server connected to the Internet through a high-speed link. The results obtained show that traffic flow in the dedicated high-speed network link have fractal behavior when the Hurst exponent is in the range of 0.5, 1, the fractal dimension between 1, 1.5, and the correlation coefficient between –0.5, 0. Based on these results, it is ideal to characterize both the singularities of the traffic and its impulsiveness during a fractal analysis of temporal scales. Finally, based on the results of the time series analyses, the fact that the traffic flows of current computer networks exhibit fractal behavior with a long-range dependency is reaffirmed.

Time Series Analysis of Computer Network Traffic in a Dedicated Link Aggregation

Fractal behavior and long-range dependence are widely observed in measurements and characterization of traffic flow in high-speed computer networks of different technologies and coverage levels. This paper presents the results obtained when applying fractal analysis techniques on a time series obtained from traffic captures coming from an application server connected to the Internet through a high-speed link. The results obtained show that traffic flow in the dedicated high-speed network link have fractal behavior when the Hurst exponent is in the range of 0.5, 1, the fractal dimension between 1, 1.5, and the correlation coefficient between –0.5, 0. Based on these results, it is ideal to characterize both the singularities of the traffic and its impulsiveness during a fractal analysis of temporal scales. Finally, based on the results of the time series analyses, the fact that the traffic flows of current computer networks exhibit fractal behavior with a long-range dependency is reaffirmed.

Time series analysis of computer network traffic in a dedicated link aggregation

Fractal behavior and long-range dependence are widely observed in measurements and characterization of traffic flow in high-speed computer networks of different technologies and coverage levels. This paper presents the results obtained when applying fractal analysis techniques on a time series obtained from traffic captures coming from an application server connected to the Internet through a high-speed link. The results obtained show that traffic flow in the dedicated high-speed network link have fractal behavior when the Hurst exponent is in the range of 0.5, 1, the fractal dimension between 1, 1.5, and the correlation coefficient between –0.5, 0. Based on these results, it is ideal to characterize both the singularities of the traffic and its impulsiveness during a fractal analysis of temporal scales. Finally, based on the results of the time series analyses, the fact that the traffic flows of current computer networks exhibit fractal behavior with a long-range dependency is reaffirmed.

A Simple Chaotic Map Model for Fractal Traffic Flows in High-speed Computer Networks (Extended and Renewed Version)

This paper presents an extension of the models used to generate fractal traffic flows in high-speed computer networks by means of the formulation of a model that considers the use of one-dimensional chaotic maps. Based on the disaggregation of the temporal series generated, a valid explanation of behavior of the values of Hurst exponent is proposed and the feasibility of their control from the parameters of the proposed model is shown.