Article
Version 2
Preserved in Portico This version is not peer-reviewed
A Simple Chaotic Map Model for Fractal Traffic Generation in High-speed Computer Networks
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)
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. Preprints 2021, 2021030325. https://doi.org/10.20944/preprints202103.0325.v2 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.v2
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.
Keywords
Chaotic maps; Fractality; Hurst exponent (H); Self-similarity; Traffic modeling in high-speed computer networks
Subject
Computer Science and Mathematics, Computational Mathematics
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.
Comments (1)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
Commenter: Ginno Millan
Commenter's Conflict of Interests: Author
1.- Reference 2 is updated.
2.- Reference 5 is updated.