if you plan on publishing a paper or something on NGRouting it may be a good idea to investigate further into what kind of behavior does the graph keyspace vs. time evolves. I'm very interested in studying which method of estimating response time is best mathematically because it may unveil some unknown facts about freenet routing in general.
This brings us back to the phone discussion we had some months ago about how to collect reasonable data. This time around we'll need a different set of measurements, and since one of them will be exact sampling data of requested keys we cannot assure any privacy for the testers. So, could we adapt the watchme functionality to report that and enable it by default in experimental? If NGRouting is hyped enough at the right places we'll find plenty of people willing to test it. The problems of the watchme network (i.e. unrealistic usage patterns) do not really affect us this time, as all we're measuring is key response times.
My guess/working hypothesis: during the initial stage while the node is getting to know the network, we'll be better off interpolating a periodic function; for heavily specialized nodes, even if they have multiple specializations we'd be more efficient to use one (or perhaps two or more independent) polynomial interpolations.
_______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
