Re: Cache Replacement Algorithm

From: Henrik Nordstrom <hno@dont-contact.us>
Date: Sat, 05 Aug 2000 19:08:05 +0200

Eran Balter wrote:

> In order to implement this algorithm, I have to maintain a data-structure
> for bandwidth's and latencie's to the origin servers. Moreover, I have to
> add two fields: bandwidth and latency for each document entry. Before
> getting into implementation, I would like to know if there is something
> similar present at the original Squid source code, or somewhere else on the
> planet :~`

Probably, but not in the Squid sources. The closest in the Squid sources
is the GDSF policy which uses size and reference age.

It should however fit quite nicely as a HEAP based policy in Squid, once
you have found a way to determine the object weights.

--
Henrik Nordstrom
Squid hacker
Received on Sat Aug 05 2000 - 11:35:17 MDT

This archive was generated by hypermail pre-2.1.9 : Tue Dec 09 2003 - 16:54:44 MST