--- Martin Stone Davis <[EMAIL PROTECTED]> wrote: > Explain how your system works in a network of all new nodes, where all > nodes' estimates of time-delays is initially very bad (since they're > newbies). How does the first query and data retrieval work?
Well they could pretty quickly learn some average time per HTL. If they're so new that they can't do that, they could use 100ms*HTL or something, but it wouldn't matter because if they were that new, they wouldn't have any data in their store worth mentioning. If they haven't yet had time to specialize yet, they won't have to take the key into account, because the adversary wouldn't know what keyspace they'd be good in either. Think of it this way: You could make this kind of worst case delay. Just delay everything some obscene time like 10s*HTL. Never give data back before then. Sure that would be slow as hell, but it would provide for what Newsbyte has suggested. Right? Hmm, wait that would totally make it impossible to figuar out the routing!!! Actually that's another good reason why doing these types of delays is BAD IDEA. As I said earlier this kind of delaying is unnessesary. Private Cache + Premix removes any need to do this. __________________________________________________________________ Gesendet von Yahoo! Mail - http://mail.yahoo.de Logos und Klingelt�ne f�rs Handy bei http://sms.yahoo.de _______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
