Super Peer File Sharing System Using Proximus Aware Interest Clustering
Pratiksha Gaikwad, Azim Shaikh, Abhijeet Sasulkar, Rajesh Gaud
Department of Computer Engineering Ambi, Pune, India
Abstract
Efficient file question is very important to the general performance of super peer file sharing systems. Clustering peers by their common interests will considerably enhance the potency of file question. Clustering peers by their physical proximity may improve file question performance. However, few current works area unit ready to cluster peers supported each peer interest and physical proximity. Though structured super peer offer higher file question potency than unstructured super peer, it's tough to appreciate it because of their strictly outlined topologies. During this work, we have a tendency to introduce a Proximity-Aware and Interest-clustered super peer file sharing System (PAIS) supported a structured super peer, that forms physically-close nodes into a cluster and any teams physically-close and common-interest nodes into a sub-cluster supported a hierarchic topology. PAIS uses associate degree intelligent file replication rule to any enhance file question potency. It creates replicas of files that area unit oftentimes requested by a gaggle of physically shut nodes in their location. Moreover, PAIS enhances the intra-subcluster file ransacking through many approaches. First, it any classifies the interest of a sub-cluster to variety of subinterests, and clusters common-sub interest nodes into a gaggle for file sharing. Second, PAIS builds associate degree overlay for every cluster that connects lower capability nodes to higher capability nodes for distributed file querying whereas avoiding node overload. Third, to scale back file looking out delay, PAIS uses proactive file info assortment so a file requester will apprehend if its requested file is in its close nodes. Fourth, to scale back the overhead of the file info assortment, PAIS uses bloom filter primarily based file info assortment and corresponding distributed file looking out. Fifth, to boost the file sharing potency, PAIS ranks the bloom filter leads to order. Sixth, considering that a recently visited file tends to be visited once more, the bloom filter primarily based approach is increased by solely checking the recently further bloom filter info to scale back file looking out delay. Further, the experimental results show the high effectiveness of the intra-sub-cluster file looking out approaches in up file looking out potency
Keywords
How to cite
Pratiksha Gaikwad, Azim Shaikh, Abhijeet Sasulkar, Rajesh Gaud (2017). Super Peer File Sharing System Using Proximus Aware Interest Clustering. IJAREST, 4(5), 299-306.
BibTeX
@article{ijarest2017A373B7,
title={{Super Peer File Sharing System Using Proximus Aware Interest Clustering}},
author={Pratiksha Gaikwad and Azim Shaikh and Abhijeet Sasulkar and Rajesh Gaud},
journal={IJAREST},
volume={4},
number={5},
pages={299-306},
year={2017}
}Published under an open-access licence. See copyright & licensing.