Applying Multi-Armed Bandit Problem into Cache Decision Algorithm for Content Centric Networking

Among the future Internet architecture, Content Centric Networking (CCN) is one of the most promising network architectures, where Content Routers (CRs) are attached with the cache space to store the contents temporary and CRs provide the contents to users from their cache. The original caching scheme stores every arriving contents and that manner leads to the fast cache replacement. So, the popular contents are replaced with non-popular contents. Thus, we proposed a cache decision algorithm, which stores only popular contents and also prevents the replacing of popular contents with non-popular contents. We have intensively simulated the proposed mechanism in a chunk level simulator and the performance is compared with existing schemes. The simulation results show that the proposed mechanism outperforms the existing state-of-the-art schemes.