Information-Centric Networking is (ICN) [1] gaining increasingly concerns, as an important direction of the Future Internet Architecture research. Although In-network caching is considered as one of the most significant properties of ICN, the cache policy for ICN is still little explored. In this paper, we formulate the in-network caching problem of ICN into Mixed-Integer Linear Programming problem. We also propose a novel cache policy named LB (Least Benefit) with taking into account the distance factor and a new forwarding scheme with shallow flooding (FSF for short) to improve the performance further,. Our simulation results show that with in-networking caching, the average hops of the ICN network can be reduced significantly by nearly 50% with simple cache policy like LFU and with some simple improvement such as LB and FSF the average hop can be reduced further.
['Sen Wang', 'Jun Bi', 'Jianping Wu', 'Zhaogeng Li', 'Wei Zhang', 'Xu Yang']
Could in-network caching benefit information-centric networking?