On Sizing CCN Content Stores by Exploiting Topological Information
Content Centric Networking (CCN) is a promising architecture to diffuse popular content over the Internet. As opposite to cache devices such as P2P-accelerator or Web proxies, CCN is content-aware but service-agnostic, so that it promises to offer a caching service that could not only relieve now-a-days congestion, but would also apply to any future services or applications as well. In this paper, the authors study the caching performance of Content Centric Networking (CCN), with special emphasis on the size of individual CCN router caches. Specifically, they consider several graph-related centrality metrics (e.g., betweenness, closeness, stress, graph, eccentricity and degree centralities) to allocate content store space heterogeneously across the CCN network, and contrast the performance to that of a homogeneous allocation.