A file sharing system in peer-to-peer network by a nearness-sensible method

S. Vimal, S. Srivatsa
{"title":"A file sharing system in peer-to-peer network by a nearness-sensible method","authors":"S. Vimal, S. Srivatsa","doi":"10.1504/ijris.2020.10023553","DOIUrl":null,"url":null,"abstract":"For a comprehensive peer-to-peer file sharing system dynamic file query is substantial where its performance can be enhanced by clustering of peer that can also considerably improve the efficiency. Depending upon physical nearness and peer interest peers are clustered in current work. File replication algorithm has been employed that creates replicas for the requested file to enhance the efficiency. Compared to unstructured P2P the efficiency is high for structured P2P which is difficult to analyse because of their rigid topology. We have developed nearness and interested cluster (NIC) super peer network to improve the efficiency of file location in current years for P2P system but few works rely on peer interest and physical nearness. Various methods have been used to improve intra-sub-cluster searching. Here the interest is categorised into sub-interest then they are linked according to common-interest. File searching delay is minimised where an overlay is built to link. Flower filter is employed to enhance the efficiency and reduce the overhead. On comparing nearness sensible I-clustered system with other system the efficiency has been traced. The effect of enhancing the efficiency using intra-sub-cluster searching is observed in experimental results.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Reason. based Intell. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijris.2020.10023553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

For a comprehensive peer-to-peer file sharing system dynamic file query is substantial where its performance can be enhanced by clustering of peer that can also considerably improve the efficiency. Depending upon physical nearness and peer interest peers are clustered in current work. File replication algorithm has been employed that creates replicas for the requested file to enhance the efficiency. Compared to unstructured P2P the efficiency is high for structured P2P which is difficult to analyse because of their rigid topology. We have developed nearness and interested cluster (NIC) super peer network to improve the efficiency of file location in current years for P2P system but few works rely on peer interest and physical nearness. Various methods have been used to improve intra-sub-cluster searching. Here the interest is categorised into sub-interest then they are linked according to common-interest. File searching delay is minimised where an overlay is built to link. Flower filter is employed to enhance the efficiency and reduce the overhead. On comparing nearness sensible I-clustered system with other system the efficiency has been traced. The effect of enhancing the efficiency using intra-sub-cluster searching is observed in experimental results.
基于邻近感知方法的点对点网络文件共享系统
对于一个全面的点对点文件共享系统来说,动态文件查询是非常重要的,动态文件查询的性能可以通过对点的聚类来提高,这也可以大大提高效率。根据物理距离和同伴兴趣,同伴在当前工作中聚集。采用文件复制算法为所请求的文件创建副本,以提高效率。与非结构化P2P相比,结构化P2P的效率较高,但由于其拓扑结构刚性,分析难度较大。为了提高P2P系统的文件定位效率,近年来人们开发了近邻和感兴趣集群(NIC)超级对等网络,但依赖于近邻和物理近邻的工作很少。已经使用了各种方法来改进子簇内搜索。在这里,兴趣被分类为子兴趣,然后根据共同兴趣将它们链接起来。文件搜索延迟最小化,其中覆盖是建立链接。采用花过滤,提高了效率,降低了开销。通过与其他系统的比较,分析了该系统的效率。实验结果表明,采用子簇内搜索提高了搜索效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信