Non-uniform EWMA-PCA based cache size allocation scheme in Named Data Networks

Research Paper

Abstract

As a data-centric cache-enabled architecture, Named Data Networking (NDN) is considered to be an appropriate alternative to the current host-centric IP-based Internet infrastructure. Leveraging in- network caching, name-based routing, and receiver-driven sessions, NDN can greatly enhance the way Internet resources are being used. A critical issue in NDN is the procedure of cache allocation and management. Our main contribution in this research is the analysis of memory requirements to allocate suitable Content-Store size to NDN routers, with respect to combined impacts of long-term centrality-based metric and Exponential Weighted Moving Average (EWMA) of short-term parameters such as users behaviours and outgoing traffic. To determine correlations in such large data sets, data mining methods can prove valuable to researchers. In this paper, we apply a data-fusion approach, namely Principal Component Analysis (PCA), to discover relations from short- and long-term parameters of the router. The output of PCA, exploited to mine out raw data sets, is used to allocate a proper cache size to the router. Evaluation results show an increase in the hit ratio of Content-Stores in sources, and NDN routers. Moreover, for the proposed cache size allocation scheme, the number of unsatisfied and pending Interests in NDN routers is smaller than the Degree-Centrality cache size scheme.

Keywords

content centric networks Named Data Networks future Internet NDN cache size exponential weighted moving average principal component analysis 

Notes

Acknowledgements

The authors would like to thank Fereshte Dehghani and Elahe Hadi for their suggestions and feedbacks.

