Paper
8 August 2003 Accurate and fast replication on the generation of fractal network traffic using alternative probability models
Stenio Fernandes, Carlos Kamienski, Djamel Sadok
Author Affiliations +
Abstract
Synthetic self-similar traffic in computer networks simulation is of imperative significance for the capturing and reproducing of actual Internet data traffic behavior. A universally used procedure 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.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Stenio Fernandes, Carlos Kamienski, and Djamel Sadok "Accurate and fast replication on the generation of fractal network traffic using alternative probability models", Proc. SPIE 5244, Performance and Control of Next-Generation Communications Networks, (8 August 2003); https://doi.org/10.1117/12.509375
Lens.org Logo
CITATIONS
Cited by 10 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer simulations

Fractal analysis

Computer networks

Monte Carlo methods

Statistical analysis

Networks

Superposition

Back to Top