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 277
- Downloads 3
Low Frequency AC Transmission System
A new Low Frequency AC (LFAC) Transmission System has proposed for transmission of bulk power over long distance by using an intermediate frequency with low investment cost. This paper presents the feasibility of applyi...
Study of Urban Travel Demand Characteristics of Twin City
BRT applications are designed to be appropriate to the market they serve and their physical surroundings and can be incrementally implemented in a variety of environments. In brief, BRT is a permanently integrated syste...
Study and Comparison of Tribological Wear Behavior Characteristics of Titanium Dioxide Coated Mild Steel
Mild steel is the most common form of steel as its price is relatively low while it provides material properties that are acceptable for many applications. Mild steel has a relatively low tensile strength, but it is che...
A secured approach for sharing critical data on halftone image Using advance visual cryptography
Visual cryptography is a secret sharing scheme which uses images divided as shares such that, when the shares are created, a hidden secret image is attached. In extended visual cryptography, the share images are develop...
Comparison of Handoff Using Mobile WiMAX
The next-generation Wireless Metropolitan Area Networks, using the Worldwide Interoperability for Microwave Access (WiMAX) as the core technology based on the IEEE 802.16 family of standards, is evolving as a Fourth-Gen...