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.
A Distributed Cooperation Schemes for Document Lookup in Geographically Dispersed Cache Servers / Lancellotti, Riccardo; Colajanni, Michele; Ciciani, Bruno. - STAMPA. - (2003), pp. N/A-N/A. ((Intervento presentato al convegno IEEE International Symposium on Network Computing and Applications (NCA2003) tenutosi a Cambridge, MA nel April 2003.
A Distributed Cooperation Schemes for Document Lookup in Geographically Dispersed Cache Servers
LANCELLOTTI, Riccardo;COLAJANNI, Michele;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.
Pubblicazioni consigliate
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
