Analysis of Floating Index Caching Technique for P2P Overlay Index Propagation

K. Haribabu, C. Hota
{"title":"Analysis of Floating Index Caching Technique for P2P Overlay Index Propagation","authors":"K. Haribabu, C. Hota","doi":"10.1145/2684464.2684489","DOIUrl":null,"url":null,"abstract":"The paper proposes an indexing scheme known as Floating Index Caching. In Floating Index caching, queries carry a summarized index of contents of the peers that are on its way. Each node snoops on the queries passing through it. Queries are sent in the network using ether flooding or random-walk methods. When a query arrives at a node, indexes can be further added to the query or existing indexes replaced with new indexes. In this paper, we classify propagation schemes as depth-wise and breadth-wise, combined with flooding and random-walk methods. Through experimental evaluations, we found that Floating Index Caching with random walkers has the best returns as far as index dissemination is considered. Breadth-wise spreading of indexes through random-walk utilized 54% of the query traffic effectively to spread the indexes. This method has spread indexes of 77% of the nodes onto more than 50% of the network.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 16th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2684464.2684489","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The paper proposes an indexing scheme known as Floating Index Caching. In Floating Index caching, queries carry a summarized index of contents of the peers that are on its way. Each node snoops on the queries passing through it. Queries are sent in the network using ether flooding or random-walk methods. When a query arrives at a node, indexes can be further added to the query or existing indexes replaced with new indexes. In this paper, we classify propagation schemes as depth-wise and breadth-wise, combined with flooding and random-walk methods. Through experimental evaluations, we found that Floating Index Caching with random walkers has the best returns as far as index dissemination is considered. Breadth-wise spreading of indexes through random-walk utilized 54% of the query traffic effectively to spread the indexes. This method has spread indexes of 77% of the nodes onto more than 50% of the network.
P2P覆盖索引传播的浮动索引缓存技术分析
本文提出了一种称为浮动索引缓存的索引方案。在浮动索引缓存中,查询携带正在进行的对等节点内容的汇总索引。每个节点都窥探通过它的查询。查询使用以太泛洪或随机漫游方法在网络中发送。当查询到达节点时,可以进一步向查询添加索引,或者用新索引替换现有索引。在本文中,我们将传播方案分为深度和广度,并结合泛洪和随机漫步方法。通过实验评估,我们发现在考虑索引传播的情况下,带有随机漫步器的浮动索引缓存具有最佳的收益。通过随机漫步进行索引的逐宽扩展有效地利用了54%的查询流量来扩展索引。这种方法将77%的节点的索引分散到超过50%的网络上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信