160 likes | 520 Views
Temporally-Ordered Routing Algorithm (TORA). Route Creation. QRY packet: contains the destination-ID (did) for which the algorithm is running. UPD packet: contains the did and the height of the node i that is broadcasting the packet, Hi Each node maintains:
E N D
Route Creation QRY packet: contains the destination-ID (did) for which the algorithm is running. UPD packet: contains the did and the height of the node i that is broadcasting the packet, Hi Each node maintains: • route-required flag RRi initially unset • the time the last UPD packet was broadcast • When a node i with no directed links and an un-set RRi requires a route, it broadcasts a QRY packet and sets RRi.
Example 1 - Route Creation(1/6) Circle around a node indicate RRi is true (-,-,-,-,A) (-,-,-,-,B) (-,-,-,-,E) QRY (-,-,-,-,C) (-,-,-,-,D) (0,0,0,0,F) DEST (-,-,-,-,G) (-,-,-,-,H) Figure 1: Node C requires a route to node F. It therefore broadcasts a QRY packet.
Example 1 - Route Creation(2/6) (-,-,-,-,A) (-,-,-,-,B) QRY (-,-,-,-,E) (-,-,-,-,C) (-,-,-,-,D) (0,0,0,0,F) DEST QRY (-,-,-,-,G) (-,-,-,-,H) Figure 1: Node A and Node G propagate the QRY packet.
Example 1 - Route Creation(3/6) QRY (-,-,-,-,A) (-,-,-,-,B) (-,-,-,-,E) QRY (-,-,-,-,C) (-,-,-,-,D) (0,0,0,0,F) DEST (-,-,-,-,G) UPD (0,0,0,1,H) Figure 1: Node B and Node D propagate the QRY packet. Node H generates a UPD packet.
Example 1 - Route Creation(4/6) (-,-,-,-,A) (-,-,-,-,B) UPD (0,0,0,0,E) UPD (-,-,-,-,C) (0,0,0,2,D) (0,0,0,0,F) DEST UPD (0,0,0,2,G) (0,0,0,2,H) Figure 1: Node D and G propagate the UPD packet while node E generates a UPD packet.
Example 1 - Route Creation(5/6) UPD UPD (0,0,0,2,B) (0,0,0,3,A) UPD (0,0,0,0,E) (0,0,0,3,C) (0,0,0,2,D) (0,0,0,0,F) DEST (0,0,0,2,G) (0,0,0,2,H) Figure 1: Node A, B, and C propagate the UPD packet.
Example 1 - Route Creation(6/6) (0,0,0,3,A) (0,0,0,2,B) (0,0,0,0,E) (0,0,0,3,C) (0,0,0,2,D) (0,0,0,0,F) DEST (0,0,0,2,G) (0,0,0,2,H) Figure 1: Route creation has completed