Content allocation in information-centric networks

The information-centric network (ICN) is a new paradigm shift from the traditional IP-based network architecture. In the ICN architecture, any node can have a storage capacity to store contents. Hence, the content allocation algorithm has been actively studied. However, many researches have proposed heuristic content allocation algorithms without considering the system-wise performance. In this paper, we study a content allocation algorithm to minimize the sum of the average end-to-end service times of client nodes. Numerical results show that the proposed content allocation algorithm significantly decreases the sum of the average end-to-end service times of client nodes.