This wiki is now locked - both user registration and edits (except by admins) are disabled. We're currently migrating all the content to our new wiki. If you have time, please register and help us out!

You can still view the source code of every page. Once a page has been copied over to the new wiki, please add a link to it to MigratedPages (the only page which is still editable), to notify the admins to go and blank it.


Small-world topology

The basis of Freenet's routing is the small-world topology. If a network has small-world topology, then routing can work, and should scale with roughly O(log^2 N) (O(log N) if nodes have O(log N) number of connections). If not, it won't.

Small-world topology for Freenet purposes means:
1. The network is fully connected, in the sense that there exists a route between any two nodes on the network.
2. There exist short routes from any node to any other node.
3. If A is connected to B, and B is connected to C, then there is an increased probability of A being connected to C. (the "triangles" property).

Small world networks can be modeled as Kleinberg networks.

See Also


Routing
NetworkTopology
The papers section on the main website.
Valid XHTML 1.0 Transitional :: Valid CSS :: Powered by WikkaWiki