Solving problems of computer networks´ planning using elastic networks method

This part of research focuses on analysis and evaluation for synthesis problem of a computer network heterogeneous structure. Where the core of the network has a ring topology, the network lower level-topology tree, and this paper composed of two interrelated parts. Firstly, this part of presented herein addresses one of problems concerned with planning of computer networks with heterogeneous structure associated with cost effectiveness. However, the second part presents other side of the computer networks´ structure problem associated with optimality of network size. Specifically, at this first part focusing attention on the cost effectiveness problem of networks´ structural features using modified elastic net method. It adopted modified method applied for reaching shortest path topology of computer network backbone structure via computing method of weight coefficient values. That solution characterized by introducing additional Synthesized weight coefficients´ values taking into account the amount of internal network nodes´ demands/ traffic. Interestingly, obtained solution results after simulated experiments proved to take the advantage of better cost effectiveness (lower cost) of designed network structure, rather than other well known applicable solutions to date.