Modeling chunk-based content placement in information centric networking

Content-centric networking (CCN) proposes a content-centric paradigm which changes the waist hourglass from Internet protocol (IP) to content chunk. In this paper, based on content chunks, an optimization model of minimizing the total delay time in information centric networking (ICN) is established, and branch-and-bound method and greedy (BG) algorithm is proposed to get the content placement method. As the multipath is natural supported in CCN, chunk-based content placement can decline delay time obviously, even it would increase the calculation amount which can be solved easily by the node's capacity. Simulation results indicate that the chunk-based content placement scheme is better than the single-based cache policy on the network total delay time, and the best number of each content chunk split is decided by the link density and the number of the nodes in the network.