Yan Cairong, Peng Qinke, Shen Junyi
(School of Electronics and Information Engineering, Xi'an Jiaotong University, Xi'an 710049, China)
Abstract: An efficient associated-content-aware request distribution
(ACARD) algorithm was proposed through analyzing the traits of requests distribution in
Web cluster server. The algorithm mines periodically the use patterns of Web server with
FP-tree method under the constraint of cache size, and then allocates documents of
patterns in different back-end servers and forwards client requests to related servers
according to their contents, so that the cluster system can achieve high disk usage and
cache hit ratio. Experimental results show that the performance of the distributing
algorithms in kernel level is much better than that in user level and ACARD can increase
the average throughput of the system by 20.4% compared to weighted least-connection.
Keywords: Web cluster server; content-aware request distribution; adaptive; cache hit
ratio Web