By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hee Jin Roh ; Sungkyunkwan Univ., Suwon ; Younwoo Kim ; Kwang Sun Ko ; Young Ik Eom

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%.

Published in:

Advanced Communication Technology, 2008. ICACT 2008. 10th International Conference on  (Volume:3 )

Date of Conference:

17-20 Feb. 2008