Caching Proposal Based on Least Recently Used Algorithm and AVL Tree
DOI:
https://doi.org/10.37591/josettt.v5i2.1750Abstract
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.
Downloads
Published
Issue
Section
License
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
- I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
- I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
- I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
- I/We also agree to the authorship of the article in the following order:
Author’s name
1. ________________
2. ________________
3. ________________
4. ________________
| We Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal. |