FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2896524821> ?p ?o ?g. }

• W2896524821 endingPage "51" @default.
• W2896524821 startingPage "43" @default.
• W2896524821 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" @default.
• W2896524821 created "2018-10-26" @default.
• W2896524821 creator A5048845086 @default.
• W2896524821 creator A5091783580 @default.
• W2896524821 date "2018-10-08" @default.
• W2896524821 modified "2023-09-26" @default.
• W2896524821 title "РАЗРАБОТКА МЕТОДИКИ МОДЕРНИЗАЦИИ ТОПОЛОГИИ СЕТИ ДЛЯ ПОЛУЧЕНИЯ КВАЗИОДНОРОДНОЙ СТРУКТУРЫ" @default.
• W2896524821 doi "https://doi.org/10.32620/reks.2018.2.05" @default.
• W2896524821 hasPublicationYear "2018" @default.
• W2896524821 type Work @default.
• W2896524821 sameAs 2896524821 @default.
• W2896524821 citedByCount "0" @default.
• W2896524821 crossrefType "journal-article" @default.
• W2896524821 hasAuthorship W2896524821A5048845086 @default.
• W2896524821 hasAuthorship W2896524821A5091783580 @default.
• W2896524821 hasBestOaLocation W28965248211 @default.
• W2896524821 hasConcept C114563136 @default.
• W2896524821 hasConcept C114614502 @default.
• W2896524821 hasConcept C120314980 @default.
• W2896524821 hasConcept C129119673 @default.
• W2896524821 hasConcept C132525143 @default.
• W2896524821 hasConcept C139940560 @default.
• W2896524821 hasConcept C199845137 @default.
• W2896524821 hasConcept C31258907 @default.
• W2896524821 hasConcept C33923547 @default.
• W2896524821 hasConcept C41008148 @default.
• W2896524821 hasConcept C80444323 @default.
• W2896524821 hasConcept C88230418 @default.
• W2896524821 hasConceptScore W2896524821C114563136 @default.
• W2896524821 hasConceptScore W2896524821C114614502 @default.
• W2896524821 hasConceptScore W2896524821C120314980 @default.
• W2896524821 hasConceptScore W2896524821C129119673 @default.
• W2896524821 hasConceptScore W2896524821C132525143 @default.
• W2896524821 hasConceptScore W2896524821C139940560 @default.
• W2896524821 hasConceptScore W2896524821C199845137 @default.
• W2896524821 hasConceptScore W2896524821C31258907 @default.
• W2896524821 hasConceptScore W2896524821C33923547 @default.
• W2896524821 hasConceptScore W2896524821C41008148 @default.
• W2896524821 hasConceptScore W2896524821C80444323 @default.
• W2896524821 hasConceptScore W2896524821C88230418 @default.
• W2896524821 hasIssue "2" @default.
• W2896524821 hasLocation W28965248211 @default.
• W2896524821 hasLocation W28965248212 @default.
• W2896524821 hasOpenAccess W2896524821 @default.
• W2896524821 hasPrimaryLocation W28965248211 @default.
• W2896524821 hasRelatedWork W1965612709 @default.
• W2896524821 hasRelatedWork W2023545901 @default.
• W2896524821 hasRelatedWork W2045236013 @default.
• W2896524821 hasRelatedWork W2055766740 @default.
• W2896524821 hasRelatedWork W2097411249 @default.
• W2896524821 hasRelatedWork W2113964533 @default.
• W2896524821 hasRelatedWork W2269937627 @default.
• W2896524821 hasRelatedWork W2561816362 @default.
• W2896524821 hasRelatedWork W2896524821 @default.
• W2896524821 hasRelatedWork W2522597310 @default.
• W2896524821 isParatext "false" @default.
• W2896524821 isRetracted "false" @default.
• W2896524821 magId "2896524821" @default.
• W2896524821 workType "article" @default.