Accuracy and Computational Efficiency on the Fractal Traffic Generation

S. Fernandes, C. Kamienski, and D. Sadok (Brazil)

Keywords

Fractal Traffic, Network Performance Analysis, Network Simulation

Abstract

The use of synthetic self-similar traffic in computer networks simulation is of vital importance for the capturing and reproducing of actual Internet data traffic behavior. A commonly used technique for generating self similar traffic is achieved by aggregating On/Off sources where the active (On) and idle (Off) periods exhibit heavy tailed distributions. This work analyzes the balance between accuracy and computational efficiency in generating self-similar traffic and presents important results that can be useful to parameterize existing heavy tailed distributions such as Pareto, Weibull and Lognormal in a simulation analysis. Our results were obtained through the simulation of various scenarios and were evaluated by estimating the Hurst (H) parameter, which measures the self-similarity level, using several methods.

Important Links:



Go Back