Dynamic Page Replacement at the Cache Memory for the Video on Demand Server

Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 28)


The audio/video stream retrieves from the storage server depends upon the cache refreshment polices. The replacement policy depends upon the efficiency of handle the cache hit ratio and cache miss ratio at real time. The cache size is limited with compare to the auxiliary memory size, and it is only the fraction of the auxiliary memory. The cache memory maintains two blocks one for the Least Recently Used (LRU) and other for the Least Frequency Used (LFU). The Least Recently Frequency used (LRFU) pages store into the cache memory. Since the size of the cache is limited by using the exponential smoothing parameter, dynamically the cache replaces the page with the smallest hit count from the LRU. The request page from the submitted request stream increment the hit counts for the already listed pages. In this paper, we present the LRFU polices and the impact of that polices for the limited cache size with a huge submitted stream of requests in a very small interval of time.


Cache Memory LRFU LRU LFU Replacement policies 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Muntzand, D.D., Honeyman, D.D.: Multi-level Caching in Distributed File Systems-oryour cache ain’t nuthin’ but trash. In: Proceedings of the Usenix Winter Technical Conference (1992)Google Scholar
  2. 2.
    Zhou, Y., Philbin, J.F.: The multi-queue replacement algorithm for second level buffer caches. In: Proceedings of USENIX Annual Technical Conference, pp. 91–104 (2001)Google Scholar
  3. 3.
    Gramacy, R.B., Warmuth, M.K., Brandt, S.A., Ari, I.: Adaptive caching by refetching. In: NIPS (2002)Google Scholar
  4. 4.
    Ari, I., Amer, A., Gramarcy, R., Miller, E., Brandt, S., Long, D.: ACME: Adaptive caching using multiple experts. In: Proceedings of the Work shop on Distributed Data and Structures (WDAS), Carleton Scientific (2002)Google Scholar
  5. 5.
    Wong, T.M., Wilkes, J.: My cache or yours? Makings to storage more exclusive. In: Proceedings of USENIX Annual Technical Conference, pp. 161–175 (2002)Google Scholar
  6. 6.
    Hsu, W.W., Smith, A.J., Young, H.C.: The automatic improvement of locality in storage systems. Tech. Rep., Computer Science Division, Univ. California, Berkeley (2001)Google Scholar
  7. 7.
    Lee, W., Park, S., Sung, B., Park, C.: Improving Adaptive Replacement Cache (ARC) by Reuse Distance. In: 9th USENIX Conference on File and Storage Technologies (FAST 2011) (2011)Google Scholar
  8. 8.
    Sha, E.H.-M., Chantrapornchai, C.: Optimizing Page Replacement for Multiple – Level Memory HierarchyGoogle Scholar
  9. 9.
    Balamash, A., Krunz, M.: An Overview of Web Caching Replacement Algorithms. IEEE Commun. Surveys & Tutorials 6(2) (2004)Google Scholar
  10. 10.
    Kanrar, S.: Performance of distributed video on demand system for multirate traffic. Retis, pp. 52–56 (2011)Google Scholar
  11. 11.
    Kanrar, S.: Analysis and Implementation of the Large Scale Video-on-Demand System. IJAIS 1(2), 41–49 (2012)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Vehere InteractiveCalcuttaIndia
  2. 2.Computer ScienceVidyasagar UniversityMidnaporeIndia

Personalised recommendations