Modelling and Evaluation of CCN-Caching Trees
Modelling and Evaluation of CCN-Caching Trees
复制标题
DOI：
10.1007/978-3-642-20757-0_7
复制
发表时间：
2011-05
期刊：
影响因子：
--
通讯作者：
I. Psaras;R. Clegg;R. Landa;W. Chai;G. Pavlou
中科院分区：
文献类型：
--
作者：
I. Psaras;R. Clegg;R. Landa;W. Chai;G. Pavlou
命名内容网络（NNC）是最近提出的一种实现内容中心网络（CCN）的新的网络模式。新的模式改变了当前互联网的许多方面，从安全性和内容命名和解析，到路由器的缓存和新的流模型。在本文中，我们研究了缓存的一部分，建议的网络模式隔离的其余建议的功能。在CCN中，每个路由器都会缓存内容数据包，并在随后请求时重新使用仍在该高速缓存中的数据包。正是CCN的这种缓存功能，我们在本文中建模和评估。我们的建模过程中分析和模拟。最初，我们开发了一个数学模型，为一个单一的路由器，连续时间马尔可夫链的基础上，评估的时间比例的一个给定的一块内容被缓存。通过一些简单的近似，该模型被扩展到多个路由器。数学模型的补充模拟看缓存动态，在数据包级别，从其余的流隔离。
Networking Named Content(NNC) was recently proposed as a new networking paradigm to realiseContent Centric Networks(CCNs). The new paradigm changes much about the current Internet, from security 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, atthe packet-level, in isolation from the rest of the flow.