Analysis and Advancement of Page Replacement Algorithm for web Proxy Server
Divyanshu Atre1, Lalit Gehlod2
1Mr. Divyanshu Atre, Department of Computer Engineering, Institute of Engineering and Technology, DAVV, Indore (M.P), India.
2Mr. Lalit Gehlod, Department of Computer Engineering, Institute of Engineering and Technology, DAVV, Indore (M.P), India.
Manuscript received on 13 June 2017 | Revised Manuscript received on 20 June 2017 | Manuscript Published on 30 June 2017 | PP: 207-210 | Volume-6 Issue-5, June 2017 | Retrieval Number: E5048066517/17©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: World Wide Web is growing rapidly and number of users is increasing day by day to access web pages. A Proxy server intercepts all client requests, and provides responses from its cache or forwards the request connects to the real server. Proxies were invented to add structure and encapsulations to distributed systems. The problems of web servers are heavy network traffic and Latency etc. To overcome these problems, proxy server caching is one of the solution. Proxy caching improve the speed of service requests by fetching the store web pages from an earlier request through the same point or even other point. In this research work Page Replacement Algorithm (LRU, LFU, FIFO) have analyzed for proxy server caching and proposed the randomly caching page replacement algorithm. It increases the hit rate with time and reduced execution time on proxy server cache. With the help of proposed algorithm, the performance of proxy server caching has been improved in terms of hit rate and time parameter.
Keywords: Proxy Server, Web Cache, Latency, Page Replacement Algorithm (LRU, LFU, FIFO) etc.
Scope of the Article: Web Algorithms