skip to main content
10.1145/2641798.2641837acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
research-article

FGPC: fine-grained popularity-based caching design for content centric networking

Authors Info & Claims
Published:21 September 2014Publication History

ABSTRACT

Content Centric Networking (CCN) is a content name-oriented approach to disseminate content to edge gateways/routers. In CCN, a content is cached at routers for a certain time. When the associated deadline is reached, the content is removed to cope with the limited size of content storage. If the content is popular, the previously queried content can be reused for multiple times to save bandwidth capacity. It is, therefore, critical to design an efficient replacement policy to keep popular content as long as possible. Recently, a novel caching strategy, named Most Popular Content (MPC), was proposed for CCN. It considers the high skewness of content popularity and outperforms existing default caching approaches in CCN such as Least Recently Used (LRU) and Least Frequency Used (LFU). However, MPC has some undesirable features, such as slow convergence of hitting rate and unstable hitting rate performance for various cache sizes. In this paper, a new caching policy, dubbed Fine-Grained Popularity-based Caching (FGPC), is proposed to overcome the above-mentioned weak points. Compared to MPC, FGPC always caches coming content when storage is available. Otherwise, it keeps only most popular content. FGPC achieves higher hitting rate and faster convergence speed than MPC. Based on FGPC, we further propose a Dynamic-FGPC (D-FGPC) approach that regularly adjusts the content popularity threshold. D-FGPC exhibits more stability in the hitting rate performance in comparison to FGPC and that is for various cache sizes and content sizes. The performance of both FGPC and D-FGPC caching policies are evaluated using OPNET Modeler. The obtained simulation results show that FGPC and D-FGPC outperform LRU, LFU, and MPC.

