Re: speed based replacement instead of LRU based

There are several replacement algorithms that do this. Perhaps the simplest and
most commonly known is the Greedy Duel.

The basic idea is this:
Set the value of new object to fetch time.
When the next object is to be placed in the cache evict the object of least value
AND reduce the value of all objects by the value of that evicted object.
If and object is hit reset it to it's original value.

Here we get a recently/frequency term and a download cost term

I have references to this and other algorithms if you want.

Tim

Miquel van Smoorenburg wrote:

> With the new high-bandwidth access methods like ADSL, and the fact that
> bandwidth is getting cheaper a lot faster than big servers with lots
> of disk space, using a proxy cache doesn't necessarily save bandwidth
> anymore. With lots of high-speed users a small 100 GB cache won't
> have the chance to cache much - objects will be replaced too fast.
>
> Now, I see one other very good reason for using a cache: to minimize
> latency. So it would be a good idea if LRU replacement could be changed
> into FD replacement: Fastest Download. Objects that took a lot of
> time to download stay longer in the cache than nearby objects that
> can be downloaded at max speed anyway. A combination of the two
> would be best, ofcourse.
>
> Has anyone ever done some work on this? It can't be a novel idea.
>
> Mike.
> --
> Cistron Certified Internetwork Expert #1. Think free speech; drink free beer.
> --
> The From: and Reply-To: addresses are internal news2mail gateway addresses.
> Reply to the list or to miquels@cistron.nl (Miquel van Smoorenburg)
Received on Wed Aug 09 2000 - 06:50:29 MDT