On network traffic statistical analysis
Articles
Liudas Kaklauskas
Institute of Mathematics and Informatics
Leonidas Sakalauslas
Institute of Mathematics and Informatics
Published 2008-12-28
https://doi.org/10.15388/LMR.2008.18116
PDF

Keywords

self-similarity
computer network
fractality

How to Cite

Kaklauskas L. and Sakalauslas L. (2008) “On network traffic statistical analysis”, Lietuvos matematikos rinkinys, 48(proc. LMS), pp. 314–319. doi: 10.15388/LMR.2008.18116.

Abstract

The present article deals with statistical university network traffic, by applying the methods of self-similarity and chaos analysis. The object of measurement is Šiauliai University LitNet network node maintaining institutions of education of the northern Lithuania region. Time series of network traffic characteristics are formed by registering amount of information packets in a node at different regimes of network traffic and different values of discretion of registered information are present. Measurement results are processed by calculating Hurst index and estimating reliability of analysis results by applying the statistical method. Investigation of the network traffic allowed us drawing conclusions that time series bear features of self-similarity when aggregated time series bear features of slowly decreasing dependence.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy