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 | mjr at statesmean.com _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl >From - Thu May 10 03:10:58 2001 X-UIDL: 3adbdd6c0000050d 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 CAA22637 for <danello at danky.com>; Thu, 10 May 2001 02:19:16 -0400 Received: from hawk.freenetproject.org (localhost [127.0.0.1]) by hawk.freenetproject.org (Postfix) with ESMTP id CE8AF58021; Wed, 9 May 2001 23:59:05 -0700 (PDT) Delivered-To: devl at freenetproject.org Received: from clementi.unisg.ch (clementi.unisg.ch [130.82.150.27]) by hawk.freenetproject.org (Postfix) with ESMTP id 055C257FF3 for <devl at freenetproject.org>; Wed, 9 May 2001 23:59:00 -0700 (PDT)
