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 306
- Downloads 3
Licence Plate Recognition Using Feature Extraction and Principle Component Analysis
There are many techniques available for recognizing license plates but due to the Indians not using the standardized number plates we often face a problem of not recognizing the number and the characters on the number p...
Study on Various Network Topologies for set –up best Network
This paper presents an introduction to Computer Network Topology. Definitions of Physical and Logical Topologies are provided. Additionally common Computer Network realizations of Physical Topologies are reviewed. This...
A Customized Adaptation of Traditional Lesk Method for Sense Disambiguation of Punjabi Words from Medical Domain
We report in this paper a way of doing Word Sense Disambiguation (WSD) that has its origin in multilingual MT. Various Machine Learning approaches have been demonstrated to produce relatively successful Word Sense Disam...
Review of Integrity Constraint in MySQL
For the semantic correctness of database records, Integrity constraints or data constraints are proper representations of invariant conditions. Constraints can be articulated in declarative languages such as data log, p...
A Literature Survey on Data Mining Techniques to Predict Lifestyle Diseases
Data Mining is the process of extraction hidden patterns from previously unknown and imaginably useful information from huge amount of data. The diagnosis of Disease is one of the major application where data mining too...