对等网络中基于多关键字的信息路由

H. Tran, Miao Miao, F. Bastani, I. Yen
{"title":"对等网络中基于多关键字的信息路由","authors":"H. Tran, Miao Miao, F. Bastani, I. Yen","doi":"10.1109/ICOIN56518.2023.10049045","DOIUrl":null,"url":null,"abstract":"IoT devices are dispersed over the edge of the Internet and, naturally, so does the IoT data. As we know, data are valuable resources and sharing of these IoT data has many benefits. Correspondingly, we develop the peer-to-peer information centric routing (P2PICR) solution to enable the discovery of IoT data sources and, subsequently, facilitate sharing of the IoT data on the edge.In P2PICR, keywords are used to index the routing tables to support search query routing toward annotated information sources. Though many DHT (distributed hash table) based solutions have been developed for managing p2p data, they are not suitable for IoT data sources. Thus, we consider the unstructured p2p routing as the basis for P2PICR. However, due to the large keyword space for specifying the IoT data sources, the p2p routing table has the potential of high space overhead. Thus, we develop a routing table space reduction scheme to significantly reduce the space requirement for the keyword-based routing tables. The routing table size reduction scheme is based on keyword summarization, which extends the IP address summarization technique adopted in IP routing tables, but keyword summarization is far more challenging than IP summarization. Compared to the conventional unstructured p2p routing in which the keyword-indexed routing table entries are cached and being elicited when the routing table is full, our summarization scheme instead compress the entries to retain its information for guiding the routing process.We conducted experimental studies and the results show that P2PICR achieves 20-30 times of routing table size reduction when compared to the case of without summarization and achieves 2-3 times communication cost reduction when compared with cache based solutions under the same table size.","PeriodicalId":285763,"journal":{"name":"2023 International Conference on Information Networking (ICOIN)","volume":"12 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-Keyword Based Information Routing in Peer-to-Peer Networks\",\"authors\":\"H. Tran, Miao Miao, F. Bastani, I. Yen\",\"doi\":\"10.1109/ICOIN56518.2023.10049045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"IoT devices are dispersed over the edge of the Internet and, naturally, so does the IoT data. As we know, data are valuable resources and sharing of these IoT data has many benefits. Correspondingly, we develop the peer-to-peer information centric routing (P2PICR) solution to enable the discovery of IoT data sources and, subsequently, facilitate sharing of the IoT data on the edge.In P2PICR, keywords are used to index the routing tables to support search query routing toward annotated information sources. Though many DHT (distributed hash table) based solutions have been developed for managing p2p data, they are not suitable for IoT data sources. Thus, we consider the unstructured p2p routing as the basis for P2PICR. However, due to the large keyword space for specifying the IoT data sources, the p2p routing table has the potential of high space overhead. Thus, we develop a routing table space reduction scheme to significantly reduce the space requirement for the keyword-based routing tables. The routing table size reduction scheme is based on keyword summarization, which extends the IP address summarization technique adopted in IP routing tables, but keyword summarization is far more challenging than IP summarization. Compared to the conventional unstructured p2p routing in which the keyword-indexed routing table entries are cached and being elicited when the routing table is full, our summarization scheme instead compress the entries to retain its information for guiding the routing process.We conducted experimental studies and the results show that P2PICR achieves 20-30 times of routing table size reduction when compared to the case of without summarization and achieves 2-3 times communication cost reduction when compared with cache based solutions under the same table size.\",\"PeriodicalId\":285763,\"journal\":{\"name\":\"2023 International Conference on Information Networking (ICOIN)\",\"volume\":\"12 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 International Conference on Information Networking (ICOIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN56518.2023.10049045\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN56518.2023.10049045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

物联网设备分散在互联网的边缘,物联网数据自然也是如此。众所周知,数据是宝贵的资源,共享这些物联网数据有很多好处。相应地,我们开发了点对点信息中心路由(P2PICR)解决方案,以实现物联网数据源的发现,并随后促进边缘物联网数据的共享。在P2PICR中,关键字用于索引路由表,以支持到带注释的信息源的搜索查询路由。虽然已经开发了许多基于DHT(分布式哈希表)的解决方案来管理p2p数据,但它们不适合物联网数据源。因此,我们将非结构化的p2p路由作为P2PICR的基础。然而,由于指定物联网数据源的关键字空间很大,p2p路由表有可能产生很高的空间开销。因此,我们开发了一种路由表空间缩减方案,以显着减少基于关键字的路由表的空间需求。路由表缩减方案基于关键字聚合,扩展了IP路由表中采用的IP地址聚合技术,但关键字聚合远比IP聚合更具挑战性。在传统的非结构化p2p路由中,关键字索引路由表项被缓存并在路由表满时提取,与之相比,我们的摘要方案通过压缩路由表项来保留其信息,从而指导路由过程。我们进行了实验研究,结果表明,在相同的表大小下,与基于缓存的解决方案相比,P2PICR与没有汇总的情况相比,路由表大小减少了20-30倍,通信成本减少了2-3倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-Keyword Based Information Routing in Peer-to-Peer Networks
IoT devices are dispersed over the edge of the Internet and, naturally, so does the IoT data. As we know, data are valuable resources and sharing of these IoT data has many benefits. Correspondingly, we develop the peer-to-peer information centric routing (P2PICR) solution to enable the discovery of IoT data sources and, subsequently, facilitate sharing of the IoT data on the edge.In P2PICR, keywords are used to index the routing tables to support search query routing toward annotated information sources. Though many DHT (distributed hash table) based solutions have been developed for managing p2p data, they are not suitable for IoT data sources. Thus, we consider the unstructured p2p routing as the basis for P2PICR. However, due to the large keyword space for specifying the IoT data sources, the p2p routing table has the potential of high space overhead. Thus, we develop a routing table space reduction scheme to significantly reduce the space requirement for the keyword-based routing tables. The routing table size reduction scheme is based on keyword summarization, which extends the IP address summarization technique adopted in IP routing tables, but keyword summarization is far more challenging than IP summarization. Compared to the conventional unstructured p2p routing in which the keyword-indexed routing table entries are cached and being elicited when the routing table is full, our summarization scheme instead compress the entries to retain its information for guiding the routing process.We conducted experimental studies and the results show that P2PICR achieves 20-30 times of routing table size reduction when compared to the case of without summarization and achieves 2-3 times communication cost reduction when compared with cache based solutions under the same table size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信