On Thu, Nov 4, 2010 at 2:09 PM, Robert Hailey <rob...@freenetproject.org>wrote:
> As best I can see, then, there may be major problems with the current > announcement and path folding implementations: > (1) announcements gather at non-destination points (in fact, shallow > first), > (2) the RequestSender logic will always eat an incoming path folding > request if we want a peer (often for very short paths), > (3) the RequestHandler logic will probabilistically drop an incoming path > folding request (about once every HTL) > (4) if path folding request is dropped (or not wanted), an intermediate > node might forward it's reference instead > > I think the behavior of 2, 3, & 4 are more likely to be making the > peer-clumps, which (as you said) might not be a horrible thing. But I think > all of these points go against the original intent of destination sampling. > > I think the behavior of 1 (this patch) is forming a specialized "backbone" > of routability around the seed nodes. This looks interesting, is there a way we can test your hypotheses in a controlled way? Ian. -- Ian Clarke CEO, SenseArray Email: i...@sensearray.com Ph: +1 512 422 3588
_______________________________________________ Devl mailing list Devl@freenetproject.org http://freenetproject.org/cgi-bin/mailman/listinfo/devl
