On Tuesday 01 May 2012 00:27:26 Michael Grube wrote: > On Mon, Apr 30, 2012 at 7:06 PM, Steve Dougherty <st...@asksteved.com>wrote: > > > -----BEGIN PGP SIGNED MESSAGE----- > > Hash: SHA1 > > > > On 04/28/2012 06:56 PM, Zlatin Balevsky wrote: > > > In Gnutella we observed that long-lived nodes tend to be better > > > connected and that they also cluster with other high-uptime nodes. > > > If the same is true for Freenet it's a good idea to keep an eye for > > > side effects as you tweak the behavior. > > > > Good to know - I'll look for that. Are there any particular effects > > you had in mind? The Metropolis-Hastings correction in the new probes > > should produce a fairly uniform distribution of endpoints despite > > clustering and well-connected nodes, but explicitly simulating the > > effects of high uptime could be helpful. > > > > It occurs to me that the probe requests I hope to depreciate allow > > reconstructing the actual network topology - perhaps we could run > > simulations on top of it? The new probe requests are currently planned > > to not report degrees or link length distributions, [1] which as far > > as I can tell would mean no way to reconstruct the network as measured > > in simulation. Does it seem reasonable to omit the ability to gather > > such information?
I don't know, in the short run. In the long run we'd prefer not to expose the full topology for security reasons. > > > > > > On 04/28/2012 03:51 PM, Michael Grube wrote: > > > Are you assuming opennet, darknet, a mix? > > > > The simulation generates the graph in a way which effectively sort of > > assumes darknet: it assigns locations, then iterates over the network > > and connects nodes based on link length. [2] [3] I'm working under the > > assumption that when using the same degree distribution as the network > > is measured to have this is an accurate enough approximation. I will > > include these and similar plots in this week's progress report. > > > > Ah, ok. You're making a Kleinberg Small World graph. Nice. > > > > > > My understanding is that a more thorough simulation of darknet would > > randomly assign locations and reassign them with the location-swapping > > algorithm used in Fred. > > > Right. Funnily enough, the swapping algorithm is most concisely described > in the Pitch Black paper. I'd suggest that as a reference for quick > implementation. > > > > I think simulating opennet would be more work > > both to implement and to run, as it would mean implementing > > path-folding and randomly assigning locations and connections. > > > > No doubt about that. Just curious. I did some work involving some very > simple probes, but it was more of a theoretical simulation. We'll see how > close theory matches reality I guess ;) Obviously, opennet will have uptime issues (but hopefully they will settle after a reasonable period), and darknet presumably won't...
signature.asc
Description: This is a digitally signed message part.
_______________________________________________ Devl mailing list Devl@freenetproject.org https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
