On the throughput capacity of information-centric networks

Abstract—Information-centric networks make storage one of the network primitives, and propose to cache data within the network in order to improve latency to access content and reduce bandwidth consumption. We study the throughput capacity of an information-centric network when the data cached in each node has a limited lifetime. The results show that with some fixed request and cache expiration rates the network can have the maximum throughput order of 1/ n and 1 / logn in case of grid and random networks, respectively. Comparing these values with the corresponding throughput with no cache capability (1/n an