Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

A Tabu Search Approach for Optimizing Server Placement in Distributed Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Biyao Wang ; Key Lab. of Network Commun. Syst. & Control, Univ. of Sci. & Technol. of China, Hefei, China ; JinLin Wang ; Xue Liu

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.

Published in:

Networking and Distributed Computing (ICNDC), 2011 Second International Conference on

Date of Conference:

21-24 Sept. 2011