Treffer: Session-affinity aware request allocation for web clusters

Title:
Session-affinity aware request allocation for web clusters
Source:
24th International Conference on Distributed Computing Systems (proceedings). :142-149
Publisher Information:
Los Alamitos CA: IEEE Computer Society, 2004.
Publication Year:
2004
Physical Description:
print, 18 ref 1
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Computer Engineering Nanyang Technological University, Singapore 639798, Singapore
Department of Computer Science Hong Kong Univ. of Sci. and Tech, Clear Water Bay, Hong-Kong
Department of Computer Sci. and Tech. Tsinghua University, Beijing 100084, China
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17415534
Database:
PASCAL Archive

Weitere Informationen

Persistent connections are increasingly being used in web retrieval due to wide adoption of HTTP/1.1 standards. With persistent connections, the request allocation algorithm used by web clusters is often session-grained. This paper studies the caching performance of web clusters under session-grained request allocation. It is shown that although content-based algorithms considerably improve caching performance over content-blind algorithms at the request-grained level, most performance gain is offset by the allocation dependency that arises when the requests are allocated at the session-grained level. The performance loss increases with cluster size and connection holding time. An optimization problem is then formulated for improving the caching effectiveness of session-grained allocation. The problem is proven to be NP-complete. Based on a heuristic approach, a session-affinity aware algorithm is presented that makes use of the correlation between the requests in a session. The new algorithm is shown to significantly outperform the content-based algorithm under session-grained allocation. It is also shown that optimizing session-grained allocation cannot fully compensate for the performance loss caused by allocation dependency.