Abstract
The server placement algorithm is to locate the given number of cache servers at “proper” coordinates in the network. A typical objective to determine good locations may be simply to find the set of client clusters in which the Euclidean center of each cluster is the location of the cache server. We claim, however, that the objective should also consider 1) the network communication delays and 2) the cost of relocating cache servers, if any. We exploit both hierarchical and partitioning approaches, and present our server placement algorithm. We evaluated the performance of the algorithm, and its result is promising.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1991.
S. Guha, R. Rastogi, and K. Shim. “CURE: An Efficient Clustering Algorithm for Large databases,” Information Systems, Vol. 26, No. 1, Pergamon, 2001.
J. Han, and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2001.
S. Jamin, C. Jin, A.R. Kurc, D. Raz, and Y. Shavitl, “Constrained Mirror Placement on the Internet,” IEEE INFOCOMM, 2001
K. Leung, J. Shim, D. Tcherevik, and A. Vinberg, “A Scalable Yet Transparent Infrastructure for Distributed Applications,” Proc. of the 8th International Conference on Parallel and Distributed Systems, IEEE Computer Society, 2001.
P. Krishnan, D. Raz, and Y. Shavitt, “The Cache Location Problem,” IEEE/ACM Transactions on Networking, Vol. 8, No. 5, ACM, 2000.
NASA. The AutoClass Project, http://ic.arc.nasa.gov/ic/projects/bayes-group/autoclass/.
R.T. Ng, and J. Han, “Efficient and Effective Clustering Methods for Spatial Data Mining,” Proc. of the 20th Very Large Data Bases Conference, Morgan Kaufmann, 1994.
L. Qiu, V.N. Padmanabhan, and G.M. Voelker, “On the Placement of Web Server Replicas,” IEEE INFOCOMM, 2001
J. Shim, and T. Lee, “Survey on Clustering Algorithms for Optimal Server Placement,” Technical Report, Sookmyung Women’s University, 2001.
J. Shim, P. Scheuermann, and R. Vingralek, “Proxy Cache Algorithms: Design, Implementation, and Performance,” IEEE Transactions on Knowledge and Data Engineering, Vol. 11, No. 4, IEEE Computer Society, 1999.
U.S. Census Bureau, United States County Statistics, http://www.census.gov/.
R. Vingralek, Y. Breitbart, M. Sayal, and P. Scheuermann, “A Transparent Replication of HTTP Service,” Proc. of the 15th International Conference on Data Engineering, IEEE Computer Society, 1999.
W. E. Wright, “Gravitational Clustering,” Pattern Recognition, Vol. 9, Pergamon Press, 1977.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shim, J., Lee, T., Lee, Sg. (2002). A Server Placement Algorithm Conscious of Communication Delays and Relocation Costs. In: Gregori, E., Cherkasova, L., Cugola, G., Panzieri, F., Picco, G.P. (eds) Web Engineering and Peer-to-Peer Computing. NETWORKING 2002. Lecture Notes in Computer Science, vol 2376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45745-3_7
Download citation
DOI: https://doi.org/10.1007/3-540-45745-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44177-9
Online ISBN: 978-3-540-45745-9
eBook Packages: Springer Book Archive