A Survey on P2P File Sharing Systems Using Proximity-aware interest Clustering
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2015, Vol 3, Issue 12
Abstract
Efficient file query is important to the overall performance of peer-to-peer (P2P) file sharing systems. Clustering peers by their common interests can significantly enhance the efficiency of file query. Clustering peers by their physical proximity can also improve file query performance. However, few current works are able to cluster peers based on both peer interest and physical proximity. Although structured P2Ps provide higher file query efficiency than unstructured P2Ps, it is difficult to realize it due to their strictly defined topologies. In this work, we introduce a Proximity-Aware and Interest-clustered P2P file sharing System (PAIS) based on a structured P2P, which forms physically-close nodes into a cluster and further groups physically-close and common-interest nodes into a sub-cluster based on a hierarchical topology. PAIS uses an intelligent file replication algorithm to further enhance file query efficiency. It creates replicas of files that are frequently requested by a group of physically close nodes in their location. Moreover, PAIS enhances the intra-sub-cluster file searching through several approaches. First, it further classifies the interest of a sub-cluster to a number of sub-interests, and clusters common-subinterest nodes into a group for file sharing. Second, PAIS builds an overlay for each group that connects lower capacity nodes to higher capacity nodes for distributed file querying while avoiding node overload. Third, to reduce file searching delay, PAIS uses proactive file information collection so that a file requester can know if its requested file is in its nearby nodes. Fourth, to reduce the overhead of the file information collection, PAIS uses bloom filter based file information collection and corresponding distributed file searching. Fifth, to improve the file sharing efficiency, PAIS ranks the bloom filter results in order. Sixth, considering that a recently visited file tends to be visited again, the bloom filter based approach is enhanced by only checking the newly added bloom filter information to reduce file searching delay. Further, the experimental results show the high effectiveness of the intra-sub-cluster file searching approaches in improving file searching efficiency.
Authors and Affiliations
Varalakshmi. T, Arul Murugan. R
Keywords
Related Articles
- EP ID EP21503
- DOI -
- Views 303
- Downloads 3
Impact of He-Ne Laser Irradiation on Germination and Electrical Conductivity of Soybean Seeds Glacine Max
The present study intends to determine the influence of He-Ne Laser on germination and electrical conductivity of soybean seeds revealed suppressive effect compared to non-irradiated seed. In this study, the soybean see...
Eccentrically Loaded Strip Footing on Oil Contaminated Kanhan Sand
Onshore and offshore oil spills contaminate soil. In addition to environmental concerns for ground water pollution and other possible effects, the geotechnical properties of the contaminated soil such as the shear stren...
Drying of Chili Using Solar Cabinet Dryer & Analysis with Results of Various Parameters
Solar Energy will going to be 5th generation main energy sources with its easy availability and scarcity of nonrenewable energy sources. With increasing demand of energy sources to harness our daily needs and scarcity of...
RBS Re-Parent Manager (RRPM)
This paper uses preemptive approach to avoid traffic congestion. With the exponential increase in the number of internet subscribers the data floating on the internet has increased 72x as compared to the internet traffi...
slugAn Efficient Priority Based Task Management In Grid Computing-2
Grid computing can integrate and utilize heterogeneous computing resources which are connected through networks without the limitation of geography.In this research paper we have proposed a priority based task schedulin...