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

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Traffic Generation ◽  
Speed Computer

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.

scholarly journals A Simple Chaotic Map Model for Fractal Traffic Generation in High-speed Computer Networks

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Traffic Generation ◽  
Speed Computer

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.

scholarly journals A simple chaotic map model for fractal traffic generation in high-speed computer networks

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Traffic Generation ◽  
Speed Computer

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.

scholarly journals A Simple Chaotic Map Model for Fractal Traffic Generation in High-speed Computer Networks

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Traffic Generation ◽  
Speed Computer

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.

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

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Traffic Generation ◽  
Speed Computer

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.

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

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Computer Networks ◽  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Speed Computer

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.

scholarly journals A Simple Chaotic Map Model for Fractal Traffic Flows in High-speed Computer Networks

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Computer Networks ◽  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Speed Computer

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.<br>

scholarly journals A Simple Chaotic Map Model for Fractal Traffic Flows in High-speed Computer Networks

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Computer Networks ◽  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Speed Computer

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.<br>

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

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Computer Networks ◽  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Speed Computer

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.

scholarly journals A simple one-dimensional chaotic map model for the fractal traffic flows generation

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Computer Networks ◽  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Speed Computer

This paper presents an extension of the models used to generation 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 the behavior of the values of Hurst exponent is proposed and the feasibility of their control from the parameters of the proposed model is shown.

scholarly journals A simplified multifractal model for self-similar traffic flows in high-speed computer networks

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Computer Networks ◽  
Network Flow ◽  
Hurst Exponent ◽  
High Speed ◽  
Second Order ◽  
Traffic Flows ◽  
Temporal Series ◽  
Self Similar ◽  
Speed Computer ◽  
Hurst Exponents

This paper proposes a multifractal model, with the aim of providing a possible explanation for the locality phenomenon that appears in the estimation of the Hurst exponent in stationary second order temporal series representing self-similar traffic flows in current high-speed computer networks. It is shown analytically that this phenomenon occurs if the network flow consists of several components with different Hurst exponents.

Sign in / Sign up

Export Citation Format

Share Document