Design and performance analysis of the web caching algorithm for performance improvement of the response speed

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

Abstract

Until now, various web caching replacement algorithms related to this were researched. An aggravation of web object heterogeneity more frequently generates a replacement of a web object, but cannot reflect enough all kinds of characteristics of web object in these traditional replacement techniques. Especially size heterogeneity of an object has an influence on performance of a web caching seriously. Therefore, a study on web caching algorithm with size heterogeneity of an object is required. In this study, we proposed a web object replacement algorithm with heterogeneity of a web object for performance improvement of the response speed. The algorithm is designed with a divided scope that considered size reference characteristic and reduced size heterogeneity on web object. The performance of the algorithm is analyzed with an experiment. With the experiments results, the algorithm is compared with previous replacement algorithms, and its performance is confirmed with 10%-20% elevation of object-hit ratio and an improvement of response speed. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Na, Y. J., & Ko, I. S. (2007). Design and performance analysis of the web caching algorithm for performance improvement of the response speed. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4352 LNCS, pp. 686–693). https://doi.org/10.1007/978-3-540-69429-8_75

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