On Mon, Feb 18, 2002 at 09:49:03AM -0500, Jeff Darcy wrote: > >Freenet's underlying protocol has log(n) > >scalability > > Gee, that sounds really cool! It'd probably be a little bit cooler, though, > if you defined what measurable quantity scaled as the log of what other > measurable quantity, for what operations etc. Without those details, and > they're not implied in any way by the context, saying something "has log(n) > scalability" is not a technical/scientific statement but a marketing one.
With any form of key-retrieval system, of which Freenet is an example, it is typical to describe scalability in terms of: T = O(fn(S)) Where T is the time required to retrieve a piece of information, and S is the size of the network. Sorry that this wasn't obvious to you, but it is to most people I speak to on this issue. Ian. -- Ian Clarke [EMAIL PROTECTED] Founder & Coordinator, The Freenet Project http://freenetproject.org/ Chief Technology Officer, Uprizer Inc. http://www.uprizer.com/
msg00615/pgp00000.pgp
Description: PGP signature
