EVALUATION OF SIMULATION RESULTS OF DATA TRANSMISSION MODELING ON A CHANNEL WITH RANDOM ACCESS
DOI:
https://doi.org/10.30837/2522-9818.2020.12.157Keywords:
stochasticity, network, package, switchboard, buffer, numerical methods, state graph, system of equations, data transmission, probabilityAbstract
The subject of the article is the evaluation of the results of a mathematical model consisting of systems of equations that describe the various states of the system and the laws of distribution of packet service time, which allows to investigate the main probability-time characteristics and analyze the operation of a single device. The purpose of the article is to evaluate the results of a mathematical model of the operation of a data network with competing access based on a switching device with a finite buffer size. To achieve the maximum probability, it is necessary to use switches with the optimal size of the buffer, so that the delay was small, and the buffer did not overflow too quickly at high load of the switch, which is the task of this article. A mathematical model consisting of systems of equations describing different states of the system and packet service time distribution laws is proposed, which allows to investigate the main probability-time characteristics and analyze the operation of a single system device and its interaction with other network devices based on the density of the probability distribution of packet service time. The final result is the obtained distribution densities of packet delivery time for different operating modes of the system that can be approximated by the corresponding analytical distribution law. The model allows to calculate the probability of data delivery, taking into account the final size of the buffers used by the data. The conclusion can be considered that, for achievement of the maximum probability it is necessary to use switches with the optimum size of the buffer that both delay was small, and the buffer is not overflowed too quickly at high loading of the switch. Thus, with the help of the developed model it is possible to solve the problem of choosing the optimal size of the switch buffer and estimating the data delivery time. Since buffer overflow leads to loss of information frames, which, in turn, leads to increased packet delivery time.
References
Aliev, T. I. (2009), Fundamentals of modeling discrete systems [Osnovy modelirovaniya diskretnykh sistem], SPb, SPbSU ITMO, 363 p.
Basharin, G. P., Kogan, Ya. A. (2009), Queue analysis in computer networks. Theory and calculation methods [Analiz ocheredey v vychislitel'nykh setyakh. Teoriya i metody rascheta], Moscow, Science.
Olifer, V. G. (2010), Computer networks. Principles, technologies, protocols [Komp'yuternyye seti. Printsipy, tekhnologii, protokoly], 4th ed. SPb, Peter, 944 p.
Berge, K. (2002), Graph Theory and its Applications [Teoriya grafov i yeye primeneniya] / Per. with fr. Moscow, Foreign Literature, 320 p.
Stallings V. (2003), Modern computer networks [Sovremennyye komp'yuternyye seti], 2nd ed. SPb : Piter, 783 p.
Nazarov, A. A., Yurevich, N. M. (1995), "Network research with dynamic Aloha random multiple access protocol" ["Issledovaniye seti s dinamicheskim protokolom sluchaynogo mnozhestvennogo dostupa Alokha"], Automation and Computer Technology, No. 6, P. 53–59.
Samarsky, A. A., Mikhailov, A. P. (2007), Mathematical modeling [Matematicheskoye modelirovaniye], Moscow, Nauka, 316 p.
Vegensha, Sh. (2003), Quality of service in IP networks [Kachestvo obsluzhivaniya v setyakh IP] / per. from English, Moscow, Williams Publishing House, 386 p.
Dymarsky, Ya. S. (2002), "Problems of optimization of resource allocation in communication networks" ["Problemy optimizatsii raspredeleniya resursov v setyakh svyazi"], Telecommunications, No. 3, P. 12–17.
Kucheryavyy, E. A. (2004), Traffic management and quality of service on the Internet [Upravleniye trafikom i kachestvo obsluzhivaniya v seti Internet], Moscow, Science and Technology, 336 p.
PROFIBUS Comprehensive Protocol Overview, available at : http://www.rtaautomation.com/profibus/
Lee, G. M. (2005), "A survey of multipath routing for traffic engineering", Proc. of LNCS 3391, Springer-Verlag, Vol. 4, P. 635–661.
Vutukury, S. (2001), Multipath routing mechanisms for traffic engineering and quality of service in the Internet, PhD Dissertation, University of Kalifornia, 152 р.
Tahilramani, K. H., Weiss, A., Kanwar, S., Kalya-Naraman, S., Gandhi, A. (2003), "BANANAS: An evolutionary framework for explicit and multipath routing in the internet", Proc. ACM SIGCOMM Workshop on Future Directions in Network Architecture. Karlsruhe, P. 277–288.
Gallager, R. G. (2005), "A minimum delay routing algorithm using distributed computation", IEEE Trans. on communications, Vol. 25, № 1, P. 73–85.
Litvinenko MI, Dolgiy Yu. S., (2016), "Khmelevsky SI Modeling of data transmission on a channel with random access" ["Modelyuvannya peredachi danykh po kanalu z vypadkovym dostupom"], Systems of Arms and Military Equipment, Vol. 2 (46), P. 124–128.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Yurii Dolhyi
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Our journal abides by the Creative Commons copyright rights and permissions for open access journals.
Authors who publish with this journal agree to the following terms:
Authors hold the copyright without restrictions and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC BY-NC-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-commercial and non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
Authors are permitted and encouraged to post their published work online (e.g., in institutional repositories or on their website) as it can lead to productive exchanges, as well as earlier and greater citation of published work.
