Design of a Content Replacement Scheme using the p-based LRFU-k algorithm in Contents Delivery Networks

In contents delivery networks (CDNs), the various content replacement schemes have been studied to increase the hit ratio at a surrogate server with limited resources in order to provide contents services of high quality to multiple users. In this paper, we propose a content replacement scheme called the p-based LRFU-k that solves the problems of the existing schemes. A simulated performance comparison between the newly proposed scheme and the existing ones shows that the average content hit ratio at a surrogate server increased by up to 6.5%.