On Wednesday 05 December 2001 07:15 pm, you wrote:
> On Mon, Dec 03, 2001 at 10:20:03PM -0500, Scott Young wrote:
> > I am willing to work on this after I figure out the internals of Freenet
> > (although the poor documentation is slowing me down).  After I get the
> > Binary Tree DBRs working well, I would then like to work on redundant
> > block matching, although I shouldn't get too far ahead of myself.  I
> > still need to get over the hurdle of understanding the internals though.
>
> If you can get an intelligent binary tree DBR scheme working, I think
> that would be great.  Your scheme sounds reasonable but I bet there will
> be some unexpected difficulties, if prior experience indicates anything ;)

I can see several difficulties already, and after I iron those out some new 
ones usually arrive.  Oh well... that's software develment :)

One unexpected difficulty that I have run into is an addiction to Civ III.  I 
have to boot to linux to do anything besides play the game, which will 
probably help reduce my addiction.

> A desirable thing for a client to do is try to remember the results of
> previous tree traversals so it can avoid making more than one request
> whenever possible.

When a client is requesting multiple values, when one comes in the request 
for all older ones could be dropped.  Since there will already be some in the 
datastore, they will return quickly so older requests than that can be 
dropped.  The only problem then is how long the node should wait for the rest 
of the requests to come in.

> As for your redundant block matching, I don't think any of us really
> understand exactly what you want to accomplish there or how it could
> actually work without breaking other elements of Freenet's design.

It would only break the current design of splitfile indexes.  They would just 
need to be able to point to data within external CHKs.

Actually, on second thought, why don't I just make an "Ideas" page on wiki 
with my redundency matching idea?  That would probably work better than 
writing about it to the mailing list.


Scott Young

_______________________________________________
Devl mailing list
Devl at freenetproject.org
http://lists.freenetproject.org/mailman/listinfo/devl

Reply via email to