Probabilistic in-network caching for information-centric networks

In-network caching necessitates the transformation of cen-tralised operations of traditional, overlay caching techniques to a decentralised and uncoordinated environment. Given that caching capacity in routers is relatively small in com-parison 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 utili-sation of available cache resources along a delivery path. Our in-network caching scheme, called ProbCache, ap-proximates the caching capability of a path and caches con-tents 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 ar-chitectures, 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