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

EasyChair Preprint no. 5144

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.

Keyphrases: chaotic maps, fractality, Hurst exponent (H), self-similarity, traffic modeling in high-speed computer networks

@Booklet{EasyChair:5144,
  author = {Ginno Millán},
  title = {A Simple Chaotic Map Model for Fractal Traffic Generation in High-speed Computer Networks},
  howpublished = {EasyChair Preprint no. 5144},

  year = {EasyChair, 2021}}