DMCA
An Empirical Evaluation of Client-side Server Selection Algorithms (2000)
Cached
Download Links
| Citations: | 80 - 3 self |
BibTeX
@INPROCEEDINGS{Dykes00anempirical,
author = {Sandra G. Dykes and Kay A. Robbins and Clinton L. Jeffery},
title = {An Empirical Evaluation of Client-side Server Selection Algorithms},
booktitle = {},
year = {2000},
pages = {1361--1370},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This paper empirically evaluates six clientside server selection algorithms. The study compares two statistical algorithms, one using median bandwidth and the other median latency, a dynamic probe algorithm, two hybrid algorithms, and random selection. The server pool includes a topologically dispersed set of United States state government web servers. Experiments were run on three clients in different cities and on different regional networks. The study examines the effects of time-of-day, client resources, and server proximity. Differences in performance highlight the degree of algorithm adaptability and the effect that network upgrades can have on statistical estimators. Dynamic network probing performs as well or better than the statistical bandwidth algorithm and the two probe-bandwidth hybrid algorithms. The statis...
Keyphrases
empirical evaluation client-side server selection algorithm server pool statistical bandwidth algorithm median bandwidth different city dynamic network retrieval time probe-bandwidth hybrid algorithm algorithm adaptability median latency different regional network hybrid algorithm dispersed set client resource statistical estimator important component internet cache architecture dynamic probe algorithm statistical algorithm different server network upgrade random selection clientside server selection algorithm efficient server selection
