Affiliations: [a] Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran
| [b] Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran
| [c] Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran
Correspondence:
[*]
Corresponding author. Ali Ebrahimnejad, Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran. E-mails: aemarzoun@gmail.com and a.ebrahimnejad@qaemiau.ac.ir.
Abstract: Internet is one of the most influential new communication technologies has influenced all aspects of human life. Extensive use of the Internet and the rapid growth of network services have increased network traffic and ultimately a slowdown in internet speeds around the world. Such traffic causes reduced network bandwidth, server response latency, and increased access time to web documents. Cache memory is used to improve CPU performance and reduce response time. Due to the cost and limited size of cache compared to other devices that store information, an alternative policy is used to select and extract a page to make space for new pages when the cache is filled. Many algorithms have been introduced which performance depends on a high-speed web cache, but it is not well optimized. The general feature of most of them is that they are developed from the famous LRU and LFU designs and take advantage of both designs. In this research, a page replacement algorithm called FCPRA (Fuzzy Clustering based Page Replacement Algorithm) is presented, which is based on four features. When the cache space can’t respond to a request for a new page, it selects a page of the lowest priority cluster and the largest login order; then, removes it from the cache memory. The results show that FCPRA has a better hit rate with different data sets and can improve the cache memory performance compared to other algorithms.
Keywords: Web cache, performance, response time, page replacement algorithm, hit rate
