容中断网络中的分布式存储

Jingzhe Du, E. Kranakis, A. Nayak
{"title":"容中断网络中的分布式存储","authors":"Jingzhe Du, E. Kranakis, A. Nayak","doi":"10.1109/WOWMOM.2010.5534948","DOIUrl":null,"url":null,"abstract":"We describe a novel Distributed Storage protocol in Disruption (Delay) Tolerant Networks (DTN). Since DTNs can not guarantee the connectivity of the network all the time, distributed data storage and look up has to be performed in a store-and-forward way. In this work, we define local distributed location regions which are called cells to facilitate the data storage and look up process. Nodes in a cell have high probability of moving within their cells. Our protocol resorts to storing data items in cells which have hierarchical structure to reduce routing information storage at nodes. Multiple copies of a data item may be stored at nodes to counter the adverse impact of the nature of DTNs. The cells are relatively stable regions and as a result, data exchange overheads among nodes are reduced. Through experimentation, we show that the proposed distributed storage protocol achieves higher successful data storage ratios with lower delays and limited data item exchange requirements than other protocols in the literature.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Distributed storage in Disruption Tolerant Network\",\"authors\":\"Jingzhe Du, E. Kranakis, A. Nayak\",\"doi\":\"10.1109/WOWMOM.2010.5534948\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe a novel Distributed Storage protocol in Disruption (Delay) Tolerant Networks (DTN). Since DTNs can not guarantee the connectivity of the network all the time, distributed data storage and look up has to be performed in a store-and-forward way. In this work, we define local distributed location regions which are called cells to facilitate the data storage and look up process. Nodes in a cell have high probability of moving within their cells. Our protocol resorts to storing data items in cells which have hierarchical structure to reduce routing information storage at nodes. Multiple copies of a data item may be stored at nodes to counter the adverse impact of the nature of DTNs. The cells are relatively stable regions and as a result, data exchange overheads among nodes are reduced. Through experimentation, we show that the proposed distributed storage protocol achieves higher successful data storage ratios with lower delays and limited data item exchange requirements than other protocols in the literature.\",\"PeriodicalId\":384628,\"journal\":{\"name\":\"2010 IEEE International Symposium on \\\"A World of Wireless, Mobile and Multimedia Networks\\\" (WoWMoM)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Symposium on \\\"A World of Wireless, Mobile and Multimedia Networks\\\" (WoWMoM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOWMOM.2010.5534948\",\"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 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOWMOM.2010.5534948","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

我们描述了一种新的分布式存储协议在容忍中断(延迟)网络(DTN)。由于ddn不能始终保证网络的连通性,因此必须采用存储转发的方式进行分布式数据存储和查找。在这项工作中,我们定义了局部分布的位置区域,称为单元,以方便数据存储和查找过程。细胞中的节点在其细胞内移动的概率很高。我们的协议将数据项存储在具有分层结构的单元中,以减少节点上的路由信息存储。一个数据项的多个副本可以存储在节点上,以抵消ddn特性的不利影响。单元是相对稳定的区域,因此减少了节点之间的数据交换开销。通过实验,我们表明所提出的分布式存储协议比文献中的其他协议具有更高的成功数据存储率和更低的延迟和有限的数据项交换需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Distributed storage in Disruption Tolerant Network
We describe a novel Distributed Storage protocol in Disruption (Delay) Tolerant Networks (DTN). Since DTNs can not guarantee the connectivity of the network all the time, distributed data storage and look up has to be performed in a store-and-forward way. In this work, we define local distributed location regions which are called cells to facilitate the data storage and look up process. Nodes in a cell have high probability of moving within their cells. Our protocol resorts to storing data items in cells which have hierarchical structure to reduce routing information storage at nodes. Multiple copies of a data item may be stored at nodes to counter the adverse impact of the nature of DTNs. The cells are relatively stable regions and as a result, data exchange overheads among nodes are reduced. Through experimentation, we show that the proposed distributed storage protocol achieves higher successful data storage ratios with lower delays and limited data item exchange requirements than other protocols in the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Social similarity as a driver for selfish, cooperative and altruistic behavior Assessment of the true risks to the protection of confidential information in the wireless home and office environment Autonomic diagnosis of anomalous network traffic Security and privacy for mobile electronic health monitoring and recording systems Spectrum sharing between IEEE 802.16 and IEEE 802.11 based wireless networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1