|
Title:
|
SCALABILITY OF COOPERATIVE ALGORITHMS FOR DISTRIBUTED ARCHITECTURES OF PROXY SERVERS |
|
Author(s):
|
Riccardo Lancellotti , Francesca Mazzoni , Michele Colajanni |
|
ISBN:
|
972-98947-1-X |
|
Editors:
|
Pedro Isaías and Nitya Karmakar |
|
Year:
|
2003 |
|
Edition:
|
1 |
|
Keywords:
|
Web Caching Protocols, Scalability, Performance Evaluation, Distributed Systems. |
|
Type:
|
Full Paper |
|
First Page:
|
458 |
|
Last Page:
|
466 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Systems consisting of multiple proxy servers are a popular solution to deal with performance and network resource utilization problems related to the growth of the Web numbers. After a first period of prevalent enthusiasm towards cooperating proxy servers, the research community is exploring in a more systematic way the real benefits and limitations of cooperative caching. Hierarchical cooperation has clearly shown its limits. We study the scalability of traditional protocols (e.g., directory-based, query-based) in flat architectures through different performance metrics and experiments using both synthetic workloads and traces. The synthetic workload is also used for sensitivity analysis with respect to various parameters while traces are used for validating our observations in a more realistic scenario. We show that ICP has a better hit rate than that of Cache Digests, but the latter has a much smaller overhead, thus making the choice between the two protocols a challenge depending on the providers interest: if the hit rate is the most important parameter, you should certainly choose ICP, while if you are mostly concerned with keeping the overhead low, then your choice should go to Cache Digests. In any case, both protocols show scalability problems when applied to a large number of cooperating cache servers. |
|
|
|
|
|
|
