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 theo _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl >From - Wed May 9 23:55:31 2001 X-UIDL: 3adbdd6c00000509 X-Mozilla-Status: 0011 X-Mozilla-Status2: 00000000 Return-Path: <devl-admin at freenetproject.org> Received: from hawk.freenetproject.org (postfix@[4.18.42.11]) by funky.danky.com (8.9.3/8.8.7) with ESMTP id TAA18866 for <danello at danky.com>; Wed, 9 May 2001 19:35:24 -0400 Received: from hawk.freenetproject.org (localhost [127.0.0.1]) by hawk.freenetproject.org (Postfix) with ESMTP
