Pastry - Irisa

Recommendations

Info

Reducing latency • Random assignment of nodeId: Nodes numerically close are geographically (topologically) distant • Objective: fill the routing table with nodes so that routing hops are as short (latency wise) as possible • Topological Metric: latency d467c4 6fdacd d467f5
Exploiting locality in <strong>Pastry</strong> Neighbour selected based of a network proximity metric: • Closest topological node • Satisfying the constraints of the routing table routeTable(i,j): • nodeId corresponding to the current nodeId up to level i next digit = j • nodes are close at the top level of the routing table • Farther nodes at the bottom levels of the routing tables
Page 1 and 2: Pastry
Page 3 and 4: Pastry (MSR/RICE) node key Id space
Page 5 and 6: Pastry: Routing table(#65a1fcx) 0 x
Page 7 and 8: Given a message, the node first che
Page 9 and 10: Failure detection Detected when imm
Page 11: State maintenance Leaf set • is a
Page 15 and 16: Locality Node X routes to node A
Page 17 and 18: Node discovery: approximation of th
Page 19: References • Rowstron and P. Drus

Pastry - Irisa

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?