Spline-approximation-based restoration for self-similar traffic

Authors

DOI:

https://doi.org/10.15587/1729-4061.2017.102999

Keywords:

self-similar traffic, Weibull distribution, queuing system, restoration, spline functions

Abstract

The work considers the queuing system of the G/M/1/K with the Weibull distribution. The model for self-similar traffic was created within the Matlab Simulink software environment. Restoration of the self-similar traffic was obtained with the help of the spline approximation using linear and cubic splines. In this research, it has been discovered that the obtained self-similar traffic is characterized by “bursts”, “pulsations”, and the long-term dependence between arrivals. Linear and cubic spline approximations have been suggested to restore traffic. The approximations with the linear and cubic splines were used to restore smoothly changing self-similar traffic.

The obtained results of the self-similar traffic restoration allow planning buffer capacities for NGN networking devices at the stages of design and further operation in order to avoid network overloads, excessive time delays and jitter for the case of packet traffic with bursts.

The wavelet approximation is recommended for the accurate restoration of the self-similar traffic

Author Biographies

Irina Strelkovskaya, O. S. Popov Odessa National Academy of Telecommunications Kuznechna str., 1, Odessa, Ukraine, 65029

Doctor of Technical Sciences, Professor, Director of Educational and Research Institute of Infocommunications and Software Engineering

Department of Higher Mathematics

Irina Solovskaya, O. S. Popov Odessa National Academy of Telecommunications Kuznechna str., 1, Odessa, Ukraine, 65029

PhD, Associate Professor

Department of Switching Systems

Nikolay Severin, O. S. Popov Odessa National Academy of Telecommunications Kuznechna str., 1, Odessa, Ukraine, 65029

Senior Lecturer

Department of Information Technologies 

Stanislav Paskalenko, O. S. Popov Odessa National Academy of Telecommunications Kuznechna str., 1, Odessa, Ukraine, 65029

Postgraduate student

Department of Higher Mathematics

References

  1. Vorobiyenko, P. P., Nikityuk, L. А., Reznichenko, P. І. (2010). Telecommunication and Information Networks. Kyiv: SMMIT-КNIGA, 640.
  2. Krylov, V. V., Samohvalova, S. S. (2005). Theory of telegraphic and its applications. Sankt-Peterburg: BXV-Petersburg, 288.
  3. Sheluhin, О. I., Теnyakshev, А. М., Оsin, А. V. (2003). Fractal processes in telecommunications. Мoscow: Radioengineering, 480.
  4. Sheluhin, О. I., Оsin, А. V., Smolskii, S. М. (2008). Self-similarity and fractals. Telecommunication applications. Мoscow: PHISMATLIT, 368.
  5. Strelkovskaya, I. V., Popovskii, V. V., Buhan, D. Y. (2008). Comparative methods of approximation in the results of recursive evaluation of the state of network elements and their modes. Telecommunication systems and technologies: Applied radio engineering, 2, 15–16.
  6. Popovskii, V. V., Strelkovskaya, I. V. (2011). Accuracy of filtration procedures, extrapolation and interpolation of random processes. Problems of telecommunications, 1 (3), 3–10.
  7. Ageyev, D. V., Kopyliev, A. N. (2010). Information streams modeling in multiservice network NGN for parametrical synthesis problem solving. Radio electronics, Computer science, Control, 2, 48–52.
  8. Sharkovsky, S., Grab, E. (2011). Modeling Self-Similar Traffic in Networks. Proc. of the 52 International Scientific Conference, 19-23.
  9. Grab, E., Sharkovsky, S. (2013). Real-Time Estimation of Traffic Self-Similarity Parameter in Simulink with Wavelet Transform. Electronics and Electrical Engineering, 19 (3), 88–91. doi: 10.5755/j01.eee.19.3.3702
  10. Millan, G., Lefranc, G. (2013). A Fast Multifractal Model for Self-Similar Traffic Flows in High-Speed Computer Networks. Procedia Computer Science, 17, 420–425. doi: 10.1016/j.procs.2013.05.054
  11. Kostromitsky, A. I., Volotka, V. S. (2010). Approaches to modelling of the self-similar traffic. Eastern-European Journal of Enterprise Technologies, 4 (7 (46)), 46–49. Available at: http://journals.uran.ua/eejet/article/view/3013/2816
  12. Rikli, N.-E. (2012). Self-similarity and stationarity of increments in VBR video. Journal of King Saud University – Computer and Information Sciences, 24 (1), 7–16. doi: 10.1016/j.jksuci.2011.09.003
  13. Tomic, I., Maletic, N. (2014). Comparison of models for self-similar network traffic generation. X International symposium on industrtial electronics, 266–269.
  14. Jeong, H.-D. J., Pawlikowski, K., McNickle, D. C. (2003). Generation of self-similar processes for simulation studies of telecommunication networks. Mathematical and Computer Modelling, 38 (11-13), 1249–1257. doi: 10.1016/s0895-7177(03)90127-0
  15. Zavyalov, Yu. S., Kvasov, B. I., Miroshnichenko, V. L. (1980). Methods of spline functions. Мoscow: Science, 352.
  16. Strelkovskaya, I., Solovskaya, I., Severin, N., Paskalenko, S. (2016). Approximation of self-similar traffic by spline-functions. 2016 13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET). doi: 10.1109/tcset.2016.7451991
  17. Strelkovskaya, I. V., Solovskaya, I. N., Severin, N. V. (2016). Modeling of self-similar traffic. Proceedings of the 4rd International Conference on Applied Innovations in IT (ICAIIT-2016), 61–64.
  18. Strelkovskaya, I. V., Solovskaya, I. N., Severin, N. V., Paskalenko, S. A. (2016). Research of self-similar traffic by spline-functions. Modern information and electronic technologies, 104–105.

Downloads

Published

2017-06-30

How to Cite

Strelkovskaya, I., Solovskaya, I., Severin, N., & Paskalenko, S. (2017). Spline-approximation-based restoration for self-similar traffic. Eastern-European Journal of Enterprise Technologies, 3(4 (87), 45–50. https://doi.org/10.15587/1729-4061.2017.102999

Issue

Vol. 3 No. 4 (87) (2017): Mathematics and Cybernetics - applied aspects

Section

Mathematics and Cybernetics - applied aspects

License

Copyright (c) 2017 Irina Strelkovskaya, Irina Solovskaya, Nikolay Severin, Stanislav Paskalenko

Creative Commons License

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

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.