-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
> even measure speed of connections to particular nodes on-the-fly as we
> retrieve data from, or send data to, those nodes. Perhaps a hashtable
> mapping node addresses to data through-put rates, although we shouldn't
> forget to remove data about nodes we no-longer reference. Nodes we
> don't know anything about should be assumed to have an average
> through-put. As for reliability, that is not an issue with a
> one-strike-your-out policy, and I think locality is probably irrelevant
> provided we are measuring throughput.
We *need* to have a peer-node class that contains all of this information,
so that disconnecting, removing this data, or sorting on one of these
fields is clean and elegant.
I also suggest something like a pluggable "SelectionStrategy" interface,
which when given a collection of these peer classes, returns a list of
nodes to try. That list can replace the old peer-node list, so the
SelectionStrategy can prune 'dead' nodes as it sees fit.
Scott
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.1 (GNU/Linux)
Comment: For info see http://www.gnupg.org
iD8DBQE4+hmWpXyM95IyRhURAiicAKCBAm+j/kNuFj2BeA2xeriztCiXMQCfeO/X
U2Afn1ibJuz5i2ExTuaSh2E=
=EZeQ
-----END PGP SIGNATURE-----
_______________________________________________
Freenet-dev mailing list
Freenet-dev at lists.sourceforge.net
http://lists.sourceforge.net/mailman/listinfo/freenet-dev
