On sizing CCN content stores by exploiting topological information
In this work, we study the caching performance of Content Centric Networking (CCN), with special emphasis on the size of individual CCN router caches. Specifically, we consider several graph-related centrality metrics (e.g., betweenness, closeness, stress, graph, eccentricity and degree centralities...
Saved in:
Published in | 2012 Proceedings IEEE INFOCOM Workshops pp. 280 - 285 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.03.2012
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this work, we study the caching performance of Content Centric Networking (CCN), with special emphasis on the size 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. |
---|---|
ISBN: | 1467310166 9781467310161 |
DOI: | 10.1109/INFCOMW.2012.6193506 |