A Server Placement Algorithm Conscious of Communication Delays and Relocation Costs

Authors:
Junho Shim;Taehee Lee;Sang-goo Lee
Affiliations:
-;-;-
Venue:
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Year:
2002

Citing 8
Cited 3

Data mining: concepts and techniques

Data mining: concepts and techniques
The cache location problem

IEEE/ACM Transactions on Networking (TON)
Cure: an efficient clustering algorithm for large databases

Information Systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Proxy Cache Algorithms: Design, Implementation, and Performance

IEEE Transactions on Knowledge and Data Engineering
Efficient and Effective Clustering Methods for Spatial Data Mining

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Transparent Replication of HTTP Service

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
A Scalable Yet Transparent Infrastructure for Distributed Applications: Core Design of Jasmine ii Framework

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems

Networks Consolidation through Soft Computing

ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
DOC: a distributed object caching system for information infrastructure

HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Network redesign through servers consolidation

Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services

Quantified Score

Hi-index	0.00

Visualization

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.