Algorithms for designing optimized fixed broadband networks

This paper presents the use of graph theory for designing fixed broadband networks with optimized link routes among transmission nodes. The cost function is the total length of links and the number of households covered by a two-layer transmission network. The topology of a backbone network is a ring and the topology of a distribution network is a tree. For designing the backbone network the ?travelling salesman problem? is solved. The distribution network is optimized using Prim´s algorithm for the minimum spanning tree. Other solutions, i.e., the dynamic programming, allow to designate other architecture elements of the networks, as well as to obtain a better efficiency of optimization process of the graphs.