Construction of a simulated dynamic model of data packet routing on a telecommunication network fragment
DOI:
https://doi.org/10.15587/1729-4061.2023.287677Keywords:
multi-service telecommunication network, imulation dynamic modeling, data packet transmission delay timeAbstract
The object of the current research is the process of routing data packets in a telecommunications network. It was established that the state and parameters of data transmission channels and routers could have a negative impact and need to be taken into account in the process of modeling the routing of data packets in telecommunication networks.
A model of simulated dynamic modeling of data packet routing in telecommunication networks has been devised and proposed. The suggested model makes it possible to establish quantitative values of the delay time of processing data packets during their routing along a separate segment of the telecommunications network, taking into account the state and parameters of the data transmission channel and routers.
It has been established that the achievement of the minimum delay time of data packets during routing is achieved by choosing the path of their transmission under the condition of minimum transmission time by communication lines and the capabilities of routers in terms of their accumulation and service speed. At the same time, the reduction of packet transmission delay time relative to the average for the time network segment can reach from 21 to 38 percent. It is shown that the main factor affecting the value of the delay time is the speed of data processing along the selected path of packet transmission. The number of routing nodes in a separate data transmission path can affect the delay time only if the parameters of the routers are equal compared to others that are included in alternative routes.
The model of simulated dynamic modeling of data packet routing reported in this work, unlike the existing ones, takes into account the state and parameters of data transmission channels and routers. It can be used in practical improvement of existing and development of new multi-service telecommunication communication networks
References
- Popovskyi, V. V., Lemeshko, O. V., Kovalchuk, V. K., Plotnikov, M. D., Kartushyn, Yu. P. et al. (2018). Telekomunikatsiyni systemy ta merezhi. Struktura y osnovni funktsiyi. Vol. 1. Kharkiv: KhNURE.
- Medhi, D., Ramasamy, K. (2007). Network routing: algorithms, protocols, and architectures. Morgan Kaufmann Publishers, 788.
- Yeremenko, O. (2016). Development of the dynamic tensor model for traffic management in a telecommunication network with the support of different classes of service. Eastern-European Journal of Enterprise Technologies, 6 (9 (84)), 12–19. doi: https://doi.org/10.15587/1729-4061.2016.85602
- Crainic, T. G., Gendron, B., Akhavan Kazemzadeh, M. R. (2022). A taxonomy of multilayer network design and a survey of transportation and telecommunication applications. European Journal of Operational Research, 303 (1), 1–13. doi: https://doi.org/10.1016/j.ejor.2021.12.028
- Wu, X., Lü, Z., Glover, F. (2020). A matheuristic for a telecommunication network design problem with traffic grooming. Omega, 90, 102003. doi: https://doi.org/10.1016/j.omega.2018.11.012
- Wedde, H. F., Farooq, M. (2006). A comprehensive review of nature inspired routing algorithms for fixed telecommunication networks. Journal of Systems Architecture, 52 (8-9), 461–484. doi: https://doi.org/10.1016/j.sysarc.2006.02.005
- Gicquel, C., Vanier, S., Papadimitriou, A. (2022). Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: A robust optimization approach. Computers & Operations Research, 146, 105890. doi: https://doi.org/10.1016/j.cor.2022.105890
- Baffier, J.-F., Poirion, P.-L., Suppakitpaisarn, V. (2018). Bilevel Model for Adaptive Network Flow Problem. Electronic Notes in Discrete Mathematics, 64, 105–114. doi: https://doi.org/10.1016/j.endm.2018.01.012
- Lin, D., Lin, Z., Kong, L., Guan, Y. L. (2023). CMSTR: A Constrained Minimum Spanning Tree Based Routing Protocol for Wireless Sensor Networks. Ad Hoc Networks, 146, 103160. doi: https://doi.org/10.1016/j.adhoc.2023.103160
- Suma, S., Harsoor, B. (2022). An optimized routing scheme for congestion avoidance using mobile nodes in Wireless Sensor Network. Measurement: Sensors, 24, 100457. doi: https://doi.org/10.1016/j.measen.2022.100457
- Borisovsky, P., Eremeev, A., Hrushev, S., Teplyakov, V. (2022). Experimental Evaluation of Algorithms for Packet Routing in Software Defined Network. IFAC-PapersOnLine, 55 (10), 584–589. doi: https://doi.org/10.1016/j.ifacol.2022.09.457
- Popovskyi, V. V., Lemeshko, A. V., Yevsieieva, O. Yu. (2009). Dynamicheskoe upravlenye resursamy TKS: matematychni modeli v prostori stanu. Naukovi zapysky UNDIZ, 1 (9), 3–26.
- Popovskyi, V. V., Lemeshko, A. V., Yevsieieva, O. Yu. (2011). Matematychni modeli telekomunikatsiynykh system. Chastyna 1. Matematycheskye modely funktsyonalnykh svoistv telekomunikatsiynykh system. Problemy telekomunikatsiy, 2 (4), 3–41.
- Lemeshko, A. V., Evseeva, O. Yu., Garkusha, S. V. (2014). Research on tensor model of multipath routing in telecommunication network with support of service quality by greate number of indices. Telecommunications and Radio Engineering, 73 (15), 1339–1360. doi: https://doi.org/10.1615/telecomradeng.v73.i15.30
- Kuchuk, N., Gavrylenko, S., Sobchuk, V., Lukova-Chuiko, N. (2019). Redistribution of information flows in a hyperconvergent system. Advanced Information Systems, 3 (2), 116–121. doi: https://doi.org/10.20998/2522-9052.2019.2.20
- Gnatyuk, S., Kinzeryavyy, V., Kyrychenko, K., Yubuzova, K., Aleksander, M., Odarchenko, R. (2019). Secure Hash Function Constructing for Future Communication Systems and Networks. Advances in Intelligent Systems and Computing, 561–569. doi: https://doi.org/10.1007/978-3-030-12082-5_51
- Brumnik, R., Kovtun, V., Okhrimenko, A., Kavun, S. (2014). Techniques for Performance Improvement of Integer Multiplication in Cryptographic Applications. Mathematical Problems in Engineering, 2014, 1–7. doi: https://doi.org/10.1155/2014/863617
- Odarchenko, R., Gnatyuk, V., Gnatyuk, S., Abakumova, A. (2018). Security Key Indicators Assessment for Modern Cellular Networks. 2018 IEEE First International Conference on System Analysis & Intelligent Computing (SAIC). doi: https://doi.org/10.1109/saic.2018.8516889
- Berkman, L., Turovsky, O., Kyrpach, L., Varfolomeeva, O., Dmytrenko, V., Pokotylo, O. (2021). Analyzing the code structures of multidimensional signals for a continuous information transmission channel. Eastern-European Journal of Enterprise Technologies, 5 (9 (113)), 70–81. doi: https://doi.org/10.15587/1729-4061.2021.242357
- Mohammed, M. M., Viktor, Z., Yurii, K., Lyubov, B., Konstiantyn, P., Turovsky, O. L. (2022). Methods for assessing the impact of bandwidth of control channels on the quality of telecommunications networks in the transmission of data packets of different types. International Journal of Communication Networks and Information Security (IJCNIS), 13 (2). doi: https://doi.org/10.17762/ijcnis.v13i2.5034
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Oleksandr Turovsky, Andrii Zakharzhevskyi, Anatoliy Makarenko, Larysa Dakova
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.