面向全域范围检索的跳跃图低成本层次感知扩展

Xun Shao, M. Jibiki, Y. Teranishi, N. Nishinaga
{"title":"面向全域范围检索的跳跃图低成本层次感知扩展","authors":"Xun Shao, M. Jibiki, Y. Teranishi, N. Nishinaga","doi":"10.1109/COMPSAC.2014.67","DOIUrl":null,"url":null,"abstract":"The rapid development of crowd sensing and cloud computing makes it possible to build world wide Cyber Physical Systems (CPS). Range queriable P2P overlay technologies are considered as promising candidate for realizing some important functionalities of CPS, for example, retrieval based on the properties of sensors. However, it is difficult to build world wide systems with existing range queriable P2Ps efficiently as the lack of proximity awareness. In this paper, we propose the hierarchical neighbor selection (HNS) mechanism for range queriable P2P overlays, which can integrate the hierarchy of physical Internet into overlay construction and routing to improve the performance. We also implement HNS based on Skip Graph (SG), an efficient range queriable P2P technology. With extensive simulations, we show that HNS based Skip Graph (HSG) can improve the routing latency and locality significantly with little overhead.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Low Cost Hierarchy-Awareness Extension of Skip Graph for World-Wide Range Retrievals\",\"authors\":\"Xun Shao, M. Jibiki, Y. Teranishi, N. Nishinaga\",\"doi\":\"10.1109/COMPSAC.2014.67\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid development of crowd sensing and cloud computing makes it possible to build world wide Cyber Physical Systems (CPS). Range queriable P2P overlay technologies are considered as promising candidate for realizing some important functionalities of CPS, for example, retrieval based on the properties of sensors. However, it is difficult to build world wide systems with existing range queriable P2Ps efficiently as the lack of proximity awareness. In this paper, we propose the hierarchical neighbor selection (HNS) mechanism for range queriable P2P overlays, which can integrate the hierarchy of physical Internet into overlay construction and routing to improve the performance. We also implement HNS based on Skip Graph (SG), an efficient range queriable P2P technology. With extensive simulations, we show that HNS based Skip Graph (HSG) can improve the routing latency and locality significantly with little overhead.\",\"PeriodicalId\":106871,\"journal\":{\"name\":\"2014 IEEE 38th Annual Computer Software and Applications Conference\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 38th Annual Computer Software and Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMPSAC.2014.67\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 38th Annual Computer Software and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSAC.2014.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

人群感知技术和云计算技术的快速发展使构建全球性的网络物理系统(CPS)成为可能。范围可查询的P2P覆盖技术被认为是实现CPS一些重要功能的有希望的候选技术,例如基于传感器属性的检索。然而,由于缺乏近距离感知,现有的距离可查询p2p难以有效地构建全球范围的系统。本文提出了一种可查询范围的P2P覆盖层分层邻居选择(HNS)机制,该机制可以将物理互联网的分层结构整合到覆盖层的构建和路由中,从而提高覆盖层的性能。我们还实现了基于跳图(SG)的HNS,这是一种高效的范围查询P2P技术。通过大量的仿真,我们表明基于HNS的跳过图(HSG)可以在很小的开销下显著改善路由延迟和局部性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Low Cost Hierarchy-Awareness Extension of Skip Graph for World-Wide Range Retrievals
The rapid development of crowd sensing and cloud computing makes it possible to build world wide Cyber Physical Systems (CPS). Range queriable P2P overlay technologies are considered as promising candidate for realizing some important functionalities of CPS, for example, retrieval based on the properties of sensors. However, it is difficult to build world wide systems with existing range queriable P2Ps efficiently as the lack of proximity awareness. In this paper, we propose the hierarchical neighbor selection (HNS) mechanism for range queriable P2P overlays, which can integrate the hierarchy of physical Internet into overlay construction and routing to improve the performance. We also implement HNS based on Skip Graph (SG), an efficient range queriable P2P technology. With extensive simulations, we show that HNS based Skip Graph (HSG) can improve the routing latency and locality significantly with little 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学术官方微信