Abstract: A cache server is asked for an object by the user in proxy caching. A cache is most likely saved in memory or on the disk. Cache memory is fetched the study from a disk cache most rapidly. The Least Recently Used shortly termed as (LRU) cache replacement calculation is straightforward as well as by end large utilized plan. Proxy caching is a unique procedure to lower traffic of network as well as delay in numerous WWW applications. Proxy caches are most often being located to near gateways of network and serve several users with objects that are cached from the large 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. Proxy caching is applied to increase access of the user to general web content. Multiple systems utilize multiple caches for good performance. A cache of the Multi-form level usually works via testing the minimum lead cache. The uncertainty you miss a minor cache than the next vast level cache. This research will study the L1 cache like the primary memory through the L2 cache such that the secondary form of the proxy server memory. LRU takes into account the replacement of page algorithm. Previously, the LRU technique used to eliminate cold caching pollution but it is not much efficient technique. We overcome this problem. In this, we used technique such as JSK-LRU. This technique has provided a higher performance on the basis of access time.
Description:The present invention relates to the field of reduce Access time of an object from Proxy Server. The present invention relates to remove Cold Cache Pollution by caching data locally. The present invention relates to serving it quickly when a request for the data is received. When data not needed for longest time then it will evict from cache. More particularly, the present invention is related to improve the performance of access time in proxy caching using JSK-LRU algorithm. , Claims:1. Improve the performance of access time in proxy caching using JSK-LRU algorithm, the process comprises:
2. Architecture of Proxy server, Flow chart of the algorithm, Security process of Proxy server
3. An improve the performance of access time in proxy caching using JSK-LRU algorithm, the system comprises Proxy server, a user, an algorithm to process and reduce access time of an object.
4. JSK-LRU algorithm comprises to reduce the workload on main server because proxy server receive object from user and process it. Proxy servers placed between user and main server to reduce the workload.
5. Performance of access time in proxy caching using JSK-LRU algorithm provide security to the user. Actually IP address of user is visible to all at the time of browsing. Proxy server protect the user’s IP address and send alternate IP address to the main server to fetch the object.
6. JSK-LRU algorithm comprises to reduce cold cache pollution on proxy server and provide better access time to access an object as per user requirement. JSK-LRU algorithm provide better result compare to traditional algorithm like LRU, LRU-D, SLRU.
7. Previous methodology examined the LRU for the caching by reducing the pollution in cold cache. There are many drawbacks and these would be overcome by the JSK-LRU. Initially, generate two memories (i.e. primary & secondary) from the cache into equal parts. In secondary memory, Data has been shifted using AVL for better and faster fetching of the data. In primary memory, LRU has been used to store the least useful data.
| # | Name | Date |
|---|---|---|
| 1 | 202221049093-FORM 1 [26-08-2022(online)].pdf | 2022-08-26 |
| 2 | 202221049093-FIGURE OF ABSTRACT [26-08-2022(online)].pdf | 2022-08-26 |
| 3 | 202221049093-DRAWINGS [26-08-2022(online)].pdf | 2022-08-26 |
| 4 | 202221049093-COMPLETE SPECIFICATION [26-08-2022(online)].pdf | 2022-08-26 |
| 5 | Abstract1.jpg | 2022-12-27 |