Efficient cache availability management in Information-Centric Networks
TL;DR: In this article, the authors proposed a distributed architecture to efficiently use the network-wide cache storage space based on distributed caching, which achieves cache retention efficiency by means of controlled traffic redirection and selective caching.
read more
About: This article is published in Computer Networks. The article was published on 19 Jun 2015. and is currently open access. The article focuses on the topics: Smart Cache & Cache invalidation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A functional taxonomy of caching schemes: Towards guided designs in information-centric networks
TL;DR: A functional-based taxonomy of ICN caching schemes is presented, detailing each functional component, and depicting the functional mandates of these schemes to aid in contrasting their operations, coupled with a comprehensive benchmark for future caching schemes, and quantitative as well as qualitative analysis of leading caching schemes.
27
Content-Centric Networking Management Based on Software Defined Networks: Survey
Rihab Jmal,Lamia Chaari Fourati +1 more
TL;DR: This survey introduces a thorough description of CCN mechanisms as well as their related studies, and analyzes some of the most prominent approaches combining the CCN and the OpenFlow.
25
On Cooperative On-Path and Off-Path Caching Policy for Information Centric Networks (ICN)
Hemant Kumar Rath,Bighnaraj Panigrahi,Anantha Simha +2 more
- 01 Mar 2016
TL;DR: This work has proposed a co-operative caching policy in which the edge routers or on-path routers optimally store the requested ICN contents and are supported by a strategically placed central off-path cache router for additional level of caching.
23
Spatially-Dispersed Caching in Information-Centric Networking
Noriaki Kamiyama,Masayuki Murata +1 more
- 01 May 2018
TL;DR: SDC is proposed, which is a caching strategy dispersing content by assigning a binary ID to each router and limiting the cache targets at each router to content with names whose hash value coincides with the router ID.
12
C3CPS: CRITIC-CoCoSo-based caching placement strategy using multi-criteria decision method for efficient content distribution in Named Data Networking
TL;DR: This paper introduces C3CPS, a novel caching placement strategy for Named Data Networking, using multi-criteria decision-making with CoCoSo and CRITIC methods to optimize cache node selection, improving content distribution efficiency and outperforming alternative caching techniques.
11
References
•Posted Content
A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems
Raj Jain,Dah Ming Chiu,W. Hawe +2 more
TL;DR: A quantitative measure called Indiex of FRairness, applicable to any resource sharing or allocation problem, which is independent of the amount of the resource, and boundedness aids intuitive understanding of the fairness index.
4.9K
Networking named content
Van L. Jacobson,Diana K. Smetters,James D. Thornton,Michael F. Plass,Nicholas H. Briggs,R. Braynard +5 more
- 01 Dec 2009
TL;DR: Content-Centric Networking (CCN) is presented, which treats content as a primitive - decoupling location from identity, security and access, and retrieving content by name, using new approaches to routing named content.
Networking named content
Van L. Jacobson,Diana K. Smetters,James D. Thornton,Michael F. Plass,Nicholas H. Briggs,R. Braynard +5 more
TL;DR: Content-Centric Networking (CCN) is presented which uses content chunks as a primitive---decoupling location from identity, security and access, and retrieving chunks of content by name, and simultaneously achieves scalability, security, and performance.
3.9K
Routing of multipoint connections
TL;DR: In this article, a weighted greedy algorithm is proposed for a version of the dynamic Steiner tree problem, which allows endpoints to come and go during the life of a connection.
3.1K
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
David R. Karger,Eric Lehman,Tom Leighton,Rina Panigrahy,Matthew S. Levine,Daniel M. Lewin +5 more
- 04 May 1997
TL;DR: A family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network, based on a special kind of hashing that is called consistent hashing.