On Thu, Jul 24, 2003 at 07:39:20PM -0400, Scott Young wrote: > There has been a lot of talk lately about algorithms to make routing > better. What about also using a better algorithm for deciding which > content to keep on a node, instead of the simple LRU cache? The new > algorithm would determine the key least likely to be requested again, > and that key is the next one that gets deleted. With this algorithm > being improved, data retention across the network should also improve.
Good question, although it is hard to think of an improvement upon the current approach, which is to assume that the least-recently-accessed key is the key least likely to be requested again. Ian. -- Ian Clarke [EMAIL PROTECTED] Coordinator, The Freenet Project http://freenetproject.org/ Founder, Locutus http://locut.us/ Personal Homepage http://locut.us/ian/
pgp00000.pgp
Description: PGP signature
