On Monday 03 November 2003 08:46 pm, Toad wrote:
> > How can the next to last node in the chain know how long the message took
> > to get to it? Doesn't it just estimate how long it would take to get it
> > successfully.
>
> Uhm, what? The calculation assumes that if the request fails, the origin
> node will retry, and the retry will take the time that a typical success
> would take.

I assume that this is coming form a global estimate comming form other nodes 
and across keyspace. That makes much more since. However my original comment 
was really irreverent to the point I was making.

So what are the prospects or difficulties of implementing the things I 
propose?

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

Reply via email to