Version 1
: Received: 9 March 2021 / Approved: 11 March 2021 / Online: 11 March 2021 (16:11:08 CET)
Version 2
: Received: 11 March 2021 / Approved: 15 March 2021 / Online: 15 March 2021 (16:32:07 CET)
How to cite:
Millán, G. A Simple Chaotic Map Model for Fractal Traffic Generation in High-speed Computer Networks. Preprints2021, 2021030325. https://doi.org/10.20944/preprints202103.0325.v1
Millán, G. A Simple Chaotic Map Model for Fractal Traffic Generation in High-speed Computer Networks. Preprints 2021, 2021030325. https://doi.org/10.20944/preprints202103.0325.v1
Millán, G. A Simple Chaotic Map Model for Fractal Traffic Generation in High-speed Computer Networks. Preprints2021, 2021030325. https://doi.org/10.20944/preprints202103.0325.v1
APA Style
Millán, G. (2021). A Simple Chaotic Map Model for Fractal Traffic Generation in High-speed Computer Networks. Preprints. https://doi.org/10.20944/preprints202103.0325.v1
Chicago/Turabian Style
Millán, G. 2021 "A Simple Chaotic Map Model for Fractal Traffic Generation in High-speed Computer Networks" Preprints. https://doi.org/10.20944/preprints202103.0325.v1
Abstract
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.
Computer Science and Mathematics, Algebra and Number Theory
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.