Removal policies in network caches for World-Wide Web documents
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Performance evaluation of Web proxy cache replacement policies
Performance Evaluation - Special issue on modelling techniques and tools for performance evaluation
Improving Proxy Cache Performance: Analysis of Three Replacement Policies
IEEE Internet Computing
Characterizing Document Types to Evaluate Web Cache Replacement Policies
ECUMN '07 Proceedings of the Fourth European Conference on Universal Multiservice Networks
A clustering-based prefetching scheme on a Web cache environment
Computers and Electrical Engineering
| Hi-index | 0.00 |
In the network we have remote data accesses. Sometimes, the network has data loss and the user requests this data again or user has local request data and has frequently data, therefore if server sends these data several times, it consumes a great deal of time, cost and bandwidth and etc. Caching is a technique intended to minimize the time involved in data access and decrease the cost and workload of network. If we have a static Cache replacement algorithm and the same cache replacement policy is used at all caches, these policies cannot adapt to changes in workload and network topology and if a miss occurs in one of the cache, it will result in a miss in the other ones. In this paper we use a multi expert system to find the best algorithm in each node which is named SCRAME. It helps with the management of distributed caches when complex dynamic workloads are serviced. We evaluated and compared some cache replacement algorithm with SCRAME, we found the SCARME has less miss than another algorithm. Our method will be useful for all distributed Web, database and content delivery services.