Caching Proposal Based on Least Recently Used Algorithm and AVL Tree

Abstract

In proxy caching, the cache server gets the request for an object from a consumer. A cache is most likely saved in memory or on disk.  A memory cache is in the main greater hastily to study from than a disk cache. The Least Recently Used (LRU) cache replacement calculation is a straightforward and by and large utilized plan. Proxy caching is a unique procedure to lower network traffic and delay in numerous WWW applications. Proxy caches are often located near network gateways and serve many users with cached objects from many servers. Caching proxies maintain close by copies of quite often requested sources, allowing vast corporations to tremendously reduce their upstream bandwidth usage and cost, whilst incredibly growing efficiency.

Keywords: Web mining, caching, proxy server, LAN, LRU, AVL tree

Cite this Article
Jitendra Singh Kushwah, Sitendra Tamrakar. Caching Proposal Based on Least Recently Used Algorithm and AVL Tree. Journal of Software Engineering Tools & Technology Trends. 2018; 5(2): 37–47p.