非结构化P2P网络中联合查询路由的改进

Wai Gen Yee, L. Nguyen, O. Frieder
{"title":"非结构化P2P网络中联合查询路由的改进","authors":"Wai Gen Yee, L. Nguyen, O. Frieder","doi":"10.1109/NCA.2010.26","DOIUrl":null,"url":null,"abstract":"Approximately 74% of queries in peer-to-peer file sharing systems return no results, wasting both network bandwidth and computational resources. Considering the popularity of this application, this is a significant problem. We propose to improve the accuracy of query routing by improving how file collections are described and defining how peers organize into groups. Our basic approach is to improve the precision of collection description by having each peer partition its collection and describe each collection independently. Experimental results on real peer-to-peer file sharing data shows that our techniques can reduce routing cost to peer groups by 40% with near-perfect load balance.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improving Conjunctive Query Routing in Unstructured P2P Networks\",\"authors\":\"Wai Gen Yee, L. Nguyen, O. Frieder\",\"doi\":\"10.1109/NCA.2010.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Approximately 74% of queries in peer-to-peer file sharing systems return no results, wasting both network bandwidth and computational resources. Considering the popularity of this application, this is a significant problem. We propose to improve the accuracy of query routing by improving how file collections are described and defining how peers organize into groups. Our basic approach is to improve the precision of collection description by having each peer partition its collection and describe each collection independently. Experimental results on real peer-to-peer file sharing data shows that our techniques can reduce routing cost to peer groups by 40% with near-perfect load balance.\",\"PeriodicalId\":276374,\"journal\":{\"name\":\"2010 Ninth IEEE International Symposium on Network Computing and Applications\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Ninth IEEE International Symposium on Network Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCA.2010.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Ninth IEEE International Symposium on Network Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2010.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在点对点文件共享系统中,大约74%的查询没有返回结果,这既浪费了网络带宽,也浪费了计算资源。考虑到这个应用程序的流行程度,这是一个严重的问题。我们建议通过改进文件集合的描述方式和定义对等体组织成组的方式来提高查询路由的准确性。我们的基本方法是通过让每个对等体划分其集合并独立描述每个集合来提高集合描述的精度。在真实的点对点文件共享数据上的实验结果表明,我们的技术可以在接近完美的负载平衡的情况下将对等组的路由成本降低40%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improving Conjunctive Query Routing in Unstructured P2P Networks
Approximately 74% of queries in peer-to-peer file sharing systems return no results, wasting both network bandwidth and computational resources. Considering the popularity of this application, this is a significant problem. We propose to improve the accuracy of query routing by improving how file collections are described and defining how peers organize into groups. Our basic approach is to improve the precision of collection description by having each peer partition its collection and describe each collection independently. Experimental results on real peer-to-peer file sharing data shows that our techniques can reduce routing cost to peer groups by 40% with near-perfect load balance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Performance Model of Gossip-Based Update Propagation QoS-enabled Video Streaming in Wireless Sensor Networks Distributed Clustering Algorithms for Lossy Wireless Sensor Networks Colocation as a Service: Strategic and Operational Services for Cloud Colocation Under the Cloud: A Novel Content Addressable Data Framework for Cloud Parallelization to Create and Virtualize New Breeds of Cloud Applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1