References

  1. V. Jacobson, D. Smetters, J. Thornton, M. Plass, N. Briggs, and R. Braynard, "Networking named content", Communication of the ACM, Vol. 55, No. 1, pp. 117--124, Jan. 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. CCNx protocol. Available: http://www.ccnx.orgGoogle ScholarGoogle Scholar
  3. C. Bernardini, T. Silverston, and O. Festor, "MPC: Popularity-based Caching Strategy for Content Centric Networks", IEEE International Conference onComminication (ICC2013), pp. 2212--2216, Budapest, Hungary, Jun. 2013.Google ScholarGoogle ScholarCross RefCross Ref
  4. OPNET Modeler. Available: www.opnet.comGoogle ScholarGoogle Scholar
  5. M. Chen, "OPNET Network Simulation", Press of Tsinghua University, ISBN 7--302-08232--4, 2004.Google ScholarGoogle Scholar
  6. Named Data Networking. Available: http://www.nameddata.netGoogle ScholarGoogle Scholar
  7. NS-3 based Named Data Networking (NDN) simulator. Available: http://ndnsim.net/index.htmlGoogle ScholarGoogle Scholar
  8. B. Han, X. Wang, T. Kwon, Y. Choi, and N. Choi, "AMVS-NDN : Adaptive Mobile Video Streaming with Offloading and Sharing in Wireless Named Data Networking", IEEE INFOCOM, NOMEN Workshop, Turin, Italy, April, 2013.Google ScholarGoogle Scholar
  9. X. N. Nguyen, D. Saucez, and T. Turletti, "Efficient caching in Content-Centric Networks using OpenFlow", INFOCOM 2013 Workshop Proceedings (2013), pp. 1--2, Feb. 2013.Google ScholarGoogle ScholarCross RefCross Ref
  10. M. Xie, I. Widjaja, and H. Wang, "Enhancing Cache Robustness for Content-Centric Networking", INFOCOM 2013 Workshop Proceedings (2012), pp. 2426--2434, Mar. 2012.Google ScholarGoogle Scholar
  11. Y. Li ,H. Xie, Y. Wen, and Z. Zhang, "Coordinating In-Network Caching in Content-Centric Networks: Model and Analysis", Distributed Computing Systems (ICDCS) 2013, pp. 62--72, Jul. 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Cha, H. Kwak, P. Rodriguez, Y. Ahn, and S.Moon, "Analyzing the Video Popularity Characteristics of Large-Scale User Generated Content Systems", IEEE/ACM Transaction on Networking, Vol. 17, No. 5, pp. 1357--1370, Oct. 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. N. Eisley, L. Peh, and L. Shang, "In-Network Cache Coherence", Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture, pp. 321--332, Dec. 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. I. Psaras, W. K. Chai, and George Pavlou, "Probabilistic In-Network Caching for Information-Centric Networks", ICN '12 Proceedings of the second edition of the ICN workshop on Information-centric networking, pp. 55--60, Aug. 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. T. Taleb, N. Kato, and Y. Nemoto, "Neighbors-Buffering Based Video-on-Demand Architecture", in Signal Processing: Image Communication J., Vol. 18, No. 7, Aug. 2003, pp. 515--526.Google ScholarGoogle ScholarCross RefCross Ref
  16. T. Taleb, Y. Hadjadj-Aoul, and K. Samdanis, "Efficient Solutions for Data Traffic Management in 3GPP Networks", in IEEE Systems J. (to appear)Google ScholarGoogle Scholar
  17. K. Samdanis, T. Taleb, and S. Schmid, "Traffic Offload Enhancements for eUTRAN", in IEEE Communications Surveys & Tutorials J., Vol. 14, No. 3, Third Quarter 2012. pp. 884--896.Google ScholarGoogle Scholar
  18. X. Wang, M. Chen, T. Taleb, A. Ksentini, and V.C.M. Leung, "Cache in the air: exploiting content caching and delivery techniques for 5G systems", in IEEE Communications Magazine, Vol. 52, No. 2, Feb. 2014. pp.131--139Google ScholarGoogle ScholarCross RefCross Ref
  19. G. Li, M. Wang, J. Feng, L. Xu, B. Ramamurthy, W. Li, and X. Guan, "Understanding User Generated Content Characteristics: A Hot-Event Perspective", IEEE Communications Conference (IEEE ICC2011), pp. 1--5, Kyoto, Japan, Jun. 2011.Google ScholarGoogle ScholarCross RefCross Ref
  20. G. Tyson, S. Kauney, S. Miles, Y. El-khatibz, A. Mauthez and A. Taweel, "A Trace-Driven Analysis of Caching in Content-Centric Networks", IEEE Conference on Computer Communications and Networks (ICCCN), Munich, Germani, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  21. A. Ghodsi, T. Koponen, B. Raghavan, S. Shenker, A. Singla and J. Wilcox," Information-Centric Networking: Seeing the Forest for the Trees", Procedure of 10th ACM Workshop Hot Topics in Networks, Nov. 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Li, H. Wu, B. Liu, J. Lu, Y. Wang, X. Wang, Y. Zhang, and L. Dong, "Popularity-driven Coordinated Caching in Named Data Networking", ACM/IEEE symposium on Architectures for networking and communications systems (ANCS), pp. 15--26, Oct. 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Z. Ming, M. Xu, and D. Wangy, "Age-based Cooperative Caching in Information-Centric Networks", IEEE Conference on Computer Communication Workshops (INFOCOM), pp. 268--273, Mar. 2012.Google ScholarGoogle Scholar
  24. D. Rossi, G. Rossini, "Caching performance of content centric networks under multi-path routing (and more)", Telecom ParisTech, Technical report, Paris, France, 2011.Google ScholarGoogle Scholar
  25. D. Rossi, G. Rossini, "A dive into the caching performance of Content Centric Networking", Computer Aided Modeling and Design of Communication Links and Networks(CAMAD), 2012 IEEE 17th International Workshop on, pp.105--109, Sept. 2012.Google ScholarGoogle Scholar

Index Terms

  1. FGPC: fine-grained popularity-based caching design for content centric networking

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      MSWiM '14: Proceedings of the 17th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
      September 2014
      352 pages
      ISBN:9781450330305
      DOI:10.1145/2641798

      Copyright © 2014 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 21 September 2014

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      MSWiM '14 Paper Acceptance Rate32of128submissions,25%Overall Acceptance Rate398of1,577submissions,25%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader