Pastry - Irisa

Given a message, the node first checks to see if the destId falls intherangeof
:thei-thclosestnodeIdinthenamespacetable
1 10233 01 02212102 10233 232
, ,where
negative/positive indices indicate nodeIds smaller/larger than the present nodeId, respectively.
0 02212102 1023312
0
:thedomainofdestId Routing
2
algorithm at level (on . node
02212102
A)
:thelengthoftheprefixsharedamong and ,inlevels.
Namespace set
10233021 10233033 10233120 10233122
(1) if ( )
(2) // is within range of our leaf namespace set set
(3) forward to ,s.th. is minimal;
(4) 4. The top else row of the routing table representsi
level zero.
Rl
(5) // use the routing table
line l, 0 ≤ l ≤ ⎣⎣
(6) Let ;
L
(7) if ( )
(8) forward to ;
(9)
(10) else
(11) // rare case
Fig. 1. State of a hypothetical Pastry node with nodeId 10233102,
:entry of the routing table R,
128/b
:ith closest nodeId in the leafset
⎦⎦
0 ≤ i ≤ 2
i
2 We assume throughout this paper that DnodeIds l
: value of are theuniformly l digits of key distributed. D
(12) forward to ,s.th.
(13) ,
(14)
(15)
(16)
.Allnumbersareinbase
SHL(
A,
B) :length of the shared prefix between A and B
b
,