基于gossip的稀有资源二跳索引复制适宜度搜索策略

Ming He, Zhijie Feng
{"title":"基于gossip的稀有资源二跳索引复制适宜度搜索策略","authors":"Ming He, Zhijie Feng","doi":"10.1109/ICT.2019.8798765","DOIUrl":null,"url":null,"abstract":"Search and data retrieval services have attracted significant attention in blockchain networks, especially for rare resources. Therefore, our paper proposes a novel Gossip-based appropriate degree search strategy (GADSS) for rare resources. This strategy employs a periodical probing mechanism (PPM) to judge whether these resources are rare resources. Once the resource types are determined, searching probability for rare ones is increased by two-hop index replication with resource weight (TIR-RW). In addition, we also provide a Gossip-based appropriate degree search algorithm (GADSA), which utilizes the appropriate degree property as heuristic information to guide the search in dynamic environment. As compared to the conventional blockchain resource search algorithms, GADSA has the ability to reduce the message quantity substantially. The simulation results show that GADSS has the better search performance for rare resources, and maintains the lower network overhead.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Gossip-based Appropriate Degree Search Strategy by Two-hop Index Replication for Rare Resources\",\"authors\":\"Ming He, Zhijie Feng\",\"doi\":\"10.1109/ICT.2019.8798765\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Search and data retrieval services have attracted significant attention in blockchain networks, especially for rare resources. Therefore, our paper proposes a novel Gossip-based appropriate degree search strategy (GADSS) for rare resources. This strategy employs a periodical probing mechanism (PPM) to judge whether these resources are rare resources. Once the resource types are determined, searching probability for rare ones is increased by two-hop index replication with resource weight (TIR-RW). In addition, we also provide a Gossip-based appropriate degree search algorithm (GADSA), which utilizes the appropriate degree property as heuristic information to guide the search in dynamic environment. As compared to the conventional blockchain resource search algorithms, GADSA has the ability to reduce the message quantity substantially. The simulation results show that GADSS has the better search performance for rare resources, and maintains the lower network overhead.\",\"PeriodicalId\":127412,\"journal\":{\"name\":\"2019 26th International Conference on Telecommunications (ICT)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 26th International Conference on Telecommunications (ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT.2019.8798765\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 26th International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2019.8798765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

搜索和数据检索服务在区块链网络中引起了极大的关注,特别是对于稀有资源。为此,本文提出了一种基于gossip的稀有资源适当度搜索策略(GADSS)。该策略采用周期性探测机制(PPM)来判断这些资源是否是稀有资源。资源类型确定后,通过资源权值的两跳索引复制(TIR-RW)提高稀有资源的搜索概率。此外,我们还提出了一种基于gossip的适当度搜索算法(GADSA),该算法利用适当度属性作为启发式信息来指导动态环境下的搜索。与传统的区块链资源搜索算法相比,GADSA具有显著减少消息量的能力。仿真结果表明,该方法对稀有资源具有较好的搜索性能,且保持了较低的网络开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Gossip-based Appropriate Degree Search Strategy by Two-hop Index Replication for Rare Resources
Search and data retrieval services have attracted significant attention in blockchain networks, especially for rare resources. Therefore, our paper proposes a novel Gossip-based appropriate degree search strategy (GADSS) for rare resources. This strategy employs a periodical probing mechanism (PPM) to judge whether these resources are rare resources. Once the resource types are determined, searching probability for rare ones is increased by two-hop index replication with resource weight (TIR-RW). In addition, we also provide a Gossip-based appropriate degree search algorithm (GADSA), which utilizes the appropriate degree property as heuristic information to guide the search in dynamic environment. As compared to the conventional blockchain resource search algorithms, GADSA has the ability to reduce the message quantity substantially. The simulation results show that GADSS has the better search performance for rare resources, and maintains the lower network overhead.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信