点对点网络上的分布式排名

Dexter Chi Wai Siu, T. Lau
{"title":"点对点网络上的分布式排名","authors":"Dexter Chi Wai Siu, T. Lau","doi":"10.1145/1013367.1013473","DOIUrl":null,"url":null,"abstract":"Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intelligently. However, it still contains drawbacks like query flooding inside clusters. The condition can be improved if the query message can send directly to the query destination, as the message does not need to send hop by hop. This can be achieved by ranking. By ranking, the network can know the destination and the information quality shared by each peer. We introduce distributed ranking in this paper. We give background of FQM, outline of the proposed method, and conduct a series of experiments that demonstrate the significant reduction of query flooding in a P2P network.","PeriodicalId":409891,"journal":{"name":"WWW Alt. '04","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed ranking over peer-to-peer networks\",\"authors\":\"Dexter Chi Wai Siu, T. Lau\",\"doi\":\"10.1145/1013367.1013473\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intelligently. However, it still contains drawbacks like query flooding inside clusters. The condition can be improved if the query message can send directly to the query destination, as the message does not need to send hop by hop. This can be achieved by ranking. By ranking, the network can know the destination and the information quality shared by each peer. We introduce distributed ranking in this paper. We give background of FQM, outline of the proposed method, and conduct a series of experiments that demonstrate the significant reduction of query flooding in a P2P network.\",\"PeriodicalId\":409891,\"journal\":{\"name\":\"WWW Alt. '04\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"WWW Alt. '04\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1013367.1013473\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"WWW Alt. '04","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1013367.1013473","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

查询泛滥是Gnutella等点对点网络中存在的一个问题。Firework查询模型通过对等集群解决了这一问题,使查询消息的路由更加智能。然而,它仍然存在一些缺点,比如集群内部的查询泛滥。如果查询消息不需要逐跳发送,可以直接发送到查询目的地,可以改善查询条件。这可以通过排名来实现。通过排序,网络可以知道每个对等体共享的目的地和信息质量。本文引入了分布式排序。我们给出了FQM的背景,提出的方法的概要,并进行了一系列的实验,证明了在P2P网络中查询泛洪的显著减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed ranking over peer-to-peer networks
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intelligently. However, it still contains drawbacks like query flooding inside clusters. The condition can be improved if the query message can send directly to the query destination, as the message does not need to send hop by hop. This can be achieved by ranking. By ranking, the network can know the destination and the information quality shared by each peer. We introduce distributed ranking in this paper. We give background of FQM, outline of the proposed method, and conduct a series of experiments that demonstrate the significant reduction of query flooding in a P2P network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信