Analysis and visualization of proxy caching using LRU, AVL tree and BST with supervised machine learning

Abstract

Proxy cache access speeds and decreases load time. There is an uncertainty regarding cache level 2 which you neglect. This research shall investigate the L1 cache, primary cache, and L2 cache as a secondary proxy server cache. LRU is typically utilised instead of cache. LRU for cold cache removal used to be a time-consuming process, but it isn't particularly efficient today. The performance of the cache L1 used LRU and L2 used LRU_AVL has risen with these solutions. The output is the LRU_AVL among other ways that utilize LRU tables and graphs. proxy cache LRU, LRU_AVL, and LRU_BST have average time of access calculated. Median access time is estimated using Python tools including Pandas, MatPlotLib as well as LRU, LRU_AVL, and LRU_BST. This research will anticipate the average period of usage of LRU, LRU_AVL, and LRU_BST cache algorithms.