On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Proof of a fundamental result in self-similar traffic modeling
ACM SIGCOMM Computer Communication Review
Fast, approximate synthesis of fractional Gaussian noise for generating self-similar network traffic
ACM SIGCOMM Computer Communication Review
Fast Self-Similar Teletraffic Generation Based on FGN and Wavelets
ICON '99 Proceedings of the 7th IEEE International Conference on Networks
ON SPECTRAL SIMULATION OF FRACTIONAL BROWNIAN MOTION
Probability in the Engineering and Informational Sciences
Long-Range Dependence: Ten Years of Internet Traffic Modeling
IEEE Internet Computing
An empirical comparison of generators for self similar simulated traffic
Performance Evaluation
TestU01: A C library for empirical testing of random number generators
ACM Transactions on Mathematical Software (TOMS)
Gaussian random number generators
ACM Computing Surveys (CSUR)
Fractal dimension applied to plant identification
Information Sciences: an International Journal
A wavelet-based joint estimator of the parameters of long-range dependence
IEEE Transactions on Information Theory
Hi-index | 0.07 |
This paper describes a new algorithm for the generation of pseudo random numbers with approximate self-similar structure. The Simple Self-Similar Sequences Generator (4SG) elaborates on an intuitive approach to obtain a fast and accurate procedure, capable of reproducing series of points exhibiting the property of persistence and anti-persistence. 4SG has a computational complexity of O(n) and memory requirements of the order of log"2(N), where N is the number of points to be generated. The accuracy of the algorithm is evaluated by means of computer-based simulations, recurring to several Hurst parameter estimators, namely Variance Time (VT) and the Wavelets-based estimator. The Hosking and the Wavelets-based methods for the generation of self-similar series were submitted to the same tests the 4SG was analysed with, providing for a basis for comparison of several performance aspects of the algorithm. Results show that the proposal embodies a good candidate not only for on-demand emulation of arbitrarily long self-similar sequences, but also for fast and efficient online simulations.