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 281
- Downloads 3
3 D Printing: Techniques and Applications
We will firstly elaborate the meaning of 3D printing and its technologies to look out the processes and material in different industries like manufacturing or production. 3D printing has become crucial and embryonic sec...
slugEfficient Design of Power and Clock network for Large Chip Design Using Energy Recycling Technique
This project aim is to develop a low- skew in multigiga hertz clocks circuit in operation with giant digital chips. A capacitance are often charged from the availability then discharged to ground. In giant digital chi...
Smart Receptionist System using Smart Lock and Wireless Communication
Security has become one of the major issues with the advent and rise in technology. This project is a security system that lets you see a visitor while the main door is locked. This embedded system is built by using PIC...
slugAn Approach towards Link Positions Routing In Wireless Network
Here, we account for the fact that MAC protocols incorporate a finite number of transmission attempts per packet. The performance of a path depends not only on the number of the links on the path and the quality of its l...
Downlink Packet Scheduling on LTE Network: A Review
LTE is a revolutionary 4g technology; it provides different type of service such as video telephony, voip, web browsing and video streaming etc. LTE is compatible with previous cellular networks. The recently, demand is...