MODELLING SELF-SIMILAR TRAFFIC OF MULTISERVICE NETWORKS

  • Zakir Maharramov Azerbaijan Technical University, Azerbaijan
  • Vugar Abdullayev Institute of Cybernetics of ANAS Azerbaijan State Oil and Industry University, Azerbaijan
  • Tamilla Mammadova Azerbaijan State University of Oil and Industry, Azerbaijan
Keywords: simulation modelling, self-similarity of traffic, Hurst exponent, distribution density

Abstract

Simulation modelling is carried out, which allows adequate describing the traffic of multiservice networks with the commutation of packets with the characteristic of burstiness. One of the most effective methods for studying the traffic of telecommunications systems is computer simulation modelling. By using the theory of queuing systems (QS), computer simulation modelling of packet flows (traffic) in modern multi-service networks is performed as a random self-similar process. Distribution laws such as exponential, Poisson and normal-logarithmic distributions, Pareto and Weibull distributions have been considered.

The distribution of time intervals between arrivals of packages and the service duration of service of packages at different system loads has been studied. The research results show that the distribution function of time intervals between packet arrivals and the service duration of packages is in good agreement with the Pareto and Weibull distributions, but in most cases the Pareto distribution prevails.

The queuing systems with the queues M/Pa/1 and Pa/M/1 has been studied, and the fractality of the intervals of requests arriving have been compared by the properties of the estimates of the system load and the service duration. It has been found out that in the system Pa/M/1, with the parameter of the form a> 2, the fractality of the intervals of requests arriving does not affect the average waiting time and load factor. However, when ????≤2, as in the M/Pa/1 system, both considered statistical estimates differ.

The application of adequate mathematical models of traffic allows to correctly assess the characteristics of the quality of service (QoS) of the network.

Downloads

Download data is not yet available.

Author Biographies

Zakir Maharramov, Azerbaijan Technical University

Department of Information technologies and Programming

Vugar Abdullayev, Institute of Cybernetics of ANAS Azerbaijan State Oil and Industry University

Department of Computer Engineering

Tamilla Mammadova, Azerbaijan State University of Oil and Industry

Department of Computer Engineering

References

Jeong H.-D. J., McNickle D., Pawlikowski K. Fast self-similar teletraffic generation based on FGN and wavelets // IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243). 1999. doi: https://doi.org/10.1109/icon.1999.796163

Kulikovs, M., Petersons, E. (2008). Packet Loss Probability Dependence on Number of ON-OFF Traffic Sources in OPNET. ELECTRONICS AND ELECTRICAL ENGINEERING, 85 (5), 77–80.

Sidorenko, I. A., Soldatov, I. V. Agent based modeling of the traffic to telecommunication company. Available at: http://simulation.su/uploads/files/default/incomplete-sidorenko-soldatov.pdf

Leland, W. E., Taqqu, M. S., Willinger, W., Wilson, D. V. (1993). On the self-similar nature of Ethernet traffic. Conference Proceedings on Communications Architectures, Protocols and Applications – SIGCOMM ’93. doi: https://doi.org/10.1145/166237.166255

Willinger, W., Taqqu, M. S., Erramilli, A. (1996). A bibliographical guide to self-similar traffic and performance modeling for modern high-speed networks. Stochastic Networks: Theory and Applications. In Royal Statistical Society Lecture Notes Series, 4, 339–366.

Sheluhin, O. I., Tenyakshev, A. M., Osin, A. V. (2003). Fraktal'nye processy v telekommunikaciyah. Moscow: Radiotekhnika, 480.

Sheluhin, O. I., Smolskiy, S. M., Osin, A. V. (2007). Self-Similar Processes in Telecommunications. John Wiley & Sons, 320. doi: https://doi.org/10.1002/9780470062098

Mitropol'skiy, A. K. (1971). Tekhnika statisticheskih vychisleniy. Moscow: Nauka, 576.

Zadorozhniy, V. N., Kutuzov, O. I. (2011). Modelirovanie i raschet buferov fraktal'nyh SMO. Imitacionnoe modelirovanie. Teoriya i praktika (IMMOD- 2011): materialy 5-y Vseros. konf. Vol. 1. Sankt-Peterburg: CT SS, 156–161.

Kleinrock, L. (1976). Queueing Systems. Vol. 2. Computer Applications. John Wiley & Sons, 549.


👁 526
⬇ 357
Published
2019-02-01
How to Cite
Maharramov, Z., Abdullayev, V., & Mammadova, T. (2019). MODELLING SELF-SIMILAR TRAFFIC OF MULTISERVICE NETWORKS. EUREKA: Physics and Engineering, (1), 46-54. https://doi.org/10.21303/2461-4262.2019.00841
Section
Computer Science