Enhanced Document Search and Sharing Tool in Organized P2p Frameworks

In internet p2p file sharing system generating more traffic. in this system file querying is important functionality which indicates the performance of p2p system .To improve file query performance cluster the common interested peers based on physical proximity .Existing methods are dedicated to only unstructured p2p systems and they don’t have strict policy for topology construction which decreases the file location efficiency. In this project proposing a proximity aware interest –clustered p2p file sharing system implemented in structured p2p file system. It forms a cluster based on node proximity as well as groups the nodes which having common interest into sub-cluster. A novel lookup function named as DHT and file replication algorithm which supports efficient file lookup and access. To reduce overhead and file searching delay the file querying may become inefficient due to the sub-interest supernode overload or failure. Thus, though the sub-interest based file querying improves querying efficiency, it is still not sufficiently scalable when there are a very large number of nodes in a sub-interest group. We then propose a distributed intra-sub-cluster file querying method in order to further improve the file querying efficiency.