Modelling and Evaluation of CCN-Caching Trees

Paper type: 
Conference paper
Ioannis Psaras, Richard G. Clegg, Raul Landa, Wei Koong Chai and George Pavlou
Networking 2011, Lecture Notes in Computer Science (6640) , 2011
Abstract: 
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Internet, from secu- rity and content naming and resolution, to caching at routers, and new flow models. In this paper, we study the caching part of the proposed networking paradigm in isolation from the rest of the suggested features. In CCNs, every router caches packets of content and reuses those that are still in the cache, when subsequently requested. It is this caching feature of CCNs that we model and evaluate in this paper. Our modelling proceeds both analytically and by simulation. Initially, we develop a mathematical model for a single router, based on continuous time Markov-chains, which assesses the proportion of time a given piece of content is cached. This model is extended to multiple routers with some simple approximations. The mathematical model is complemented by simulations which look at the caching dynamics, at the packet-level, in isolation from the rest of the flow.
Description: 
This paper creates a simple mathematical model based on Markov chains which can model (with some simple assumptions) the type of cacheing trees seen in content centric networking. The model is tested with some simulation results.
Preprint: 
bibtex: 
@incollection{ccn_networking_2011,
year={2011},
booktitle={NETWORKING 2011},
volume={6640},
series={Lecture Notes in Computer Science},
editor={Domingo-Pascual, Jordi and Manzoni, Pietro and Palazzo, Sergio and Pont, Ana and Scoglio, Caterina},
title={Modelling and Evaluation of CCN-Caching Trees},
publisher={Springer Berlin Heidelberg},
author={Psaras, Ioannis and Clegg, RichardG. and Landa, Raul and Chai, WeiKoong and Pavlou, George},
pages={78--91}
}
doi: 
doi://10.1007/978-3-642-20757-0_7