Skip to Main Content
In distributed systems, the server placement problem in which a new server has to compete with existing servers for user requests is important in planning of constructing new business service sites. In addition to minimizing cost, competition-aware server placement also needs to maximize the benefit of building a new server. This paper proposes a Tabu Search approach to optimize the problem in general graphs. Results from the simulation experiments show that it do has a better performance than both of the Greedy Add and Greedy Remove algorithms.