An Efficient P2P File Sharing System Using an Intelligent File Replication Algorithm

Abstract

efficient file query is very important performance of the peer to peer file sharing system. Significantly
enhance the efficiency of file query by using a Clustering peers and physical proximity can improve the file query
performance. Some of the working procedure has able to cluster peers based on both peer interest and physical
proximity. Here the structured P2Ps will give the higher precedence file query efficiency than unstructured P2Ps, and
can’t define topologies. In this topic we introduced (PAIS) means a Proximity-Aware and Interest-clustered P2P file
sharing System and this is completely based on the structure of P2P system, and it has form the physically closed
nodes into a cluster and remaining groups are physically close and common interest nodes into a sub cluster based on
a hierarchical topology. We have used intelligent file replication algorithm because enhance file query efficiency. It
has created replicas of files which are requested by a group of physically close nodes in particular location. Searching
the several approaches by using a PAIS enhance the intra sub cluster file. Initially it has to classify the interest of a
sub-cluster to a number of sub-interests, and clusters common cub interest nodes into a group for file sharing. And
then later it connects from lower capacity nodes to the higher precedence capacity nodes and distributing the file
querying and avoids node overload. After that file searching delay is decreases. PAIS uses proactive file information
collection so file requester can only kwon the where the file and whether it is nearby nodes or not. Overhead of the file
information collection is reduced. Corresponding distributed file searching and file information collection are used by
PAIS used bloom filter based. However, to improve the best performance of file sharing efficiency, and to get the
blooms filter results in based on their rank order. Bloom filter approach has to use because of only check the newly
collected bloom filter information to decrease file searching delay.