Architectures consisting of multiple cache servers are a popular solution to deal with performance and network resource utilization issues related to the growth of the Web request. Cache cooperation is often carried out through purely hierarchical and flat schemes that suffer from scalability problems when the number of servers increases. We propose, implement and compare the performance of three novel distributed cooperation models based on a two-tier organization of the cache servers. The experimental results show that the proposed architectures are effective in supporting cooperative document lookup and download They guarantee cache hit rates comparable to those of the most performing protocols with a significant reduction of the cooperation overhead Moreover in case of congested network, they reduce the 90-percentile of the system response time up to nearly 30% with respect to the best pure cooperation mechanisms.

Distributed Cooperation Schemes for Document Lookup in Multiple Cache Servers / Lancellotti, R; Ciciani, Bruno; Colajanni, M.. - STAMPA. - (2003), pp. 43-50. (Intervento presentato al convegno 2nd IEEE International Symposium on Network Computing and Applications tenutosi a Cambridge, MA; USA nel 16-18 April 2003) [10.1109/NCA.2003.1201136].

Distributed Cooperation Schemes for Document Lookup in Multiple Cache Servers

CICIANI, Bruno;
2003

Abstract

Architectures consisting of multiple cache servers are a popular solution to deal with performance and network resource utilization issues related to the growth of the Web request. Cache cooperation is often carried out through purely hierarchical and flat schemes that suffer from scalability problems when the number of servers increases. We propose, implement and compare the performance of three novel distributed cooperation models based on a two-tier organization of the cache servers. The experimental results show that the proposed architectures are effective in supporting cooperative document lookup and download They guarantee cache hit rates comparable to those of the most performing protocols with a significant reduction of the cooperation overhead Moreover in case of congested network, they reduce the 90-percentile of the system response time up to nearly 30% with respect to the best pure cooperation mechanisms.
2003
2nd IEEE International Symposium on Network Computing and Applications
Cooperative caching; Delay; Network servers; Protocols; Prototypes; Resource management; Scalability; Service oriented architecture; Web and internet services; Web server
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Distributed Cooperation Schemes for Document Lookup in Multiple Cache Servers / Lancellotti, R; Ciciani, Bruno; Colajanni, M.. - STAMPA. - (2003), pp. 43-50. (Intervento presentato al convegno 2nd IEEE International Symposium on Network Computing and Applications tenutosi a Cambridge, MA; USA nel 16-18 April 2003) [10.1109/NCA.2003.1201136].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/193449
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact