Autonomous Data Replication Using Q-Learning for Unstructured P2P Networks

S. Thampi, K. C. Sekaran
{"title":"Autonomous Data Replication Using Q-Learning for Unstructured P2P Networks","authors":"S. Thampi, K. C. Sekaran","doi":"10.1109/NCA.2007.11","DOIUrl":null,"url":null,"abstract":"Resource discovery is an important problem in unstructured peer-to-peer networks as there is no centralized index where to search for information about resources. The solution for the problem is to use a search algorithm that locates the resources based on the local information about the network. Efficient data sharing in a peer-to-peer system is complicated by uneven node failure, unreliable network connectivity and limited bandwidth. A well-known technique for improving availability is replication. If multiple copies of data exist on independent nodes, then the chances of at least one copy being accessible are increased. Replication increases robustness. In this paper, we present a novel technique based on Q-learning for replicating objects to other nodes.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2007.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

Abstract

Resource discovery is an important problem in unstructured peer-to-peer networks as there is no centralized index where to search for information about resources. The solution for the problem is to use a search algorithm that locates the resources based on the local information about the network. Efficient data sharing in a peer-to-peer system is complicated by uneven node failure, unreliable network connectivity and limited bandwidth. A well-known technique for improving availability is replication. If multiple copies of data exist on independent nodes, then the chances of at least one copy being accessible are increased. Replication increases robustness. In this paper, we present a novel technique based on Q-learning for replicating objects to other nodes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于q -学习的非结构化P2P网络自主数据复制
在非结构化点对点网络中,资源发现是一个重要的问题,因为没有集中的索引来搜索资源信息。该问题的解决方案是使用一种基于网络本地信息的搜索算法来定位资源。在点对点系统中,节点故障不均匀、网络连接不可靠和带宽有限使数据的有效共享变得复杂。提高可用性的一种众所周知的技术是复制。如果独立节点上存在多个数据副本,那么至少有一个副本可访问的可能性就会增加。复制增强了健壮性。在本文中,我们提出了一种基于q学习的新技术,用于将对象复制到其他节点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Constructing Overlay Networks with Low Link Costs and Short Paths Approximate Analytical Models for Networked Servers Subject to MMPP Arrival Processes A Global On-Demand Routing Protocol for Mobile Ad Hoc Networks On the Evaluation of Shortest Journeys in Dynamic Networks Multilayer In-service Reconfiguration for Network Computing Systems
×
引用
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