In the telecommunications industry, due to the increase in the number of users and the requirements created by 5G, network operators need to create new nodes in their aggregation network. One of the most important aspects is the availability, so the new node must reach the backbone layer in at least two directions.
The current cable structure may not reach the new node’s location, therefore an optical cable track must be designed to the node. Because the cable construction is very expensive, the new track must be designed, so that the construction cost as low as possible, that’s why the goal is to minimize the new track. So far, this task was solved manually. It was my job to automate this task, that is, to create a program that calculates these tracks and finds two independent paths to these nodes. The cable tracks follow the road network, so I used the road network’s tracks for the design.
When the existing nodes was designed, the redundancy was not so important requirement. Therefore, these nodes must be checked to see if they reach the backbone network in two independent direction. If there is only one direction, then the other must be designed.
In my thesis I write more about this problem. I introduce the phases of the design and the tools and algorithms, what I used. I describe the OpenStreetMap APIs and the LEMON library, which is a C++ library for network modelling. In my thesis end I introduce and analyze the results.