An Optimal Trade-off between Content Freshness and Refresh Cost

Computer Science – Information Retrieval

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Caching is an effective mechanism for reducing bandwidth usage and alleviating server load. However, the use of caching entails a compromise between content freshness and refresh cost. An excessive refresh allows a high degree of content freshness at a greater cost of system resource. Conversely, a deficient refresh inhibits content freshness but saves the cost of resource usages. To address the freshness-cost problem, we formulate the refresh scheduling problem with a generic cost model and use this cost model to determine an optimal refresh frequency that gives the best tradeoff between refresh cost and content freshness. We prove the existence and uniqueness of an optimal refresh frequency under the assumptions that the arrival of content update is Poisson and the age-related cost monotonically increases with decreasing freshness. In addition, we provide an analytic comparison of system performance under fixed refresh scheduling and random refresh scheduling, showing that with the same average refresh frequency two refresh schedulings are mathematically equivalent in terms of the long-run average cost.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An Optimal Trade-off between Content Freshness and Refresh Cost does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Optimal Trade-off between Content Freshness and Refresh Cost, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Optimal Trade-off between Content Freshness and Refresh Cost will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-613667

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.