Distributed cache updating for dynamic source routing protocol Sexemail chat

Posted by / 04-Jul-2017 02:04

Distributed cache updating for dynamic source routing protocol

In a reactive (on-demand) approach such as this, a route is established only when it is required and hence the need to find routes to all other nodes in the network as required by the table-driven approach is eliminated.The intermediate nodes also utilize the route cache information efficiently to reduce the control overhead.The destination node, on receiving a Route Request packet, responds by sending a Route Reply packet back to the source, which carries the route traversed by the Route Request packet received.Consider a source node that does not have a route to the destination.Each node, upon receiving a Route Request packet, rebroadcasts the packet to its neighbors if it has not forwarded it already, provided that the node is not the destination node and that the packet’s time to live (TTL) counter has not been exceeded.Each Route Request carries a sequence number generated by the source node and the path it has traversed.

The packet is forwarded only if it is not a duplicate Route Request.The disadvantage of this protocol is that the route maintenance mechanism does not locally repair a broken link.Stale route cache information could also result in inconsistencies during the route reconstruction phase.When it has data packets to be sent to that destination, it initiates a Route Request packet.This Route Request is flooded throughout the network.

distributed cache updating for dynamic source routing protocol-23distributed cache updating for dynamic source routing protocol-85distributed cache updating for dynamic source routing protocol-76