Abstract
Mesh networks planning is a difficult topic to deal with. Due to the high redundancy in this type of networks, the complexity of planning such networks is greatly increased, comparing to traditional point-to-multipoint networks. In this work we have developed an optimization algorithm to perform the planning of a mesh network. Although this could be performed using linear programming, the process is, most of the times, too complicated, thus the complexity involved in switching scenarios is too high. In order to account for the accuracy of the algorithm, we have used one linear programming mathematical model, which allowed us to prove that the algorithm's results are correct and, thus, that it can be used in large scale scenarios with diferente characteristics.
Authors: André Cardote and Susana Sargento