Referenced Items are not available for this document.
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
- Page(s):
- 122 - 126
- Print ISBN:
- 978-1-4577-0407-9
- INSPEC Accession Number:
- 12316002
- Conference Location :
- Beijing
- Digital Object Identifier :
- 10.1109/ICNDC.2011.32
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
