Neural network hot spot prediction algorithm for shared web caching system

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

There are innumerable objects found on the Web. Both the popular objects that are requested frequently by the users and unpopular objects that are rarely requested exist. Hot spots are produced whenever huge numbers of objects are requested by the users. Often this situation produces excessive load on the cache server and original server, resulting in the system becoming a swamped state. Many problems arise, such as server refusals or slow operations. In this paper, a neural network prediction algorithm is suggested in order to solve the problems caused by the hot spot. The hot spot would be requested in the near future is prefetched to the proxy servers after the prediction of the hot spot; then the fast response for the users' requests and a higher efficiency for the proxy server can be achieved. The hot spots are obtained by analyzing the access logs file. A simulator is developed to validate the performance of the suggested algorithm, through which the hit rate improvement and the request among the shared proxy servers are load-balanced. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Park, J. H., Jung, S. C., Zhang, C., & Chong, K. T. (2005). Neural network hot spot prediction algorithm for shared web caching system. In Lecture Notes in Computer Science (Vol. 3399, pp. 795–806). Springer Verlag. https://doi.org/10.1007/978-3-540-31849-1_76

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free