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

Analysis on caching large content for information centric networking

Published: 21 September 2018 Publication History

Abstract

Increase in the size of content due to the emergence of bandwidthintensive applications leads to a problematic phenomenon, looped replacement, of packet-level caching of information centric networking. This paper analytically investigates how looped replacement occurs. The analyses imply that cache admission is one of countermeasures against looped replacement. Through simulation, we confirm cache admission suppress looped replacement through simulation.

References

[1]
Bengt Ahlgren, Christian Dannewitz, Claudio Imbrenda, Dirk Kutscher, and Börje Ohlman. 2012. A survey of information-centric networking. IEEE Communications Magazine 50 (July 2012), 26--36.
[2]
Ashok Anand, Archit Gupta, Aditya Akella, Srinivasan Seshan, and Scott Shenker. 2008. Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination. In Proceedings of ACM SIGCOMM. 219--230.
[3]
Ashok Anand, Vyas Sekar, and Aditya Akella. 2009. SmartRE: An Architecture for Coordinated Network-wide Redundancy Elimination. In Proceedings of ACM SIGCOMM. 87--98.
[4]
Somaya Arianfar, Pekka Nikander, and Jörg Ott. 2010. Packet-level Caching for Information-centric Networking. Working Paper. Aalto University. 16 pages.
[5]
M Ascigil, Sergi Reñé, George Xylomenos, Ioannis Psaras, and George Pavlou. 2017. A keyword-based ICN-IoT platform. In Proceedings of ACM ICN. 22--28.
[6]
Abdullah Balamash and Marwan Krunz. 2004. An overview of web caching replacement algorithms. IEEE Communications Surveys Tutorials 6, 2 (Second Quarter 2004), 44--56.
[7]
Walter Bellante, Rosa Vilardi, and Dario Rossi. 2013. On Netflix catalog dynamics and caching performance. In Proceedings of IEEE CAMAD. 89--93.
[8]
Hao Che, Ye Tung, and Zhijun Wang. 2002. Hierarchical web caching systems: Modeling, design and experimental results. IEEE Journal on Selected Areas in Communications 20, 7 (Nov. 2002), 1305--1314.
[9]
Kideok Cho, Munyoung Lee, Kunwoo Park, T.T. Kwon, Yanghee Choi, and Sangheon Pack. 2012. WAVE: Popularity-based and collaborative in-network caching for content-oriented networks. In Proceedings of IEEE NOMEN. 316--321.
[10]
Gil Einziger, Roy Friedman, and Ben Manes. 2017. TinyLFU: A highly efficient cache admission policy. ACM Transactions on Storage 13, 4 (Dec. 2017), 35.
[11]
Christine Fricker, Philippe Robert, James Roberts, and Nada Sbihi. 2012. Impact of traffic mix on caching performance in a content-centric network. In Proceedings of IEEE NOMEN. 310--315.
[12]
Van Jacobson, D. K. Smetters, James D. Thornton, Michael Plass, Nick Briggs, and Rebecca L. Braynard. 2009. Networking Named Content. In Proceedings of ACM CoNEXT. 1--12.
[13]
Netflix, Inc. 2015. Internet Connection Speed Recommendations. (2015). Retrieved (March 23, 2018) from https://help.netflix.com/en/node/306/
[14]
Michele Papalini. 2015. Tagnet: A scalable tag-based information-centric network. Ph.D. Dissertation. Università della Svizzera italiana.
[15]
Ioannis Psaras, Wei Koong Chai, and George Pavlou. 2012. Probabilistic In-network Caching for Information-centric Networks. In Proceedings of Workshop on Information-centric Networking. 55--60.
[16]
Ioannis Psaras, Richard G. Clegg, Raul Landa, Wei Koong Chai, and George Pavlou. 2011. Modelling and Evaluation of CCN-Caching Trees. In Proceedings of IFIP Networking. 78--91.
[17]
Junji Takemasa, Yuki Koizumi, and Toru Hasegawa. 2017. Toward an ideal NDN router on a commercial off-the-shelf computer. In Proceedings of ACM ICN. 43--53.
[18]
Junji Takemasa, Kosuke Taniguchi, Yuki Koizumi, and Toru Hasegawa. 2016. Identifying Highly Popular Content Improves Forwarding Speed of NDN Software Router. In Proceedings of IEEE ICNSRA.
[19]
Yannis Thomas, George Xylomenos, Christos Tsilopoulos, and George C Polyzos. 2015. Object-oriented packet caching for ICN. In Proceedings of ACM ICN. 89--98.
[20]
Yoji Yamamoto, Junji Takemasa, Yuki Koizumi, and Toru Hasegawa. 2017. On an impact of large content on packet-level caching of information centric networking. In Proceedings of IEEE ICNP (Poster Paper).
[21]
L. Zhang, A. Afanasyev, J. Burke, V. Jacobson, k. claffy, P. Crowley, C. Papadopoulos, L. Wang, and B. Zhang. 2014. Named Data Networking. ACM SIGCOMM Computer Communication Review 44, 3 (July 2014), 66--73.

Cited By

View all
  • (2022)On cache-aware dynamic adaptive streaming over information-centric networkingProceedings of the 9th ACM Conference on Information-Centric Networking10.1145/3517212.3559491(186-188)Online publication date: 6-Sep-2022
  • (2021)A Two-tiered Caching Scheme for Information-Centric Networks2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR52026.2021.9481839(1-6)Online publication date: 7-Jun-2021
  • (2020)A Packet-level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN NetworksIEEE Access10.1109/ACCESS.2020.3001088(1-1)Online publication date: 2020
  • Show More Cited By

Index Terms

  1. Analysis on caching large content for information centric networking

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      ICN '18: Proceedings of the 5th ACM Conference on Information-Centric Networking
      September 2018
      230 pages
      ISBN:9781450359597
      DOI:10.1145/3267955
      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: 21 September 2018

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. cache
      2. information centric networking
      3. large object

      Qualifiers

      • Research-article

      Conference

      ICN '18
      Sponsor:
      ICN '18: 5th ACM Conference on Information-Centric Networking
      September 21 - 23, 2018
      Massachusetts, Boston

      Acceptance Rates

      ICN '18 Paper Acceptance Rate 17 of 57 submissions, 30%;
      Overall Acceptance Rate 133 of 482 submissions, 28%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)4
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 28 Dec 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2022)On cache-aware dynamic adaptive streaming over information-centric networkingProceedings of the 9th ACM Conference on Information-Centric Networking10.1145/3517212.3559491(186-188)Online publication date: 6-Sep-2022
      • (2021)A Two-tiered Caching Scheme for Information-Centric Networks2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR52026.2021.9481839(1-6)Online publication date: 7-Jun-2021
      • (2020)A Packet-level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN NetworksIEEE Access10.1109/ACCESS.2020.3001088(1-1)Online publication date: 2020
      • (2019)A Cache Placement Strategy with Energy Consumption Optimization in Information-Centric NetworkingFuture Internet10.3390/fi1103006411:3(64)Online publication date: 5-Mar-2019

      View Options

      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