DYNASEM - An Improvised Dynamic and Semantic based Web Cache Replacement Policy

Main Article Content

Geetha K
Ammasi Gounden N


This paper proposes a web cache replacement policy based on semantic content of the pages cached at the client side. Two models namely Clustered Model(CM) and Relational Model(RM) are proposed that focus on the Dynamicity which refers the dynamic nature of the content and the Semantic content which exhibits the relation of information available among cached web pages and hence the name DynaSem. The proposed policy marks the page for eviction prioritized by Eviction Index (EI) in CM and Relation Index (RI) in RM. CM uses an interface with a web browser incorporated into it. The Trie data structure that enables the searching process to be more efficient has been framed to store the well-known categories of cached content as clusters. Pages with highest EI are marked for eviction. RM employs a technique to reveal the relation among cached documents. It evicts documents that are less related(minimum RI) to an incoming document which needs to be stored in the cache to ensure that only related documents are cached; hence the contents of the cache represent the documents of interest to the user and those which are of more static in nature. The proposed policy has been developed to incorporate two algorithms- one to find the dynamic count of the given web page 'P' and the other to the find semantic relation between the pages cached. Both the models(CM and RM) are used to establish the semantic relation. The policy has been simulated under model driven simulation with the help of an input set consisting of a few web pages. The parameters pertinent to cache replacement algorithms are computed and the result shows there is a factual improvement compared to the original semantic based policies.



Keywords: Web caching, replacement policies, eviction, semantic relation, dynamism.


Download data is not yet available.

Article Details