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 299
- Downloads 3
LTE Scheduling Algorithm with Balanced Throughput and Fairness
Long Term Evolution, the recent technology in Mobile Communication can handle the high Data Rate traffic in a better way. Packet scheduling plays a vital role in handling the data traffic by allocating resources in freq...
Kinematics of Usain Bolt’s 100 m performance: A Review
The sprint event viz, 100m is considered as the blue riband event in the world, as athlete tries to cover the maximum distance in the shortest possible time. This study was aimed to review the kinematics of Usain Bolt’s...
Factors Affecting Stability and Quality of the Power System with Its Compensation Techniques In Brief
The purpose of this paper is to provide the practical information about the factors responsible for affecting power system stability and power quality. Some compensation techniques are also discussed to improve the beha...
Implementation on Data Cleaning for RFID and WSN Integration
Today’s manufacturing environments are very dynamic and turbulent. Wireless Sensor Network (WSN) and Radio Frequency Identification (RFID) integration is a developing innovation which utilizes focal points of the both f...
Energy Management System in Buildings using Programmable Logic Controller
All Buildings have some form of electrical and mechanical services in order to afford a comfortable living environment for human beings. Energy Management System in Buildings (EMS) is to systematize the usage of electri...