Trust and Caching Technique for Intelligent Semantic Query Routing in P2P Networks

The P2P routing protocol is affected from the fact that queries need to reach the largest number of peers to enhance the chances to locate the target file and messages should be low as possible We propose trust based query routing technique for P2P Networks. Initially the node with maximum trust value is chosen as cluster head. These cluster heads are designated as trust managers. Each peer maintains a trust table which gets updated once it gets feedback from the trust manager about the resource requested peer. If the update denotes that the node is reachable and trusted, the routing is performed. Otherwise its echo time is verified again to decide the re-routing process. By simulation results, we show that the proposed work offers secured and reliable routing. This peer to peer network is carried out without using a caching mechanism to store the data packets while routing. To achieve this caching mechanism we have proposed methods for caching the data packets in the peers and also to replace these data packets with the new data packets in the next routing process.