Detailed Information

Cited 0 time in webofscience Cited 6 time in scopus
Metadata Downloads

A server placement algorithm conscious of communication delays and relocation costs

Authors
Shim, JHLee, TLee, SG
Issue Date
Oct-2002
Publisher
SPRINGER-VERLAG BERLIN
Citation
WEB ENGINEERING AND PEER TO PEER COMPUTING, v.2376, pp.83 - 89
Journal Title
WEB ENGINEERING AND PEER TO PEER COMPUTING
Volume
2376
Start Page
83
End Page
89
URI
https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/16612
DOI
10.1007/3-540-45745-3_7
ISSN
0302-9743
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.
Files in This Item
Go to Link
Appears in
Collections
공과대학 > 소프트웨어학부 > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Shim, Junho photo

Shim, Junho
공과대학 (소프트웨어학부)
Read more

Altmetrics

Total Views & Downloads

BROWSE