Pastry - Irisa
Pastry - Irisa
Pastry - Irisa
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Node discovery: approximation of the<br />
closest node<br />
discover(seed) //destination<br />
nodes=getleafset(seed)<br />
//probes on the leaf set<br />
nearNode=pickClosest(nodes) //pick closest in the leafset<br />
depth=getMaxRoutingTableLevel(nearNode) //highest line in RT<br />
closest=nil<br />
while (closest != nearNode)<br />
closest=nearNode<br />
nodes = getRoutingTable(nearNode, depth)<br />
nearNode =pickclosest(nodes)<br />
if (depth >0) depth = depth – 1<br />
end<br />
return closest<br />
Routing table property used to move exponentially closer to the closest<br />
Pick the closest node at each level and get the the next level from it (bottom up)<br />
• Constant number of probes at each level<br />
• Probed nodes get exponentially closer at each level<br />
Fill routing table entries from the closest node