Abstract
This paper addresses the optimization problems of placing servers in the presence of competition. We place a set of extra servers on a graph to compete with the set of original servers. Our objective is to find the placement that maximizes the benefit, which is defined as the profits from the requests made to the extra servers despite the competition, minus the cost of constructing those extra servers.
We propose an O(|V|3 k) time dynamic programming algorithm to find the optimal placement of k extra servers that maximizes the benefit in a tree with |V| nodes. We also propose an O(|V|3) time dynamic programming algorithm for finding the optimal placement of extra servers that maximizes the benefit, without any constraint on the number of extra servers. For general connected graphs, we prove that the optimization problems are NP-complete. As a result, we present a greedy heuristic for the problems. Experiment results indicate that the greedy heuristic achieves good results, even when compared with the upper bounds found by a linear programming algorithm. The greedy heuristic yields performances within 15% of the upper bound in the worst case, and within 2% of the same theoretical upper bound on average.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Calvert, K., Zegura, E.: Gt-itm: Georgia tech internetwork topology models. http://www-static.cc.gatech.edu/projects/gtitm/
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)
Jia, X., et al.: Placement of web-server proxies with consideration of read and update operations on the internet. The Computer Journal 46(4), 378–390 (2003)
Kalpakis, K., Dasgupta, K., Wolfson, O.: Optimal placement of replicas in trees with read, write, and storage costs. IEEE Transactions on Parallel and Distributed Systems 12(6), 628–637 (2001)
Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. ii: The p-medians. SIAM J. Appl. Math. 37(3), 539–560 (1979)
Ko, B.-J., Rubenstein, D.: A greedy approach to replicated content placement using graph coloring. In: SPIE ITCom Conference on Scalability and Traffic Control in IP Networks II, Boston, MA (July 2002)
Makhorin, A.: http://www.gnu.org/software/glpk/glpk.html
Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proc. 29th ACM STOC., pp. 265–274 (1997)
Tamir, A.: An o(pn 2) algorithm for the p-median and related problems on tree graphs. Operations Research Letters 19(2), 59–64 (1996)
Unger, O., Cidon, I.: Optimal content location in multicast based overlay networks with content updates. World Wide Web 7(3), 315–336 (2004)
Waxman, B.M.: Routing of multipoint connections. pp. 347–352 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Liu, P., Chung, YM., Wu, JJ., Wang, CM. (2007). Server Placement in the Presence of Competition. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-72360-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72359-2
Online ISBN: 978-3-540-72360-8
eBook Packages: Computer ScienceComputer Science (R0)