Comparison of Node Position in Clustered P2P File Allocate System

Abstract

Advancements in technology over the past decade in stimulated the development large amount peer-to-peer (P2P) file allocate systems, The nodes interconnect to realize collaborative file services. Assessment of trustiness becomes modify. Trust errors and trusting data is stored by the middle server. Trust data finding one another is maintained and stored many- peers in p2p system. Feedbacks take different peers is  stored by trust users in hash table depend model. We introduce a Proximity Aware and Interest-clustered P2P file sharing System (PAIS) is based n structured P2P, which forms physically-close nodes into a cluster and further group’s physically close and same nodes into a sub cluster based on a hierarchical model. Cluster based locality system involves the method of intelligent file replication algorithm to change the file query efficiency. It commonly uses replicas of each file that are frequently accessed and create same clustering in particular nearest location. Initially, it classifies all the small nodes into sub cluster as a group this model is provide the effectiveness of secure file sharing system and also it find out the small attackers with the help of the routing value using follower and cluster based file allocate algorithms to change file search efficiently in the peer network A narrative lookup function named as DHT and file allocate algorithm is supports resourceful file lookup and access. To diminish overhead and file searching delay it keeps up file data collection. Bloom filter model is used to cut file sharing delay. Finally proposed model shows competence in file search, sharing and overhead.