-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Sorry, deleted the context, but re: adding in connection speed and
closeness...
The reliability factor would only be useful for screening a list of
nodes. We can make closeness a separate factor, and add it to the
function that determines if a randomly selected node is 'fit'. If not,
select another. Or you can treat each factor as a sort of filter. Filter
the nodes based on closeness, then sort on reliability, then connection
speed.
We can define connection speed as the time it takes to complete a
transaction divided by the amount of data exchanged. This might be an
oversimplification, but it would generate a usable number for sorting. We
don't want to completely ignore low-bandwidth nodes, though. They might
have useful information....
So, in summary:
1) Use closeness as a filter, generate set A
2) Tournament select X nodes out of A based on reliability
3) Sort set X by the efficiency factor
4) Try the node at the top of X
Scott
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.1 (GNU/Linux)
Comment: For info see http://www.gnupg.org
iD8DBQE49PdCpXyM95IyRhURAluHAJ9o6Z+vLT3nAN7yPGLCrC21S6dkQACfSdLc
30ZtV24wh+84V/Clhz2Isc0=
=8b59
-----END PGP SIGNATURE-----
_______________________________________________
Freenet-dev mailing list
Freenet-dev at lists.sourceforge.net
http://lists.sourceforge.net/mailman/listinfo/freenet-dev
