A Simple Chaotic Map Model for Fractal Traffic Flows in High-speed
Computer Networks
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.