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.

Scalability of Cooperative algorithms for distributed architectures of proxy servers / Lancellotti, Riccardo; Mazzoni, Francesca; Colajanni, Michele. - STAMPA. - (2003), pp. N/A-N/A. (Intervento presentato al convegno IADIS International WWW/Internet 2003 Conference tenutosi a Algarve, Portugal nel November 2003).

Scalability of Cooperative algorithms for distributed architectures of proxy servers

LANCELLOTTI, Riccardo;MAZZONI, Francesca;COLAJANNI, Michele
2003

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.
2003
IADIS International WWW/Internet 2003 Conference
Algarve, Portugal
November 2003
N/A
N/A
Lancellotti, Riccardo; Mazzoni, Francesca; Colajanni, Michele
Scalability of Cooperative algorithms for distributed architectures of proxy servers / Lancellotti, Riccardo; Mazzoni, Francesca; Colajanni, Michele. - STAMPA. - (2003), pp. N/A-N/A. (Intervento presentato al convegno IADIS International WWW/Internet 2003 Conference tenutosi a Algarve, Portugal nel November 2003).
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/465534
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact