REPLACEMENT MECHANISM OF CACHING TECHNIQUE FOR QUERY ROUTING IN PEER TO PEER NETWORKS

In this approach we are proposing an extension to our previous work which deals with Trust Based Routing in the peer to peer network. 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. The method proposed to store the data packets is the Cache Mechanism approach, where this mechanism considers the throughput and the aggregated delay. To get this aggregated delay it considers the latency to return the current reply (L_c) and the latency to reply future data requests (L_f). Then an approach has been proposed to replace this stored data packets with the new data packets for the next routing process where the old data packets are removed from the peer’s cache and the new data packets will be moved to the cache