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 280
- Downloads 3
A Comparative Study & Analysis of Image Restoration by Non Blind Technique
The process of retrieving and analyzing the pictorial information by a digital computer is known as digital image processing. Vision is the foremost trusted source of information compare to other human perceptions. And...
Graphene Nano Ribbons
This paper gives an introduction to graphene nano ribbons. Graphene nanoribbons possess ultra-thin width and offers potential applications in various devices and systems. It has many novel properties which vary accordin...
Mechanical Properties Assessment of Ultra High Performance Fibre Reinforced Concrete (UHPFRC)
The present paper is aimed to assessment of UHPFRC the conventional concrete is replaced by UHPFRC, an Advanced Cement based Super plasticised concrete with high workability and low water cement ratio. The constituents...
Snubberless Soft-switching (zcs/zvs) Closed loop Current-fed Half-bridge Converter Based PV Inverter
Snubber circuit dissipates some amount of the output power along with increase in circulating current through the components, increasing their conduction losses and also increases the components count, converter complex...
Four Wheel Steering System for Automobiles
Work is based on the steering system modification that a new type of steering mechanism can be employed over conventional steering system. This includes steering over all of the 4 wheels instead of 2 wheels as in the pr...