Preprint
Article

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

This version is not peer-reviewed.

Submitted:

09 March 2021

Posted:

11 March 2021

Read the latest preprint version here

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  -   Algebra and Number Theory
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

Altmetrics

Downloads

331

Views

345

Comments

0

Subscription

Notify me about updates to this article or when a peer-reviewed version is published.

Email

Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2025 MDPI (Basel, Switzerland) unless otherwise stated