Introduction to Distributed Cache Updating For the Dynamic Source Routing Protocol Java Project:
The main objective of this technique is to find the broken links which are transferring information and to divert them to the other nodes which are present in the cache. A cache update algorithm is used for updating the new cache structure called a cache table for the broken links. In this paper we will see for the cache algorithms are implanted for find the broken links and updating the caches.
Brief into the working of the distributed cache updating:
To make cache update for the broken links each node maintains the cache table information required for making the cache updates. When a link failure is detected the algorithm notifies all the reachable nodes which have the cached link. The proactive cache updating includes some protocols for patching up the broken links.
We have two types of routing protocols available for the adhoc networks. The proactive protocols maintain a up to date information of the nodes which periodically disseminates the topology updates through the network. Whereas the on demand protocols make the discovery of the routes only when the routes are required.
Limitations of existing system and advantages of distributed cache updating:
In the existing system the link failure occurs in the mac layer as it undergoes multiple transmissions due to increase of stale route packet delivery latency. The stale route packets remain in the caches only due to the usage of FIFO replacement algorithm.
By using proactive cache updating the propagation of stale routes to other routes gets prevented. A new cache updating algorithm is used which makes the dynamic source routing to adapt quickly to the changes occurred in the topology.
Download Distributed Cache Updating For the Dynamic Source Routing Protocol Java Project Report.