On Fri, Aug 1, 2008 at 6:46 AM, Michael Rogers <m.rogers at cs.ucl.ac.uk> wrote: > Ed Tomlinson wrote: >> Not at all. Think that churn is making data much harder to find. >> While I think FOF routing will help shorten path lenghts, I do not >> think its going to help find older data all that much faster. I >> would love to see some simulations where the average location of the >> store influences swapping. > > This does sound like an interesting idea, but how would you calculate > the average when the keyspace is circular? Just taking the mean of the > keys' locations will tend to push nodes away from 0.
in a circular space, we can get infinite number of "average" by changing point of reference. --- choose the point of reference with the smallest standard deviation. > Cheers, > Michael
