-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1
On 24 May 2006, at 09:09, Matthew Toseland wrote: > On Wed, May 24, 2006 at 05:04:40PM +0100, Matthew Toseland wrote: >> On Wed, May 24, 2006 at 05:00:39PM +0100, Michael Rogers wrote: >>> >>> As for generating the networks, I'm thinking of using some kind >>> of small >>> world model, probably one of these: >>> >>> http://dx.doi.org/10.1073/pnas.012582999 >>> http://nlsc.ustc.edu.cn/BJKim/PAPER/PRE_CLUS.PDF >> >> Freenet 0.7 is predicated on the premise that social networks are >> a lot >> closer to small world than to scale free. If they are scale-free then >> the darknet is pretty pointless as it's extremely vulnerable to >> targeted >> assassination. > > We have historically created models based on Kleinberg's work - > create a > big circle, then add cross-links with a 1/d distribution. > > However we have also simulated with Orkut-derived real world data. > > It would be sensible to at least start with the same data we have used > to simulate routing. I think our core assumption is that there will be clustering in the graph, meaning that if A is connected to B, and B is connected to C, there is a higher probability that A is connected to C than that A is connected to any other randomly selected node in the network. I think given the nature of human relationships, or even the way that people exchange references on #freenet-refs, that this assumption will be valid. We should therefore simulate using a graph generated in a manner as close to how darknets are likely to grow and spread as possible. Ian. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.2.2 (Darwin) iD8DBQFEdKTBQtgxRWSmsqwRAtvNAJ40+XwTmH5u9Nzxqw8gpF17c9gH2QCeM04n R40Tv19CCikALx5pnr3oWuI= =m9sV -----END PGP SIGNATURE-----
