NCPP-based caching and NUR-based resource allocation for information-centric networking
- 88 Downloads
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.
KeywordsInformation-centric networking Caching Node utilization ratio Node-content pass probability Server hit ratio
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.
Compliance with Ethical Standards
Conflict of interest
The authors declare that there is no conflict of interests regarding the publication of this paper.
- 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
- Dehghan M, Massoulie L, Towsley D, Menasche D, Tay Y (2016) A utility optimization approach to network cache design. In: Proceeding of IEEE INFOCOMGoogle Scholar
- Gharaibeh A, Khreishah A, Khalil I (2016) An O(1)-competitive online caching algorithm for content centric networking. In: Proceedings of IEEE INFOCOMGoogle Scholar
- 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–6Google Scholar
- Jacobson V, Smetters D, Thornton J (2009) Networking named content. In: Proceedings of international conference on emerging NETWORKING experiments and technologies, pp 1–12Google Scholar
- Jokela P, Zahemszky A, Arianfar S, Nikander P (2009) LIPSIN: line speed publish/subscribe inter-networking. In: Proceedings of ACM SIGCOMM, pp 195–206Google Scholar
- Neglia G, Carra D, Michiardi P (2017) Cache policies for linear utility maximization. In: Proceedings of IEEE INFOCOMGoogle 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–60Google 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 networkingGoogle Scholar
- Trossen D (2011) Conceptual architecture: principles, patterns and subcomponents descriptions. http://www.fp7-pursuit.eu/PursuitWeb/. Accessed 21 Jan 2017
- 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