Uh ... the draft is clearly wrong. It should be [ n+2^( 128-i ) , n+2^( 128-(i-1) )-1 ]
The lower bound is the ideal finger and the upper bound one less than the ideal finger for previous finger. For your example, this gives the result you proposed as the correct result. Thanks for catching this - this is fixed in the -14 version. On Mar 25, 2010, at 10:59 AM, Thomas Kluge wrote: > We just probing around this: > > Section 9.6.4.2. Refreshing finger table > > A finger table entry i is valid if it is in the range > [n+2^(128-i), n+2^(128-(i-1))-2^(128-(i+1))]. > > In a theoretical situation of a chord ring with 8 nodes (so 128 replaced by 3) > and n=3, I have the following finger table entries: > > f=(7 , 5 , 4) > > the ranges computed using the formula above are: > > (7-9 , 5-6 , 4-4.5) modulo corrected -> (7-1 , 5-6 , 4-4.5) > > We're confused about this, cause we believe the following > is correct: > > (7-2 , 5-6 , 4) > > Whats wrong? > > regards, > Thomas > _______________________________________________ > P2PSIP mailing list > [email protected] > https://www.ietf.org/mailman/listinfo/p2psip _______________________________________________ P2PSIP mailing list [email protected] https://www.ietf.org/mailman/listinfo/p2psip
