Probabilistic in-network caching for information-centric networks
By Ioannis Psaras, Wei Koong Chai, George Pavlou. Information-Centric Networking, 2012
667 citations recorded by the source corpus.
In-network caching necessitates the transformation of centralised operations of traditional, overlay caching techniques to a decentralised and uncoordinated environment. Given that caching capacity in routers is relatively small in comparison to the amount of forwarded content, a key aspect is balanced distribution of content among the available caches. In this paper, we are concerned with decentralised, real-time distribution of content in router caches. Our goal is to reduce caching redundancy and in turn, make more efficient utilisation of available cache resources along a delivery path. Our in-network caching scheme, called ProbCache, approximates the caching capability of a path and caches contents probabilistically in order to: i) leave caching space for other flows sharing (part of) the same path, and ii) fairly multiplex contents of different flows among caches of a shared path. We compare our algorithm against universal caching and against schemes proposed in the past for Web-Caching architectures, such as Leave Copy Down (LCD). Our results show reduction of up to 20% in server hits, and up to 10% in the number of hops required to hit cached contents, but, most importantly, reduction of cache-evictions by an order of magnitude in comparison to universal caching.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/9984baaba409e5e879b17d533f48a0bdb7aa029d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- George Pavlou
- Vasilios A. Siris
- George C. Polyzos
- Hongbin Luo
- George Xylomenos
- Diliang He
- Ioannis Psaras
- Wei Koong Chai
Citations in the corpus
- Cache "less for more" in information-centric networks (extended version) (2012, methodology): “In our most recent work [30], we design a distributed caching algorithm, which tracks the number of hops that a content travels from source to destination.”
- A Survey of Information-Centric Networking Research (2014, methodology): “Thus, a simplified metric, for which a node needs only to know its 1-hop neighbors and the paths among them, is used [45].”
- A Survey of Caching Mechanisms in Information-Centric Networking (2015, background): “The value of Ttw is defined as the target time window and is set to be 10 in [32].”