References

  1. 1.
    Cisco Systems, Inc.. The zettabyte era: trends and analysis. White Paper, 2015Google Scholar
  2. 2.
    Passarella A. A survey on content-centric technologies for the current Internet: CDN and P2P solutions. Comput Commun, 2012, 35: 1–32CrossRefGoogle Scholar
  3. 3.
    Kurose J. Information-centric networking: the evolution from circuits to packets to content. Comput Netw, 2014, 66: 112–120CrossRefGoogle Scholar
  4. 4.
    Kutscher D, Eum S, Pentikousis K, et al. Information-centric networking (ICN) research challenges. RFC 7927, 2016. http://www.rfc-editor.org/info/rfc7927Google Scholar
  5. 5.
    Palo Alto Research Center. PARC’s open-source implementation of content-centric networking, CCNx. http://www. ccnx.org/Google Scholar
  6. 6.
    Zhang L X, Afanasyev A, Burke J, et al. Named data networking. ACM SIGCOMM Comput Commun Rev, 2014, 44: 66–73CrossRefGoogle Scholar
  7. 7.
    Perino D, Varvello M. A reality check for content centric networking. In: Proceedings of the ACM SIGCOMMWorkshop on Information-centric Networking, Toronto, 2011. 44–49Google Scholar
  8. 8.
    Rossi D, Rossini G. On sizing CCN content stores by exploiting topological information. In: Proceedings of IEEE Conference on Computer Communications Workshops, Orlando, 2012. 280–285Google Scholar
  9. 9.
    Psaras I, Chai W K, Pavlou G. In-network cache management and resource allocation for information-centric networks. IEEE Trans Parall Distrib Syst, 2014, 25: 2920–2931CrossRefGoogle Scholar
  10. 10.
    Araldo A, Rossi D, Martignon F. Cost-aware caching: Caching more (costly items) for less (ISPs operational expendi-tures). IEEE Trans Parall Distrib Syst, 2016, 27: 1316–1330CrossRefGoogle Scholar
  11. 11.
    Xu Y M, Li Y, Lin T, et al. A novel cache size optimization scheme based on manifold learning in content centric networking. J Netw Comput Appl, 2014, 37: 273–281CrossRefGoogle Scholar
  12. 12.
    Xu Y M, Li Y, Lin T, et al. An adaptive per-application storage management scheme based on manifold learning in information centric networks. Future Gener Comput Syst, 2014, 36: 170–179CrossRefGoogle Scholar
  13. 13.
    Cui X D, Liu J, Huang T, et al. A novel metric for cache size allocation scheme in Content Centric Networking. In: Proceedings of National Doctoral Academic Forum on Information and Communications Technology, Beijing, 2013. 1–6Google Scholar
  14. 14.
    Laszlo M, Mukherjee S. A genetic algorithm that exchanges neighboring centers for k-means clustering. Pattern Recogn Lett, 2007, 28: 2359–2366CrossRefGoogle Scholar
  15. 15.
    Abdi H, Williams L. Principal component analysis. Wiley Interdisciplin Rev: Comput Stat, 2010, 2: 433–459CrossRefGoogle Scholar
  16. 16.
    Brandes U. On variants of shortest-path betweenness centrality and their generic computation. Social Netw, 2008, 30: 136–145CrossRefGoogle Scholar
  17. 17.
    Chai W K, He D L, Psaras I, et al. Cache “less for more” in information-centric networks (extended version). Comput Commun, 2013, 36: 758–770CrossRefGoogle Scholar
  18. 18.
    Steiner S H. Exponentially weighted moving average control charts with time-varying control limits and fast initial response. J Qual Technol, 1999, 31: 75–86Google Scholar
  19. 19.
    Raol J R. Multi-Sensor Data Fusion with MATLAB. Boca Raton: CRC Press, Taylor & Francis Group, 2009. 380–385CrossRefGoogle Scholar
  20. 20.
    Afanasyev A, Moiseenko I, Zhang L. ndnSIM: NDN simulator for NS-3. University of California, Los Angeles, Technical Report, 2012Google Scholar
  21. 21.
    Rossini G, Rossi D. ccnSim: a highly scalable CCN simulator. In: Proceedings of IEEE International Conference on Communications, Budapest, 2013. 2309–2314Google Scholar
  22. 22.
    Saino L, Psaras I, Pavlou G. Icarus: a caching simulator for information centric networking (ICN). In: Proceedings of the 7th International ICST Conference on Simulation Tools and Techniques, Lisbon, 2014. 66–75Google Scholar
  23. 23.
    Ahlgren B, Dannewitz C, Imbrenda C, et al. A survey of information-centric networking. IEEE Commun Mag, 2012, 50: 26–36CrossRefGoogle Scholar
  24. 24.
    Abilene Core Topology. https://uit.stanford.edu/service/network/internet2/abileneGoogle Scholar
  25. 25.
    Eftekhari S, Ghahfarokhi B S, Moghim N. Otanes: a live TV simulator for Content-Centric Networking. In: Proceedings of the 7th IEEE International Conference on Information and Knowledge Technology, Urmia, 2015. 1–6Google Scholar
  26. 26.
    Yi C, Afanasyev A, Moiseenko I, et al. A case for stateful forwarding plane. Comput Commun, 2013, 36: 779–791CrossRefGoogle Scholar
  27. 27.
    Psaras I, Clegg R G, Landa R, et al. Modelling and evaluation of CCN-caching trees. In: Proceedings of the 10th International Conference on IFIP Networking, Valencia, 2011. 78–91Google Scholar
  28. 28.
    Rossi D, Rossini G. Caching performance of content centric networks under multi-path routing (and more). Technical Report, Telecom ParisTech, 2011Google Scholar
  29. 29.
    Saleh O, Hefeeda M. Modeling and caching of peer-to-peer traffic. In: Proceedings of the 14th IEEE International Conference on Network Protocols (ICNP’06), Santa Barbara, 2006CrossRefGoogle Scholar
  30. 30.
    Tortelli M, Grieco L A, Boggia G. Performance assessment of routing strategies in Named Data Networking. In: Pro-ceedings of GTTI Session on Telecommunication Network, 2013Google Scholar
  31. 31.
    Luo Y Q, Eymann J, Timm-Giel A. Mobility support for content centric networking. Telecommun Syst, 2015, 59: 271–288CrossRefGoogle Scholar
  32. 32.
    Halko N, Martinsson P G, Tropp J A. Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev, 2011, 53: 217–288MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Science China Press and Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.Department of Computer Architecture, Faculty of Computer EngineeringUniversity of IsfahanIsfahanIran

Personalised recommendations