Enhancing the performance of Least Recently Used Policy in the Presence on One-timers using Support Vector Machines.
Out of the many Information Centric Network architectures investigated in the open literature, the content centric networking (CCN) initiative is by far the most popular. CCN advocates a leave copy everywhere (LCE) caching strategy coupled with a least recently used (LRU) replacement policy. However, an LRU replacement strategy is not well suited as well for handling the presence of one‐timer objects in the cache as one‐timers can cause the eviction of many popular objects from the cache. Therefore, the main objective behind this undergraduate research activity is to propose and assess the namely the support vector machines one. Report in pdf