On Tue, May 24, 2011 at 9:18 AM, Pierre Abbat <phma at phma.optus.nu> wrote:
> On Tuesday 24 May 2011 08:56:07 Matthew Toseland wrote: > > You should simulate this. There are a few simulators but you might have > to > > write your own. > > > > The main difficulty I see is that greedy routing only works if most of > our > > connections are close and a few are distant. If they are all distant, a > > request will get to roughly where it should be quickly but will not be > able > > to get to a specific location in a reasonable number of hops. > > To run a simulator, do I need to know Java? I have two computers, one a > years-old Ubuntu installation that I haven't had time to upgrade, and one a > recent DragonFly box that I've had trouble installing Java on. The Ubuntu > box's Java interpreter reports the following: > My recommendation would be to whip up a simulation in whatever language you are most familiar with. It shouldn't be complicated, and will probably be easier than the learning curve of using unfamiliar code in an unfamiliar language. This is very interesting work! Ian. -- Ian Clarke Founder, The Freenet Project Email: ian at freenetproject.org -------------- next part -------------- An HTML attachment was scrubbed... URL: <https://emu.freenetproject.org/pipermail/tech/attachments/20110525/38aa040c/attachment.html>
