Changes between Version 1 and Version 2 of OverSimKbrRouting

Timestamp:

Sep 22, 2008, 12:19:22 PM (16 years ago)

Author:

Ingmar Baumgart

Comment:

--

OverSimKbrRouting

@@ -3 +3 @@
 
  * '''iterative''': The originator starts a lookup by sending one (or multiple) !FindNode RPCs to the closest next hop
-   stored in the local routing table. The received !FindNodeResponse contains better next hop nodes, which are successively queried by the originator until a !FindNodeResponse with set '''isSibling''' bit is received. Finally the message is directly sent to this sibling (= "closest node").
- * '''exhaustive-iterative'''
- * '''semi-recursive'''
- * '''full-recursive'''
- * '''source-routing-recursive'''
+   stored in the local routing table. The received !FindNodeResponse contains better next hop nodes, which are successively queried by the originator until a !FindNodeResponse with set ''isSibling'' bit is received. Finally the message is directly sent to this sibling (= "closest node").
+ * '''exhaustive-iterative''': This is similar to the ''iterative'' case above, but the ''isSibling'' bit is ignored. The originator instead continues to query all closest nodes, until no better nodes are returned. This increases bandwidth consumption and lookup latency, but is more secure.
+ * '''semi-recursive''': The originator encapsulates the message in a ''!BaseRouteMessage'' and forwards it to the
+closest next hop stored in the local routing table. The message get forwarded recursively until the sibling node (= "closest node") for the destination key is reached.
+ * '''full-recursive''': ...
+ * '''source-routing-recursive''': ...