Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2396556.2396561acmconferencesArticle/Chapter ViewAbstractPublication PagesancsConference Proceedingsconference-collections
research-article

Popularity-driven coordinated caching in named data networking

Published: 29 October 2012 Publication History
  • Get Citation Alerts
  • Abstract

    The built-in caching capability of future Named Data Networking (NDN) promises to enable effective content distribution at a global scale without requiring special infrastructure. The aim of this work is to design efficient caching schemes in NDN to achieve better performance at both the network layer and application layer. With the specific objective of minimizing the inter-ISP (Internet Service Provider) traffic and average access latency, we first formulate the optimization problems for different objectives and then solve them to obtain the optimal replica placement. Then we develop popularity-driven caching schemes which dynamically place the replicas in the caches on the en-route path in a coordination fashion. Simulation results show that the performances of our caching algorithms are much closer to the optimum and outperform the widely used schemes in terms of the inter-ISP traffic and the average number of access hops. Finally, we thoroughly evaluate the impact of several important design issues such as network topology, cache size, access pattern and content popularity on the caching performance and demonstrate that the proposed schemes are effective, stable, scalable and with reasonably light overhead.

    References

    [1]
    Jacobson, V., Smetters, D. K., and Thornton, J. D. et al., "Networking named content", Proceedings of the 5th international conference on Emerging networking experiments and technologies, ACM, 2009, pp.1--12.
    [2]
    Hefeeda, M. and Noorizadeh, B., "On the Benefits of Cooperative Proxy Caching for Peer-to-Peer Traffic," Parallel and Distributed Systems, IEEE Transactions on, vol. 21, no. 7, pp.998--1010, 2010.
    [3]
    Rodriguez, P., Spanner, C., and Biersack, E. W., "Analysis of web caching architectures: hierarchical and distributed caching," Networking, IEEE/ACM Transactions on, vol. 9, no. 4, pp.404--418, 2001.
    [4]
    Hefeeda, M., Hsu, C. H., and Mokhtarian, K., "Design and Evaluation of a Proxy Cache for Peer to Peer Traffic," IEEE Transactions on Computers, vol. 60, no.7, pp.964--977, 2011.
    [5]
    Pallis, G. and Vakali, A., "Insight and perspectives for content delivery networks," Communications of the ACM, vol. 49, no. 1, pp.101--106, 2006.
    [6]
    Bhattacharjee, S., Calvert, K. L., and Zegura, E. W., "Self-organizing wide-area network caches", Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom'98), pp.600--608, 1998.
    [7]
    Lijun Dong, Dan Zhang, Yanyong Zhang, and Dipankar Raychaudhuri, "Optimal Caching with Content Broadcast in Cache-and-Forward Networks", ICC' 2011, 2011.
    [8]
    Walter Wong, Marcus Giraldi, Mauricio F.Magalhaes, and Jussi Kangasharj, "Content Routers: Fetching Data on Network Path", ICC'2011, pp.1--6, 2011.
    [9]
    D.Rossi and G.Rossini, "Caching performance of content centric networks under multi-path routing (and more)," Telecom ParisTech, Technical Report, 2011.
    [10]
    Psaras, I., Clegg, R., Landa, R., Chai, W., and Pavlou, G., "Modelling and Evaluation of CCN-Caching Trees," NETWORKING 2011, pp.78--91, 2011.
    [11]
    Cho, K., Lee, M., Park, K., Kwon, T. T., Choi, Y., and Pack, S., "WAVE: Popularity-based and Collaborative In-network Caching for Content-Oriented Networks", Infocom'2012 workshops, pp.316--321, 2012.
    [12]
    Schwartz, Y., Shavitt, Y., and Weinsberg, U., "A measurement study of the origins of end-to-end delay variations", Passive and Active Measurement, Lecture notes in Computer Science, vol. 6032/2010, pp.21--30, 2010.
    [13]
    P.V.Mieghem, "Performance analysis of communications networks and systems",Cambridge Univ. Press, 2006, pp.358.
    [14]
    "GLPK: GNU Linear Programming Kit," http://www.gnu.org/s/glpk/, 2012.
    [15]
    Calvert, K. I., Doar, M. B., and Zegura, E. W., "Modeling internet topology," Communications Magazine, IEEE, vol. 35, no. 6, pp.160--163, 1997.
    [16]
    Hefeeda, M. and Saleh, O., "Traffic modeling and proportional partial caching for peer-to-peer systems," IEEE/ACM Transactions on Networking (TON), vol. 16, no. 6, pp.1447--1460, 2008.
    [17]
    Laoutaris, N., Syntila, S., and Stavrakakis, I., "Meta algorithms for hierarchical web caches", IEEE International Conference on Performance, Computing and Communications, pp. 445--452, 2004.

    Cited By

    View all
    • (2023)LBCC: A Load Balanced Collaborative Caching in Content Based Networking2023 IEEE 14th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)10.1109/UEMCON59035.2023.10316034(655-662)Online publication date: 12-Oct-2023
    • (2023)The Doctrine of MEAN: Realizing Deduplication Storage at Unreliable EdgeIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.330546034:10(2811-2826)Online publication date: Oct-2023
    • (2023)When Deduplication Meets Migration: An Efficient and Adaptive Strategy in Distributed Storage SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.329930934:10(2749-2766)Online publication date: Oct-2023
    • Show More Cited By

    Index Terms

    1. Popularity-driven coordinated caching in named data networking

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      ANCS '12: Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
      October 2012
      270 pages
      ISBN:9781450316859
      DOI:10.1145/2396556
      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]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 29 October 2012

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. coordinated caching
      2. dynamic caching
      3. modeling
      4. named data networking
      5. popularity-based

      Qualifiers

      • Research-article

      Conference

      ANCS '12

      Acceptance Rates

      Overall Acceptance Rate 88 of 314 submissions, 28%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)31
      • Downloads (Last 6 weeks)9
      Reflects downloads up to 26 Jul 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2023)LBCC: A Load Balanced Collaborative Caching in Content Based Networking2023 IEEE 14th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)10.1109/UEMCON59035.2023.10316034(655-662)Online publication date: 12-Oct-2023
      • (2023)The Doctrine of MEAN: Realizing Deduplication Storage at Unreliable EdgeIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.330546034:10(2811-2826)Online publication date: Oct-2023
      • (2023)When Deduplication Meets Migration: An Efficient and Adaptive Strategy in Distributed Storage SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.329930934:10(2749-2766)Online publication date: Oct-2023
      • (2023)Popularity-Based Data Placement With Load Balancing in Edge ComputingIEEE Transactions on Cloud Computing10.1109/TCC.2021.309646711:1(397-411)Online publication date: 1-Jan-2023
      • (2023)C3CPS: CRITIC-CoCoSo-based caching placement strategy using multi-criteria decision method for efficient content distribution in Named Data NetworkingJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2023.10171435:9(101714)Online publication date: Oct-2023
      • (2023)Effective Communication in NDN via Transient Popular Content Caching at EdgeMobile Radio Communications and 5G Networks10.1007/978-981-19-7982-8_6(63-69)Online publication date: 15-Feb-2023
      • (2022)Popularity-Aware Closeness Based Caching in NDN Edge NetworksSensors10.3390/s2209346022:9(3460)Online publication date: 2-May-2022
      • (2022)An Efficient Distributed Content Store-Based Caching Policy for Information-Centric NetworkingSensors10.3390/s2204157722:4(1577)Online publication date: 17-Feb-2022
      • (2022)An Energy Reward-Based Caching Mechanism for Information-Centric Internet of ThingsSensors10.3390/s2203074322:3(743)Online publication date: 19-Jan-2022
      • (2022)NDN Content Store and Caching Policies: Performance EvaluationComputers10.3390/computers1103003711:3(37)Online publication date: 4-Mar-2022
      • Show More Cited By

      View Options

      Get Access

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media