Skip to main content

A Weighted Frequency Based Cache Memory Replacement Policy for Named Data Networking

  • Conference paper
  • First Online:
Book cover Security, Privacy and Anonymity in Computation, Communication and Storage (SpaCCS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10067))

Abstract

This paper presents a weighted frequency based real-time data replacement policy (WFRRP) for named data networking (NDN) cache memory. Based on the temporal locality, WFRRP leverages the weighted request frequency within different time periods and the cost of data request to predictas well as evaluate the real-time popularity of data. Specifically, those real hot data and data further away from the source servers are able to obtain high real-time popularity so as to have the caching priorities over the cold data. Experimental results show that WFRRP has accurate prediction capability, and is able to gain considerable improvements of data hit rate so as to help the NDN reduce the average number of hops and transmission delay.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gaogang, X.: A survey on future internet architecture. Chin. J. Comput. 35(6), 1109–1119 (2012)

    Article  Google Scholar 

  2. Er Long, M.: Research progress of content center network. Netinfo Secur. 6–10 (2012)

    Google Scholar 

  3. Lin, X.: future internet architecture—content centric networks. Telecommun. Sci. 26(4), 7–16 (2010)

    Google Scholar 

  4. Sprangle, E., Carmean, D., Kumar, R.: Distribution of tasks among asymmetric processing elements. US, US8930722 (2015)

    Google Scholar 

  5. Mu, R., Zhao, F.: CDN and P2P network model based on HCDN Technology. J. Softw. Eng. 9(3), 469–486 (2015)

    Article  MathSciNet  Google Scholar 

  6. Ahlgren, B.: A survey of information-centric networking. IEEE Commun. Mag. 50(7), 26–36 (2012)

    Article  Google Scholar 

  7. Afanasyev, A.: SNAMP: secure namespace mapping to scale NDN forwarding. In: 2015 IEEE Conference on IEEE Computer Communications Workshops (INFOCOM WKSHPS) (2015)

    Google Scholar 

  8. Jacobson, V., Mosko, M., Smetters, D.: Content-centric networking. Whitepaper, Palo Alto Research Center, pp. 2–4 (2007)

    Google Scholar 

  9. Zhang, L., Estrin, D., Jacobson, V.: Named data networking project. Technical Report, NDN-0001 (2010)

    Google Scholar 

  10. Shin, S.W., Kim, K.Y., Jang, J.S.: LRU based small latency first replacement (SLFR) algorithm for the proxy cache. In: Proceedings. IEEE/WIC International Conference on IEEE Web Intelligence, WI 2003, pp. 499–502 (2003)

    Google Scholar 

  11. Karakostas, G., Serpanos, D.: Practical LFU implementation for web caching. Technical Report TR-622–00, Department of Computer Science, Princeton University (2000)

    Google Scholar 

  12. Wang, J.M., Bensaou, B.: Improving content-centric networks performance with progressive, diversity-load driven caching. In: 2012 1st IEEE International Conference on IEEE Communications in China (ICCC), pp. 85–90 (2012)

    Google Scholar 

  13. Chen, X., Fan, Q., Yin, H.: Caching in information-centric networking: from a content delivery path perspective. In: 2013 9th International Conference on IEEE Innovations in Information Technology (IIT), pp. 48–53 (2013)

    Google Scholar 

  14. Afanasyev, A., Moiseenko, I., Zhang, L.: ndnSIM: NDN simulator for NS-3. University of California, Los Angeles, Technical report (2012)

    Google Scholar 

  15. Carofiglio, G.: Modeling data transfer in content-centric networking. In: 2011 23rd International IEEE Teletraffic Congress (ITC), pp. 111–118 (2011)

    Google Scholar 

  16. Laoutaris, N., Syntila, S., Stavrakakis, I.: Meta algorithms for hierarchical web caches. In: 2004 IEEE International Conference on Performance, Computing, and Communications, pp. 445–452. IEEE (2004)

    Google Scholar 

Download references

Acknowledgments

This work is partially supported by the National Science Foundation of China under Grant Nos. 61572181, 61300218, 61472131 and 61272546; Research and Development Key Projects of Hunan Province (2016JC2013, 2016JC2012); Science and Technology Key Projects of Hunan Province (2015 TP1004).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yupeng Hu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Liao, Y., Hu, Y., Wu, L., Qin, Z. (2016). A Weighted Frequency Based Cache Memory Replacement Policy for Named Data Networking. In: Wang, G., Ray, I., Alcaraz Calero, J., Thampi, S. (eds) Security, Privacy and Anonymity in Computation, Communication and Storage. SpaCCS 2016. Lecture Notes in Computer Science(), vol 10067. Springer, Cham. https://doi.org/10.1007/978-3-319-49145-5_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49145-5_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49144-8

  • Online ISBN: 978-3-319-49145-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics