Pair of Replacement Algorithms MFMR and AF-LRU on L1 and L2 Cache for Proxy Server

Access to the Internet and WWW is growing extensively, which results in heavy network traffic. To reduce the network traffic proxy server is used. Proxy server reduces the load of server. If the cache replacement algorithm of proxy server´s cache is efficient then proxy server will be helpful to reduce the network traffic in more efficient manner. In this paper we are considering proxy server cache to be Level 1 (L1) cache and storage cache of proxy server to be Level 2 (L2) cache. For collecting the real trace proxy server is used in an organization. Log of proxy server gives the information of various URLs accessed by various clients with time. For performing experiments various URLs were given a numeric identity. This paper analyzes the behavior of various replacement algorithms. The replacement algorithms taken into consideration are least recently used (LRU), least frequently used (LFU), first in first out (FIFO). This paper proposes a new replacement algorithm named MFMR (most frequent with maximum reusability) for L1 which works about 16% better than existing algorithms considered in this paper. This paper also proposes a new replacement policy for L2 named AFLRU (average frequency, least recently used). Simulation results shows that pair of MFMR and AF-LRU is approximately 28% better than other existing pairs of replacement algorithms considered.