On Thu, Sep 04, 2003 at 03:07:55PM +0200, Benny Amorsen wrote:
> (This is a slightly changed retransmission)
> 
> When a freenet node hits overloadLow, it starts rejecting requests. It
> will reject anything that doesn't fit 
> ((ft.contains(searchKey) || ds.contains(searchKey)).
> 
> This is a rather rough approach. Instead I have decided to be gentler,
> and give requests another chance. When load hits overloadLow (which I
> have personally set low, at 0.5), requests that do not fit the above
> expression still have a chance to get through; a high chance if the load
> is just over overloadLow, and a low chance if load is close to
> overloadHigh.

We did this before. It was reverted for some reason...
> 
> Once load passes overloadHigh, requests that do not fit the above
> expression are simply rejected. The rest still have a chance, unless
> load becomes 1 (which, alas, happens much too often). Again the chance
> gets smaller as load increases.
> 
> In theory this kinder, gentler approach should lead to a smoother
> performance with fewer load spikes, as well as world peace. The code is
> attached, sf CVS is still broken.
> 
> A test jar for the curious is available at
> http://amorsen.dk/freenet-probabilistic-4.jar
> 
> The jar includes modifications to NewRequest.java, to make rejection
> easier and more efficient. (In freenet, rejection is hardest on the one
> doing the rejecting...)
> 
> A patch to build 6162 is attached.
> 
> 
> /Benny
> 
-- 
Matthew J Toseland - [EMAIL PROTECTED]
Freenet Project Official Codemonkey - http://freenetproject.org/
ICTHUS - Nothing is impossible. Our Boss says so.

Attachment: pgp00000.pgp
Description: PGP signature

_______________________________________________
Devl mailing list
[EMAIL PROTECTED]
http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl

Reply via email to