Interest Relevance-Based Caching Design in Content-Centric Networking
Among the existing Content Center Networking (CCN) caching schemes, the most important category is popularity-based schemes which perform better than non-popularity-based in terms of cache-hits. However, these existing popularity-based caching schemes assumed that they provide services for a single type of applications and assumed that content requests (interest) conform to Zipf-like distribution. Although Zipf-like request distribution was validated in many network applications, this distribution may not exist at the node level in CCN when there exist multiple types of upper-level applications in the network. Once the traffic feature of Zipf-like distribution becomes less obvious, the existing popularity-based caching schemes could not work well. Therefore, how to predict the content request (interest) for each node becomes a key problem of caching design.
In this paper, we use the application-level relevance of interest to assist the caching design, rather than just relying on names. We propose a scheme (named as ICDCS) based on interest/content tag analyzing in which multiple types of upper-level applications produced contents/interests and tags is added as a part of name, then a measuring mechanism is designed to count and predict the trend of interest. Our scheme can be well combined with existed approaches and improve their caching performance. Simulations over various system parameters are done to validate the effectiveness and efficiency of ICDCS.
KeywordsTagging system Content centric networking Cache allocation strategy Naming design
This work was supported in part by the Natural Science Foundation of China under Grants 61672092 and 61572066, and in part by the Fundamental Research Funds for the Central Universities of China under Grants 2018JBZ103.
- 1.Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: International Conference on Emerging Networking Experiments and Technologies, pp. 117–124 (2009)Google Scholar
- 4.Fricker, C., Robert, P., Roberts, J., Sbihi, N.: Impact of traffic mix on caching performance in a content-centric network. In: 2012 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 310–315. IEEE (2012)Google Scholar
- 9.Pacifici, V., Dán, G.: Coordinated selfish distributed caching for peering content-centric networks. IEEE/ACM Trans. Netw. 24, 1–12 (2016)Google Scholar
- 11.Wang, S., Bi, J., Wu, J., Vasilakos, A.V.: CPHR: in-network caching for information-centric networking with partitioning and hash-routing. IEEE/ACM Trans. Netw. 24, 1 (2015)Google Scholar
- 12.Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like distributions: evidence and implications. Proc. IEEE INFOCOM 1, 126–134 (1999)Google Scholar
- 13.Gu, Y., Chen, L., Tang, K.M.: A load balancing method under zipf-like requests distribution in DHT-based P2P network systems. In: 2009 International Conference on Web Information Systems and Mining, WISM 2009, pp. 656–660 (2009)Google Scholar
- 15.Afanasyev, A., Moiseenko, I., Zhang, L.: ndnSIM: NDN simulator for NS-3. University of California, Los Angeles, Technical report 4 (2012)Google Scholar
- 16.networking Index, C.V.: Forecast and methodology, 2016–2021, White Paper. San Jose, CA, USA 1 (2016)Google Scholar