OPTIMAL ROUTE DEFINITION IN THE NETWORK BASED ON THE MULTILAYER NEURAL MODEL
DOI:
https://doi.org/10.15802/stp2018/154443Keywords:
computer network, optimal route, neural network, sampling, average harmonic, activation function, ptimization algorithmAbstract
Purpose. The classic algorithms for finding the shortest path on the graph that underlie existing routing protocols, which are now used in computer networks, in conditions of constant change in network traffic can not lead to the optimal solution in real time. Methodology. To determine the optimal route in the computer network, the program model «MLP 34-2-410-34» was developed in Python using the TensorFlow framework, which allows the following steps to be performed: sample generation (random or balanced ); the creation of a neural network, the input of which is an array of bandwidth channels of the computer network, as a resultant array of signs of the use of the appropriate communication channel in the formation of the route in the computer network; training and testing of the neural network in the appropriate samples. Findings. Neural network configuration 34-2-410-34 with activation functions of ReLU and Leaky-ReLU in a hidden layer and a linear activation function in the output layer learns from Adam algorithm, which is a combination of Adagrad, RMSprop algorithms and stochastic gradient descent with inertia, the fastest on of all volumes of the training sample, the rest of the others are overwhelmed by the conversion and reaches the value of the error at 0.0024 on the control voter and 86 % returns the optimal path. Originality. The study of the parameters of the neural network on the basis of the calculation of the average harmonic with different activation functions (Linear, Sigmoid, Tanh, Softplus, ReLU, L-ReLU) on training samples of different volumes (140, 1400, 14000, 49000 examples) and various training algorithms Neural Network (BGD, MB SGD, Adam, Adamax, Nadam). Practical value. The use of a neural model, the input of which gives the value of bandwidth channels, will allow in real time to determine the optimal route in the computer network.
References
Bryndas, A. M., Rozhak, P. I., Semynyshyn, N. O., & Kurka, R. R. (2016). Realizatsiia zadachi vyboru optymalnoho marshrutu neironnoiu merezheiu Khopfilda. Naukovyi visnyk NLTU Ukrainy, 26(1), 357-363. (in Ukraіnian)
Kolesnikov, K. V., Karapetian, A. R., & Bahan, V. Y. (2016). Analiz rezultativ doslidzhennia realizatsii zadachi marshrutyzatsii na osnovi neironnykh merezh ta henetychnykh alhorytmiv. Visnyk Cherkaskoho derzhavnoho tekhnolohichnoho universytetu. Seriia: Tekhnichni nauky, 1, 28-34. (in Ukraіnian)
Kutyrkin, A. V., & Semin, A. V. (2007). Ispolzovanie neyronnoy seti Khopfilda dlya resheniya optimizatsionnykh zadach marshrutizatsii: Metodicheskie ukazaniya. Moscow: Izdatelstvo Moskovskogo gosudarstvennogo universiteta putey soobshcheniya. (in Russian)
Keras. Retrieved from https://keras.io (in English)
An open source machine learning framework for everyone. TensorFlow. Retrieved from https://www.tensorflow.org (in English)
IBM. IBM Knowledge Center. Retrieved from https://u.to/G-giFA (in Russian)
Security Lab.ru. Retrieved from https://www.securitylab.ru (in Russian)
CiscoTips. Retrieved from http://ciscotips.ru/ospf (in Russian)
Pavlenko M. A. (2011). Analysis opportunities of artificial neural networks for solving single-path routing in telecommunication network. Problemy telekomunikatsii, 2(4). Retrived from http://pt.journal.kh.ua/index/0-139 (in Russian)
Palmer, M., & Sinkler, R. B. (2004). Proektirovanie i vnedrenie kompyuternykh setey. St. Petersburg: BKhV-Peterburg. (in Russian)
Pakhomova, V. M., & Fedorenko, Y. O. (2012). Rishennia zadachi marshrutyzatsii v komp’iuternii merezhi Prydniprovskoi zaliznytsi na osnovi neironnoi modeli Khopfilda. Information and control systems at railway transport, 4, 76-84. (in Ukraіnian)
Pakhomova, V. M., & Lepekha, R. O. (2014). Analiz metodiv z pryrodnymy mekhanizmamy vyznachennia optymalnoho marshrutu v komp’iuternii merezhi Prydniprovskoi zaliznytsi. Information and control systems at railway transport, 4, 82-91. (in Ukraіnian)
Pakhomovа, V. M. (2016). Network Traffic Forcasting in Information-telecommunication System of Prydniprovsk Railways Based on Neuro-fuzzy Network. Science and Transport Progress, 6(66), 105-114. doi: 10.15802/stp2016/90485 (in English)
Khaykin, S. (2006). Neyronnye seti. Polnyy kurs.Moscow: Vilyams. (in Russian)
Chang Wook Ahn, Ramakrishna, R. S., In Chan Choi, & Chung Gu Kang. (n.d.). Neural network based near-optimal routing algorithm. Proceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP’02. doi: 10.1109/iconip.2002.1198978 (in English)
Hopfield, J. J. (1982). Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences, 79(8), 2554-2558. doi: 10.1073/pnas.79.8.2554 (in English)
Kojic, N., Zajeganovic-Ivancic, M., Reljin, I., & Reljin, B. (2010). New algorithm for packet routing in mobile ad-hoc networks. Journal of Automatic Control, 20(1), 9-16. doi: 10.2298/jac1001009k (in English)
Yang, H., Li, T., Hu, X., Wang, F., & Zou, Y. (2014). A Survey of Artificial Immune System Based Intrusion Detection. The Scientific World Journal, 2014, 1-11. doi: 10.1155/2014/156790 (in English)
Schuler, W. H., Bastos-Filho, C. J. A., & Oliveira, A. L. I. (2009). A novel hybrid training method for hopfield neural networks applied to routing in communications networks1. International Journal of Hybrid Intelligent Systems, 6(1), 27-39. doi: 10.3233/his-2009-0074 (in English)
Zhukovyts’kyy, I., & Pakhomova, V. (2018). Research of Token Ring network options in automation system of marshalling yard. Transport Problems, 13(2), 145-154. doi: 10.20858/tp.2018.13.2.14 (in English)
Downloads
Published
How to Cite
Issue
Section
License
Copyright and Licensing
This journal provides open access to all of its content.
As such, copyright for articles published in this journal is retained by the authors, under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0). The CC BY license permits commercial and non-commercial reuse. Such access is associated with increased readership and increased citation of an author's work. For more information on this approach, see the Public Knowledge Project, the Directory of Open Access Journals, or the Budapest Open Access Initiative.
The CC BY 4.0 license allows users to copy, distribute and adapt the work in any way, provided that they properly point to the author. Therefore, the editorial board of the journal does not prevent from placing published materials in third-party repositories. In order to protect manuscripts from misappropriation by unscrupulous authors, reference should be made to the original version of the work.