On Tuesday 27 November 2001 19:41, Oskar wrote: > On Tue, Nov 27, 2001 at 07:11:42PM -0500, Tavin Cole wrote: > > On Tue, Nov 27, 2001 at 06:54:24PM -0500, Gianni Johansson wrote: > > <> > > > > I'm getting the keys from TreeRoutingTable.refTable.elements(). I > > > discard the 32 (hex) digit ones, because they don't look like keys to > > > data. Does this seem legit to you? > > > > Yes. All the real keys will be 23 bytes and end in 0x0302 or 0x0203. > > The others are probably there from seeding the routing table either > > manually or as a result of another node announcing itself. What do > > they end in? 0x0000? > > Can we use some matching of the keytype bytes instead of the length of > the keys to determine this? No problem. I will fix the code to check for 0x0302 or 0x0203. > It is not ok to assume that that keys will > always have any length. Any distribution of the keys should be based > only on the first single or half byte anyways. Right now I am using the most significant nibble, but if keys can vary length, I guess I should be using the least significant nibble.
> Gianni: How are you making the Histograms? Just printling ascii chars. If that's not pretty enough, people can grab the raw data with the /keylist.txt URL and use the plotting program of their choice. >I know of one set of > Histograming tools under the FreeHep program, called Aida - > http://java.freehep.org/ - though I doubt it works under 1.1 as graphics > was generally bad before 1.2... I am not worried about making it look pretty at this point. The important thing is to get some data and figure out what's going on with the network. --gj -- Freesites (0.3) freenet:MSK at SSK@enI8YFo3gj8UVh-Au0HpKMftf6QQAgE/homepage// (0.4) freenet:SSK at npfV5XQijFkF6sXZvuO0o~kG4wEPAgM/homepage// _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl
