Method for minimizing street crossings and meeting maximum capacity

Abstract

A method for designing a telecom network includes retrieving data corresponding to a plurality of network node locations, a plurality of subscriber locations and other relevant information such as associated street blocks and distance values. Each network node location and subscriber location combination having a distance value therebetween greater than a maximum distance is initially eliminated. Thereafter, each network node location and subscriber location combination is assigned a priority value, based on constraints such as the proximity between their associated street blocks and/or the maximum capacity of each network node location. The total sum of priority values and total number of subscriber locations are then calculated for those sets of network node locations and corresponding subscriber locations that are selected by the algorithm. A final set of network node locations and assigned subscriber locations is identified by determining the set having the lowest total sum of priority values, which minimizes the street crossings in the design, and the highest number of subscriber locations.