Generation of self-similar processes for simulation studies of telecommunication networks

• Published in: Mathematical and computer modelling Vol. 38; no. 11; pp. 1249 - 1257
• Main Authors: Jeong, Hae-Duck J., Pawlikowski, K., McNickle, D.C.
• Format: Journal Article Conference Proceeding
• Language: English
• Published: Oxford Elsevier Ltd 01.12.2003; Elsevier Science
• Subjects: Applied sciences; Exact sciences and technology; Exponential and inverse transformations; Flows in networks. Combinatorial problems; Hurst parameter; Interarrival process; Operational research and scientific management; Operational research. Management science; Self-similar process; Steady-state simulation; Teletraffic generation; Self-similar process; Interarrival process; Hurst parameter; Teletraffic generation; Exponential and inverse transformations; Steady-state simulation; Exponential transformation; Inverse transformation; Teletraffic; Short range dependency; Communication network; Poisson process; Steady state; Selfsimilarity; Case study; Selfsimilar process; Wavelets; Simulation; Dependence; Arrival process; Telecommunication network; Distribution function; Simulation model
• ISSN: 0895-7177; 1872-9479
• DOI: 10.1016/S0895-7177(03)90127-0

It is generally accepted that self-similar processes may provide better models for teletraffic in modern telecommunication networks than Poisson processes. If stochastic self-similarity of teletraffic is not taken into account, it can lead to inaccurate conclusions about the performance of networks. Thus, an important requirement for conducting simulation studies of networks is the ability to generate long synthetic self-similar sequences of incremental processes, to transform them into interevent time intervals, and to do this accurately and quickly. A fast generator for count processes based on wavelets is described. Then a method for transformation of count processes into interevent processes proposed by Leroux and Hassan [1] and an alternative method, that is, inverting the empirical distribution directly, are studied. A case study is discussed to show how long sequences are needed in the steady-state simulation of queueing models with self-similar input processes. This is compared with simulation run lengths of the same queueing models fed by Poisson processes.