--- Newsbyte <[EMAIL PROTECTED]> wrote: > As for the question at hand; I'm no coder, but as far as I've understood, there is > an estimator > of how much time it would cost to retrieve something from a node(?) > > Can't you make something that > > 1)checks if the requested item is in it's store > 2)if not, send it to the next node (and follow the normal way) > 3.a)if yes, estimate how long it would take to get it from another node > 3.b)Send the data back in the timeframe it has estimated it would take if it came > from another > node (maybe add a bit randomn time to it too?) > > Something like that?
Yes you can do a "worst senerio" delay. Where based on the HTL of the request it always takes a certain amount of time. Implementation A: Make an array per HTL storing a moving average of delay for requests that where forwarded on with that HTL. If you find something in your store, but the request was with HTL 13, you look it up and delay 637ms. Implementation B: Same as A, but store a standard deviation too and randomly +- a bit based on that. That way there won't be a couple things that all come back exactly on the average. Implementation C: Use NGR on yourself per each HTL. That way specailization is accounted for so the advesary won't be able to notice an atypical delay for something inside vs. outside your specialization. Though doing something like this would be possible, I don't advise it. 1) Things are slow enough, without delay 2) The premix + private cache solution should eliminate the need for this 3) It's a bunch of work, especially C 4) I'm not sure C is even nice enough to resist all statistical attacks. __________________________________________________________________ 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
