With NGrouting nodes that are closer together on the underlying network, are (somewhat) more likely to connect to each other than the previously totally random connections.
Nodes can maintain connections that are usefull to them, because their specialization is close to their own. This could ether be done by estimating the what the contribute to the overall routing time, biased on the incoming connections, and/or simply dropping the least recently used connection. That is all well and good, however it does not give us any way of insuring that nodes that have a fast connection to each other on the underlying network will be any more likely to share a similar specialization. I can think of several hacks that could help, IE: making the first 20 bits of a brand new node's specialization the same as the first 20 bits of it's IP address. However is their any way we can do this with an algorithm without compromising anonymity? _______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
