SWITCHING NODE MODELING OF A PACKET-SWITCHED DATA TRANSMISSION NETWORK
DOI:
https://doi.org/10.33042/2522-1809-2025-1-189-8-12Keywords:
data network, switching node, queuing model, loss probabilityAbstract
The article considers probabilistic modeling of the information transfer process in a packet-switched data network in datagram mode. In such networks, messages are divided into smaller fragments called packets and sent over the network from one switching node to another independently of each other. So-called smart switches and routers with the appropriate software are considered as switching nodes. Each packet is provided with a header, which specifies the address required to deliver the packet to the destination node. The presence of an address in each packet allows the switch to process the packet independently of other packets in the information flow. In addition to the header, the packet has another additional field, which contains the checksum. The switch checks the checksum, and only if it indicates that the packet data is not distorted, begins to process the packet and determines the destination address in the next switch. Therefore, each packet is sequentially placed bit by bit in the input buffer. Depending on the type of traffic, the packet size may be different. When transmitting voice, the packet size can be 64 bytes, while when transmitting video or text information, the packet size can reach 1500 bytes and higher. Accordingly, the processing and switching time of packets varies widely, which leads to the stochastic nature of the switching nodes' operation, which can be studied using the apparatus of the mass service theory. The paper proposes to use a multi-line mass service system with several input streams and a common buffer as a model of the switching node's operation process. A system of linear equations with respect to the state probabilities is derived for it, the solution to which is obtained in analytical form. The most important characteristic is derived - the probability of packet loss depending on the packet incoming rate and the buffer memory size. It is proven that the buffer size has a lesser effect on the probability of packet loss than the packet incoming rate, which requires the corresponding power from the switching node's processors.
References
Network Switches: What Are They and How Do They Work. URL. https://www.coursera.org/articles/networkswitches/. (дата звернення: 07.02.2025).
Литвинов А. Л. Теорія систем масового обслуговування : навч. посібник / А. Л. Литвинов. –Харків : ХНУМГ ім. О. М. Бекетова, 2018. – 141 с.
Performance Modeling of Softwarized Network Services Based on Queuing Theory With Experimental Validation / J. Prados-Garzon, P. Ameigeiras, Juan J.Ramos-Munoz and others // IEEE Transactions on Mobile Computing, 2021. – Vol. 20. – Pp. 1558-1573.
Wong J.W., Lam S.S. Queuing Network Models of Packet Switching Networks Part 1: Open Networks /J.W. Wong, S.S. Lam // Performance Evaluation, 1982.– №2(3). – Pp. 11 –21.
Queuing Mechanisms in Modern Switches. URL. https://blog.ipspace.net/2014/05/queuing-mechanismsin-modern-switches/. (дата звернення: 20.01.2025).
Testing and Modeling Ethernet Switches and Networks for Use in ATLAS High-level Triggers / R. W. Dobinson, S. Haas, K. Korcyl and others // IEEE Transactions on Nuclear Science, 2001. – Vol. 48(3). – Pp. 607 – 612.
Queuing modeling for delay analysis in mission oriented sensor networks under the protocol interference model. / PictureBowu Zhang, PictureWei Cheng, PictureLimin Sun and others // MiSeNet '13: Proceedings of the 2nd ACM annual international workshop on Mission-oriented wireless sensor networking.– 2013.– Pp. 11 – 20.
System-Level Modeling of a Network Switch SoC. / J.M. Paul, C.P. Andrews, A.S. Cassidy, D. E. Thomas //Proceedings of the 15th International Symposium on System Synthesis (ISSS 2002), October 2-4, 2002, Kyoto, Japan. – 2002. – Pp. 62 – 67.
Гуляев К.Л., Каптур К.Л., Степаненко О.В. Імітаційне моделювання процесу інформаційного обміну на базі мережної технології зі змінним розміром мережної адреси / К.Л. Гуляев, В.А. Каптур, О.В. Степаненко // Проблеми телекомунікацій, 2014. – № 3(15). – С. 86 – 94.
Lin Arthur Y. M., Silvester J. A. Queueing Analysis of an ATM Switch with Multichannel Transmission Groups / Arthur Y.M. Lin, J.A. Silvester // ACM SIGMETRICS Performance Evaluation Review. – 1990. Vol. 8, №. 1. – Pp. 96 – 105.
Downloads
Published
How to Cite
Issue
Section
License
The authors who publish in this collection agree with the following terms:
• The authors reserve the right to authorship of their work and give the magazine the right to first publish this work under the terms of license CC BY-NC-ND 4.0 (with the Designation of Authorship - Non-Commercial - Without Derivatives 4.0 International), which allows others to freely distribute the published work with a mandatory reference to the authors of the original work and the first publication of the work in this magazine.
• Authors have the right to make independent extra-exclusive work agreements in the form in which they were published by this magazine (for example, posting work in an electronic repository of an institution or publishing as part of a monograph), provided that the link to the first publication of the work in this journal is maintained. .
• Journal policy allows and encourages the publication of manuscripts on the Internet (for example, in institutions' repositories or on personal websites), both before the publication of this manuscript and during its editorial work, as it contributes to the emergence of productive scientific discussion and positively affects the efficiency and dynamics of the citation of the published work (see The Effect of Open Access).
