构建自组织多媒体检索系统的研究

J. Sedmidubský, Vlastislav Dohnal, P. Zezula
{"title":"构建自组织多媒体检索系统的研究","authors":"J. Sedmidubský, Vlastislav Dohnal, P. Zezula","doi":"10.1109/FUTURETECH.2010.5482652","DOIUrl":null,"url":null,"abstract":"We focus on content-based retrieval in unstructured P2P networks consisting of thousands of peers that unpredictably join and leave the network. Such environments with permanent churning of peers require self-organizing mechanisms that should deal with sudden peer failures, arrivals of new peers, and continual changes of data or network topology. In this paper, we build a self-organizing search system that operates in an unstructured P2P network and allows users to search for multimedia data by their content. In order to efficiently route queries to relevant peers, we define and evaluate several techniques for joining new peers to the existing network. These techniques create new relationships between peers -- on the basis of answers returned to queries -- so that a new peer will be able to efficiently forward queries and other peers will be immediately informed about its data. In addition, we demonstrate resilience of the system to sudden peer failures by studying system performance and quality of returned answers after a large number of peers is disconnected. The experiments, evaluated on a synthetic and real-life multimedia dataset, confirm that the proposed techniques are suitable for dynamic environments.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On Building a Self-Organizing Search System for Multimedia Retrieval\",\"authors\":\"J. Sedmidubský, Vlastislav Dohnal, P. Zezula\",\"doi\":\"10.1109/FUTURETECH.2010.5482652\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We focus on content-based retrieval in unstructured P2P networks consisting of thousands of peers that unpredictably join and leave the network. Such environments with permanent churning of peers require self-organizing mechanisms that should deal with sudden peer failures, arrivals of new peers, and continual changes of data or network topology. In this paper, we build a self-organizing search system that operates in an unstructured P2P network and allows users to search for multimedia data by their content. In order to efficiently route queries to relevant peers, we define and evaluate several techniques for joining new peers to the existing network. These techniques create new relationships between peers -- on the basis of answers returned to queries -- so that a new peer will be able to efficiently forward queries and other peers will be immediately informed about its data. In addition, we demonstrate resilience of the system to sudden peer failures by studying system performance and quality of returned answers after a large number of peers is disconnected. The experiments, evaluated on a synthetic and real-life multimedia dataset, confirm that the proposed techniques are suitable for dynamic environments.\",\"PeriodicalId\":380192,\"journal\":{\"name\":\"2010 5th International Conference on Future Information Technology\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 5th International Conference on Future Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FUTURETECH.2010.5482652\",\"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 5th International Conference on Future Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUTURETECH.2010.5482652","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

我们关注的是非结构化P2P网络中基于内容的检索,该网络由数千个不可预测地加入和离开网络的节点组成。这种具有永久对等点的环境需要自组织机制来处理突然的对等点故障、新对等点的到来以及数据或网络拓扑结构的持续变化。在本文中,我们建立了一个自组织搜索系统,该系统运行在一个非结构化的P2P网络中,允许用户根据内容搜索多媒体数据。为了有效地将查询路由到相关的对等点,我们定义并评估了几种将新对等点连接到现有网络的技术。这些技术在对等点之间创建了新的关系——基于对查询返回的答案——这样,新的对等点将能够有效地转发查询,而其他对等点将立即获知其数据。此外,我们通过研究系统性能和在大量对等点断开连接后返回答案的质量来证明系统对突然对等点故障的弹性。实验在一个合成的和真实的多媒体数据集上进行了评估,证实了所提出的技术适用于动态环境。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Building a Self-Organizing Search System for Multimedia Retrieval
We focus on content-based retrieval in unstructured P2P networks consisting of thousands of peers that unpredictably join and leave the network. Such environments with permanent churning of peers require self-organizing mechanisms that should deal with sudden peer failures, arrivals of new peers, and continual changes of data or network topology. In this paper, we build a self-organizing search system that operates in an unstructured P2P network and allows users to search for multimedia data by their content. In order to efficiently route queries to relevant peers, we define and evaluate several techniques for joining new peers to the existing network. These techniques create new relationships between peers -- on the basis of answers returned to queries -- so that a new peer will be able to efficiently forward queries and other peers will be immediately informed about its data. In addition, we demonstrate resilience of the system to sudden peer failures by studying system performance and quality of returned answers after a large number of peers is disconnected. The experiments, evaluated on a synthetic and real-life multimedia dataset, confirm that the proposed techniques are suitable for dynamic environments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信