METHOD OF THE NETWORK TOPOLOGY TRANSFORMATION TO QUASIHOMOGENEOUS STRUCTURE

Олександр Анатолійович Рева, Юрій Костянтинович Давидовський

Abstract


The subject matters of the article are design, creation and modernization of the computer networks. The goal is to create algorithm which will allow to build new network design based on an existing one using graph theory and optimization algorithms. The tasks to be solved are: to make a review of the rates of modernization of the computer networks; to analyze the market of telecom companies that offer to create network design; to seek for the automated solutions of this task; to create a method of automated network modernization which allow to decrease human influence on the network creation process; to create software implementation of such method on test environment. The methods used are: graph theory, optimization algorithms, algorithmic modelling. The following results were obtained: based on the prepared analysis and data from such sources as Cisco, Nokia, DataGroup etc. were described the need and importance of the specialists and solutions which can create high-quality network design; were noted the criteria to describe the network from the point of view of a network-provider company like reliability, quality of service and cost of network design and implementation; the network was described using graphs and based on the graph theory was selected the most efficient graph-network – divalent graph topology; during the creation of the new method was used common approach but with one important improvement which allows not to build a completely new network to add its structure to the existing one but to modernize an existing network topology to increase cost-efficiency of the design. Conclusions. The scientific novelty of the results obtained is as follows: 1) the networks were described as graphs that should allow to use algorithmic modelling to the process of data transfer through the network in the future; 2) new method has optimized the process of the network design by using and considering the resources that are already in use by network provides such as routers, switches and communication channels. In the future there is an idea to improve this method by adding a module of network modelling which will allow not only to create network design but also to describe its advantages and disadvantages

Keywords


graph theory; data transmission network (DTN); network topology; optimization of topology; divalent DTN; homogeneous DTN; modernization of DTN structure; traffic

References


Mazzarese, D. Impact of increased bandwidth on the fiber network. Available at: http://www.cablinginstall.com/articles/print/volume-24/issue-7/features/data-center/impact-of-increased-bandwidth-on-the-fiber-network.html (accessed 21.12.2017).

Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update. Available at: https://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/mobile-white-paper-c11-520862.html (assecced 18.12.2017).

Creating Cable 2020. Available at: https://onestore.nokia.com/asset/201171/Nokia_Cable_2020_eBook_EN.pdf (accessed 09.01.2018).

Akhter, J. Amin, M. R. Traffic Modelling of Low Dense Femtocellular Network. 9th International Conference on Electrical and Computer Engineering, 2016, pp. 74 – 77.

Luqman, G. Luqman, A. Modelling and Simulation of Load Balancing in Computer Network. American Journal of Engineering Research (AJER), 2016, vol. 5, issue 1, pp. 111 – 117.

Artamonov, G. T. Topologija reguljarnyh vychislitel'nyh setej i sred [Topology of regular computer networks and environments]. Moscow, Radio i svjaz' Publ., 1985. 192 p.

Reva, A. A., Nekrasov, A. B. Generacija predel'no ploskogo grafa minimal'nogo vesa na osnove vzveshennogo neorientirovannogo grafa Kerni [Generating an extremely flat graph of minimal weight on the basis of a weighted undirected graph Kerney]. Aviacijno-kosmicna tehnika i tehnologia – Aerospace technic and technology, 2004, no. 3 (11), pp. 79 – 82.

Nekrasov, A. B. Optimizacija algoritma generacii predel'no ploskogo grafa minimal'nogo vesa [Optimization of the algorithm for generating an extremely flat graph of minimum weight]. Radioelektronni i komp'uterni sistemi –Radioelectronic and computer systems, 2004, no. 4 (8), pp. 71 – 74.




DOI: https://doi.org/10.32620/reks.2018.2.05

Refbacks

  • There are currently no refbacks.