ABOUT ONE METHOD OF OPTIMIZING THE STRUCTURE OF INFOCOMMUNICATION NETWORKS

Parsiev S. S.1, Vinogradov A. S.2 , Glukhov E. V.3
1Doctor of Technical Sciences (DSc) Associate Professor, Senior Lecturer at the University of Security of the Repubic of Uzbekistan.
2Doctor of Philosophy in Technical Sciences (PhD.), Senior Lecturer at the University of Security of the Repubic of Uzbekistan.
3Doctor of Philosophy in Technical Sciences (PhD.), Senior Lecturer at the University of Security of the Repubic of Uzbekistan.
EMAIL: s.parsiyev@gmail.com

Abstract

:The purpose of this study is to increase the efficiency of designing infocommunication networks through the use of the method of penalty functions with restrictions on the probabilistic-temporal characteristics of information flows. The method of penalty functions is a powerful computational tool of the theory of optimization and is convenient because the structure of constraints, their nonlinearity or linearity, smoothness or non-smoothness, do not play a fundamental role in solving the design problem. In addition, the method of penalty functions is easy to calculate, it is possible to take into account many structural parameters. An important task of effective design of infocommunication networks is to find the optimal structure, according to the criterion of network-wide costs, taking into account the limitations on the quality of transmitted many product flows of information.The results showed that in the area of small sizes of the territory of 3x3, 4x4 and 5x5 km networks, the above costs change little, which is explained by the fact that in a limited area the bulk of the costs are the cost of nodes, the number of which does not depend on the size of the territory, but is determined only by the capacity of the network. It has been determined that at network levels R=2,3,4,5 the most optimal, regardless of topology, are networks with layers 2 and 3 compared to networks with layers 4 and 5. It was revealed that the radial structure was 5 (five) times more economical than the fully connected structure, 3 (three) times compared to the ring structure and 2 (two) times more economical than the lattice structure. The proposed method allows you to take into account all the technical parameters of the network, as well as the integration of information resources located in different geographical locations and does not require that the starting point belongs to an acceptable area. Based on the above method of designing infocommunication networks, a computer program in the Rython language was developed, and a certificate was obtained from the Intellectual Property Agency of the Republic of Uzbekistan.

Keywords:

:infocommunication network, network design, penalty function, network-wide reduced costs, optimal structure


Full Text:

PDF


References


1. Ageev D., Ignatenko A., Fuad Vehbe. Design of information and telecommunication systems using the multilevel graph model. XII International Conference "Experience in the design and application of SAPR in microelectronics (CADSM)", Lviv-Polyana, Ukraine, 2013. pp. 1 – 4. 2. Al-tayar Bashir Ali, Margolis B. I., Matveev Y. N. Optimization of the structure of the content delivery network based on load balancing according to the average delay criterion. Bulletin of the Kuban State University named after N.A. Nekrasov No 5, 2014. pp.46-50. 3. Breheny, P., Huang, J.: Coordunate descent algroithms for nonconvex penalized regression, with applications to biological feature selection. Annals of Applied Statistics 5(1), 232–252 (2011). 4. Bundy B. Methods of optimization / Translation from English. -Moskva: Radio & Communications, 1988. 128 p. 5. Gemintern V.I., Kagan B.M. Methods of optimal design. Moscow: Energia, 1980. 159 p. 6. Kolpakov R. M., Posypkin M. A. Upper and lower estimation of the labor intensity of the method of branches and borders for the problem of the satchel // Institute of system analysis of the Russian Academy of Sciences, Vol. 32, 2008, p. 137-158. 7. Lemeshko A.V., Sterin V. L. Optimization of structural and functional synthesis of the transport telecommunication network // Information processing systems, 2012, vipusk 9 (107) . p. 186-190. 8. Lohmotko V.V., Pirogov K.I. Analysis and optimization of digital networks of integral service. Minsk: Science and technology, 1991. 192 p. 9. Parsiev S. S., Kudratov S. G., Abdikayumov B. T. The problem of planning transport telecommunication networks. // International Conference on Importance of Information - Communication Technologies in Innovative Development of Sectors of Economy dedicated to the 1235 th anniversary of the Muhammad al-Khwarizmi. Tashkent 2018. -P. 636 – 638. 10. Parsiyev S. S. Design methods of info communication networks. Materials of the III International Scientific and Practical Conference "Science and Education: Problems and Development Trends". UFA - 2015 - P. 95-97. 11. Reizlin V.I. Numerical methods of optimization: a textbook / V.I. Reislin; Tomsk Polytechnic University. – Tomsk: Publishing House of Tomsk Polytechnic University, 2011 – 105 p. 12. Stephen J. Coordinate Descent Algorithms. Wright Department of Computer Sciences, University of Wisconsin-Madison, 1210. Р.1-32., USA. 13. Tseng, P., Yun, S.: A coordinate gradient descent method for no smooth separable minimization. Mathematical Programming, Series B 117, Р.387–423 (2009). 14. Yanbykh G. F. Multi-criteria optimization of the structure of the information-computer network // Mechanization and automation of management. – 1982. - №2. – pp. 40 - 43. 15. Zakharov G. P. Methods of data transmission network research. – M.: Radio & Communications, 982. – 208 p.

Refbacks

  • There are currently no refbacks.