There are many studies dealing with the design of optimal communication network topologies. However, in the current methodologies, every user or node presents the same constrains and behavior, while in reality networks resources have different characteristics than any other user or node. The greedy algorithm is offered for locating-central network resources on a communication network. The algorithm is generic and can be applied to various LANs and WANs. The proposed method gives the network manager analytical tools to deal with the issue of how to locate central resources in networks. The algorithm was compared to an optimal solution where possible, to lower bound, and to the results of simulated annealing.
展开▼
