| Speaker : | Giuseppe Rossini |
| Telecom ParisTech | |
| Date: | 21/03/2012 |
| Time: | 3:15 pm - 3:30 pm |
| Location: | LINCS Meeting Room 40 |
Abstract
Preview of talk at INFOCOM 2012 and associated workshop.
In this work, we study the caching performance of Content Centric Networking (CCN), with special emphasis on thesize of individual CCN router caches. Specifically, we 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 an homogeneous allocation. To gather relevant results, we study CCN caching performance under large cache sizes (individual content stores of 10 GB), realistic topologies (up to 60 nodes), a YouTube-like Internet catalog (10^8 files for 1PB video data). A thorough simulation campaign allow us to conclude that
- the gain brought bycontent store size heterogeneity is very limited, and that
- the simplest metric, namely degree centrality, already proves to be a sufficiently good allocation criterion.
On the one hand, this implies rather simple rules of thumb forthe content store sizing (e.g., if you add a line card to a CCN router, add some content store space as well). On the other hand, we point out that technological constraints, such as line speed operation requirement, may however limit the applicabilityof degree-based content store allocation.
Joint work with D. Rossi