On Tue, 8 May 2001, Theodore Hong wrote:
> Bernardo Huberman (formerly of Xerox PARC) sent me a preprint of a paper on
> the scalability of routing algorithms in power-law networks. The main
> result seems to be that you can get good sublinear scaling by just
> forwarding messages to the neighbor who has the most connections.
>
> Since nodes that have a lot of connections are also likely to have a lot of
> references pointing at them, which increases the chances that messages will
> be routed to them, I wonder how much of Freenet's scalability comes simply
> from this effect, and how much contribution the actual key-closeness bit
> makes.
>
> "Search in Power-Law Networks"
> http://www.hpl.hp.com/shl/new.html
Hub nodes could instruct requesting nodes to connect directly to the
target node, and thus avoid the expense of transferring and caching data.
ZAP--SUPER BAT SNATCH! ELSEWHEREVILLE FOR YOU!
--
"...it must be held that third-party electronic monitoring, subject
only to the self-restraint of law enforcement officials, has no place
in our society..." Mark Roberts | [EMAIL PROTECTED]
_______________________________________________
Devl mailing list
[EMAIL PROTECTED]
http://lists.freenetproject.org/mailman/listinfo/devl
