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
Estimating of long term concrete magnesium sulfate resistance up to 450 days depending on cement impact and water cement ratio
Sulfate attack is a complex form of deterioration that has damaged concrete structures throughout the world. Sulfate attack is particularly complex because the source of sulfates can be external or internal. The sulfate...
Facets of Semantic Web (3.0)
Ontology represents relationships among set of terms and concepts in hierarchical fashion. Ontology plays crucial role in formulization of information related to given domain. Understanding these ontologies without havi...
Reducing Web Response Time in Peer to Peer Network Using Peer’s History and Caching
With the dramatic explosion of online information, the Internet has undergone a transition from a data communication infrastructure to a global information utility and web searching has become a normal way of informatio...
Retrofication of Mechanical Speed Governor with Electronic Speed Governor for Heavy Duty Diesel Engines
The engine speed controller used in heavy duty/off road conventional diesel engine by the adaption of mechanical/electronic governor. In order to control engine speed, the governor controls the amount of fuel using fuel...
Total Productive Maintenance- A Review
The purpose of this paper is to present the literature review of Total productive maintenance (TPM). Objectives of TPM is zero breakdown, zero losses, zero defect and zero health hazard and hence increase quality and pr...