| Speaker : | Steve Uhligh |
| Queen Mary University, London | |
| Date: | 19/02/2014 |
| Time: | 2:00 pm - 3:00 pm |
| Location: | LINCS Meeting Room 40 |
Abstract
Content-Centric Networking (CCN) is a promis-ing framework for evolving the current network architecture,advocating ubiquitous in-network caching to enhance contentdelivery. Consequently, in CCN, each router has storage spaceto cache frequently requested content. In this work, we focuson the cache allocation problem: namely, how to distribute thecache capacity across routers under a constrained total storage budget for the network. We formulate this problem as a content placement problem and obtain the exact optimal solution by a two-step method. Through simulations, we use this algorithm to investigate the factors that affect the optimal cache allocation in CCN, such as the network topology and the popularity ofcontent. We find that a highly heterogeneous topology tends toput most of the capacity over a few central nodes. On the otherhand, heterogeneous content popularity has the opposite effect, by spreading capacity across far more nodes. Using our findings, wemake observations on how network operators could best deployCCN caches capacity