Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/774

On caching effectiveness of web clusters under persistent connections

Authors Tang, XY
Chanson, ST
Issue Date 2003
Source Journal of parallel and distributed computing , v. 63, (10), 2003, OCT, p. 981-995
Summary Due to the emergence of the HTTP/1.1 standards, persistent connections are increasingly being used in web retrieval. This paper studies the caching performance of web clusters under persistent connections, focusing on the difference between session-grained and request-grained allocation strategies adopted by the web switch. It is shown that the content-based algorithm considerably improves caching performance over the content-blind algorithm at the request-grained level. However, most of the performance gain is offset by the allocation dependency that arises when the content-based algorithm is used at the session-grained level. The performance loss increases with cluster size and connection holding time. An optimization problem is formulated to investigate the best achievable caching performance under session-grained allocation. Based on a heuristic approach, a session-affinity aware algorithm is presented that makes use of the correlation between the requests in a session. Experimental results show that while the session-affinity aware algorithm outperforms the content-based algorithm under session-grained allocation, this optimization cannot fully compensate for the performance loss caused by allocation dependency. (C) 2003 Elsevier Inc. All rights reserved.
Subjects
ISSN 0743-7315
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Find@HKUST
Files in this item:
File Description Size Format
jpdc2003.pdf 278225 B Adobe PDF