Dynamic information-based scalable hashing on a cluster of web cache servers
Document Type
Article
Publication Date
3-10-2012
Abstract
Caching web pages is an important part of web infrastructures. Medium to large-scale infrastructures deploy a cluster of servers to solve the scalability and storage problems inherent in caching. In this paper we present dynamic information-based scalable hashing that evenly hashes client requests to a cluster of cache servers, resulting in performance scalability. Runtime information is used to determine when and how to cache pages. Cached pages are stored and retrieved mutually exclusively to/from all the servers to minimize the use of storage, resulting in storage scalability. We set up an experimental environment consisting of various machines, including client servers, a cluster of 16 cache servers, and a load balancer. We demonstrate through experimental results that dynamic information-based scalable hashing maximizes both performance scalability and storage scalability while the existing approaches do only either one of the two. Copyright © 2011 John Wiley & Sons, Ltd.
Identifier
84860410322 (Scopus)
Publication Title
Concurrency and Computation Practice and Experience
External Full Text Location
https://doi.org/10.1002/cpe.1830
e-ISSN
15320634
ISSN
15320626
First Page
322
Last Page
340
Issue
3
Volume
24
Recommended Citation
Kwak, Hukeun; Sohn, Andrew; and Chung, Kyusik, "Dynamic information-based scalable hashing on a cluster of web cache servers" (2012). Faculty Publications. 18322.
https://digitalcommons.njit.edu/fac_pubs/18322
