Replacement Strategy of Web Cache Based on Data Mining

  • Jing Zhang
  • Published 2015 in 2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)

Abstract

RFS model is established by the application of RFM data mining theory to Web cache replacement policy, Using K-Means clustering algorithm to analyze RFS model we obtained the value of segmentation of the Web access, and ordered the worst access value web pages of the segmentation data by RFS. When the Web cache replacement occurs, the last web file order was eliminated, and all the Web pages in the buffer re-executed the strategic positioning of access value. Finally, a contrast between the new strategy (in this paper) and the old one (LRU, LFU, SIZE, GDSF) was conducted so as to prove the new one better.

Topics

    0 Figures and Tables

      Download Full PDF Version (Non-Commercial Use)