Skip to main content
Log in

NCPP-based caching and NUR-based resource allocation for information-centric networking

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Recently, Information-centric networking (ICN) has flourished research interest. One common and important feature of ICN is that has built-in caching capability, which means that every node can cache content along the content delivery path. To improve the transmission efficiency of content dissemination, we propose an efficient caching scheme for ICN, which is named as NCPP-based caching scheme. In our proposed caching scheme, we use the definition of node-content pass probability (NCPP), which taking both node utilization ratio and popularity of content into consideration, to decide whether the node needs to cache the content. In addition, the reasonable resource allocation can also improve the performance of ICN. Therefore, we propose a NUR-based resource allocation scheme, which uses the definition of node utilization radio (NUR). We compare the server hit ratio of random caching scheme and the proposed caching scheme by simulation. Our results show that our proposed scheme has smaller server hit ratio than random caching scheme. Furthermore, our proposed caching scheme depends on the number of requests.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Ahlgren B, Ambrosio M, Dannewitz C, Eriksson A, Golić J (2010) Second NetInf architecture description, 4WARD EU FP7 Project, Deliverable D-6.2 v2.0, FP7-ICT-2007-1-216041-4WARD/D-6.2, http://www.4ward-project.eu/. Accessed 21 Jan 2017

  • Barabasi A, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512

    Article  MathSciNet  MATH  Google Scholar 

  • Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D (2006) Complex networks: structure and dynamics. Phys Rep 424(4–5):175–308

    Article  MathSciNet  MATH  Google Scholar 

  • Chai W, He D, Psaras I, Pavlou G (2013) Cache “less for more” in information-centric networks. Comput Commun 36(7):758–770

    Article  Google Scholar 

  • Che H, Tung Y, Wang Z (2002) Hierarchical web caching systems: modeling, design and experimental results. IEEE J Sel Areas Commun 20(7):1305–1314

    Article  Google Scholar 

  • Dan G (2011) Cache-to-Cache: Could ISPs Cooperate to Decrease Peer-to-Peer Content Distribution Costs? IEEE Trans Parallel Distrib Syst 22(9):1469–1482

    Article  Google Scholar 

  • Dan A, Towsley D (1990) An approximate analysis of the LRU and FIFO buffer replacement schemes. ACM Sigmetrics Perform Eval Rev 18(1):143–152

    Article  Google Scholar 

  • Dehghan M, Massoulie L, Towsley D, Menasche D, Tay Y (2016) A utility optimization approach to network cache design. In: Proceeding of IEEE INFOCOM

  • Gharaibeh A, Khreishah A, Khalil I (2016) An O(1)-competitive online caching algorithm for content centric networking. In: Proceedings of IEEE INFOCOM

  • Ghodsi A, Shenker S, Koponen T, Singla A, Raghavan B, Wilcox J (2011) Information-centric networking: seeing the forest for the trees. In: Proceedings of ACM Workshop on Hot Topics in Networks (HotNets-X), pp 1–6

  • Jacobson V, Smetters D, Thornton J (2009) Networking named content. In: Proceedings of international conference on emerging NETWORKING experiments and technologies, pp 1–12

  • Jelenkovic P, Randovanovic A, Squillante M (2006) Critical sizing of LRU caches with dependent requests. J Appl Probab 43(4):1013–1027

    Article  MathSciNet  MATH  Google Scholar 

  • Jokela P, Zahemszky A, Arianfar S, Nikander P (2009) LIPSIN: line speed publish/subscribe inter-networking. In: Proceedings of ACM SIGCOMM, pp 195–206

  • Koponen T, Chawla M, Chun B, Ermolinskiy A, Kim K, Shenker S, Stoica I (2007) A data-oriented (and beyond) network architecture. ACM Sigcomm Comput Commun Rev 37(4):181–192

    Article  Google Scholar 

  • Laoutaris N, Smaragdakis G, Bestavros A, Matta I, Stavrakakis I (2007) Distributed Selfish Caching. IEEE Trans Parallel Distrib Syst 18(10):1361–1376

    Article  MATH  Google Scholar 

  • Neglia G, Carra D, Michiardi P (2017) Cache policies for linear utility maximization. In: Proceedings of IEEE INFOCOM

  • Newman M (2005) Power laws, Pareto distributions and Zipf’s law. Contemp Phys, 46(5):323–351

    Article  Google Scholar 

  • Psaras I, Chai W, Pavlou G (2012) Probabilistic in-network caching for information-centric networks. In: Proceedings of the second edition of the ICN workshop on Information-centric networking, pp 55–60

  • Psaras I, Chai W, Pavlou G (2014) In-network cache management and resource allocation for information-centric networks. IEEE Trans Parallel Distrib Syst 25(11):2920–2931

    Article  Google Scholar 

  • Rossi D, Rossini G (2012) On sizing CCN content stores by exploiting topological information. In: Proceeding of IEEE INFOCOM workshop on emerging design choices in name-oriented networking

  • Trossen D (2011) Conceptual architecture: principles, patterns and subcomponents descriptions. http://www.fp7-pursuit.eu/PursuitWeb/. Accessed 21 Jan 2017

  • Wang H, Hernandez J, Mieghem P (2008) Betweenness centrality in a weight network. Phys Rev E Stat Nonlinear Soft Matter Phys 77(4 Pt 2):046105

    Article  Google Scholar 

  • Wang X, Chen M, Taleb T, Ksentini A, Leung V (2014) Cache in the air: exploiting content caching and delivery techniques for 5G systems. IEEE Commun Mag 52(2):131–139

    Article  Google Scholar 

  • Wang S, Bi J, Wu J, Vasilakos A (2016) CPHR: In-network caching for information-centric networking with partitioning and hash-routing. IEEE/ACM Trans Netw 24(5):2742–2755

    Article  Google Scholar 

  • Wu J, Tse C, Lau F, Ho I (2013) Analysis of communication network performance from a complex network perspective. IEEE Trans Circuits Syst 60(12):3303–3316

    Article  Google Scholar 

  • Yan G, Zhao T, Hu B, Fu Z, Wang B (2005) Efficient routing on complex networks. Phys Rev E 73(4 Pt 2):046108 (Statistical, nonlinear, and soft matter physics)

    Google Scholar 

  • Zhang G, Li Y, Lin T (2013) Caching in information centric networking: a survey. Comput Netw 57(16):3128–3141

    Article  Google Scholar 

Download references

Acknowledgements

This work is partially supported by the National Natural Science Foundation of China (NSFC) under Grants nos. U1404611 and U1604155, in part by the China Postdoctoral Science Foundation under Grant nos. 2015M570028 and 2016T90031, in part by the Program for Science & Technology Innovation Talents in the University of Henan Province under Grants no. 16HASTIT035, and in part by Henan Science and Technology Innovation Project under Grant nos. 164200510007 and 174100510010.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mingchuan Zhang.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, M., Xie, P., Zhu, J. et al. NCPP-based caching and NUR-based resource allocation for information-centric networking. J Ambient Intell Human Comput 10, 1739–1745 (2019). https://doi.org/10.1007/s12652-017-0590-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-017-0590-5

Keywords

Navigation