[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Gzz] Re: [Gzz-commits] storm/doc/pegboard/attacking_gisp--hemppah p
From: |
Tuomas Lukka |
Subject: |
Re: [Gzz] Re: [Gzz-commits] storm/doc/pegboard/attacking_gisp--hemppah peg.rst |
Date: |
Wed, 11 Jun 2003 13:22:11 +0300 |
User-agent: |
Mutt/1.5.4i |
On Wed, Jun 11, 2003 at 10:17:32AM +0300, Hermanni Hyytiälä wrote:
> On Tue, 2003-06-10 at 21:28, Tuomas Lukka wrote:
>
> > >
> > > Again, Chord paper cites, "Each peer in an experiment picked a random
> > > set of keys to query from the system, and we measured the path length
> > > required to resolve each query."
> > >
> > > So, I'll use the same method...
> >
> > Once or several times?
>
> The authors used in tests a network with n=2^k peers, where k varied
> from 3 to 14.
>
> So, several times (and the number of peers in the system varied).
>
> Is this ok for us ?
I meant: does each peer try to get the set of keys it chose once or several
times?
Tuomas