z-logo
open-access-imgOpen Access
Basic characteristics of networks with self-similar traffic simulation
Author(s) -
Marek Aleksander,
Роман Одарченко,
Sergiy Gnatyuk,
Tadeusz Kantor
Publication year - 2019
Publication title -
autobusy – technika eksploatacja systemy transportowe
Language(s) - English
Resource type - Journals
eISSN - 2450-7725
pISSN - 1509-5878
DOI - 10.24136/atest.2019.023
Subject(s) - realization (probability) , computer science , traffic generation model , similarity (geometry) , self similarity , network traffic simulation , process (computing) , value (mathematics) , distributed computing , data mining , computer network , artificial intelligence , machine learning , mathematics , network traffic control , statistics , geometry , network packet , image (mathematics) , operating system
This paper is devoted to simulations the networks with self-similar traffic. The self-similarity in the stochastic process is identified by calculation of the Herst parameter value. Based on the results, received from the experimental research of network perfomance, we may conclude that the observed traffic in real-time mode is selfsimilar by its nature. Given results may be used for the further investigation of network traffic and work on the existing models of network traffic (particularly for new networks concepts like IoT, WSN, BYOD etc) from viewpoint of its cybersecurity. Furthermore, the adequacy of the description of real is achieved by complexifying the models, combining several models and integration of new parameters. Accordingly, for more complex models, there are higher computing abilities needed or longer time for the generation of traffic realization.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom